Chapter

Applied Cryptography and Network Security

Volume 5536 of the series Lecture Notes in Computer Science pp 125-142

Efficient Robust Private Set Intersection

  • Dana Dachman-SoledAffiliated withColumbia University
  • , Tal MalkinAffiliated withColumbia University
  • , Mariana RaykovaAffiliated withColumbia University
  • , Moti YungAffiliated withColumbia University and Google Inc.

* Final gross prices may vary according to local VAT.

Get Access

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