When private set intersection meets big data : an efficient and scalable protocol

Dong, Changyu and Chen, Liqun and Wen, Zikai; (2013) When private set intersection meets big data : an efficient and scalable protocol. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security. ACM, DEU, pp. 789-800. ISBN 9781450324779 (In Press) (https://doi.org/10.1145/2508859.2516701)

[thumbnail of https_eprint.iacr.org_2013_515.pdf]
Preview
 PDF. Filename: https_eprint.iacr.org_2013_515.pdf
Accepted Author Manuscript
Download (405kB)| Preview

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.

CORE (COnnecting REpositories)