CRFeb 15, 2012

Attack on Fully Homomorphic Encryption over the Integers

arXiv:1202.3321v13 citations
Originality Synthesis-oriented
AI Analysis

This work addresses a security vulnerability in fully homomorphic encryption, which is crucial for privacy-preserving computations in cryptography, but it is incremental as it builds on known lattice attacks.

The authors tackled the security of fully homomorphic encryption over the integers by developing a heuristic attack using lattice reduction, showing that the DGHV10 scheme is insecure for certain parameter settings, and proposed an improvement scheme to mitigate this attack.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes