CORTEXA
← Browse
semantic_scholarProceedings on Privacy Enhancing Technologies

Training TFHE-Based Neural Networks with Approximated Floating-Point Arithmetic

Emanuel Nicoletti, Fabrizio Pittorino, Alessandro Falcetta, Luca Colombo, Manuel Roveri

TL;DR: This work presents a framework that enables approximate floating-point training within TFHE by reinterpreting IEEE 754 representations as encrypted integers and operating on them with redesigned arithmetic, and performs the first fully encrypted training of a small-scale CNN under TFHE.

Training neural networks under Torus Fully Homomorphic Encryption (TFHE) is severely constrained by the native restriction of the scheme to boolean and integer arithmetic, forcing prior work to rely on quantized integer pipelines limited to shallow MLPs. We present a framework that enables approximate floating-point training within TFHE by reinterpreting IEEE 754 representations as encrypted integers and operating on them with redesigned arithmetic. Our core contribution adapts L-mul, an approximate integer-based multiplication, to the encrypted setting, introducing numerical safeguards that prevent catastrophic wrap-around errors near zero and in subnormal ranges. We extend this approach to approximate division and implement exact addition and square root, yielding a sufficient arithmetic for backpropagation with SGD. For CPU-based FP32 encrypted operations, our approach achieves up to 2.1x faster multiplication and 29.3x faster division compared to state-of-the-art exact TFHE floating-point arithmetic, alongside up to 57x lower peak memory. Using these primitives, we perform, to our knowledge, the first fully encrypted training of a small-scale CNN under TFHE. To bypass the prohibitive overhead of training deep networks in this encrypted environment, we utilize plain-text emulation. We ensure strict output alignment by verifying that the network parameters generated during emulation are identical to those produced by the encrypted execution. Leveraging this equivalence, we use emulation to evaluate convergence on larger architectures (LeNet-5, VGG-style CNNs, and ResNet-20) across six benchmarks from MNIST variants to CIFAR-10 and medical imaging, matching exact-arithmetic baselines within 1% accuracy. Fully encrypted training of these deeper models remains beyond current hardware; we provide wall-clock projections quantifying this gap.

Related papers

semantic_scholarProceedings on Privacy Enhancing Technologies

FHEON: A Configurable Framework for Developing Privacy-Preserving Encrypted Neural Networks

Nges Brian Njungle, Eric Jahns, Michel A. Kinsy

TL;DR: FHEON is presented, an open-source configurable framework for developing privacy-preserving neural network models for inference using the CKKS scheme of HE, and outperform all state-of-the-art HE inference works in both latency and memory utilization.

The widespread adoption of Machine Learning as a Service raises critical privacy and security concerns, particularly about data confidentiality and trust in both cloud providers and the machine learning models provided. Homomorphic Encryption (HE) has emerged as a promising solut…

semantic_scholarProceedings on Privacy Enhancing Technologies

SoK: Verifiable Integrity Claims for Privacy-Preserving Federated Learning

Andrea Rizzini, Marco Esposito, Tommaso Gagliardoni, F. Bruschi

TL;DR: This SoK model federated learning as an append-only transcript of submissions, admissions, aggregation, and finalization events, and formalize verifiability as a collection of integrity claims issued by clients and the aggregator, and checked by different verifier classes.

Federated Learning (FL) is an advancement in Machine Learning motivated by the need to preserve the privacy of the data used to train models. While it effectively addresses this issue, the multi-participant paradigm on which it is based introduces several challenges. Among these…