Results 141 to 150 of about 3,768 (173)
Some of the next articles are maybe not open access.
Useable Fully Homomorphic Encryption
2023Fully Homomorphic Encryption (FHE) enables arbitrary computations to be performed over encrypted data, eliminating the need to decrypt the data and expose it to potential risk while in use. FHE promises to significantly broaden the range of applications that can be secured with End-to-End encryption.
openaire +1 more source
Fully Homomorphic Encryption: Computations with a Blindfold
IEEE Security & Privacy, 2016To leverage the power of cloud computing, you can no longer encrypt data the traditional way. However, anyone (including the cloud service itself) can easily read unencrypted data. Fully homomorphic encryption reconciles this dilemma.
Marc Beunardeau +3 more
openaire +1 more source
2014
Homomorphic encryption is a very useful tool with a number of attractive applications. However, the applications are limited by the fact that only one operation is possible (usually addition or multiplication in the plaintext space) to be able to manipulate the plaintext by using only the ciphertext. What would really be useful is to be able to utilize
Xun Yi, Russell Paulet, Elisa Bertino
openaire +1 more source
Homomorphic encryption is a very useful tool with a number of attractive applications. However, the applications are limited by the fact that only one operation is possible (usually addition or multiplication in the plaintext space) to be able to manipulate the plaintext by using only the ciphertext. What would really be useful is to be able to utilize
Xun Yi, Russell Paulet, Elisa Bertino
openaire +1 more source
Exploring the Feasibility of Fully Homomorphic Encryption
IEEE Transactions on Computers, 2015In 2010, Gentry and Halevi presented the first FHE implementation. FHE allows the evaluation of arbitrary functions directly on encrypted data on untrusted servers. However, even for the small setting with 2048 dimensions, the authors reported a performance of 1.8 s for a single bit encryption and 32 s for recryption on a high-end server.
Wei Wang 0053 +4 more
openaire +1 more source
Fully homomorphic encryption: A case study
Journal of Intelligent & Fuzzy Systems, 2022Fully Homomorphic Encryption (FHE) is the holy grail of encrypted communications. It opens the door to several advanced functionalities to overcome the security and trust issues of the IT world. After 2009, once Craig Gentry had shown that FHE could be achieved, a study in this field boomed, and significant improvement was made in identifying more ...
openaire +1 more source
An Optimal Fully Homomorphic Encryption Scheme
2017 IEEE 3rd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing, (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS), 2017The expeditious expansion of the networking technologies have remarkably driven the usage of the distributedcomputing as well as services, such as task offloading to the cloud. However, security and privacy concerns are restricting the implementations of cloud computing because of the threats from both outsiders and insiders. The primary alternative of
Keke Gai, Meikang Qiu
openaire +1 more source
Fully Homomorphic Encryption with Auxiliary Inputs
2015In this paper, we propose the first (leveled) fully homomorphic encryption (FHE) that remains secure even when the attacker is equipped with auxiliary inputs – any computationally hard-to-invert function of the secret key. It is more general than the tolerance of Berkoff and Liu’s leakage resilient fully homomorphic encryption, in which the leakage is ...
Fuqun Wang, Kunpeng Wang 0001
openaire +1 more source
Breaking Fully-Homomorphic-Encryption Challenges
2011Following Gentry's breakthrough work [7], there is currently great interest on fully-homomorphic encryption (FHE), which allows to compute arbitrary functions on encrypted data. Though the area has seen much progress recently (such as [10,11,5,2,1,8,6]), it is still unknown if fully-homomorphic encryption will ever become truly practical one day, or if
openaire +1 more source
Fully Homomorphic Encryption for Point Numbers
2017Based on the FV scheme, we construct at first fully homomorphic encryption scheme \(\mathsf {FX}\) that can homomorphically compute addition and multiplication of encrypted fixed point numbers without knowing the secret key. Then, we show that in the \(\mathsf {FX}\) scheme one can efficiently and homomorphically compare magnitude of two encrypted ...
Seiko Arita, Shota Nakasato
openaire +2 more sources
On the Plausibility of Fully Homomorphic Encryption for RAMs
2019We initiate the study of fully homomorphic encryption for RAMs (RAM-FHE). This is a public-key encryption scheme where, given an encryption of a large database D, anybody can efficiently compute an encryption of P(D) for an arbitrary RAM program P. The running time over the encrypted data should be as close as possible to the worst case running time of
Ariel Hamlin +3 more
openaire +2 more sources