Sciweavers

Share
PKC
2010
Springer

Efficient Set Operations in the Presence of Malicious Adversaries

9 years 4 months ago
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.
Carmit Hazay, Kobbi Nissim
Added 14 Oct 2010
Updated 14 Oct 2010
Type Conference
Year 2010
Where PKC
Authors Carmit Hazay, Kobbi Nissim
Comments (0)
books