Cryptanalysis of an Unbounded Fully Homomorphic Encryption Scheme †
Gentry’s original blueprint for the construction of fully homomorphic encryption (FHE) starts from a somewhat homomorphic encryption scheme, that supports the homomorphic evaluation of arithmetic circuits of moderate multiplicative depth up to L, and whose decryption circuit itself can furthermore be “squashed” to a mu...