Public Key Cryptography – PKC 2010

Volume 6056 of the series Lecture Notes in Computer Science pp 312-331

Efficient Set Operations in the Presence of Malicious Adversaries

  • Carmit HazayAffiliated withLancaster UniversityDept. of Computer Science and Applied Mathematics, Weizmann Institute and Interdisciplinary Center (IDC)
  • , Kobbi NissimAffiliated withLancaster UniversityDept. of Computer Science, Ben-Gurion University and Microsoft AI


We revisit the problem of constructing efficient secure two-party protocols for set-intersection and set-union, focusing on the model of malicious parties. Our main results are constant-round protocols that exhibit linear communication and a linear number of exponentiations with simulation based security. In the heart of these constructions is a technique based on a combination of a perfectly hiding commitment and an oblivious pseudorandom function evaluation protocol. Our protocols readily transform into protocols that are UC-secure.


Secure two-party computation Simulation based security Set intersection Set union Oblivious pseudorandom function evaluation