Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
From MaRDI portal
Publication:5962221
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
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- A fast string searching algorithm
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Bridging Game Theory and Cryptography: Recent Results and Future Directions
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Efficient oblivious transfer protocols
- Fast Pattern Matching in Strings
- Foundations of Cryptography
- Foundations of Cryptography
- Number-theoretic constructions of efficient pseudo-random functions
- Oblivious transfer and polynomial evaluation
- Parallel coin-tossing and constant-round secure two-party computation
- Privacy preserving data mining
- Privacy-Preserving Set Operations
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Security and composition of multiparty cryptographic protocols
- Theory of Cryptography
Cited in
(20)- Improved private set intersection for sets with small entries
- Linear-time 2-party secure merge from additively homomorphic encryption
- Fast secure computation of set intersection
- Secure set intersection with untrusted hardware tokens
- Efficient set operations in the presence of malicious adversaries
- Efficient Concurrent Covert Computation of String Equality and Set Intersection
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Privately computing set-union and set-intersection cardinality via Bloom filters
- Scalable multi-party private set-intersection
- Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
- Advances in Cryptology - EUROCRYPT 2004
- Oblivious key-value stores and amplification for private set intersection
- Attaining GOD beyond honest majority with friends and foes
- Efficient and secure outsourced approximate pattern matching protocol
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Privacy-preserving pattern matching on encrypted data
- PSI from PaXoS: fast, malicious private set intersection
- Private set-intersection with common set-up
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Efficient set operations in the presence of malicious adversaries
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)
