Efficient set operations in the presence of malicious adversaries

Carmit Hazay; Kobbi Nissim

doi:10.1007/978-3-642-13013-7_19

Efficient set operations in the presence of malicious adversaries

Carmit Hazay, Kobbi Nissim

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

85 Scopus citations

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.

Original language	English
Title of host publication	Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings
Pages	312-331
Number of pages	20
DOIs	https://doi.org/10.1007/978-3-642-13013-7_19
State	Published - 2010
Externally published	Yes
Event	13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 - Paris, France Duration: 26 May 2010 → 28 May 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6056 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010
Country/Territory	France
City	Paris
Period	26/05/10 → 28/05/10

Keywords

Oblivious pseudorandom function evaluation
Secure two-party computation
Set intersection
Set union
Simulation based security

Access to Document

10.1007/978-3-642-13013-7_19

Cite this

Hazay, C., & Nissim, K. (2010). Efficient set operations in the presence of malicious adversaries. In Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings (pp. 312-331). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6056 LNCS). https://doi.org/10.1007/978-3-642-13013-7_19

Hazay, Carmit ; Nissim, Kobbi. / Efficient set operations in the presence of malicious adversaries. Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. 2010. pp. 312-331 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

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

pages = "312--331",

booktitle = "Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings",

note = "13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 ; Conference date: 26-05-2010 Through 28-05-2010",

}

Hazay, C & Nissim, K 2010, Efficient set operations in the presence of malicious adversaries. in Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6056 LNCS, pp. 312-331, 13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010, Paris, France, 26/05/10. https://doi.org/10.1007/978-3-642-13013-7_19

Efficient set operations in the presence of malicious adversaries. / Hazay, Carmit; Nissim, Kobbi.
Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. 2010. p. 312-331 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6056 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient set operations in the presence of malicious adversaries

AU - Hazay, Carmit

AU - Nissim, Kobbi

PY - 2010

Y1 - 2010

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

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

KW - Oblivious pseudorandom function evaluation

KW - Secure two-party computation

KW - Set intersection

KW - Set union

KW - Simulation based security

UR - http://www.scopus.com/inward/record.url?scp=79955547393&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-13013-7_19

DO - 10.1007/978-3-642-13013-7_19

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:79955547393

SN - 3642130127

SN - 9783642130120

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 312

EP - 331

BT - Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings

T2 - 13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010

Y2 - 26 May 2010 through 28 May 2010

ER -

Hazay C, Nissim K. Efficient set operations in the presence of malicious adversaries. In Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. 2010. p. 312-331. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-13013-7_19

Efficient set operations in the presence of malicious adversaries

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this