Welcome to the resource topic for 2009/594
Title:
Efficient Set Operations in the Presence of Malicious Adversaries
Authors: Carmit Hazay, Kobbi Nissim
Abstract: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. 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.
ePrint: https://eprint.iacr.org/2009/594
Talk: https://www.youtube.com/watch?v=NIV8jFO_x_A
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .