Design of a P2P network that protects users’ privacy in front of Web Search Engines

Romero-Tris, Cristina; Castellà Martínez, Damià; Viejo Galicia, Alexandre; Castellà Roca, Jordi; Solsona Tehàs, Francesc; Mateo-Sanz, Josep María

doi:https://doi.org/10.1016/j.comcom.2014.09.003

View/Open

021597.pdf (830.8Kb)
Sol·licita una còpia

Issue date

2015

Author

Romero-Tris, Cristina

Castellà Martínez, Damià

Viejo Galicia, Alexandre

Castellà Roca, Jordi

Solsona Tehàs, Francesc

Mateo-Sanz, Josep María

Suggested citation

Romero-Tris, Cristina; Castellà Martínez, Damià; Viejo Galicia, Alexandre; Castellà Roca, Jordi; Solsona Tehàs, Francesc; Mateo-Sanz, Josep María; . (2015) . Design of a P2P network that protects users’ privacy in front of Web Search Engines. Computer Communications, 2015, vol. 57, p. 37-49. https://doi.org/10.1016/j.comcom.2014.09.003.

Abstract

Web Search Engines store and analyze queries made by their users in order to build their profiles and offer them personalized search results (i.e., results are ranked according to each user’s preferences). Even though this service is positive for the users, their profiles may contain sensitive information that can threaten their privacy. Literature in this field stresses the existence of a trade-off between the level of privacy achieved and the quality of service received. Current proposals try to maximize this trade-off, yet we argue that there is still room for improvement. In this paper, we present a new approach which improves the trade-off by grouping users who share similar profiles. Moreover, our new proposal is based on a hybrid P2P architecture that outperforms current schemes in terms of scalability. The proposed system has been tested in terms of performance and privacy achieved, using real data from the AOL dataset. Simulation results show that: (i) the system protects users’ privacy when they behave honestly, and penalizes selfish users; (ii) it supports a large number of users; (iii) the runtime required to group users is affordable; and (iv) groups are dynamic and their topology is unpredictable, which we argue that is positive from the privacy point of view.

URI

http://hdl.handle.net/10459.1/57186

DOI

https://doi.org/10.1016/j.comcom.2014.09.003

Is part of

Computer Communications, 2015, vol. 57, p. 37-49