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

DOI10.1007/s00145-008-9034-xzbMath1195.94058OpenAlexW2133314176MaRDI QIDQ5962221

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)

Related Items (14)

Oblivious key-value stores and amplification for private set intersection ⋮ Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters ⋮ Improved private set intersection for sets with small entries ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ Privacy-preserving pattern matching on encrypted data ⋮ Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Scalable Multi-party Private Set-Intersection ⋮ Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer ⋮ Private set-intersection with common set-up ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ Secure Set Intersection with Untrusted Hardware Tokens ⋮ PSI from PaXoS: fast, malicious private set intersection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel coin-tossing and constant-round secure two-party computation
• Security and composition of multiparty cryptographic protocols
• Oblivious transfer and polynomial evaluation
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• A fast string searching algorithm
• Number-theoretic constructions of efficient pseudo-random functions
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Fast Pattern Matching in Strings
• Foundations of Cryptography
• Foundations of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• Bridging Game Theory and Cryptography: Recent Results and Future Directions
• Privacy-Preserving Set Operations
• Theory of Cryptography
• Privacy preserving data mining

This page was built for publication: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries