@inproceedings{182b9c6c120e4f77b765d414be29eede,
title = "Efficient set operations in the presence of malicious adversaries",
abstract = "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.",
keywords = "Oblivious pseudorandom function evaluation, Secure two-party computation, Set intersection, Set union, Simulation based security",
author = "Carmit Hazay and Kobbi Nissim",
year = "2010",
doi = "10.1007/978-3-642-13013-7\_19",
language = "אנגלית",
isbn = "3642130127",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "312--331",
booktitle = "Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings",
address = "גרמניה",
note = "13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 ; Conference date: 26-05-2010 Through 28-05-2010",
}