Efficient Circuit-based PSI via Cuckoo Hashing - ATHENE

Autor	Pinkas, Benny; Schneider, Thomas; Weinert, Christian; Wieder, Udi
Datum	2018
Art	Conference Proceedings
Abstrakt	While there has been a lot of progress in designing efficient custom protocols for computing Private Set Intersection (PSI), there has been less research on using generic Multi-Party Computation (MPC) protocols for this task. However, there are many variants of the set intersection functionality that are not addressed by the existing custom PSI solutions and are easy to compute with generic MPC protocols (e.g., comparing the cardinality of the intersection with a threshold or measuring ad conversion rates).\textbackslash Generic PSI protocols work over circuits that compute the intersection. For sets of size n, the best known circuit constructions conduct O(n łog n) or O(n łog n / łogłog n) comparisons (Huang et al., NDSS'12 and Pinkas et al., USENIX Security'15). In this work, we propose new circuit-based protocols for computing \textbackslashemphvariants of the intersection with an almost linear number of comparisons. Our constructions are based on new variants of Cuckoo hashing in two dimensions.\textbackslash We present an asymptotically efficient protocol as well as a protocol with better concrete efficiency. For the latter protocol, we determine the required sizes of tables and circuits experimentally, and show that the run-time is concretely better than that of existing constructions.\textbackslash The protocol can be extended to a larger number of parties. The proof technique presented in the full version for analyzing Cuckoo hashing in two dimensions is new and can be generalized to analyzing standard Cuckoo hashing as well as other new variants of it.
Konferenz	37th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2018)
Serie	Lecture Notes in Computer Science
In	Advances in Cryptology - EUROCRYPT 2018, p.125-157
Publisher	Springer
Schlüssel	TUD-CS-2018-0017
Url	https://tubiblio.ulb.tu-darmstadt.de/id/eprint/101508