Computationally secure pattern matching in the presence of malicious adversaries

Carmit Hazay, Tomas Toft

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

54 Scopus citations

Abstract

We propose a dedicated protocol for the highly motivated problem of secure two-party pattern matching: Alice holds a text t ∈ {0,1}*. of length n, while Bob has a pattern p ∈ {0,1}*. of length m. The goal is for Bob to learn where his pattern occurs in Alice's text. Our construction guarantees full simulation in the presence of malicious, polynomial-time adversaries (assuming that ElGamal encryption is semantically secure) and exhibits computation and communication costs of O(n + m) in a constant round complexity. In addition to the above, we propose a collection of protocols for variations of the secure pattern matching problem: The pattern may contain wildcards (O(nm) communication in O(1) rounds). The matches may be approximated, i.e., Hamming distance less than some threshold ((O(nm) communication in O(1) rounds). The length, m, of Bob's pattern is secret (O(nm) communication in O(1) rounds). The length, n, of Alice's text is secret (O(n + m) communication in O(1) rounds).

Original languageEnglish
Title of host publicationAdvances in Cryptology, ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
PublisherSpringer Verlag
Pages195-212
Number of pages18
ISBN (Print)3642173721, 9783642173721
DOIs
StatePublished - 2010
Externally publishedYes
Event16th Annual International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2010 - Singapore, Singapore
Duration: 5 Dec 20109 Dec 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6477 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th Annual International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2010
Country/TerritorySingapore
CitySingapore
Period5/12/109/12/10

Keywords

  • Pattern matching
  • full simulation
  • malicious adversary
  • secure two-party computation

Fingerprint

Dive into the research topics of 'Computationally secure pattern matching in the presence of malicious adversaries'. Together they form a unique fingerprint.

Cite this