Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings |
| Pages | 332-350 |
| Number of pages | 19 |
| DOIs | |
| State | Published - 2010 |
| Externally published | Yes |
| Event | 13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 - Paris, France Duration: 26 May 2010 → 28 May 2010 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 6056 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 |
|---|---|
| Country/Territory | France |
| City | Paris |
| Period | 26/05/10 → 28/05/10 |
Bibliographical note
Funding Information:This research was supported by a National Institutes of Health Grant, GM 26020, and by a grant-in-aid from the American Heart Association with funds contributed in part by the Greater Los Angeles Affiliate.