Articles in Press

Accepted articles here

Latest Issues

Volume 17 Issue 3
Volume 17 Issue 2
Volume 17 Issue 1

Volume 16 Issue 3
Volume 16 Issue 2
Volume 16 Issue 1

Volume 15 Issue 3
Volume 15 Issue 2
Volume 15 Issue 1

Volume 14 Issue 3
Volume 14 Issue 2
Volume 14 Issue 1

Volume 13 Issue 3
Volume 13 Issue 2
Volume 13 Issue 1

Volume 12 Issue 3
Volume 12 Issue 2
Volume 12 Issue 1

Volume 11 Issue 3
Volume 11 Issue 2
Volume 11 Issue 1

Volume 10 Issue 3
Volume 10 Issue 2
Volume 10 Issue 1

Volume 9 Issue 3
Volume 9 Issue 2
Volume 9 Issue 1

Volume 8 Issue 3
Volume 8 Issue 2
Volume 8 Issue 1

Volume 7 Issue 3
Volume 7 Issue 2
Volume 7 Issue 1

Volume 6 Issue 3
Volume 6 Issue 2
Volume 6 Issue 1

Volume 5 Issue 3
Volume 5 Issue 2
Volume 5 Issue 1

Volume 4 Issue 3
Volume 4 Issue 2
Volume 4 Issue 1

Volume 3 Issue 3
Volume 3 Issue 2
Volume 3 Issue 1

Volume 2 Issue 3
Volume 2 Issue 2
Volume 2 Issue 1

Volume 1 Issue 3
Volume 1 Issue 2
Volume 1 Issue 1

Volume 10 Issue 2

A Privacy-Preserving Approach for Composite Web Service Selection

Amine Belabed^(a),(*), Esma Aïmeur^(b), Mohammed Amine Chikh^(c), Fethallah Hadjila^(a)

Transactions on Data Privacy 10:2 (2017) 83 - 115

Abstract, PDF

(a) UABT University - Tlemcen, LRI, Algeria.

(b) Computer Science Department, University of Montreal, Canada.

(c) UABT University - Tlemcen, EBM, Algeria.

e-mail:belabed.amine @mail.univ-tlemcen.dz; aimeur @iro.umontreal.ca; mea_chikh @mail.univ-tlemcen.dz; f_hadjila @mail.univ-tlemcen.dz

Abstract

Web services technologies are considered as the most promising technologies for the integration of applications and heterogeneous data sources. In spite of the progress achieved in this area, the issue of users' privacy protection remains a major concern for both academic and industrial communities. This paper presents a model for preserving privacy in the context of web services and demonstrates its feasibility in a web service selection scenario. In addition, we introduce three privacy based selection approaches. The first one is based on a best first search like procedure, while the two others are based on two well-known declarative AI models, namely propositional satisfiability (SAT) and answer set programming (ASP). Finally, an experimental evaluation on different types of datasets, demonstrates the effectiveness of our proposed approaches.

^* Corresponding author.

Follow us

Supports