Efficient Robust Private Set Intersection
| Title | Efficient Robust Private Set Intersection |
| Publication Type | Book Chapters |
| Year of Publication | 2009 |
| Authors | Dachman-Soled D, Malkin T, Raykova M, Yung M |
| Editor | Abdalla M, Pointcheval D, Fouque P-A, Vergnaud D |
| Book Title | Applied Cryptography and Network Security |
| Series Title | Lecture Notes in Computer Science |
| Pagination | 125 - 142 |
| Publisher | Springer Berlin Heidelberg |
| ISBN Number | 978-3-642-01956-2, 978-3-642-01957-9 |
| Keywords | Coding and Information Theory, Computer Communication Networks, Cryptographic protocols, Data Encryption, Data Structures, Cryptology and Information Theory, Information Systems Applications (incl.Internet), Privacy Preserving Data Mining, Secure Two-party Computation, Set Intersection, Systems and Data Security |
| 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. |
| URL | http://link.springer.com/chapter/10.1007/978-3-642-01957-9_8 |