Improved Homomorphic String Bits Encryption Public-key Cryptosystem based on LWE

DOI

10.2991/ccis-13.2013.82How to use a DOI?

Keywords

LWE; Lattice; Public-key Cryptosystem; Homomor -phism; Regev’s Cryptosystem

Abstract

Accompany with the developing of the cloud computing, a public-key cryptosystem which is efficiency and homomorphic will have a wide application. Through analyzing the public-key cryptosystem, which is designed by Oded Regev and based on LWE (Learning with errors), in details, our main results are optimizing this public-key cryptosystem for bits string encryption and designing some good idea to make the optimized public-key cryptosystem satisfy the additive homomorphism and mixed multiplicative homomorphism. And also we give a small example and a time simulation about the improved public-key cryptosystem. The small example shows the cryptosystem can encrypt and decrypt correctly and the time simulation tells us the time of the generation of key and the decryption is the same with the original cryptosystem, but the encryption is more efficiency than the original cryptosystem.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jian Bai
AU  - Yatao Yang
AU  - Zichen Li
PY  - 2013/11
DA  - 2013/11
TI  - Improved Homomorphic String Bits Encryption Public-key Cryptosystem based on LWE
BT  - Proceedings of the The 1st International Workshop on Cloud Computing and Information Security
PB  - Atlantis Press
SP  - 355
EP  - 358
SN  - 1951-6851
UR  - https://doi.org/10.2991/ccis-13.2013.82
DO  - 10.2991/ccis-13.2013.82
ID  - Bai2013/11
ER  -