Cryptology ePrint Archive: Report 2013/515

When Private Set Intersection Meets Big Data: An Efficient and Scalable Protocol

Changyu Dong and Liqun Chen and Zikai Wen

Abstract: Large scale data processing brings new challenges to the design of privacy-preserving protocols: how to meet the increasing requirements of speed and throughput of modern applications, and how to scale up smoothly when data being protected is big. Efficiency and scalability become critical criteria for privacy preserving protocols in the age of Big Data. In this paper, we present a new Private Set Intersection (PSI) protocol that is extremely efficient and highly scalable compared with existing protocols. The protocol is based on a novel approach that we call oblivious Bloom intersection. It has linear complexity and relies mostly on efficient symmetric key operations. It has high scalability due to the fact that most operations can be parallelized easily. The protocol has two versions: a basic protocol and an enhanced protocol, the security of the two variants is analyzed and proved in the semi-honest model and the malicious model respectively. A prototype of the basic protocol has been built. We report the result of performance evaluation and compare it against the two previously fastest PSI protocols. Our protocol is orders of magnitude faster than these two protocols. To compute the intersection of two million-element sets, our protocol needs only 41 seconds (80-bit security) and 339 seconds (256-bit security) on moderate hardware in parallel mode.

Category / Keywords: cryptographic protocols /

Original Publication (with major differences): ACM CCS 2013

Date: received 19 Aug 2013, last revised 4 Aug 2016

Contact author: changyu dong at gmail com

Available format(s): PDF | BibTeX Citation

Note: Added a note regarding selective failure attacks.

Version: 20160804:093421 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]