Efficient Robust Private Set Intersection

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.

• Type: Conference
• Year: 2009
• Where: ACNS
• Authors: Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung
• Keywords: ACNS 2009, Costly Generic Techniques, Cryptology, Important Basic Procedure, Private Data Mining