Automata evaluation and text search protocols with simulation-based security
From MaRDI portal
Publication:290379
DOI10.1007/s00145-014-9193-xzbMath1355.94057OpenAlexW2025883329MaRDI QIDQ290379
Jeffrey S. Sorensen, Carmit Hazay, Rosario Gennaro
Publication date: 1 June 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-014-9193-x
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure computation of functionalities based on Hamming distance and its application to computing document similarity
- Efficient set operations in the presence of malicious adversaries
- Efficient secure two-party protocols. Techniques and constructions
- Security and composition of multiparty cryptographic protocols
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- 5PM: Secure Pattern Matching
- Compressed representations of sequences and full-text indexes
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
- A fast string searching algorithm
- Evaluating Branching Programs on Encrypted Data
- New directions in cryptography
- Fast Pattern Matching in Strings
- Foundations of Cryptography
- Foundations of Cryptography
- Advances in Cryptology - CRYPTO 2003
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Verifiable Shuffle of Large Size Ciphertexts
This page was built for publication: Automata evaluation and text search protocols with simulation-based security
