Attack on Fully Homomorphic Encryption over the Integers

2012/02/15 by Gu Chunsheng, Chunsheng, Gu
Computer Science · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR

paper · pdf · doi:10.48550/arxiv.1202.3321

24 pages

arxiv created 2012/02/15 · arxiv updated 2012/02/16

Abstract

This paper presents a heuristic attack on the fully homomorphic encryption over the integers by using lattice reduction algorithm. Our result shows that the FHE in [DGHV10] is not secure for some parameter settings. We also present an improvement scheme to avoid the lattice attack in this paper.

Related

• An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem
• Practical Homomorphic Encryption Over the Integers
• Security and Efficiency analysis of Fully Homomorphic Encryption (FHE) algorithm ZK111
• On the Weakness of Fully Homomorphic Encryption
• Lattices, Homomorphic Encryption, and CKKS