It is shown that both the timing and the location of errors in the ciphertext components \(c_0\) and \(c_1\) have a significant impact on the correctness of the final FHE output.
Abstract
Homomorphic Encryption (HE) is a privacy-preserving encryption paradigm that enables computation directly on encrypted data without requiring decryption. In this paper, we study errors in fully homomorphic encryption (FHE) computations, with a particular focus on server-side homomorphic multiplication in the unoptimized CKKS (Cheon--Kim--Kim--Song) scheme. We show that both the timing and the location of errors in the ciphertext components \(c_0\) and \(c_1\) have a significant impact on the correctness of the final FHE output.
This work identifies homomorphic multiplication as the most error-sensitive operation in practical HE pipelines and characterize how faults propagate and amplify through it, exposing a critical robustness vulnerability and motivating the need for more resilient HE deployments.
Matías Mazzanti, Vattana Chan, Karthik Swaminathan et al.· 0 citations
Fully homomorphic encryption (FHE) enables inference on private data without revealing it to the server, but evaluating an entire input under FHE is expensive. We study \emph{selective homomorphic inference}, where only a sensitive region of interest (ROI) is encrypted, and computations independent of that region are p...
Ali Backour, J. Reyes, Jaime Punyed et al.· 0 citations
The results of the experiments show that the hardware-accelerated implementation of the FHE primitives speeds up the encrypted gradient descent algorithm significantly.
A. Baldeschi, G. Bruno, Mohammad G. Raeini et al.· 0 citations
Fully Homomorphic Encryption (FHE) enables computations on encrypted data without decryption, ensuring data privacy in cloud computing and preventing sensitive information leakage. In recent years, significant progress has been made in FHE research, resulting in the development of various FHE schemes and supporting lib...
Zhuo-Yu Tian, Sheng-Yu Fan, Xiang-Long Deng et al.· Cybersecurity· 0 citations
In this study, we present a structural redesign of public key polynomial h(X) in NTRUEncrypt cryptosystem. The proposed modification reconstructs h(X) using existing polynomial components to alter its algebraic structure while preserving the correctness of the encryption and decryption processes. Rather than relying on...
Muhamad Azlan Daud, H. Kamarulhaili, A. Mandangan et al.· International Journal of Mat...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
