Efficient Non-Interactive Discrete ReLU over CKKS Using Interpolation Look-Up Table
Entropy · 11.05.2026 · 28 (5) · 542
DOI: 10.3390/e28050542 ↗Kurz gefasst
Fachartikel in der Zeitschrift Entropy, online erschienen am 11.05.2026. Verfasst von Zhigang Chen und 2 weiteren Autor:innen. Beteiligte Einrichtung: College of Artificial Intelligence, Ningbo University of Finance and Economics, Ningbo 315175, China. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Zhejiang Provincial Natural Science Foundation, Ningbo Natural Science Foundation of China, Zhejiang Provincial Natural Science Foundation of China.
Abstract (Originalsprache)
Deploying neural networks on encrypted data requires efficient evaluation of nonlinear activations, especially the ReLU function, without decryption. While the CKKS homomorphic encryption scheme supports packed arithmetic over approximate numbers efficiently, its approximate semantics make direct nonlinear evaluation difficult, and polynomial surrogates often introduce approximation error and non-discrete outputs. In this work, we present a task-specific, non-interactive construction for discrete ReLU evaluation in CKKS by combining modulus-switch-based discretization with interpolation-driven lookup-table (LUT) evaluation. We instantiate this design in two complementary schemes. The first uses trigonometric Hermite interpolation and functional bootstrapping to compute a discrete sign indicator, which is then combined with the encrypted input through conditional multiplication to obtain the ReLU output; this variant is compact and suitable for lightweight settings. The second uses iterative most-significant-bit (MSB) bootstrapping to support larger plaintext moduli and higher-precision regimes through repeated digit extraction. A common enabler of both schemes is a discretization step that maps approximate CKKS plaintexts to a finite integer representation; exactness in our setting therefore refers to exact evaluation over this discretized representation, while the deviation from the original CKKS plaintext is governed by the discretization error analyzed in Lemma 1. Experiments on encrypted MNIST inference and the accompanying LUT/storage analysis indicate that the proposed schemes preserve competitive accuracy relative to polynomial-approximation baselines while maintaining manageable auxiliary storage under the reported parameter settings. These results suggest that interpolation-based discrete activation is a promising alternative to polynomial approximation for selected CKKS-based encrypted inference tasks.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- College of Artificial Intelligence, Ningbo University of Finance and Economics, Ningbo 315175, China.
- School of Big Data and Software Engineering, Zhejiang Wanli University, Ningbo 315100, China.
- Department of Computer Science, University of Surrey, Guildford GU2 7XH, UK.
Förderung
- Zhejiang Provincial Natural Science Foundation
- Ningbo Natural Science Foundation of China
- Zhejiang Provincial Natural Science Foundation of China
- Ningbo University of Finance & Economics
Zitieren
APA
Chen, Z., Song, X., & Chen, L. (2026). Efficient Non-Interactive Discrete ReLU over CKKS Using Interpolation Look-Up Table. Entropy, 28(5), 542. https://doi.org/10.3390/e28050542
Vancouver
Chen Z, Song X, Chen L. Efficient Non-Interactive Discrete ReLU over CKKS Using Interpolation Look-Up Table. Entropy. 2026;28(5):542. doi:10.3390/e28050542
BibTeX
@article{Chen2026,
author = {Chen, Zhigang and Song, Xinxia and Chen, Liqun},
title = {Efficient Non-Interactive Discrete ReLU over CKKS Using Interpolation Look-Up Table},
journal = {Entropy},
year = {2026},
volume = {28},
number = {5},
pages = {542},
doi = {10.3390/e28050542}
}
EUVIMED