scholarly journals Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes

2012 ◽  
pp. 419-436 ◽  
Author(s):  
Zhenfei Zhang ◽  
Thomas Plantard ◽  
Willy Susilo
Keyword(s):  
Homomorphic Encryption ◽  
Fully Homomorphic Encryption ◽  
Encryption Schemes ◽  
Reaction Attack

An Additively Homomorphic Encryption over Large Message Space

2015 ◽  
Vol 10 (3) ◽  
pp. 82-102 ◽  
Author(s):  
Hu Chen ◽  
Yupu Hu ◽  
Zhizhu Lian ◽  
Huiwen Jia ◽  
Xu An Wang
Keyword(s):  
Homomorphic Encryption ◽  
Prime Numbers ◽  
Encryption Scheme ◽  
Fully Homomorphic Encryption ◽  
The Public ◽  
Real World Applications ◽  
Encryption Schemes ◽  
Setting Parameters ◽  
Message Space ◽  
The Ideal

Fully homomorphic encryption schemes available are not efficient enough to be practical, and a number of real-world applications require only that a homomorphic encryption scheme is somewhat homomorphic, even additively homomorphic and has much larger message space for efficiency. An additively homomorphic encryption scheme based heavily on Smart-Vercauteren encryption scheme (SV10 scheme, PKC 2010) is put forward, where both schemes each work with two ideals I and J. As a contribution of independent interest, a two-element representation of the ideal I is given and proven by factoring prime numbers in a number field. This two-element representation serves as the public key. The authors' scheme allows working over much larger message space than that of SV10 scheme by selecting the ideal I with larger decryption radius to generate public/private key pair, instead of choosing the ideal J as done in the SV10 scheme. The correctness and security of the scheme are shown, followed by setting parameters and computational results. The results indicate that this construction has much larger message space than SV10 scheme.

About Fully Homomorphic Encryption Improvement Techniques

2019 ◽  
Vol 10 (3) ◽  
pp. 1-20
Author(s):  
Ahmed El-Yahyaoui ◽  
Mohamed Daifr Ech-Cherif El Kettani
Keyword(s):  
Cloud Computing ◽  
Homomorphic Encryption ◽  
Quality Of Services ◽  
End User ◽  
Fully Homomorphic Encryption ◽  
Encrypted Data ◽  
Cloud Server ◽  
Encryption Schemes ◽  
Multiple Clients

Fully homomorphic encryption schemes (FHE) are a type of encryption algorithm dedicated to data security in cloud computing. It allows for performing computations over ciphertext. In addition to this characteristic, a verifiable FHE scheme has the capacity to allow an end user to verify the correctness of the computations done by a cloud server on his encrypted data. Since FHE schemes are known to be greedy in term of processing consumption and slow in terms of runtime execution, it is very useful to look for improvement techniques and tools to improve FHE performance. Parallelizing computations is among the best tools one can use for FHE improvement. Batching is a kind of parallelization of computations when applied to an FHE scheme, it gives it the capacity of encrypting and homomorphically processing a vector of plaintexts as a single ciphertext. This is used in the context of cloud computing to perform a known function on several ciphertexts for multiple clients at the same time. The advantage here is in optimizing resources on the cloud side and improving the quality of services provided by the cloud computing. In this article, the authors will present a detailed survey of different FHE improvement techniques in the literature and apply the batching technique to a promising verifiable FHE (VFHE) recently presented by the authors at the WINCOM17 conference.

scholarly journals Plaintext recovery attacks against linearly decryptable fully homomorphic encryption schemes

2019 ◽  
Vol 87 ◽  
pp. 101587
Author(s):  
Nicholas Mainardi ◽  
Alessandro Barenghi ◽  
Gerardo Pelosi
Keyword(s):  
Homomorphic Encryption ◽  
Fully Homomorphic Encryption ◽  
Encryption Schemes

scholarly journals A Verifiable Fully Homomorphic Encryption Scheme for Cloud Computing Security

Technologies ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 21
Author(s):  
Ahmed EL-YAHYAOUI ◽  
Mohamed Dafir ECH-CHERIF EL KETTANI
Keyword(s):  
Cloud Computing ◽  
Homomorphic Encryption ◽  
Encryption Scheme ◽  
Fully Homomorphic Encryption ◽  
Sensitive Data ◽  
Verifiable Computation ◽  
Multiplication Operation ◽  
Matrix Operations ◽  
Encryption Schemes ◽  
Simple Matrix

Performing smart computations in a context of cloud computing and big data is highly appreciated today. It allows customers to fully benefit from cloud computing capacities (such as processing or storage) without losing confidentiality of sensitive data. Fully homomorphic encryption (FHE) is a smart category of encryption schemes that enables working with the data in its encrypted form. It permits us to preserve confidentiality of our sensible data and to benefit from cloud computing capabilities. While FHE is combined with verifiable computation, it offers efficient procedures for outsourcing computations over encrypted data to a remote, but non-trusted, cloud server. The resulting scheme is called Verifiable Fully Homomorphic Encryption (VFHE). Currently, it has been demonstrated by many existing schemes that the theory is feasible but the efficiency needs to be dramatically improved in order to make it usable for real applications. One subtle difficulty is how to efficiently handle the noise. This paper aims to introduce an efficient and symmetric verifiable FHE based on a new mathematic structure that is noise free. In our encryption scheme, the noise is constant and does not depend on homomorphic evaluation of ciphertexts. The homomorphy of our scheme is obtained from simple matrix operations (addition and multiplication). The running time of the multiplication operation of our encryption scheme in a cloud environment has an order of a few milliseconds.

scholarly journals Efficient Leveled (Multi) Identity-Based Fully Homomorphic Encryption Schemes

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 79299-79310 ◽  
Author(s):  
Tongchen Shen ◽  
Fuqun Wang ◽  
Kefei Chen ◽  
Kunpeng Wang ◽  
Bao Li
Keyword(s):  
Homomorphic Encryption ◽  
Fully Homomorphic Encryption ◽  
Encryption Schemes ◽  
Identity Based

scholarly journals HARDWARE IMPLEMENTATION OF AN ENCRYPTION FOR ENHANCEMENT DGHV

2019 ◽  
Vol 2 (2) ◽  
pp. 44-57
Author(s):  
Zainab H. Mahmood ◽  
Mahmood K. Ibrahem
Keyword(s):  
Real Time ◽  
High Speed ◽  
Hardware Implementation ◽  
Graphics Processing Unit ◽  
Homomorphic Encryption ◽  
Processing Unit ◽  
Fully Homomorphic Encryption ◽  
Encryption Schemes ◽  
Field Programmable ◽  
Programmable Gate Arrays

In constructing a secure and reliable cloud computing environment, a fully homomorphic encryption (FHE) scheme is conceived as a major cryptographic tool, as it enables arbitrary arithmetic evaluation of a cipher text without revealing the plaintext. However, due to very high of fully homomorphic encryption systems stays impractical and unfit for real-time applications  One way to address this restriction is by using graphics processing unit (GPUs) and field programmable gate arrays (FPGAs) to produce homomorphic encryption schemes. This paper represents the hardware implementation of an encryption for enhancement van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) scheme over the integer (DGHV10) using FPGA technology for high speed computation and real time results. The proposed method was simulated via Vivado system generator tools. Then design systems of fully homomrphic encryption are implemented in an FPGA hardware successfully using NEXYS 4 DDR board with ARTIX 7 XC7A100T FPGA. The Experimental results show that the FPGA- based fully homomorphic encryption system is 63 times faster than the simulation based implementation.

Sign in / Sign up

Export Citation Format

Share Document