Academic
Publications
Efficient Robust Private Set Intersection

Efficient Robust Private Set Intersection,10.1007/978-3-642-01957-9_8,Dana Dachman-soled,Tal Malkin,Mariana Raykova,Moti Yung

Efficient Robust Private Set Intersection   (Citations: 17)
BibTex | RIS | RefWorks Download
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.
Conference: Applied Cryptography and Network Security , pp. 125-142, 2009
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...There are several improvements to this construction against malicious adversaries in the standard model, with linear communication and quadratic computation [7], and linear communication and O(wloglog v) computation in [20] (all under DDH)...

    Giuseppe Atenieseet al. (If) Size Matters: Size-Hiding Private Set Intersection

    • ...Ye et. al. [9] extended the FNP scheme to a distributed private matching scheme; recent work [16] focused on reducing the complexity in the malicious model...

    Ming Liet al. FindU: Privacy-preserving personal profile matching in mobile social n...

    • ...We focus on the secure computation of basic set operations (intersection and union) where the parties P1 ,P 2, holding input sets X, Y , respectively, wish to compute X ∩ Y or X ∪ Y . These problems have been widely looked at by researchers in the last few years [6,8,14,24,30,32,34], mainly due to their potential applications for dating services, data mining, recommendation systems, law enforcement, etc...
    • ...• Finally, Dachman-Soled, Malkin, Raykova, and Yung [14] present a protocol for set-intersection in the presence of malicious adversaries without restricting the domain...

    C. Nissim K. Hazay. Efficient Set Operations in the Presence of Malicious Adversaries

    • ...We call this delegated subset test where the service provider is the delegator chosen by the data owner, so as to differentiate it from private set operations [11,16,9,8,7] which is an interactive algorithm between two participants...
    • ...Delegated subset tests are related to, but different from private set operations [11,16,9,8,7] such as set union and intersection...

    Xuhua Zhouet al. Lightweight Delegated Subset Test with Privacy Protection

    • ...This problem has numerous applications in practice and has been considered in a series of works [FNP04, HL08, KS05, JL09, DSMRY09, CKT10, HN10, DSMRY11]...

    Seny Kamaraet al. Outsourcing Multi-Party Computation

Sort by: