Efficient and secure generalized pattern matching via Fast Fourier Transform
From MaRDI portal
Publication:3011902
DOI10.1007/978-3-642-21969-6_3zbMATH Open1280.94097OpenAlexW4300743249MaRDI QIDQ3011902FDOQ3011902
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
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
Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50) Algorithms on strings (68W32)
Cites Work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- Efficient signature generation by smart cards
- Security and composition of multiparty cryptographic protocols
- Jewels of Stringology
- Fast Pattern Matching in Strings
- Computationally secure pattern matching in the presence of malicious adversaries
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient secure two-party protocols. Techniques and constructions
- Generalized String Matching
- Simple deterministic wildcard matching
- Text search protocols with simulation based security
- A Verifiable Secret Shuffe of Homomorphic Encryptions
- Title not available (Why is that?)
- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- FFT-based algorithms for the string matching with mismatches problem
Cited In (12)
- Scalable multi-party private set-intersection
- Secure parameterized pattern matching
- Title not available (Why is that?)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Automata evaluation and text search protocols with simulation-based security
- 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)
