Text search protocols with simulation based security

DOI10.1007/978-3-642-13013-7_20MaRDI QIDQ3562906zbMATH OpenOpenAlexFDO

Authors Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen

Publication date 28 May 2010

Published in Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13013-7_20

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Automata evaluation and text search protocols with simulation-based security
• Computationally secure pattern matching in the presence of malicious adversaries
• Computationally secure pattern matching in the presence of malicious adversaries
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
• Efficient and secure generalized pattern matching via Fast Fourier Transform

Cited in

(13)

• Efficient and secure outsourced approximate pattern matching protocol
• Oblivious DFA evaluation on joint input and its applications
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
• Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
• Secure parameterized pattern matching
• An efficient protocol for oblivious DFA evaluation and applications
• Automata evaluation and text search protocols with simulation-based security
• Efficient and secure generalized pattern matching via Fast Fourier Transform
• Computationally secure pattern matching in the presence of malicious adversaries
• Rate-limited secure function evaluation
• Rate-limited secure function evaluation: definitions and constructions
• Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption
• Computationally secure pattern matching in the presence of malicious adversaries

This page was built for publication: Text search protocols with simulation based security

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