Efficient Robust Private Set Intersection

TitleEfficient Robust Private Set Intersection
Publication TypeBook Chapters
Year of Publication2009
AuthorsDachman-Soled D, Malkin T, Raykova M, Yung M
EditorAbdalla M, Pointcheval D, Fouque P-A, Vergnaud D
Book TitleApplied Cryptography and Network Security
Series TitleLecture Notes in Computer Science
Pagination125 - 142
PublisherSpringer Berlin Heidelberg
ISBN Number978-3-642-01956-2, 978-3-642-01957-9
KeywordsCoding 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

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.