Results 161 to 170 of about 1,818,451 (197)
Some of the next articles are maybe not open access.
A algorithm of fully homomorphic encryption
2012 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012Among so many cryptographies, homomorphice encryption has attracted widely attentions from scholars for its special performance. Common cryptography can't directly calculate on encrypted data, but homomorphic encryption can, meanwhile, the operation results of homomorphic encryption will be automatically encrypted.
Guangli Xiang, Benzhi Yu, Ping Zhu
openaire +2 more sources
A Flexible Fully Homomorphic Encryption
Wireless Personal Communications, 2016In view of research on fully homomorphic encryption scheme proposed by Zvika Brakerski in 2012, we find it is not much efficient, because it requests that $$q/B \ge (O(nlogq))^{L+O(1)}$$ , and can encrypt ...
Chunguang Ma, Juyan Li, Gang Du
openaire +2 more sources
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
vFHE: Verifiable Fully Homomorphic Encryption
Proceedings of the 12th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2023Fully Homomorphic Encryption (FHE) is a powerful building block for secure and private applications. However, state-of-the-art FHE schemes do not offer any integrity guarantees, which can lead to devastating correctness and security issues when FHE is deployed in non-trivial settings.
Christian Knabenhans +3 more
openaire +2 more sources
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
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
A Survey on Fully Homomorphic Encryption
ACM Computing Surveys, 2017It is unlikely that a hacker is able to compromise sensitive data that is stored in an encrypted form. However, when data is to be processed, it has to be decrypted, becoming vulnerable to attacks. Homomorphic encryption fixes this vulnerability by allowing one to compute directly on encrypted data.
Paulo Martins 0002 +2 more
openaire +2 more sources
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
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
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 +3 more sources