Secure Intersection with MapReduce - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Secure Intersection with MapReduce


Relation intersection is a fundamental problem, which becomes non-trivial when the relations to be intersected are too large to fit on a single machine. Hence, a natural approach is to design parallel algorithms that are executed on a cluster of machines rented from a public cloud provider. Intersection of relations becomes even more difficult when each relation belongs to a different data owner that wants to protect her data privacy. We consider the popular MapReduce paradigm for outsourcing data and computations to a semi-honest public cloud. Our main contribution is the SI protocol (for Secure Intersection) that allows to securely compute the intersection of an arbitrary number of relations, each of them being encrypted by its owner. The user allowed to query the intersection result has only to decrypt the result sent by the public cloud. SI does not leak (to the public cloud or to the user) any information on tuples that are not in the final relation intersection result, even if t he public cloud and the user collude i.e., they share all their private information. We prove the security of SI and provide an empirical evaluation showing its efficiency.
No file

Dates and versions

hal-02273966 , version 1 (29-08-2019)



Radu Ciucanu, Matthieu Giraud, Pascal Lafourcade, Lihua Ye. Secure Intersection with MapReduce. International Conference on Security and Cryptography (SECRYPT), Jul 2019, Prague, Czech Republic. pp.236-243, ⟨10.5220/0007918902360243⟩. ⟨hal-02273966⟩
91 View
0 Download



Gmail Facebook X LinkedIn More