摘要
针对当前同态加密效率低的问题，利用Gentry设计思想，构建了基于部分近似最大公因子问题（PACDP）的全同态加密方案。首先，通过引入稀疏子集求和问题（SSSP）和“可忽略解密错误”压缩技术对电路进行解密，构造Somewhat方案，实现将模2运算转化为模4运算；其次，对所提方案的自举性进行证明，完善了算法的理论基础。与Dijk和汤殿华等人的方案相比，所提方案在加密过程中，可一次加密2bit信息，提高了加密过程的执行效率．并且具有更小的公钥尺寸。
Aiming at the problem of low efficiency of homomorphic encryption, here constructs the approximate greatest common factor problem （PACDP） based fully homomorphic encryption scheme. Firstly, by introducing a sparse subset sum problem （SSSP） and ＂negligible decryption error＂ compression technique, here realizes the circuit decryption, somewhat scheme construction, and achieves modulo 2 arithmetic into modulo 4 arithmetic; Secondly, the schemes of the bootstrap is proved, which perfects the theoretical basis of the algorithm. Compared with Dijk and Tang Dianhua＇s scheme, the proposed scheme can encrypt 2bit information once, which could improve the encryption efficiency, and has a smaller key size.
出处
《控制工程》
CSCD
北大核心
2018年第3期527-534,共8页
Control Engineering of China
基金
贵州省联合基金(黔科合LH字[2015]7606号)
关键词
全通态加密
公钥尺寸
执行效率
稀疏子集求和
Fully homomorphic encryption
public key size
efficiency
sparse subset sum
