Verifiable FHE via Lattice-based SNARKs

ePrint Report: Verifiable FHE via Lattice-based SNARKs

Shahla Atapoor, Karim Baghery, Hilder V. L. Pereira, Jannik Spiessens

Fully Homomorphic Encryption (FHE) is a prevalent cryptographic primitive that allows for computation on encrypted data. In various cryptographic protocols, this enables outsourcing computation to a third party while retaining the privacy of the inputs to the computation. However, these schemes make an honest-but-curious assumption about the adversary. Previous work has tried to remove this assumption by combining FHE with Verifiable Computation (VC). …

computation cryptographic data encrypted encrypted data encryption eprint report fhe fully homomorphic encryption homomorphic encryption inputs outsourcing party prevalent privacy protocols report third