Outsourced Pattern Matching

DOI10.1007/978-3-642-39212-2_48zbMath1334.68072OpenAlexW2111388002MaRDI QIDQ5327464

Daniele Venturi, Sebastian Faust, Carmit Hazay

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

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

Related Items (9)

Rate-limited secure function evaluation ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Verifiable pattern matching on outsourced texts ⋮ Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ Proxy Re-encryption with Delegatable Verifiability ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ The Feasibility of Outsourced Database Search in the Plain Model

This page was built for publication: Outsourced Pattern Matching