Efficient set operations in the presence of malicious adversaries

Carmit Hazay, Kobbi Nissim

Research output: Contribution to journalArticlepeer-review

35 Scopus citations


We revisit the problem of constructing efficient secure two-party protocols for the problems of 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 (practically) linear number of exponentiations with simulation-based security. At 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, and we discuss how to perform these transformations.

Original languageEnglish
Pages (from-to)383-433
Number of pages51
JournalJournal of Cryptology
Issue number3
StatePublished - 1 Jul 2012


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

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Efficient set operations in the presence of malicious adversaries'. Together they form a unique fingerprint.

Cite this