An Additively Homomorphic Encryption from Ideal Lattices

作者：Chen, Hu^*; Hu, Yupu; Jia, Huiwen

来源：10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing 3PGCIC, 2015-11-04 To 2015-11-06.

DOI：10.1109/3PGCIC.2015.18

• lattice-based cryptosystem
• fully homomorphic encryption
• polynomial coset problem
• bounded distance decoding problem

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, by factoring prime numbers in a number field, is given. This two-element representation serves as the public key. Our 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.

• 出版日期2015
• 单位综合业务网理论及关键技术国家重点实验室; 西安电子科技大学