Automata evaluation and text search protocols with simulation-based security
From MaRDI portal
Recommendations
- 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
- 5PM: secure pattern matching
- Efficient and secure generalized pattern matching via Fast Fourier Transform
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 1490002 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 1445379 (Why is no real title available?)
- 5PM: secure pattern matching
- A fast string searching algorithm
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - CRYPTO 2003
- Compressed representations of sequences and full-text indexes
- Computationally secure pattern matching in the presence of malicious adversaries
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Efficient secure two-party protocols. Techniques and constructions
- Efficient set operations in the presence of malicious adversaries
- Evaluating Branching Programs on Encrypted Data
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Fast Pattern Matching in Strings
- Foundations of Cryptography
- Foundations of Cryptography
- New directions in cryptography
- Secure computation of functionalities based on Hamming distance and its application to computing document similarity
- Secure two-party computation via cut-and-choose oblivious transfer
- Security and composition of multiparty cryptographic protocols
- Verifiable Shuffle of Large Size Ciphertexts
Cited in
(9)- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
- Privacy-preserving pattern matching on encrypted data
- 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
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- 5PM: secure pattern matching
- An efficient protocol for oblivious DFA evaluation and applications
- Text search protocols with simulation based security
This page was built for publication: Automata evaluation and 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 Q290379)
