Efficient and secure generalized pattern matching via Fast Fourier Transform

DOI10.1007/978-3-642-21969-6_3MaRDI QIDQ3011902zbMATH OpenOpenAlexFDO

Authors Damien Vergnaud

Publication date 29 June 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01110047/file/africacrypt11.pdf

zbMATH Keywords

pattern matchinghomomorphic encryptionFast Fourier Transformtwo-party secure computation

Mathematics Subject Classification ID

Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50) Algorithms on strings (68W32)

Recommendations

• Computationally secure pattern matching in the presence of malicious adversaries
• Computationally secure pattern matching in the presence of malicious adversaries
• 5PM: secure pattern matching
• Automata evaluation and text search protocols with simulation-based security
• SWiM: secure wildcard pattern matching from OT extension

Cites work

• scientific article; zbMATH DE number 1186873 (Why is no real title available?)
• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• A public key cryptosystem and a signature scheme based on discrete logarithms
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Computationally secure pattern matching in the presence of malicious adversaries
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
• Efficient secure two-party protocols. Techniques and constructions
• Efficient signature generation by smart cards
• FFT-based algorithms for the string matching with mismatches problem
• Fast Pattern Matching in Strings
• Generalized String Matching
• Jewels of Stringology
• Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
• Security and composition of multiparty cryptographic protocols
• Simple deterministic wildcard matching
• Text search protocols with simulation based security

Cited in

(12)

• Scalable multi-party private set-intersection
• Secure parameterized pattern matching
• scientific article; zbMATH DE number 4191391 (Why is no real title available?)
• Automata evaluation and text search protocols with simulation-based security
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Computationally secure pattern matching in the presence of malicious adversaries
• Pattern matching in encrypted stream from inner product encryption
• Computationally secure pattern matching in the presence of malicious adversaries
• 5PM: secure pattern matching
• Efficient and secure outsourced approximate pattern matching protocol
• Text search protocols with simulation based security
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer

This page was built for publication: Efficient and secure generalized pattern matching via Fast Fourier Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011902)