Computationally secure pattern matching in the presence of malicious adversaries

DOI10.1007/978-3-642-17373-8_12MaRDI QIDQ3058657zbMATH OpenOpenAlexFDO

Authors Carmit Hazay, Tomas Toft

Publication date 7 December 2010

Published in Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17373-8_12

zbMATH Keywords

pattern matchingsecure two-party computationmalicious adversaryfull simulation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Computationally secure pattern matching in the presence of malicious adversaries
• Efficient and secure generalized pattern matching via Fast Fourier Transform
• 5PM: secure pattern matching
• Automata evaluation and text search protocols with simulation-based security
• Text search protocols with simulation based security

Cited in

(20)

• Scalable multi-party private set-intersection
• Non-interactive secure computation of inner-product from LPN and LWE
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
• SWiM: secure wildcard pattern matching from OT extension
• Secure parameterized pattern matching
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• Automata evaluation and text search protocols with simulation-based security
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Computationally secure pattern matching in the presence of malicious adversaries
• Rate-limited secure function evaluation
• Efficient and secure generalized pattern matching via Fast Fourier Transform
• 5PM: secure pattern matching
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Efficient and secure outsourced approximate pattern matching protocol
• The feasibility of outsourced database search in the plain model
• An efficient protocol for oblivious DFA evaluation and applications
• Text search protocols with simulation based security
• Rate-limited secure function evaluation: definitions and constructions
• Outsourced pattern matching
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer

This page was built for publication: Computationally secure pattern matching in the presence of malicious adversaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058657)