Results 11 to 20 of about 318 (123)

A Fast Heuristic for Mapping Boolean Circuits to Functional Bootstrapping [PDF]

Transactions on Cryptographic Hardware and Embedded Systems
Functional bootstrapping in FHE schemes such as FHEW and TFHE allows the evaluation of arbitrary functions on encrypted data, while simultaneously reducing noise.
Sergiu Carpov
doaj   +4 more sources

Faster amortized bootstrapping using the incomplete NTT for free [PDF]

Transactions on Cryptographic Hardware and Embedded Systems
Amortized bootstrapping techniques have been proposed for FHEW/TFHE to efficiently refresh multiple ciphertexts simultaneously within a polynomial modulus.
Thales B. Paiva, Gabrielle De Micheli, Syed Mahbub Hafiz, Marcos A. Simplicio Jr., Bahattin Yildiz   +4 more
doaj   +4 more sources

Sharing the Mask: TFHE Bootstrapping on Packed Messages [PDF]

Transactions on Cryptographic Hardware and Embedded Systems
Fully Homomorphic Encryption (FHE) schemes typically experience significant data expansion during encryption, leading to increased computational costs and memory demands during homomorphic evaluations compared to their plaintext counterparts.
Loris Bergerat, Charlotte Bonte, Benjamin R. Curtis, Jean-Baptiste Orfila, Pascal Paillier, Samuel Tap   +5 more
doaj   +2 more sources

Circuit Privacy for FHEW/TFHE-Style Fully Homomorphic Encryption in Practice [PDF]

IACR Communications in Cryptology
A fully homomorphic encryption (FHE) scheme allows a client to encrypt and delegate its data to a server that performs computation on the encrypted data that the client can then decrypt. While FHE gives confidentiality to clients' data, it does not protect the server's input and computation.
Kamil Kluczniak
core   +5 more sources

SecureBP from Homomorphic Encryption

Security and Communication Networks, Volume 2020, Issue 1, 2020., 2020
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, Xianhui Lu, Fucai Luo, Shuai Zhou, Jingnan He, Kunpeng Wang, Stelvio Cimato   +6 more
wiley   +1 more source

A Bitwise Design and Implementation for Privacy‐Preserving Data Mining: From Atomic Operations to Advanced Algorithms

Security and Communication Networks, Volume 2019, Issue 1, 2019., 2019
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, Joon Soo Yoo, Miyeon Hong, Ji Won Yoon, Stelvio Cimato   +4 more
wiley   +1 more source

Analysis on Matrix GSW‐FHE and Optimizing Bootstrapping

Security and Communication Networks, Volume 2018, Issue 1, 2018., 2018
With the rapid development of multimedia technologies, the multimedia data storage and outsource computation are delegated to the untrusted cloud, which has led to a series of challenging security and privacy threats. Fully homomorphic encryption can be used to protect the privacy of cloud data and solve the trust problem of third party. In this paper,
Xiufeng Zhao, Hefeng Mao, Shuai Liu, Weitao Song, Bo Zhang, Zhaoqing Pan   +5 more
wiley   +1 more source

A Practical Full Key Recovery Attack on TFHE and FHEW by Inducing Decryption Errors [PDF]

, 2023
Fully Homomorphic Encryption (FHE) promises to secure our data on the untrusted cloud, while allowing arbitrary computations. Recent research has shown two side channel attacks on the client side running a popular HE library.
Ayantika Chatterjee, Bhuvnesh Chaturvedi, Debdeep Mukhopadhyay, Anirban Chakraborty   +3 more
core  

Homomorphic Field Trace Revisited : Breaking the Cubic Noise Barrier

Transactions on Cryptographic Hardware and Embedded Systems
We present a novel homomorphic trace evaluation algorithm RevHomTrace, which mitigates the phase amplification problem that comes with the definition of the field trace.
Kang Hoon Lee, Ji Won Yoon
doaj   +1 more source

Multikey Fully Homomorphic Encryption: Removing Noise Flooding in Distributed Decryption via the Smudging Lemma on Discrete Gaussian Distribution

IET Information Security, Volume 2025, Issue 1, 2025.
The current multikey fully homomorphic encryption (MKFHE) needs to add exponential noise in the distributed decryption phase to ensure the simulatability of partial decryption. Such a large noise causes the ciphertext modulus of the scheme to increase exponentially compared to the single‐key fully homomorphic encryption (FHE), further reducing the ...
Xiaokang Dai, Wenyuan Wu, Yong Feng, Xueqin Liang   +3 more
wiley   +1 more source