Text search protocols with simulation based security
From MaRDI portal
Publication:3562906
DOI10.1007/978-3-642-13013-7_20zbMATH Open1281.94025OpenAlexW1565006950MaRDI QIDQ3562906FDOQ3562906
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
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)
- Secure parameterized pattern matching
- Automata evaluation and text search protocols with simulation-based security
- Oblivious DFA evaluation on joint input and its applications
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Computationally secure pattern matching in the presence of malicious adversaries
- 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
- Efficient and secure outsourced approximate pattern matching protocol
- Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption
- An efficient protocol for oblivious DFA evaluation and applications
- Rate-limited secure function evaluation: definitions and constructions
- Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
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)
