Efficient and secure generalized pattern matching via fast fourier transform - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Efficient and secure generalized pattern matching via fast fourier transform

Abstract

We present simple protocols for secure two-party computation of generalized pattern matching in the presence of malicious parties. The problem is to determine all positions in a text T where a pattern P occurs (or matches with few mismatches) allowing possibly both T and P to contain single character wildcards. We propose constant-round protocols that exhibit linear communication and quasilinear computational costs with simulation-based security. Our constructions rely on a well-known technique for pattern matching proposed by Fischer and Paterson in 1974 and based on the Fast Fourier Transform. The security of the new schemes is reduced to the semantic security of the ElGamal encryption scheme.
Fichier principal
Vignette du fichier
africacrypt11.pdf (358.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01110047 , version 1 (13-05-2020)

Identifiers

  • HAL Id : hal-01110047 , version 1

Cite

Damien Vergnaud. Efficient and secure generalized pattern matching via fast fourier transform. AFRICACRYPT'11 - 4th international conference on Progress in cryptology in Africa, Jul 2011, Dakar, Senegal. pp.41-58. ⟨hal-01110047⟩
172 View
250 Download

Share

Gmail Facebook X LinkedIn More