BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom Filters

Mohammad Alaggan 1 Sébastien Gambs 2, 3 Anne-Marie Kermarrec 1
1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
2 CIDER
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
3 CIDRE - Confidentialité, Intégrité, Disponibilité et Répartition
CentraleSupélec, Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
Abstract : In this paper, we consider the scenario in which the profile of a user is represented in a compact way, as a Bloom filter, and the main objective is to privately compute in a distributed manner the similarity between users by relying only on the Bloom filter representation. In particular, we aim at providing a high level of privacy with respect to the profile even if a potentially unbounded number of similarity computations take place, thus calling for a non-interactive mechanism. To achieve this, we propose a novel non-interactive differentially private mechanism called BLIP (for BLoom-and-flIP) for randomizing Bloom filters. This approach relies on a bit flipping mechanism and offers high privacy guarantees while maintaining a small communication cost. Another advantage of this non-interactive mechanism is that similarity computation can take place even when the user is offline, which is impossible to achieve with interactive mechanisms. Another of our contributions is the definition of a probabilistic inference attack, called the ''Profile Reconstruction attack'', that can be used to reconstruct the profile of an individual from his Bloom filter representation. More specifically, we provide an analysis of the protection offered by BLIP against this \mbox{profile reconstruction} attack by deriving an upper and lower bound for the required value of the differential privacy parameter $\epsilon$.
Type de document :
Communication dans un congrès
14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2012), Oct 2012, Toronto, Canada. 2012
Liste complète des métadonnées

https://hal.inria.fr/hal-00724829
Contributeur : Mohammad Alaggan <>
Soumis le : mercredi 22 août 2012 - 17:35:52
Dernière modification le : mercredi 2 août 2017 - 10:06:24

Identifiants

  • HAL Id : hal-00724829, version 1

Citation

Mohammad Alaggan, Sébastien Gambs, Anne-Marie Kermarrec. BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom Filters. 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2012), Oct 2012, Toronto, Canada. 2012. <hal-00724829>

Partager

Métriques

Consultations de la notice

891