Post-Quantum Fully Homomorphic Encryption with Group Ring Homomorphisms

ePrint Report: Post-Quantum Fully Homomorphic Encryption with Group Ring Homomorphisms

Christopher Leonardi, Maya Gusak

Gentry's groundbreaking work showed that a fully homomorphic, provably secure scheme is possible via bootstrapping a somewhat homomorphic scheme. However, a major drawback of bootstrapping is its high computational cost. One alternative is to use a different metric for noise so that homomorphic operations do not accumulate noise, eliminating the need for boostrapping altogether. Leonardi and Ruiz-Lopez present a group-theoretic framework for such a ``noise non-accumulating'' …

computational cost encryption eprint report fully homomorphic encryption high homomorphic encryption major maya metric post-quantum quantum report ring work