标准模型下可证安全的无证书全同态加密体制

doi:10.11772/j.issn.1001-9081.2015.02.0387

计算机应用 ›› 2015, Vol. 35 ›› Issue (2): 387-392.DOI: 10.11772/j.issn.1001-9081.2015.02.0387

标准模型下可证安全的无证书全同态加密体制

李少鲲^1,2

1. 信息工程大学, 郑州 450002;
2. 数学工程与先进计算国家重点实验室, 郑州 450002

收稿日期:2014-09-11 修回日期:2014-11-07 出版日期:2015-02-10 发布日期:2015-02-12
通讯作者: 李少鲲
作者简介:李少鲲(1988-),男,北京人,硕士研究生,主要研究方向:云计算安全、全同态加密。

Provable secure certificateless fully homomorphic encryption scheme in standard model

LI Shaokun^1,2

1. Information Engineering University, Zhengzhou Henan 450002, China;
2. State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou Henan 450002, China

Received:2014-09-11 Revised:2014-11-07 Online:2015-02-10 Published:2015-02-12

摘要/Abstract

摘要：

针对现有全同态加密体制普遍存在的公钥尺寸大的缺陷,结合无证书公钥加密的思想,提出一种无证书全同态加密体制设计方案,无需对公钥进行身份认证,因而有效提高密码系统的整体应用效率。体制利用满秩差分矩阵实现身份信息的嵌入,摆脱了对于哈希函数的依赖,因而在安全性证明中无需引入随机谕示假设;借助一对彼此对偶的正态分布采样函数实现部分私钥的提取,进而结合容错学习问题实例生成体制私钥;通过双重加密使服务器失去对用户密文进行解密的能力,从而杜绝密钥托管问题。体制的安全性在标准模型下归约到容错学习问题的难解性。

关键词: 全同态加密, 无证书公钥加密, 容错学习问题, 可证安全, 标准模型

Abstract:

Focused on the flaw of large-scale public keys which is shared by the existing fully homomorphic encryption schemes, the idea of certificateless public-key encryption was introduced into the design of fully homomorphic encryption schemes, and an certificateless fully homomorphic encryption scheme was proposed. The overall efficiency of the cryptosystem would be improved since the public keys of the scheme no longer need identity authentication. The full-rank differencing matrix was used to embed the identities into the scheme, and the random oracles were no longer needed in the security proof because of the absence of hash function. The partial private keys were abstracted by a pair of dual normal distribution sampling functions, and were transformed to the private keys by the instance of learning with errors problem. The scheme employed double encryption to deprive the servers of the capability of decryption and thus avoided key escrow. The security of the scheme reduces to the hardness of learning with errors problem.

Key words: fully homomorphic encryption, certificateless public-key encryption, learning with errors problem, provable security, standard model

中图分类号:

TP309

李少鲲. 标准模型下可证安全的无证书全同态加密体制[J]. 计算机应用, 2015, 35(2): 387-392.

LI Shaokun. Provable secure certificateless fully homomorphic encryption scheme in standard model[J]. Journal of Computer Applications, 2015, 35(2): 387-392.

参考文献

