When private set intersection meets big data

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.

Efficient Delegated Private Set Intersection on Outsourced Private Datasets

“…Following that many protocols such as [4], [21], [22], [23], [24], [25], [26], [27] were proposed. Among them, [21] provides a number of protocols supporting further private set operations based on additive homomorphic encryption and polynomial representation of sets.…”

“…In addition, [23], [24] proposed PSI protocols that allow result recipients to hide their set size from the other party during the computation of the intersection, while [24] also proposed protocols that output only the cardinality of the intersection. More recently, some efficient protocols, like [25], [26], [27], have been proposed. The protocols in [25] use Bloom filters, secret sharing and oblivious transfer to offer efficient PSI.…”

“…More recently, some efficient protocols, like [25], [26], [27], have been proposed. The protocols in [25] use Bloom filters, secret sharing and oblivious transfer to offer efficient PSI. Later on, [26] extended [25] by using hash tables and a more efficient oblivious transfer extension protocol for better efficiency.…”

“…The protocols in [25] use Bloom filters, secret sharing and oblivious transfer to offer efficient PSI. Later on, [26] extended [25] by using hash tables and a more efficient oblivious transfer extension protocol for better efficiency. Recently, [27] further improved the efficiency of [25] by utilizing permutationbased hashing.…”

Zero-Knowledge Password Policy Check from Lattices

“…if the set of shares can reconstruct the secret in the LSSS. To obtain a privacy-preserving protocol for SPC, the oblivious bloom intersection (OBI) from [16] is used. The server constructs an LSSS that only users who fulfil the policy can obtain the right shares from the OBI and recover the secret.…”