关键词: 全同态加密, 公钥尺寸, 效率, 安全性

Abstract: In order to improve the efficiency of the fully homomorphic encryption scheme, based on partially approximate common divisor problem, a fully homomorphic encryption scheme over the integer is presented. Compared with the Dijk et al’s scheme, this scheme has these advantages of a smaller public key size and faster computation. Under this condition of allowing for a negligible probability of decryption error, this paper further reduces the complexity of the decryption algorithm, thus the given scheme is more efficient. Finally, it is proved that the scheme is semantically secure.

Key words: fully homomorphic encryption, public key size, efficiency, security