CryptoDB
Efficient Post-Quantum Pattern Matching on Encrypted Data
| Authors: |
|
|---|---|
| Download: | |
| Abstract: | Pattern matching methods are essential in various applications where users must disclose highly sensitive information. Among these applications are genomic data analysis, financial records inspection, and intrusion detection processes, all of which necessitate robust privacy protection mechanisms. Balancing the imperative of protecting the confidentiality of analyzed data with the need for efficient pattern matching presents a significant challenge. In this paper, we propose an efficient post-quantum secure construction that enables arbitrary pattern matching over encrypted data while ensuring the confidentiality of the data to be analyzed. In addition, we address scenarios where a malicious data sender, intended to send an encrypted content for pattern detection analysis, has the ability to modify the encrypted content. We adapt the data fragmentation technique to handle such a malicious sender. Our construction makes use of a well-suited Homomorphic Encryption packing method in the context of fragmented streams and combines homomorphic operations in a leveled mode (i.e. without bootstrapping) to obtain a very efficient pattern matching detection process. In contrast to the most efficient state-of-the-art scheme, our construction achieves a significant reduction in the time required for encryption, decryption, and pattern matching on encrypted data. Specifically, our approach decreases the time by factors of $1850$, $10^6$, and $245$, respectively, for matching a single pattern, and by factors of $115$, $10^5$, and $12$, respectively, for matching $2^{10}$ patterns. |
BibTeX
@article{cic-2024-34415,
title={Efficient Post-Quantum Pattern Matching on Encrypted Data},
journal={cic},
publisher={International Association for Cryptologic Research},
volume={1, Issue 2},
url={https://cic.iacr.org//p/1/2/22},
doi={10.62056/a09qxrxqi},
author={Anis Bkakria and Malika Izabachène},
year=2024
}