Efficient fully homomorphic encryption from RLWE with an extension to a threshold encryption scheme

2014 ◽  
Vol 36 ◽  
pp. 180-186 ◽  
Author(s):  
Xiaojun Zhang ◽  
Chunxiang Xu ◽  
Chunhua Jin ◽  
Run Xie ◽  
Jining Zhao
Keyword(s):  
Homomorphic Encryption ◽  
Encryption Scheme ◽  
Fully Homomorphic Encryption ◽  
Threshold Encryption

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.

Sign in / Sign up

Export Citation Format

Share Document