Skip to main content

Efficient Set Intersection with Simulation-Based Security

Author(s): Freedman, Michael J; Hazay, Carmit; Nissim, Kobbi; Pinkas, Benny

To refer to this page use:
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.
Publication Date: 2016
Citation: Freedman, Michael J., Carmit Hazay, Kobbi Nissim, and Benny Pinkas. "Efficient Set Intersection with Simulation-Based Security." Journal of Cryptology 29 (2016): 115-155. doi:10.1007/s00145-014-9190-0
DOI: 10.1007/s00145-014-9190-0
ISSN: 0933-2790
EISSN: 1432-1378
Pages: 115 - 155
Type of Material: Journal Article
Journal/Proceeding Title: Journal of Cryptology
Version: Author's manuscript

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.