Results 191 to 200 of about 18,513 (227)

LWE-Based FHE with Better Parameters

2015
Fully homomorphic encryption allows a remote server to perform computable functions over the encrypted data without decrypting them first. We propose a public-key fully homomorphic encryption with better parameters from the learning with errors problem.
Fuqun Wang, Kunpeng Wang 0001, Bao Li 0001   +2 more
openaire   +2 more sources

FHE-CGRA: Enable Efficient Acceleration of Fully Homomorphic Encryption on CGRAs

Design Automation Conference
Fully Homomorphic Encryption (FHE) is an attractive privacy-preserving technique that allows computation directly on encrypted data without decryption. However, it incurs significant performance and memory costs due to intensive computations.
Miaomiao Jiang, Yilan Zhu, Honghui You, Cheng Tan, Zhaoying Li, Ji-Ming Xu, Lei Ju   +6 more
semanticscholar   +1 more source

Comparison of FHE Schemes and Libraries for Efficient Cryptographic Processing

International Conference on Computing, Networking and Communications
In recent years, opportunities to collect and analyze big data in the cloud have increased. Cryptographic processing is imperative for protecting data on cloud servers, and homomorphic encryption, which can perform calculations in an encrypted state, is ...
Arisa Tsuji, Masato Oguchi
semanticscholar   +1 more source

Reusable Garbled Turing Machines Without FHE

2019
Since Yao introduced the garbled circuit concept in 1980s, it has been an open problem to design efficient reusable garbled Turing machines/circuits. Recently, Goldwasser et al. and Garg et al. answered this question affirmatively by designing reusable garbled circuits and reusable garbled Turing machines.
Yongge Wang 0001, Qutaibah M. Malluhi
openaire   +2 more sources

Multi-key FHE from LWE, Revisited

2016
Traditional fully homomorphic encryption FHE schemes only allow computation on data encrypted under a single key. Lopez-Alt, Tromer, and Vaikuntanathan STOC 2012 proposed the notion of multi-key FHE, which allows homomorphic computation on ciphertexts encrypted under different keys, and also gave a construction based on a somewhat nonstandard ...
Chris Peikert, Sina Shiehian
openaire   +3 more sources

Parameter Optimization and Larger Precision for (T)FHE

Journal of Cryptology, 2023
Loris Bergerat, Anas Boudi, Quentin Bourgerie, Ilaria Chillotti, D. Ligier, J. Orfila, Samuel Tap   +6 more
semanticscholar   +1 more source

Fast Blind Rotation for Bootstrapping FHEs

2023
Binwu Xiang, Jiang Zhang 0001, Yi Deng 0002, Yiran Dai, Dengguo Feng   +4 more
openaire   +2 more sources

The CKKS FHE Scheme

2023
Rashmi Agrawal, Ajay Joshi
openaire   +1 more source

Batch Bootstrapping II: - Bootstrapping in Polynomial Modulus only Requires Õ(1) FHE Multiplications in Amortization

International Conference on the Theory and Application of Cryptographic Techniques, 2023
Feng-Hao Liu, Han Wang
semanticscholar   +1 more source

I/O Performance Improvement of FHE Apriori with Striping File Layout Considering Storage of Intermediate Data

IEICE Transactions on Information and Systems, 2023
Saneyasu Yamaguchi
exaly