Puncturable fully homomorphic encryption based on Bloom filter
PeerJ Computer Science · 05.03.2026 · 12 · e3675
DOI: 10.7717/peerj-cs.3675 ↗Kurz gefasst
Fachartikel in der Zeitschrift PeerJ Computer Science, online erschienen am 05.03.2026. Verfasst von Jhih-Wei Shen und 2 weiteren Autor:innen. Die Arbeit nennt 21 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: National Science and Technology Council, Taiwan.
Abstract (Originalsprache)
Fully Homomorphic Encryption (FHE) empowers secure computation over encrypted data, offering a crucial solution for privacy-preserving applications in cloud computing. However, the security of FHE is contingent upon robust key management practices. This article introduces a novel FHE scheme that integrates a robust key revocation mechanism. By incorporating key revocation, our scheme ensures forward secrecy, guaranteeing that the confidentiality of previously encrypted data remains intact even if the secret key is subsequently compromised.
Förderung
- National Science and Technology Council, Taiwan
Zitieren
APA
Shen, J., Chi, P., & Lin, S. (2026). Puncturable fully homomorphic encryption based on Bloom filter. PeerJ Computer Science, 12, e3675. https://doi.org/10.7717/peerj-cs.3675
Vancouver
Shen J, Chi P, Lin S. Puncturable fully homomorphic encryption based on Bloom filter. PeerJ Computer Science. 2026;12:e3675. doi:10.7717/peerj-cs.3675
BibTeX
@article{Shen2026,
author = {Shen, Jhih-Wei and Chi, Po-Wen and Lin, Shao-Yuan},
title = {Puncturable fully homomorphic encryption based on Bloom filter},
journal = {PeerJ Computer Science},
year = {2026},
volume = {12},
pages = {e3675},
doi = {10.7717/peerj-cs.3675}
}
EUVIMED