Results 11 to 20 of about 1,675 (182)
GPU Acceleration for FHEW/TFHE Bootstrapping
Fully Homomorphic Encryption (FHE) allows computations to be performed directly on encrypted data without decryption. Despite its great theoretical potential, the computational overhead remains a major obstacle for practical applications.
Yu Xiao +7 more
doaj +4 more sources
Cryptanalysis of TFHE-Friendly Cipher FRAST [PDF]
FRAST is a TFHE-friendly stream cipher that was published at FSE 2025. The cipher is defined over Z16, and makes extensive use of negacyclic S-boxes over Z16 as they are less costly in TFHE.
Antoine Bak +5 more
doaj +5 more sources
VeloFHE: GPU Acceleration for FHEW and TFHE Bootstrapping
Bit-wise Fully Homomorphic Encryption schemes like FHEW and TFHE offer efficient functional bootstrapping, enabling concurrent function evaluation and noise reduction.
Shiyu Shen +8 more
doaj +4 more sources
Sharing the Mask: TFHE Bootstrapping on Packed Messages [PDF]
Fully Homomorphic Encryption (FHE) schemes typically experience significant data expansion during encryption, leading to increased computational costs and memory demands during homomorphic evaluations compared to their plaintext counterparts.
Loris Bergerat +5 more
doaj +6 more sources
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 +5 more sources
Trivial Transciphering With Trivium and TFHE [PDF]
sponsorship: The authors would like to thank Christian Rechberger and Samuel Tap for helpful conversations during the work on this paper. The work of the third author was supported by CyberSecurity Research Flanders with reference number VR20192203, by the FWO under an Odysseus project GOH9718N. (CyberSecurity Research Flanders|VR20192203, FWO under an
Thibault Balenbois +2 more
openaire +5 more sources
Error-Simulatable Sanitization for TFHE and Applications [PDF]
We show that the randomized TFHE bootstrapping technique of Bourse and Izabechène provides a form of sanitization which is error-simulatable. This means that the randomized bootstrap can be used not only for sanitization of ciphertexts (i.e. to hide the function that has been computed), but that it can also be used in server-assisted threshold ...
Nigel P. Smart, Michael Walter 0001
core +5 more sources
Hitchhiker's Guide to the TFHE Scheme
Abstract Also referred to as the holy grail of cryptography, Fully Homomorphic Encryption (FHE) allows for arbitrary calculations over encrypted data. First proposed as a challenge by Rivest et al.
Klemsa, Jakub
openaire +2 more sources
Faster TFHE Bootstrapping with Block Binary Keys [PDF]
Fully Homomorphic Encryption over the Torus (TFHE) is a homomorphic encryption scheme which supports efficient Boolean operations over encrypted bits.
Changmin Lee 0001 +3 more
core +4 more sources
Transistor: a TFHE-Friendly Stream Cipher [PDF]
Fully Homomorphic Encryption (FHE) allows computations on encrypted data without requiring decryption, ensuring data privacy during processing. However, FHE introduces a significant expansion of ciphertext sizes compared to plaintexts, which results in higher communication.
Baudrin, Jules +10 more
core +5 more sources