[1] RIVEST R, ADLEMAN L, DERTOUZOS M. On data banks and privacy homomorphisms [C]//FOCS 1978: Proceedings of the IEEE 17th Annual Symposium on Foundations of Computer Science. Washington, DC: IEEE Computer Society, 1978: 169-177.
[2] GENTRY C. Fully homomorphic encryption using ideal lattices [C]//STOC 2009: Proceedings of the 41st ACM Symposium on Theory of Computing. New York: ACM, 2009: 169-178.
[3] van DIJK M, GENTRY C, HALEVI S, et al. Fully homomorphic encryption over the integers [C]//EUROCRYPT 2010: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 6110. Berlin: Springer, 2010: 24-43.
[4] GENTRY C, HALEVI S. Implementing gentry's fully-homomorphic encryption scheme [C]//EUROCRYPT 2011: Proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 6632. Berlin: Springer Press, 2011: 129-148.
[5] SMART N P, VERCAUTEREN F. Fully homomorphic encryption with relatively small key and ciphertext sizes [C]//PKC 2010: Proceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography, LNCS 6056. Berlin: Springer, 2010: 420-443.
[6] BRAKERSKI Z, VAIKUNTANATHAN V. Efficient fully homomorphic encryption from (standard) LWE [C]//FOCS 2011: Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science. Piscataway: IEEE, 2011: 97-106.
[7] REGEV O. On lattices, learning with errors, random linear codes, and cryptography [C]//STOC 2005: Proceedings of the 37th Annual ACM Symposium on Theory of Computing. New York: ACM, 2005: 84-93.
[8] BRAKERSKI Z, GENTRY C, VAIKUNTANATHAN V. Fully homomorphic encryption without bootstrapping [C]//ITCS 2012: Proceedings of the 3rd Innovations in Theoretical Computer Science. New York: ACM, 2012: 309-325.
[9] GENTRY C, HALEVI S, SMART N P. Fully homomorphic encryption with polylog overhead [C]//EUROCRYPT 2012: Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 7237. Berlin: Springer, 2012: 465-482.
[10] GENTRY C, HALEVI S, SMART N P. Better bootstrapping in fully homomorphic encryption [C]//PKC 2012: Proceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography, LNCS 7293. Berlin: Springer, 2012: 1-16.
[11] SHAMIR A. Identity-based cryptosystems and signature schemes [C]//CRYPTO 1984: Proceedings of the 28th Annual International Cryptology Conference, LNCS 196. Berlin: Springer-Verlag, 1984: 47-53.
[12] AL-RIYAMI S S, PATERSON K G. Certificateless public key cryptography [C]//ASIACRYPT 2003: Proceedings of the 9th International Conference on the Theory and Application of Cryptology and Information Security, LNCS 2894. Berlin: Springer-Verlag, 2003: 452-473.
[13] GUANG Y, ZHU Y, FEI J, et al. Identity-based fully homomorphic encryption from learning with error problem [J]. Journal on Communications, 2014,35(2): 111-117.(光焱,祝跃飞,费金龙,等.利用容错学习问题构造基于身份的全同态加密体制[J].通信学报, 2014,35(2): 111-117.)
[14] GENTRY C, SAHAI A, WATERS B. Homomorphic encryption from learning with errors: conceptually- simpler, asymptotically-faster, attribute-based [C]//CRYPTO 2013: Proceedings of the 33rd Annual International Conference on Cryptology, LNCS 8042. Berlin: Springer-Verlag, 2013: 75-92.
[15] GUANG Y, GU C, ZHU Y, et al. Certificateless fully homomorphic encryption based on LWE problem [J]. Journnal of Electronics and Informtion Technology, 2013, 35(4): 988-993. (光焱, 顾纯祥, 祝跃飞,等. 一种基于LWE问题的无证书全同态加密体制[J]. 电子与信息学报, 2013, 35(4): 988-993.)
[16] AJTAI M. Generating hard instances of the short basis problem [C]//ICALP 1999: Proceedings of the 26th International Colloquium on Automata, Languages and Programming, LNCS 1644. Berlin: Springer, 1999: 1-9.
[17] MICCIANCIO D, REGEV O. Worst-case to average-case reductions based on Gaussian measures [C]//FOCS2004: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. Piscataway: IEEE, 2004: 372-381.
[18] PEIKERT C. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract [C]//STOC 2009: Proceedings of the 41st ACM Symposium on Theory of Computing. New York: ACM, 2009: 333-342.
[19] AGRAWAL S, BONEH D, BOYEN X. Efficient lattice (H)IBE in the standard model [C]//EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 6110. Berlin: Springer, 2010: 553-572.
[20] CRAMER R, DAMGÅRD I. On the amortized complexity of zero-knowledge protocols [C]//CRYPTO 2009: Proceedings of the 29th Annual International Cryptology Conference, LNCS 5677. Berlin: Springer, 2009: 177-191.
[21] CASH D, HOFHEINZ D, KILTZ E, et al. Bonsai trees, or how to delegate a lattice basis [C]//EUROCRYPT 2010: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 6110. Berlin: Springer, 2010: 523-552.
[22] DODIS Y, OSTROVSKY R, REYZIN L, et al. Fuzzy extractors: how to generate strong keys from biometrics and other noisy data [J]. SIAM Journal on Computing, 2008, 38(1): 97-139.

标准模型下可证安全的无证书全同态加密体制

Provable secure certificateless fully homomorphic encryption scheme in standard model

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	余卿斐, 涂广升, 李宁波, 周潭平. 多跳多策略属性基全同态加密方案[J]. 计算机应用, 2019, 39(8): 2326-2332.
[2]	涂广升, 杨晓元, 周潭平. 高效的身份基多用户全同态加密方案[J]. 计算机应用, 2019, 39(3): 750-755.
[3]	白平, 张薇. 多属性环境下基于容错学习的全同态加密方案[J]. 计算机应用, 2018, 38(5): 1377-1382.
[4]	李明祥, 刘照, 张明艳. 无高斯噪声的全同态加密方案[J]. 计算机应用, 2017, 37(12): 3430-3434.
[5]	戴晓明, 张薇, 郑志恒, 李镇林. 基于容错学习的GSW-型全同态层次型IBE方案[J]. 计算机应用, 2016, 36(7): 1856-1860.
[6]	孙意如, 梁向前, 商玉芳. 理想格上基于身份的环签名方案[J]. 计算机应用, 2016, 36(7): 1861-1865.
[7]	王曌, 丁勇, 王会勇. 基于环上容错学习和GSW的层次型全同态加密方案[J]. 计算机应用, 2016, 36(4): 962-965.
[8]	任小康, 陈培林, 曹源, 李亚楠, 杨小东. 基于身份的服务器辅助验证部分盲签名方案[J]. 计算机应用, 2016, 36(11): 3098-3102.
[9]	明洋, 原红平, 孙变, 乔正阳. 标准模型下高效的基于身份匿名广播加密方案[J]. 计算机应用, 2016, 36(10): 2762-2766.
[10]	李作辉, 杨梦梦, 陈性元. 素数阶群上属性可重复的多授权机构基于属性的加密方案[J]. 计算机应用, 2015, 35(8): 2189-2194.
[11]	白寅城韩益亮杨晓元卢万宜. 标准模型下基于身份的可公开验证签密方案[J]. 计算机应用, 2014, 34(6): 1676-1680.
[12]	明洋张琳韩娟周俊. 标准模型下广义指定验证者签密[J]. 计算机应用, 2014, 34(2): 464-468.
[13]	孙华孟坤. 标准模型下可证安全的有效无证书签密方案[J]. 计算机应用, 2013, 33(07): 1846-1850.
[14]	杜卫东杨晓元张祥火王绪安. 适应性选择密文安全的可公开验证加密方案[J]. 计算机应用, 2013, 33(04): 1051-1054.
[15]	柳欣雷文庆. 无随机预言的完全匿名多服务订购系统[J]. 计算机应用, 2013, 33(02): 417-429.