A fast verifiable fully homomorphic encryption technique for secret computation on cloud data
International Journal of Information Technology · 2025-05 · 17 (4) · 2193-2207
DOI: 10.1007/s41870-024-01994-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Information Technology, online erschienen am 07.07.2024. Verfasst von Ganesh Kumar Mahato und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 43 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Mahato, G. K., & Chakraborty, S. K. (2025). A fast verifiable fully homomorphic encryption technique for secret computation on cloud data. International Journal of Information Technology, 17(4), 2193-2207. https://doi.org/10.1007/s41870-024-01994-9
Vancouver
Mahato GK, Chakraborty SK. A fast verifiable fully homomorphic encryption technique for secret computation on cloud data. International Journal of Information Technology. 2025;17(4):2193-2207. doi:10.1007/s41870-024-01994-9
BibTeX
@article{Mahato2025,
author = {Mahato, Ganesh Kumar and Chakraborty, Swarnendu Kumar},
title = {A fast verifiable fully homomorphic encryption technique for secret computation on cloud data},
journal = {International Journal of Information Technology},
year = {2025},
volume = {17},
number = {4},
pages = {2193--2207},
doi = {10.1007/s41870-024-01994-9}
}
EUVIMED