[1] Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors:conceptually-simpler, asymptotically-faster, attribute-based[C]//Proceedings of CRYPTO 2013. Santa Barbara:Springer, 2013:75-92.
[2] Clear M, McGoldrick C. Bootstrappable identity-based fully homomorphic encryption[C]//Proceedings of International Conference on Cryptology and Network Security. New York:Springer, 2014:1-19.
[3] 康元基, 顾纯祥, 郑永辉, 等. 利用特征向量构造基于身份的全同态加密体制[J]. 软件学报, 2016, 27(6):1487-1497. Kang Yuanji, Gu Chunxiang, Zheng Yonghui, et al. Identity-based fully homomorphic encryption from eigenvector[J]. Journal of Software, 2016, 27(6):1487-1497.
[4] 段然, 顾纯祥, 祝跃飞, 等. NTRU格上高效的基于身份的全同态加密体制[J]. 通信学报, 2017, 38(1):66-75. Duan Ran, Gu Chunxiang, Zhu Yuefei, et al. Efficient identity-based fully homomorphic encryption over NTRU[J]. Journal on Communications, 2017, 38(1):66-75.
[5] Clear M, McGoldrick C. Multi-identity and multi-key leveled FHE from learning with errors[C]//Proceedings of CRYPTO 2015. Santa Barbara:Springer, 2015:630-656.
[6] Ajtai M. Generating hard instances of the short basis problem[C]//Proceedings of Automata, Languages and Programming.[S.l.]:Springer, 1999:1-9.
[7] 来齐齐, 胡予濮, 陈原, 等. 辅助输入安全的损耗陷门函数的构造[J]. 北京邮电大学学报, 2014, 37(6):6-10. Lai Qiqi, Hu Yupu, Chen Yuan, et al. Construction of auxiliary-input secure lossy trapdoor functions[J]. Journal of Beijing University of Posts and Telecommunications, 2014, 37(6):6-10.
[8] Alwen J, Peikert C. Generating shorter bases for hard random lattices[C]//Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science. Freiburg:Springer, 2009:535-553.
[9] Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions[C]//Proceeding of the 40th ACM Symposium on Theory of Computing. Victoria:ACM, 2008:197-206.
[10] Micciancio D, Peikert C. Trapdoors for lattices:simpler, tighter, faster, smaller[C]//Proceeding of EUROCRYPT 2012. Cambridge:Springer, 2012:700-718.
[11] Agrawal S, Boneh D, Boyen X. Efficient lattice (H)IBE in the standard model[C]//Proceeding of EUROCRYPT 2010. Riviera:Springer, 2010:553-572.
[12] Regev O. On lattices, learning with errors, random linear codes, and cryptography[C]//Proceedings of the 37th Annual ACM Symposium on Theory of Computing. New York:Springer, 2005:84-93.
[13] Cash D, Hofheinz D, Kiltz E, et al. Bonsai trees, or how to delegate a lattice basis[C]//Proceeding of EUROCRYPT 2010. Riviera:Springer, 2010:523-552.
[14] 王威力, 胡斌. 利用混淆器构造多身份的全同态加密体制[J]. 密码学报, 2017, 4(2):165-175. Wang Weili, Hu Bin. Multi-identity-based fully homomorphic encryption from obfuscation[J]. Journal of Cryptologic Research, 2017, 4(2):165-175. |