Results 251 to 260 of about 39,520 (292)

Optimized Stream-Cipher-Based Transciphering by Means of Functional-Bootstrapping [PDF]

Lecture Notes in Computer Science, 2023
International audienceFully homomorphic encryption suffers from a large expansion in the size of encrypted data, which makes FHE impractical for low-bandwidth networks.
Aymen Boudguiga, Renaud Sirdey, Boudguiga Aymen   +2 more
exaly   +3 more sources

ComBo: A Novel Functional Bootstrapping Method for Efficient Evaluation of Nonlinear Functions in the Encrypted Domain

Lecture Notes in Computer Science, 2023
International audienceThe application of Fully Homomorphic Encryption (FHE) to privacy issues arising in inference or training of neural networks has been actively researched over the last few years.
Aymen Boudguiga, Renaud Sirdey, Boudguiga Aymen   +2 more
exaly   +2 more sources

General Functional Bootstrapping Using CKKS [PDF]

The Ducas-Micciancio (DM) and Chilotti-Gama-Georgieva-Izabachene (CGGI) cryptosystems provide a general privacy-preserving computation capability. These fully homomorphic encryption (FHE) cryptosystems can evaluate an arbitrary function expressed as a ...
Andreea Alexandru, Andrey Kim, Yuriy Polyakov   +2 more
openaire   +3 more sources

A bootstrapping residuals approach to determine the error in quantitative functional lung imaging [PDF]

Magnetic Resonance in Medicine
Purpose To implement and validate an algorithm to determine the statistical errors in self-gated non-contrast-enhanced functional lung imaging. Methods A bootstrapping residuals approach to determine the error in quantitative functional lung imaging
Andreas Max Weng, Simon Veldhoen, Herbert Köstler   +2 more
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Large-Plaintext Functional Bootstrapping in FHE with Small Bootstrapping Keys

Lecture Notes in Computer Science
Guangsheng Ma
exaly   +3 more sources

Bootstrap Learning of Heuristic Functions

Proceedings of the International Symposium on Combinatorial Search, 2010
search algorithms such as IDA* or heuristic-search planners. Our method aims to generate a strong heuristic from a given weak heuristic h0 through bootstrapping. The "easy" problem instances that can be solved using h0 provide training examples for a learning algorithm that produces a heuristic h1 that is expected to be stronger than h0.
Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte   +2 more
openaire   +2 more sources