Paper 2025/261
HasteBoots: Proving FHE Bootstrapping in Seconds
Abstract
Fully Homomorphic Encryption (FHE) enables computations on encrypted data, ensuring privacy for outsourced computation. However, verifying the integrity of FHE computations remains a significant challenge, especially for bootstrapping, the most computationally intensive operation in FHE. Prior approaches, including zkVM-based solutions and general-purpose SNARKs, suffer from inefficiencies, with proof generation times ranging from several hours to days. In this work, we propose HasteBoots, a succinct argument tailored for FHE operations. By designing customized polynomial interactive oracle proofs and optimized polynomial commitment schemes, HasteBoots achieves proof generation in a few seconds for FHE bootstrapping, significantly outperforming existing methods. Our approach demonstrates the potential for scalable and efficient verifiable FHE, paving the way for practical, privacy-preserving computations.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Verifiable FHEsuccinct argumentsFHEW/TFHE
- Contact author(s)
-
fengrun liu @ gmail com
lianghaofei @ sjtu edu cn
andrew_sjtu @ sjtu edu cn
huyuncong @ sjtu edu cn
xiexiangiscas @ gmail com
hstan @ ustc edu cn
yyuu @ sjtu edu cn - History
- 2025-02-18: approved
- 2025-02-18: received
- See all versions
- Short URL
- https://ia.cr/2025/261
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/261,
author = {Fengrun Liu and Haofei Liang and Tianyu Zhang and Yuncong Hu and Xiang Xie and Haisheng Tan and Yu Yu},
title = {{HasteBoots}: Proving {FHE} Bootstrapping in Seconds},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/261},
year = {2025},
url = {https://eprint.iacr.org/2025/261}
}
