Skip to content
Open access

Cryptanalysis of an Unbounded Fully Homomorphic Encryption Scheme †

Sep 2026 · Pragmatic Cybersecurity · Vol 1 · 0 citations · 29 references

TL;DR

It is shown that Zhang et al.

Abstract

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 multiplicative depth less than L. Then, the homomorphic evaluation of this squashed decryption circuit, called bootstrapping, transforms any ciphertext into a ciphertext supporting at least one extra level of multiplication, enabling the homomorphic evaluation of arbitrary arithmetic circuits. Bootstrapping is the cornerstone of Gentry’s breakthrough. Unfortunately, it introduces substantial overhead that limits the efficiency of most FHE schemes so far. Consequently, numerous attempts have been made to circumvent the bottleneck of bootstrapping by directly constructing encryption schemes that support the evaluation of circuits of unbounded depth, e.g., by avoiding ciphertext noise, the randomness present in Gentry-like somewhat homomorphic schemes that grows after each homomorphic multiplication. Noise effectively limits the depths of supported circuits, as ciphertexts fail to correctly decrypt when noise size exceeds a certain threshold. Most attempts to achieve noiseless FHE schemes have proved insecure, however. In this paper, we take a closer look at a recent construction along those lines due to Zhang et al.’s unbounded FHE scheme, and show that it is no exception. We show that it is susceptible to an efficient full key recovery attack, and moreover that ciphertexts can be decrypted faster with the public parameters alone than the time it takes to generate the public key.

Read PDF

Similar papers

Book Open access Nov 2026

Beyond Approximate Arithmetic: Efficient Homomorphic Computation with Discrete CKKS

Fully homomorphic encryption (FHE) allows computations to be performed directly on encrypted sensitive data without decrypting it. Modern FHE schemes expose different computational models. CKKS distinguishes itself by supporting approximate arithmetic on packed complex values. Despite its high throughput, the absence o...

Elias Suvanto · 0 citations
Book Open access Nov 2026

FHEMIST: A Maximum Independent Set Technique for Efficient Bootstrapping Reductions in FHE Evaluations

Fully Homomorphic Encryption (FHE) enables arbitrary computation over encrypted data but suffers from noise growth, which eventually causes ciphertexts to be undecryptable after a few computations. Bootstrapping mitigates this issue but incurs significant computational overhead. Torus-FHE (TFHE) scheme [JoC 2019] achie...

Animesh Singh, Ayantika Chatterjee, Anupam Chattopadhyay et al. · 0 citations
Review Open access Sep 2026

A survey on fully homomorphic encryption compilers

This paper systematically reviews existing FHE compilers, examining their techniques and effectiveness to explore the current state of the art and identify areas for future research.

Zhuo-Yu Tian, Sheng-Yu Fan, Xiang-Long Deng et al. · 0 citations

Coral: General and Efficient Framework for Homomorphic Evaluation of Symmetric Ciphers

This work presents C ORAL, a general and efficient transciphering framework built on TFHE that decomposes an entire decryption circuit to a uniform evaluation strategy and provides optimized procedures for four recurring computational modules: linear Boolean operations, sparse low-degree Boolean functions, modular addi...

Ji-Kang Bai, Rui-Da Wang, Xian-Hui Lu et al. · 0 citations
Preprint Oct 2026

Fully Homomorphic Encryption for Statistical Modeling

Fully homomorphic encryption allows arithmetic to be carried out on encrypted values, so that a party performing a computation need not see the data it operates on. This is useful wherever collaborating parties or sites cannot share data records or computed summaries yet need to do a joint analysis. We demonstrate the...

B. Narasimhan · 0 citations
Review Open access 2026

Fully Homomorphic Encryption and Artificial Intelligence: A Review of Architectures, Optimizations, and Distributed Privacy

Fully homomorphic encryption (FHE) enables arbitrary mathematical evaluation directly over encrypted ciphertexts without intermediate decryption, establishing a foundational cryptographic primitive for cloud computation and secure machine learning. However, practical real-world adoption has historically been constraine...

Nisarg Shukla, M. Pandya, Snehal Samanth · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.