Journal Article10.1504/IJACT.2012.048080
Efficient robust private set intersection
TL;DR: The first solution to this problem of assuring robustness, namely, coping with potentially arbitrarily misbehaving parties, while retaining protocol efficiency, is presented.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Practical private set intersection protocols with linear complexity
Emiliano De Cristofaro,Gene Tsudik +1 more
- 25 Jan 2010
TL;DR: This paper explores some PSI variations and constructs several secure protocols that are appreciably more efficient than the state-of-the-art.
464
•Proceedings Article
Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?
Yan Huang,David Evans,Jonathan Katz +2 more
- 01 Jan 2012
TL;DR: This paper develops three classes of protocols targeted to different set sizes and domains, all based on Yao's generic garbled-circuit method, and compares the performance of these protocols to the fastest custom PSI protocols in the literature.
When private set intersection meets big data: an efficient and scalable protocol
Changyu Dong,Liqun Chen,Zikai Wen +2 more
- 04 Nov 2013
TL;DR: A new Private Set Intersection (PSI) protocol that is extremely efficient and highly scalable compared with existing protocols, based on a novel approach that is oblivious Bloom intersection, which has linear complexity and relies mostly on efficient symmetric key operations.
Fast Private Set Intersection from Homomorphic Encryption
Hao Chen,Kim Laine,Peter Rindal +2 more
- 30 Oct 2017
TL;DR: This work uses fully homomorphic encryption to construct a fast PSI protocol with a small communication overhead that works particularly well when one of the two sets is much smaller than the other, and is secure against semi-honest adversaries.
350
•Posted Content
Faster Private Set Intersection based on OT Extension.
TL;DR: In this paper, the authors give an overview on existing PSI protocols that are secure against semi-honest adversaries and suggest a new PSI protocol whose runtime is superior to that of existing protocols.
References
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
A public key cryptosystem and a signature scheme based on discrete logarithms
Taher Elgamal
- 23 Aug 1985
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Public-key cryptosystems based on composite degree residuosity classes
Pascal Paillier
- 02 May 1999
TL;DR: A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
Taher Elgamal
- 19 Aug 1984
TL;DR: In this article, a new signature scheme is proposed together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem and the security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
How to generate and exchange secrets
Andrew Chi-Chih Yao
- 27 Oct 1986
TL;DR: A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature.
4.1K
Related Papers (5)
Michael J. Freedman,Kobbi Nissim,Benny Pinkas +2 more
- 02 May 2004
Emiliano De Cristofaro,Gene Tsudik +1 more
- 25 Jan 2010