An efficient FHE based on the hardness of solving systems of non-linear multivariate equations


We propose a general framework to develop fully homomorphic encryption schemes (FHE) without using the Gentry’s technique. Initially, a private-key cryptosystem is built over Zn (n being an RSA modulus). An encryption of x ∈ Zn is a randomly chosen vector e such that Φ(e) = x where Φ is a secret multivariate polynomial. This private-key cryptosystem is not… (More)

3 Figures and Tables


  • Presentations referencing similar topics