Computationally secure pattern matching in the presence of malicious adversaries
From MaRDI portal
Publication:744607
DOI10.1007/S00145-013-9147-8zbMATH Open1297.94075OpenAlexW2162113290MaRDI QIDQ744607FDOQ744607
Authors: Carmit Hazay, Tomas Toft 
Publication date: 25 September 2014
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-013-9147-8
Recommendations
- Computationally secure pattern matching in the presence of malicious adversaries
- 5PM: secure pattern matching
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Text search protocols with simulation based security
- Automata evaluation and text search protocols with simulation-based security
Cites Work
- Compressed representations of sequences and full-text indexes
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Security and composition of multiparty cryptographic protocols
- Title not available (Why is that?)
- Title not available (Why is that?)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Title not available (Why is that?)
- Foundations of Cryptography
- Space/time trade-offs in hash coding with allowable errors
- A fast string searching algorithm
- Title not available (Why is that?)
- Fast Pattern Matching in Strings
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- 5PM: secure pattern matching
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Efficient secure two-party protocols. Techniques and constructions
- Advances in Cryptology - EUROCRYPT 2004
- Information Security and Cryptology - ICISC 2005
- An efficient protocol for oblivious DFA evaluation and applications
- Secure database commitments and universal arguments of quasi knowledge
- Sub-linear, secure comparison with two non-colluding parties
- Proofs of Restricted Shuffles
- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Cited In (13)
- Communication-Efficient Private Protocols for Longest Common Subsequence
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- SWiM: secure wildcard pattern matching from OT extension
- Secure parameterized pattern matching
- Automata evaluation and text search protocols with simulation-based security
- Reverse-safe data structures for text indexing
- Computationally secure pattern matching in the presence of malicious adversaries
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- 5PM: secure pattern matching
- Efficient and secure outsourced approximate pattern matching protocol
- An efficient protocol for oblivious DFA evaluation and applications
- Text search protocols with simulation based security
- Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
Uses Software
This page was built for publication: Computationally secure pattern matching in the presence of malicious adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744607)
