Efficient Homomorphic String Search via TFHE †
Pragmatic Cybersecurity · 2026
DOI: 10.53941/pc.2026.100013 ↗Kurz gefasst
Fachartikel in der Zeitschrift Pragmatic Cybersecurity, 2026. Verfasst von Shintaro Narisada und 3 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We present a method for secure pattern matching over encrypted texts using TFHE. Our approach realizes a fully secure binary search algorithm by leveraging two operational modes of integer-input TFHE.While the BGV-based method of Bonte and Iliashenko (CCSW’20) requires O(|P|·|T|) secure character comparisons to find a pattern P in a text T, our method reduces this to O(|P| log |T|) comparisons, achieving improved scalability for large texts. As a result, our method can find a pattern of length 100 in an encrypted text containing genomic data of one million characters in less than 5 min, where prior work would require approximately 5 days for the same task. These results highlight the practicality of TFHE and its potential for large-scale secure string search.
Zitieren
APA
Narisada, S., Okada, H., Nishide, T., & Fukushima, K. (2026). Efficient Homomorphic String Search via TFHE †. Pragmatic Cybersecurity. https://doi.org/10.53941/pc.2026.100013
Vancouver
Narisada S, Okada H, Nishide T, Fukushima K. Efficient Homomorphic String Search via TFHE †. Pragmatic Cybersecurity. 2026. doi:10.53941/pc.2026.100013
BibTeX
@article{Narisada2026,
author = {Narisada, Shintaro and Okada, Hiroki and Nishide, Takashi and Fukushima, Kazuhide},
title = {Efficient Homomorphic String Search via TFHE †},
journal = {Pragmatic Cybersecurity},
year = {2026},
doi = {10.53941/pc.2026.100013}
}
EUVIMED