@Primuslabs
Make the World’s Data Useful Onchain
Website
Website
Twitter
Twitter
Deck
Deck
Paper(Garble-Then-Prove)
Paper(Garble-Then-Prove)
Paper(QuickSilver)
Paper(QuickSilver)
Paper(HasteBoots)
Paper(HasteBoots)
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 NAND with bootstrapping, significantly outperforming existing methods. Our approach demonstrates the potential for scalable and efficient verifiable FHE, paving the way for practical, privacy-preserving computations.
Github
Github
Medium
Medium
Email
Email
View on mobile
