Efficient set operations in the presence of malicious adversaries

Carmit Hazay, Yaacov Nissim-Kobliner

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

82 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 languageEnglish
Title of host publicationPublic Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings
Pages312-331
Number of pages20
DOIs
StatePublished - 1 Dec 2010
Externally publishedYes
Event13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 - Paris, France
Duration: 26 May 201028 May 2010

Publication series

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

Conference

Conference13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010
Country/TerritoryFrance
CityParis
Period26/05/1028/05/10

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Efficient set operations in the presence of malicious adversaries'. Together they form a unique fingerprint.

Cite this