TY - CHAP
T1 - Efficient Robust Private Set Intersection
T2 - Applied Cryptography and Network Security
Y1 - 2009
A1 - Dana Dachman-Soled
A1 - Malkin, Tal
A1 - Raykova, Mariana
A1 - Yung, Moti
ED - Abdalla, Michel
ED - Pointcheval, David
ED - Fouque, Pierre-Alain
ED - Vergnaud, Damien
KW - Coding and Information Theory
KW - Computer Communication Networks
KW - Cryptographic protocols
KW - Data Encryption
KW - Data Structures, Cryptology and Information Theory
KW - Information Systems Applications (incl.Internet)
KW - Privacy Preserving Data Mining
KW - Secure Two-party Computation
KW - Set Intersection
KW - Systems and Data Security
AB - 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.
JA - Applied Cryptography and Network Security
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-642-01956-2, 978-3-642-01957-9
UR - http://link.springer.com/chapter/10.1007/978-3-642-01957-9_8
ER -