Efficient Set Intersection with Simulation-Based Security

Michael J. Freedman, Carmit Hazay, Kobbi Nissim, Benny Pinkas

Research output: Contribution to journalArticlepeer-review

90 Scopus citations

Abstract

We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has many applications for online collaboration. In this work, we present protocols based on the use of homomorphic encryption and different hashing schemes for both the semi-honest and malicious environments. The protocol for the semi-honest environment is secure in the standard model, while the protocol for the malicious environment is secure in the random oracle model. Our protocols obtain linear communication and computation overhead. We further implement different variants of our semi-honest protocol. Our experiments show that the asymptotic overhead of the protocol is affected by different constants. (In particular, the degree of the polynomials evaluated by the protocol matters less than the number of polynomials that are evaluated.) As a result, the protocol variant with the best asymptotic overhead is not necessarily preferable for inputs of reasonable size.

Original languageEnglish
Pages (from-to)115-155
Number of pages41
JournalJournal of Cryptology
Volume29
Issue number1
Early online date24 Oct 2014
DOIs
StatePublished - 1 Jan 2016

Bibliographical note

Publisher Copyright:
© 2014, International Association for Cryptologic Research.

Fingerprint

Dive into the research topics of 'Efficient Set Intersection with Simulation-Based Security'. Together they form a unique fingerprint.

Cite this