Nov 2026· Proceedings of the 2026 ACM SIGSAC Conference on Computer and Communications Security· pp. 7315-7317· 0 citations· 7 references
Abstract
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 of a homomorphic error-reduction mechanism long confined it to applications that tolerate approximation, such as privacy-preserving machine learning. This PhD research tackles this issue and extends CKKS to support efficient computation over discrete data while satisfying the correctness conditions required for security. We first show that, in the IND-CPAD security model, failure probabilities above 2-λ can invalidate λ-bit security, even for exact FHE schemes. We address the correctness challenge of discrete CKKS through three complementary approaches: (1) Functional Bootstrapping allows arbitrarily deep computations on packed small integers and achieves over two orders of magnitude higher throughput for lookup-table evaluation on 8-bit integers than the reported TFHE-rs baseline. (2) Digit Decomposition cuts modulus consumption for high-precision integer cleaning, also improving the throughput of high-precision approximate bootstrapping. (3) Character-Block Encodings provide lower error growth and constant-depth cleaning but consume more slots per integer. Building on functional bootstrapping, we also provide an extension of discrete CKKS to arithmetic over finite extension fields of small characteristic and large extension degree. This research project explores the regimes in which approximate arithmetic enables efficient homomorphic computation over discrete data.
An important challenge in homomorphic encryption (HE) is ensuring the integrity of the encrypted computations. Although verifiable computation can address this in theory, making it practical is far from trivial. [Cascudo et al. CRYPTO 2025] recently proposed a solution to this problem for the CKKS scheme. In particular...
Ignacio Cascudo, Anamaria Costache, Daniele Cozzo et al.· 0 citations
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.· Proceedings of the 2026 ACM...· 0 citations
Homomorphic encryption allows computation on encrypted data, making it a promising technology for privacy-preserving machine learning. However, currently available fully homomorphic schemes, such as CKKS, only support addition and multiplication by default. Modern applications, such as neural networks, require more com...
Simon Engel, Lukas Horn, Thomas Prantl et al.· Discover Artificial Intellig...· 1 citation
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...
In recent years, the Cheon–Kim–Kim–Song (CKKS) scheme has gained widespread popularity among practitioners due to its support for approximate arithmetic on encrypted data. However, the decrypted outputs of CKKS inherently contain approximation errors arising from homomorphic operations. If the error term in the ciphert...
Yu Zhan, Zhen Zhao, Yan-Bo Wang et al.· Electronics· 0 citations
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· IEEE Access· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.