Skip to Main content Skip to Navigation
New interface
Conference papers

Efficient and secure generalized pattern matching via fast fourier transform

Damien Vergnaud 1 
1 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique - ENS Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Brigitte Briot Connect in order to contact the contributor
Submitted on : Wednesday, May 13, 2020 - 1:25:28 PM
Last modification on : Thursday, March 17, 2022 - 10:08:38 AM


Files produced by the author(s)


  • HAL Id : hal-01110047, version 1




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⟩



Record views


Files downloads