Results 1 to 10 of about 2,104 (177)
FRAST: TFHE-Friendly Cipher Based on Random S-Boxes [PDF]
A transciphering framework, also known as hybrid homomorphic encryption, is a practical method of combining a homomorphic encryption (HE) scheme with a symmetric cipher in the client-server model to reduce computational and communication overload on the
Mingyu Cho +5 more
doaj +4 more sources
Improved homomorphic evaluation for hash function based on TFHE
Homomorphic evaluation of hash functions offers a solution to the challenge of data integrity authentication in the context of homomorphic encryption. The earliest attempt to achieve homomorphic evaluation of SHA-256 hash function was proposed by Mella ...
Benqiang Wei, Xianhui Lu
doaj +3 more sources
YATA: Yet Another TFHE Accelerator with Key Compression and Radix-8 NTT
This paper introduces a silicon-proven ASIC accelerator, YATA, specifically designed for TFHE’s most demanding operation, the BlindRotate. The architecture tackles the main bottleneck in TFHE—massive memory bandwidth—by applying Key Compression to ...
Kotaro Matsuoka, Takashi Sato
doaj +1 more source
Faster Homomorphic Integer Computer
We design a fully homomorphic encryption for moduli of the form bk with small b. Our construction asymptotically improves upon Kim [TCHES’25]: for fixed b, the multiplication latency decreases from O(k log k) to O(log k) while preserving amortized ...
Jaehyung Kim
doaj +1 more source
Privacy-Preserving Feature Selection with Fully Homomorphic Encryption
For the feature selection problem, we propose an efficient privacy-preserving algorithm. Let D, F, and C be data, feature, and class sets, respectively, where the feature value x(Fi) and the class label x(C) are given for each x∈D and Fi∈F. For a triple (
Shinji Ono +5 more
doaj +1 more source
FINAL bootstrap acceleration on FPGA using DSP-free constant-multiplier NTTs
This work showcases Quatorze-bis, a state-of-the-art Number Theoretic Transform circuit for TFHE-like cryptosystems on FPGAs. It contains a novel modular multiplication design for modular multiplication with a constant for a constant modulus.
Jonas Bertels +2 more
doaj +1 more source
Multiplicative Integer Division over Integer-wise TFHE
This paper proposes homomorphic multiplicative division algorithms over integer-wise TFHE. These algorithms compute an approximate reciprocal of the divisor and use it to evaluate division, based on Rodeheffer’s integer Newton- Raphson (NR) algorithm ...
Kotaro Matsuoka +2 more
doaj +1 more source
Decomposition of Large Look-Up Tables for Fast Homomorphic Evaluation
TFHE is one of the most promising scheme in the literature for an adoption of Fully Homomorphic Encryption (FHE) in practice. The core reason of its good performances is the powerful Programmable Bootstrapping (PBS) operation, that enables to ...
Sonia Belaïd +2 more
doaj +1 more source
Multi-Key Homomorphic Encryption Scheme with Multi-Output Programmable Bootstrapping
Multi-key Homomorphic Encryption (MKHE) scheme can homomorphically evaluate ciphertexts encrypted by different keys, which can effectively protect the privacy information of data holders in the joint computing of cloud services.
Lingwu Li, Ruwei Huang
doaj +1 more source
The functional bootstrap in FHEW/TFHE allows for fast table lookups on ciphertexts and is a powerful tool for privacy-preserving computations. However, the functional bootstrap suffers from two limitations: the negacyclic constraint of the lookup table (
Shihe Ma +4 more
doaj +1 more source

