Homomorphic Evaluation of Neural Networks Using Functional Bootstrapping with CKKS

In this work, the newly developed functional bootstrapping (FBT) for the Cheon–Kim–Kim–Song (CKKS) scheme is used for the first time to homomorphically evaluate an encrypted neural network. The advantage of FBT over previous approaches for the homomorphic evaluation of non-linear activation functions is that it combines bootstrapping and homomorphic function evaluation. For this purpose, FBT for CKKS is extended to be applied to real input values by evaluating the first order Hermite interpolation function not only on its interpolation points but on the entire domain [0,1]. For the sigmoid function, to respect the internal representation of negative values in CKKS and the convergence behaviour of trigonometric interpolation, a glueing of shifted and reflected sigmoid functions that is periodic and continuous is used as an input function for FBT. The experimental results yield an accuracy of 97.33% with a relative loss of 0% compared to the Hermite plaintext counterpart that were obtained with a fully connected neural network with 100 hidden neurons on the MNIST test set at a security level of 128 bits. The current implementation required approximately 1.66 s per image (amortised time) and about 201 GB RAM.

Authors

Institutions

Publication Details

Journal
Future Internet
Published
2026-05-28
DOI
https://doi.org/10.3390/fi18060294
Primary Topic
Chaos-based Image/Signal Encryption
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Homomorphic Evaluation of Neural Networks Using Functional Bootstrapping with CKKS

Yogachandran Rahulamathavan, Mona Scheerer
Future Internet
Chaos-based Image/Signal Encryption
article

Homomorphic Evaluation of Neural Networks Using Functional Bootstrapping with CKKS

Yogachandran Rahulamathavan, Mona Scheerer
article en

Abstract

In this work, the newly developed functional bootstrapping (FBT) for the Cheon–Kim–Kim–Song (CKKS) scheme is used for the first time to homomorphically evaluate an encrypted neural network. The advantage of FBT over previous approaches for the homomorphic evaluation of non-linear activation functions is that it combines bootstrapping and homomorphic function evaluation. For this purpose, FBT for CKKS is extended to be applied to real input values by evaluating the first order Hermite interpolation function not only on its interpolation points but on the entire domain [0,1]. For the sigmoid function, to respect the internal representation of negative values in CKKS and the convergence behaviour of trigonometric interpolation, a glueing of shifted and reflected sigmoid functions that is periodic and continuous is used as an input function for FBT. The experimental results yield an accuracy of 97.33% with a relative loss of 0% compared to the Hermite plaintext counterpart that were obtained with a fully connected neural network with 100 hidden neurons on the MNIST test set at a security level of 128 bits. The current implementation required approximately 1.66 s per image (amortised time) and about 201 GB RAM.

Future InternetVol. 18(6)
Loughborough University (GB), Heidelberg University (DE), Heidelberg Engineering (Germany) (DE), Heidelberg University (US)
Openalex Percentile: Top 4%
Chaos-based Image/Signal Encryption
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.