Results 131 to 140 of about 5,085 (174)

Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-Based GSW-FHE

Lecture Notes in Computer Science, 2021
Fully homomorphic encryption (FHE) allows us to perform computations directly over encrypted data and can be widely used in some highly regulated industries. Gentry’s bootstrapping procedure is used to refresh noisy ciphertexts and is the only way to achieve the goal of FHE up to now.
Anyu Wang, Wang Anyu
exaly   +3 more sources

A Survey on FHE Acceleration

2023 IEEE 16th Dallas Circuits and Systems Conference (DCAS), 2023
Banafsheh Saber Latibari, Kevin Immanuel Gubbi, Houman Homayoun   +2 more
exaly   +2 more sources

Improving the Efficiency of SVM Classification With FHE

IEEE Transactions on Information Forensics and Security, 2020
In an ever more data-centric economy, machine learning models have risen in importance. With the large amounts of data companies collect, they are able to develop highly accurate models to predict the behaviours of their customers. It is thus important to safeguard the data used to build these models to prevent competitors from mimicking their services.
Jean-Claude Bajard, Paulo Martins 0002, Leonel Sousa, Vincent Zucca   +3 more
openaire   +1 more source

Compressible FHE with Applications to PIR

2019
Homomorphic encryption (HE) is often viewed as impractical, both in communication and computation. Here we provide an additively homomorphic encryption scheme based on (ring) LWE with nearly optimal rate (\(1-\epsilon \) for any \(\epsilon >0\)). Moreover, we describe how to compress many Gentry-Sahai-Waters (GSW) ciphertexts (e.g., ciphertexts that ...
Craig Gentry, Shai Halevi
openaire   +2 more sources

Occurrence download FHE

2023
ALA occurrence record ...
openaire   +1 more source

An Efficient Leveled Identity-Based FHE

2015
Gentry, Sahai and Waters constructed the first identity-based fully homomorphic encryption schemes from identity-based encryption schemes in CRYPTO 2013. In this work, we focus on improving their IBFHE schemes, using Micciancio and Peikert’s novel and powerful trapdoor in conjunction with Alperin-Sheriff and Peikert’s simple and tight noise analysis ...
Fuqun Wang, Kunpeng Wang 0001, Bao Li 0001   +2 more
openaire   +1 more source

Faster Bootstrapping of FHE over the Integers

2020
In FHE over the integers, decryption function is simplified by sparse subset subset sum problem (SSSP) assumption, which is introduced by Dijk et al. (Eurocrypt 2010), so that bootstrapping can be achieved successfully. Later, Nuida and Kurowasa (Eurocrypt 2015) proposed an advanced method of which the degree is very low and the message space is non ...
Jung Hee Cheon, Kyoohyung Han, Duhyeong Kim   +2 more
openaire   +2 more sources

Doing Real Work with FHE

Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography - WAHC '18, 2018
We describe our recent experience, building a system that uses fully-homomorphic encryption (FHE) to approximate the coefficients of a logistic-regression model, built from genomic data. The aim of this project was to examine the feasibility of a solution that operates "deep within the bootstrapping regime,'' solving a problem that appears too hard to ...
Jack L. H. Crawford, Craig Gentry, Shai Halevi, Daniel Platt, Victor Shoup   +4 more
openaire   +2 more sources