Outsourced pattern matching

DOI10.1007/978-3-642-39212-2_48MaRDI QIDQ5327464zbMATH OpenOpenAlexFDO

Authors Sebastian Faust, Carmit Hazay, D. Venturi

Publication date 7 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL http://infoscience.epfl.ch/record/188323

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algorithms on strings (68W32)

Recommendations

• Verifiable pattern matching on outsourced texts
• Verifiable pattern matching on outsourced texts
• 5PM: secure pattern matching
• Computationally secure pattern matching in the presence of malicious adversaries
• The feasibility of outsourced database search in the plain model

Cited in

(13)

• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Verifiable pattern matching on outsourced texts
• Efficient and secure outsourced approximate pattern matching protocol
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
• Naor-Yung paradigm with shared randomness and applications
• Proxy re-encryption with delegatable verifiability
• Naor-Yung Paradigm with Shared Randomness and Applications
• The feasibility of outsourced database search in the plain model
• Verifiable pattern matching on outsourced texts
• Lightweight delegated subset test with privacy protection
• Rate-limited secure function evaluation
• Asynchronous Pattern Matching
• \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection

This page was built for publication: Outsourced pattern matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5327464)