Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
From MaRDI portal
Publication:3058657
DOI10.1007/978-3-642-17373-8_12zbMath1290.94085OpenAlexW1837554175MaRDI QIDQ3058657
Publication date: 7 December 2010
Published in: Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17373-8_12
Related Items (14)
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ An Efficient Protocol for Oblivious DFA Evaluation and Applications ⋮ Automata evaluation and text search protocols with simulation-based security ⋮ Rate-limited secure function evaluation ⋮ Secure parameterized pattern matching ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Rate-Limited Secure Function Evaluation: Definitions and Constructions ⋮ Scalable Multi-party Private Set-Intersection ⋮ Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ The Feasibility of Outsourced Database Search in the Plain Model
This page was built for publication: Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
