Efficient post-quantum pattern matching on encrypted data

DOI10.62056/A09QXRXQIMaRDI QIDQ7318598zbMATH OpenFDO

Authors Anis Bkakria, Malika Izabachène

Publication date 25 August 2026

Published in Unnamed Author (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/A09QXRXQI

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Divisible e-cash made practical
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Functional encryption: definitions and challenges
• On the concrete hardness of learning with errors
• Pattern matching in encrypted stream from inner product encryption
• Pattern matching on encrypted streams
• Practical packing method in somewhat homomorphic encryption
• Privacy-preserving pattern matching on encrypted data
• Public Key Encryption with Flexible Pattern Matching
• Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
• Structured encryption and leakage suppression

This page was built for publication: Efficient post-quantum pattern matching on encrypted data

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