Results 1 to 10 of about 318 (123)
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, Wangchen Dai, Yunlei Zhao
exaly +6 more sources
FHEW with Efficient Multibit Bootstrapping [PDF]
In this paper, we describe a generalization of the fully homomorphic encryption scheme FHEW described by Ducas and Micciancioi¾?[8]. It is characterized by an efficient bootstrapping procedure performed after each gate, as opposed to the HElib of Halevi and Shoup that handles batches of encryptions periodically.
Jean-François Biasse
exaly +10 more sources
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
Improved Circuit Synthesis with Multi-Value Bootstrapping for FHEW-like Schemes [PDF]
In recent years, the research community has made great progress in improving techniques for privacy-preserving computation, such as fully homomorphic encryption (FHE).
Johannes Mono +2 more
doaj +4 more sources
Faster Bootstrapping via Modulus Raising and Composite NTT
FHEW-like schemes utilize exact gadget decomposition to reduce error growth and ensure that the bootstrapping incurs only polynomial error growth. However, the exact gadget decomposition method requires higher computation complexity and larger memory ...
Zhihao Li +6 more
doaj +2 more sources
Revisiting the functional bootstrap in TFHE
The FHEW cryptosystem introduced the idea that an arbitrary function can be evaluated within the bootstrap procedure as a table lookup. The faster bootstraps of TFHE strengthened this approach, which was later named Functional Bootstrap (Boura et al ...
Antonio Guimarães +2 more
doaj +3 more sources
Optimizing Encrypted Neural Networks: Model Design, Quantization and Fine-Tuning Using FHEW/TFHE
Third-generation Fully Homomorphic Encryption (FHE), particularly the FHEW/TFHE schemes, is recognized for its balanced security requirements, small parameters, and low memory usage, though the current methods in the scenarios of Deep Neural Network (DNN) inference still have high computational costs, limiting the practical applicability.
Ming-Ching Chang +2 more
exaly +2 more sources
Homomorphic encryption (HE) is notable for enabling computation on encrypted data as well as guaranteeing high‐level security based on the hardness of the lattice problem. In this sense, the advantage of HE has facilitated research that can perform data analysis in an encrypted state as a purpose of achieving security and privacy for both clients and ...
Joon Soo Yoo, Ji Won Yoon, Junggab Son
wiley +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
To help smartphone users protect their phone, fingerprint‐based authentication systems (e.g., Apple’s Touch ID) have increasingly become popular in smartphones. In web applications, however, fingerprint‐based authentication is still rarely used. One of the most serious concerns is the lack of technology for securely storing fingerprint data used for ...
Taeyun Kim +3 more
wiley +1 more source

