Results 1 to 10 of about 1,099 (113)

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).
Bertels, Jonas, Van Beirendonck, Michiel, Turan, Furkan, Verbauwhede, Ingrid   +3 more
openaire   +3 more sources

GPU Acceleration for FHEW/TFHE Bootstrapping

Transactions on Cryptographic Hardware and Embedded Systems
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, Feng-Hao Liu, Yu-Te Ku, Ming-Chien Ho, Chih-Fan Hsu, Ming-Ching Chang, Shih-Hao Hung, Wei-Chao Chen   +7 more
doaj   +2 more sources

VeloFHE: GPU Acceleration for FHEW and TFHE Bootstrapping

Transactions on Cryptographic Hardware and Embedded Systems
Bit-wise Fully Homomorphic Encryption schemes like FHEW and TFHE offer efficient functional bootstrapping, enabling concurrent function evaluation and noise reduction.
Shiyu Shen, Hao Yang, Zhe Liu, Ying Liu, Xianhui Lu, Wangchen Dai, Lu Zhou, Yunlei Zhao, Ray C. C. Cheung   +8 more
doaj   +2 more sources

Improved Circuit Synthesis with Multi-Value Bootstrapping for FHEW-like Schemes

Transactions on Cryptographic Hardware and Embedded Systems
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, Kamil Kluczniak, Tim Güneysu   +2 more
doaj   +2 more sources

FHEW with Efficient Multibit Bootstrapping [PDF]

, 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, Luis Ruiz
openaire   +5 more sources

Fast and Accurate: Efficient Full-Domain Functional Bootstrap and Digit Decomposition for Homomorphic Computation

Transactions on Cryptographic Hardware and Embedded Systems, 2023
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, Tairong Huang, Anyu Wang, Qixian Zhou, Xiaoyun Wang   +4 more
doaj   +1 more source

Revisiting the functional bootstrap in TFHE

Transactions on Cryptographic Hardware and Embedded Systems, 2021
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, Edson Borin, Diego F. Aranha   +2 more
doaj   +1 more source

Faster Bootstrapping via Modulus Raising and Composite NTT

Transactions on Cryptographic Hardware and Embedded Systems, 2023
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, Ying Liu, Xianhui Lu, Ruida Wang, Benqiang Wei, Chunling Chen, Kunpeng Wang   +6 more
doaj   +1 more source

Biological reconstruction of the Late Neolithic Lengyel Culture [PDF]

, 2013
of PhD thesis submitted in 2013 to the Doctoral School of Biology, Eötvös Loránd University, Budapest under the supervision of Gyula Gyenis. Between 2006 and 2009 rescue excavations preceding the construction of M6 Motorway were carried out, in the ...
Köhler, Kitti
core   +8 more sources

Practical Homomorphic Encryption Over the Integers for Secure Computation in the Cloud [PDF]

, 2017
We present novel homomorphic encryption schemes for integer arithmetic, intended primarily for use in secure single-party computation in the cloud. These schemes are capable of securely computing arbitrary degree polynomials homomorphically. In practice,
Dyer, J, Dyer, M, Xu, J
core   +2 more sources