This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P 1 holds a pattern and party P 2 holds a text. The goal of P 1 is to learn where the pattern appears in the text, without revealing it to P 2 or learning anything else about P 2's text. Our protocol is the first to address this problem with full security in the face of malicious adversaries. The construction is based on a novel protocol for secure oblivious automata evaluation which is of independent interest. In this problem party P 1 holds an automaton and party P 2 holds an input string, and they need to decide if the automaton accepts the input, without learning anything else. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gennaro, R., Hazay, C., & Sorensen, J. S. (2010). Text search protocols with simulation based security. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6056 LNCS, pp. 332–350). https://doi.org/10.1007/978-3-642-13013-7_20
Mendeley helps you to discover research relevant for your work.