Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
From MaRDI portal
Publication:3011902
DOI10.1007/978-3-642-21969-6_3zbMath1280.94097MaRDI QIDQ3011902
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
94A60: Cryptography
65T50: Numerical methods for discrete and fast Fourier transforms
68W32: Algorithms on strings
Related Items
Scalable Multi-party Private Set-Intersection, Automata evaluation and text search protocols with simulation-based security, Computationally secure pattern matching in the presence of malicious adversaries, Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs, Efficient and secure outsourced approximate pattern matching protocol, Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer, Secure parameterized pattern matching
Cites Work
- Simple deterministic wildcard matching
- Efficient secure two-party protocols. Techniques and constructions
- Efficient signature generation by smart cards
- Security and composition of multiparty cryptographic protocols
- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
- Text Search Protocols with Simulation Based Security
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Generalized String Matching
- Fast Pattern Matching in Strings
- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
- A Verifiable Secret Shuffe of Homomorphic Encryptions
- Jewels of Stringology
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Efficient Non-interactive Proof Systems for Bilinear Groups
- FFT-based algorithms for the string matching with mismatches problem
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Unnamed Item
- Unnamed Item
