Efficient robust private set intersection

120Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2009 Springer Berlin Heidelberg.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

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

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 26

74%

Professor / Associate Prof. 5

14%

Researcher 3

9%

Lecturer / Post doc 1

3%

Readers' Discipline

Tooltip

Computer Science 26

79%

Engineering 3

9%

Mathematics 3

9%

Social Sciences 1

3%

Save time finding and organizing research with Mendeley

Sign up for free