Efficient set operations in the presence of malicious adversaries

Carmit Hazay; Kobbi Nissim

doi:10.1007/s00145-011-9098-x

Efficient set operations in the presence of malicious adversaries

Carmit Hazay
, Kobbi Nissim

Aarhus University
Microsoft USA
Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

54 Scopus citations

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	https://doi.org/10.1007/s00145-011-9098-x
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

Access to Document

10.1007/s00145-011-9098-x

Cite this

@article{7cb927fd60d54d7ebb3f070171123843,

title = "Efficient set operations in the presence of malicious adversaries",

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.",

keywords = "Oblivious pseudorandom function evaluation, Secure two-party computation, Set intersection, Set union, Simulation-based security",

author = "Carmit Hazay and Kobbi Nissim",

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).",

year = "2012",

month = jul,

doi = "10.1007/s00145-011-9098-x",

language = "אנגלית",

volume = "25",

pages = "383--433",

journal = "Journal of Cryptology",

issn = "0933-2790",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Efficient set operations in the presence of malicious adversaries

AU - Hazay, Carmit

AU - Nissim, Kobbi

N1 - 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).

PY - 2012/7

Y1 - 2012/7

N2 - 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.

AB - 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.

KW - Oblivious pseudorandom function evaluation

KW - Secure two-party computation

KW - Set intersection

KW - Set union

KW - Simulation-based security

UR - https://www.scopus.com/pages/publications/84865203234

U2 - 10.1007/s00145-011-9098-x

DO - 10.1007/s00145-011-9098-x

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84865203234

SN - 0933-2790

VL - 25

SP - 383

EP - 433

JO - Journal of Cryptology

JF - Journal of Cryptology

IS - 3

ER -

Efficient set operations in the presence of malicious adversaries

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this