桂林电子科技大学学报2017，Vol.37Issue(6)：478-482,5.
一种改进的基于整数的全同态加密方案
An improved fully homomorphic encryption on the integers
摘要
Abstract
An improved fully homomorphic encryption scheme is designed to solve the defect of DGHV,which will expose the key when it does ciphertext retrieval.Firstly,it constructs a somewhat homomorphic encryption scheme,then the decryp-tion circuit is squashed to achieve bootstrapping by applying sparse subset sum.Finally the somewhat homomorphic encryp-tion scheme is converted into a fully homomorphic encryption scheme.The security of the scheme is own to the approximate integer GCD and the sparse subset sum.Compared with DGHV scheme,this fully homomorphic encryption not only can de-crypt data correctly,but also has the advantages of protecting the secret key when it does cipertext retrieval,this provides a new direction for the research of fully homomorphic encryption in the future.关键词
全同态加密/整数近似GCD/自举性/稀疏子集和/密文检索Key words
fully homomorphic encryption/approximate integer GCD/bootstrapping/sparse subset sum/ciphertext retrieval分类
信息技术与安全科学引用本文复制引用
周津,王勇..一种改进的基于整数的全同态加密方案[J].桂林电子科技大学学报,2017,37(6):478-482,5.基金项目
国家自然科学基金(11661025) （11661025）
广西可信软件重点实验室基金(KX201625) （KX201625）
广西密码学与信息安全重点实验室基金(GCIS201617) （GCIS201617）
