Privacy preservation in peer-to-peer gossiping networks in presence of a passive adversary

Abstract : In the Web 2.0, more and more personal data are released by users (queries, social networks, geo-located data, ...), which create a huge pool of useful information to leverage in the context of search or recommendation for instance. In fully decentralized systems, tapping on the power of this information usually involves a clustering process that relies on an exchange of personal data (such as user proles) to compute the similarity between users. In this internship, we address the problem of computing similarity between users while preserving their privacy and without relying on a central entity, with regards to a passive adversary.
Liste complète des métadonnées

Cited literature [49 references]  Display  Hide  Download

https://dumas.ccsd.cnrs.fr/dumas-00530603
Contributor : Co-Responsables Du Mri V. Gouranton Et S. Blazy <>
Submitted on : Friday, October 29, 2010 - 2:27:48 PM
Last modification on : Wednesday, May 16, 2018 - 11:23:29 AM
Document(s) archivé(s) le : Sunday, January 30, 2011 - 2:55:36 AM

Identifiers

  • HAL Id : dumas-00530603, version 1

Citation

Mohammad Al-Aggan. Privacy preservation in peer-to-peer gossiping networks in presence of a passive adversary. Distributed, Parallel, and Cluster Computing [cs.DC]. 2010. ⟨dumas-00530603⟩

Share

Metrics

Record views

413

Files downloads

249