Efficient robust private set intersection. (1st January 2012)

• Record Type: Journal Article
• Authors: Dachman-Soled, Dana; Malkin, Tal; Raykova, Mariana; Yung, Moti
• Is Part Of: International journal of applied cryptography. Volume 2:Number 4(2012)
• Page Start: 289
• Page End: 303
• Publication Date: 2012-01-01
• Subjects: set intersection -- secure two-party computation -- cryptographic protocols -- privacy preserving data mining; Data encryption (Computer science) -- Periodicals; Cryptography -- Periodicals; Computer security -- Periodicals; 652.8
• Languages: English
• ISSNs: 1753-0563

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.