Results 21 to 30 of about 390 (116)
Accelerating FHEW-like Bootstrapping via New Configurations of the Underlying Cryptosystems. [PDF]
This work introduces a new configuration of the GSW fully homomorphic encryption (FHE) (Gentry, Sahai, Waters~Crypto 2013), with a squared gadget ,batching and scale-based homomorphic operation.
Han Wang 0030 +4 more
openaire +2 more sources
Extend FHEW to General Case. [PDF]
When talking about FHE, refresh process is a little different from bootstrapping process. Bootstrapping always means that a scheme homomorphic decrypting its process, while refresh imply that use another scheme, always in large scale, to perform its ...
Tanping Zhou +3 more
openaire +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
New Strategies for Bootstrapping Large-Error Ciphertext in Large-Precision FHEW/TFHE Cryptosystem. [PDF]
Bootstrapping is the core task in fully homomorphic encryption. It is designed to self-clean encrypted data to support unlimited level of homomorphic computing. FHEW/TFHE cryptosystem provides the fastest bootstrapping machinery in addition to the unique
Hongbo Li, Dengfa Liu, Guangsheng Ma
core +3 more sources
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
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 +1 more source
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 +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
SecureBP from Homomorphic Encryption
We present a secure backpropagation neural network training model (SecureBP), which allows a neural network to be trained while retaining the confidentiality of the training data, based on the homomorphic encryption scheme. We make two contributions.
Qinju Liu +6 more
wiley +1 more source
Homomorphic encryption (HE) is considered as one of the most powerful solutions to securely protect clients’ data from malicious users and even severs in the cloud computing. However, though it is known that HE can protect the data in theory, it has not been well utilized because many operations of HE are too slow, especially multiplication.
Baek Kyung Song +4 more
wiley +1 more source

