Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries

DOI10.1007/S00145-008-9034-XzbMATH Open1195.94058OpenAlexW2133314176MaRDI QIDQ5962221FDOQ5962221

Yehuda Lindell, Carmit Hazay

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

zbMATH Keywords

oblivious pseudorandom functionpattern matching and set intersection

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Oblivious transfer and polynomial evaluation
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• 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 (15)

• Secure Set Intersection with Untrusted Hardware Tokens
• Attaining GOD beyond honest majority with friends and foes
• Privacy-preserving pattern matching on encrypted data
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Linear-time 2-party secure merge from additively homomorphic encryption
• Private set-intersection with common set-up
• Improved private set intersection for sets with small entries
• 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
• Scalable Multi-party Private Set-Intersection
• Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
• Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer

Recommendations

• Advances in Cryptology - EUROCRYPT 2004 👍 👎
• 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 👍 👎
• Fast Secure Computation of Set Intersection 👍 👎
• Computationally Secure Pattern Matching in the Presence of Malicious Adversaries 👍 👎
• Efficient set operations in the presence of malicious adversaries 👍 👎
• Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model 👍 👎
• Computationally secure pattern matching 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)