Text search protocols with simulation based security
From MaRDI portal
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)