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. At 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.
Original language | English |
---|---|
Pages (from-to) | 383-433 |
Number of pages | 51 |
Journal | Journal of Cryptology |
Volume | 25 |
Issue number | 3 |
DOIs | |
State | Published - Jul 2012 |
Externally published | Yes |
Bibliographical note
Funding Information:C. Hazay research was supported by an Eshkol scholarship and the Israel Science Foundation (grant No. 70/80).
Funding Information:
K. Nissim research partly supported by the Israel Science Foundation (grant No. 860/06).
Funding
C. Hazay research was supported by an Eshkol scholarship and the Israel Science Foundation (grant No. 70/80). K. Nissim research partly supported by the Israel Science Foundation (grant No. 860/06).
Funders | Funder number |
---|---|
Israel Science Foundation | 70/80, 860/06 |
Keywords
- Oblivious pseudorandom function evaluation
- Secure two-party computation
- Set intersection
- Set union
- Simulation-based security