Efficient Robust Private Set Intersection

  • Dana Dachman-Soled
  • Tal Malkin
  • Mariana Raykova
  • Moti Yung
Conference paper

DOI: 10.1007/978-3-642-01957-9_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5536)
Cite this paper as:
Dachman-Soled D., Malkin T., Raykova M., Yung M. (2009) Efficient Robust Private Set Intersection. In: Abdalla M., Pointcheval D., Fouque PA., Vergnaud D. (eds) Applied Cryptography and Network Security. ACNS 2009. Lecture Notes in Computer Science, vol 5536. Springer, Berlin, Heidelberg

Abstract

Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustness, namely, coping with potentially arbitrarily misbehaving (i.e., malicious) parties, while retaining protocol efficiency (rather than employing costly generic techniques) is an open problem. In this work the first solution to this problem is presented.

Keywords

Set Intersection Secure Two-party Computation Cryptographic Protocols Privacy Preserving Data Mining 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Dana Dachman-Soled
    • 1
  • Tal Malkin
    • 1
  • Mariana Raykova
    • 1
  • Moti Yung
    • 2
  1. 1.Columbia University 
  2. 2.Columbia University and Google Inc. 

Personalised recommendations