Efficient Set Operations in the Presence of Malicious Adversaries

  • Carmit Hazay
  • Kobbi Nissim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6056)


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 

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Carmit Hazay
    • 1
  • Kobbi Nissim
    • 2
  1. 1.Dept. of Computer Science and Applied MathematicsWeizmann Institute and Interdisciplinary Center (IDC)Herzliya
  2. 2.Dept. of Computer ScienceBen-Gurion University and Microsoft AIIsrael

Personalised recommendations