Results 91 to 100 of about 390 (116)

Hardware Acceleration of FHEW [PDF]

2023 26th International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS), 2023
sponsorship: This work was supported in part by CyberSecurity Research Flanders with reference number VR20192203, the Horizon 2020 ERC Advanced Grant (101020005 Belfort) and by Darpa DPRIVE (Contract No. HR0011-21-C-0034). Michiel Van Beirendonck is funded by FWO PhD fellow (1SD5621N).
Furkan Turan, Ingrid Verbauwhede, Michiel Van Beirendonck   +2 more
exaly   +6 more sources

FHEW with Efficient Multibit Bootstrapping [PDF]

Lecture Notes in Computer Science, 2015
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   +7 more sources

Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption [PDF]

Lecture Notes in Computer Science, 2023
There are two competing approaches to bootstrap the FHEW fully homomorphic encryption scheme (Ducas and Micciancio, Eurocrypt 2015) and its variants: the original AP/FHEW method, which supports arbitrary secret key distributions, and the improved GINX ...
Donghoon Yoo, Yongwoo Lee, Andrey Kim
exaly   +5 more sources

Overlapped Bootstrapping for FHEW/TFHE and Its Application to SHA3 [PDF]

Lecture Notes in Computer Science
Homomorphic Encryption (HE) enables operations on encrypted data without requiring decryption, thus allowing for secure handling of confidential data within smart contracts.
Yongwoo Lee
exaly   +5 more sources

Faster Amortized FHEW Bootstrapping Using Ring Automorphisms [PDF]

Lecture Notes in Computer Science
Amortized bootstrapping offers a way to simultaneously refresh many ciphertexts of a fully homomorphic encryption scheme, at a total cost comparable to that of refreshing a single ciphertext.
Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio   +2 more
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

Optimizing FHEW With Heterogeneous High-Performance Computing

IEEE Transactions on Industrial Informatics, 2020
The latest implementation of the fully homomorphic encryption algorithm (FHEW), FHEW-V2, takes about 0.12 s for a bootstrapping on a single-node computer. It seems much faster than the previous implementations. However, the 30-bit homomorphic addition requires 270 times of bootstrapping; plus those spent on key generation, the total elapsed time climbs
Xinya Lei, Ruixin Guo
exaly   +4 more sources

Bootstrapping in FHEW-like Cryptosystems

Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2021
FHEW and TFHE are fully homomorphic encryption (FHE) cryptosystems that can evaluate arbitrary Boolean circuits on encrypted data by bootstrapping after each gate evaluation. The FHEW cryptosystem was originally designed based on standard (Ring, circular secure) LWE assumptions, and its initial implementation was able to run bootstrapping in less than ...
Yuriy S Polyakov, Daniele Micciancio
exaly   +3 more sources

Batched Fully Dynamic Multi-key FHE from FHEW-Like Cryptosystems

Lecture Notes in Computer Science, 2022
Jianghong Wei, Jing Pan, Yuting Jiang
exaly   +3 more sources