Efficient Robust Private Set Intersection
- Cite this paper as:
- Dachman-Soled D., Malkin T., Raykova M., Yung M. (2009) Efficient Robust Private Set Intersection. In: Abdalla M., Pointcheval D., Fouque PA., Vergnaud D. (eds) Applied Cryptography and Network Security. ACNS 2009. Lecture Notes in Computer Science, vol 5536. Springer, Berlin, Heidelberg
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.
KeywordsSet Intersection Secure Two-party Computation Cryptographic Protocols Privacy Preserving Data Mining
Unable to display preview. Download preview PDF.