Journal Article10.1007/S00145-008-9034-X
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
Carmit Hazay,Yehuda Lindell +1 more
TL;DR: In this paper, the authors proposed a secure set intersection and pattern matching algorithm based on secure pseudorandom function evaluation. But their results are presented in two adversary models: one is simulatable and the other is not.
read more
Abstract: In this paper, we construct efficient secure protocols for set intersection and pattern matching. Our protocols for secure computing the set intersection functionality are based on secure pseudorandom function evaluations, in contrast to previous protocols that are based on polynomials. In addition to the above, we also use secure pseudorandom function evaluation in order to achieve secure pattern matching. In this case, we utilize specific properties of the Naor---Reingold pseudorandom function in order to achieve high efficiency.
Our results are presented in two adversary models. Our protocol for secure pattern matching and one of our protocols for set intersection achieve security against malicious adversaries under a relaxed definition where one corruption case is simulatable and, for the other, only privacy (formalized through indistinguishability) is guaranteed. We also present a protocol for set intersection that is fully simulatable in the model of covert adversaries. Loosely speaking, this means that a malicious adversary can cheat but will then be caught with good probability.
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
Secure Two-Party Computation Is Practical
Benny Pinkas,Thomas Schneider,Nigel P. Smart,Stephen C. Williams +3 more
- 02 Dec 2009
TL;DR: In this article, an implementation of the two-party case, using Yao's garbled circuits, and various algorithmic protocol improvements are analyzed both theoretically and empirically, using experiments of various adversarial situations.
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Benny Applebaum,David Cash,Chris Peikert,Amit Sahai +3 more
- 19 Aug 2009
TL;DR: Public-key and symmetric-key cryptosystems that provide security for key-dependent messages and enjoy circular security and a pseudorandom generator that can be computed by a circuit of n ·polylog(n) size are constructed.
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.
References
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.
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
•Proceedings Article
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
Oded Goldreich,Silvio Micali,Avi Wigderson +2 more
- 01 Jan 1987
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machimery.
3.9K
How to play ANY mental game
Oded Goldreich,Silvio Micali,Avi Wigderson +2 more
- 01 Jan 1987
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
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