Efficient Set Operations in the Presence of Malicious Adversaries

We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main results are constantround protocols that exhibit linear communication and a (practically) 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, and we discuss how to perform these transformations.

• Type: Conference
• Year: 2010
• Where: PKC
• Authors: Carmit Hazay, Kobbi Nissim
• Keywords: Constantround Protocols, Cryptology, Oblivious Pseudorandom Function, PKC 2010, Secure Two-party Protocols