Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
From MaRDI portal
Publication:5962221
DOI10.1007/S00145-008-9034-XzbMATH Open1195.94058OpenAlexW2133314176MaRDI QIDQ5962221FDOQ5962221
Authors: Carmit Hazay, Yehuda Lindell 
Publication date: 21 September 2010
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-008-9034-x
Recommendations
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Efficient set intersection with simulation-based security
- Efficient set operations in the presence of malicious adversaries
- Efficient set operations in the presence of malicious adversaries
- Computationally secure pattern matching in the presence of malicious adversaries
- Computationally secure pattern matching in the presence of malicious adversaries
- Advances in Cryptology - EUROCRYPT 2004
- Linear-complexity private set intersection protocols secure in malicious model
- Fast secure computation of set intersection
Cites Work
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Parallel coin-tossing and constant-round secure two-party computation
- Security and composition of multiparty cryptographic protocols
- Efficient oblivious transfer protocols
- Title not available (Why is that?)
- Oblivious transfer and polynomial evaluation
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Cryptography
- Foundations of Cryptography
- Privacy-Preserving Set Operations
- Theory of Cryptography
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Number-theoretic constructions of efficient pseudo-random functions
- Bridging Game Theory and Cryptography: Recent Results and Future Directions
- Privacy preserving data mining
Cited In (20)
- Attaining GOD beyond honest majority with friends and foes
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Privacy-preserving pattern matching on encrypted data
- Efficient set operations in the presence of malicious adversaries
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Linear-time 2-party secure merge from additively homomorphic encryption
- Efficient set operations in the presence of malicious adversaries
- Fast secure computation of set intersection
- Private set-intersection with common set-up
- Improved private set intersection for sets with small entries
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Efficient and secure outsourced approximate pattern matching protocol
- PSI from PaXoS: fast, malicious private set intersection
- Oblivious key-value stores and amplification for private set intersection
- Efficient Concurrent Covert Computation of String Equality and Set Intersection
- Secure set intersection with untrusted hardware tokens
- Scalable Multi-party Private Set-Intersection
- Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
- Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
This page was built for publication: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962221)
