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. © 2009 Springer Berlin Heidelberg.
Mendeley helps you to discover research relevant for your work.
CITATION STYLE
Dachman-Soled, D., Malkin, T., Raykova, M., & Yung, M. (2009). Efficient robust private set intersection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5536 LNCS, pp. 125–142). https://doi.org/10.1007/978-3-642-01957-9_8