Skip to content

How to Watermark the RLWE Homomorphic Ciphertexts

2026 · arXiv.org · Vol abs/2607.25222 · 0 citations · 47 references
Computer Science

TL;DR

A watermarking technique is proposed for RLWE-based HE ciphertexts using the roots of a linear equation and is resilient to both homomorphic additive and multiplicative operations, while supporting zero-bit watermarking.

View source

Similar papers

Open access Aug 2026

EHEIR: Efficient Homomorphic Encrypted Inference via Architectural Redesign

This work presents a framework that reformulates HE-aware model design as a constrained neural architecture search problem, where the objective is to identify architectures that are both cryptographically feasible and computationally efficient while preserving task performance.

Reeshav Chowdhury, Anoop Mishra, Deepak Khazanchi et al. · 0 citations
Preprint Aug 2026

On the Sensitivity to Errors in Homomorphic Computing: Single Transient Bit-flip Client-side Error Characterization

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
Open access Sep 2026

Cryptanalysis of an Unbounded Fully Homomorphic Encryption Scheme †

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 mu...

Mehdi Tibouchi, Hyewon Sung · 0 citations
Preprint Sep 2026

Memory-Efficient Designs for Word-Wise Universal Fully Homomorphic Encryption

Fully Homomorphic Encryption (FHE) enables computation on encrypted data, preserving privacy throughout analysis. While its privacy is very strong, FHE is much slower to execute than the original computation. In particular, due to the recent success in accelerating its compute, the performance bottleneck shifts to the...

A. W. B. Yudha, Erwin Eko Wahyudi, R. Rajagede et al. · 0 citations
Open access Aug 2026

Two-limb CRT Ring-LWE encryption with exact decryption and public re-randomization

Anonymity infrastructures such as mix networks, anonymous storage, and privacy-preserving replication rely on public re-randomization: any party holding only public information can transform a ciphertext into a fresh-looking encryption of the same plaintext, hiding the linkage between the two. Classical ElGamal-based s...

D. Vodenicarevic, Andrei Fleiser, Pierre Seznec et al. · 1 citation
Review Open access Sep 2026

A survey on fully homomorphic encryption compilers

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. · 0 citations

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