Efficient and secure outsourced approximate pattern matching protocol
From MaRDI portal
Recommendations
- 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
- Outsourced pattern matching
- Text search protocols with simulation based security
Cites work
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- 5PM: secure pattern matching
- Advances in Cryptology - CRYPTO 2003
- An efficient protocol for oblivious DFA evaluation and applications
- 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
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Efficient randomized pattern-matching algorithms
- Efficient secure two-party protocols. Techniques and constructions
- Fast Pattern Matching in Strings
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- How to share a secret
- Improved delegation of computation using fully homomorphic encryption
- Multi-client verifiable computation with stronger security guarantees
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Outsourced pattern matching
- Text search protocols with simulation based security
- Theory of Cryptography
- Verifiable outsourced ciphertext-policy attribute-based encryption in cloud computing
Cited in
(4)
This page was built for publication: Efficient and secure outsourced approximate pattern matching protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1797787)