[1] GENTRY C. Fully homomorphic encryption using ideal lattices[C]//STOC 2009:Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York:ACM, 2009:169-178. [2] 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 Theory and Applications of Cryptographic Techniques. Berlin:Springer, 2010:24-43. [3] BRAKERSKI Z, GENTRY C, VAIKUNTANATHAN V.(Leveled) fully homomorphic encryption without bootstrapping[J]. ACM Transactions on Computation Theory, 2014, 6(3):Article No. 13. [4] 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 Cryptology Conference on Advances in Cryptology. Berlin:Springer, 2013:75-92. [5] BRAKERSKI Z, VAIKUNTANATHAN V. Lattice-based FHE as secure as PKE[C]//ITCS 14:Proceedings of the 5th Conference on Innovations in Theoretical Computer Science. New York:ACM, 2014:1-12. [6] ALPERIN-SHERIFF J, PEIKERT C. Faster bootstrapping with polynomial error[C]//CRYPTO 2014:Proceedings of the 34th Annual Cryptology Conference on Advances in Cryptology. Piscataway, NJ:IEEE, 2014:297-314. [7] NAEHRIG M, LAUTER K, VAIKUNTANATHAN V. Can homomorphic encryption be practical?[C]//CCSW11:Proceedings of the 3rd ACM Workshop on Cloud Computing Security Work Shop. New York:ACM, 2011:113-124. [8] MICCIANCIO D, PEIKERT C. Trapdoors for lattices:simpler, tighter, faster, smaller[C]//EUROCRYPT 2012:Proceedings of the 31st Annual International Conference on Theory and Applications of Cryptographic Techniques. Berlin:Springer, 2012:700-718. [9] LYUBASHEVSKY V, PEIKERT C, REGEV O. On ideal lattices and learning with errors over rings[J]. Journal of the ACM, 2013, 60(6):Article No. 43. [10] MICCIANCIO D. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions[J]. Computational Complexity, 2007, 16(4):365-411. [11] REGEV O. The learning with errors problem[C]//Proceedings of the 2012 IEEE 27th Conference on Computational Complexity. Piscataway, NJ:IEEE, 2010, 41(3):191-204. [12] BRAKERSKI Z. Fully homomorphic encryption without modulus switching from classical GapSVP[C]//CRYPTO 2012:Proceedings of the 32nd International Cryptology Conference on Advances in Cryptology. Berlin:Springer, 2012:868-886. [13] 陈智罡, 王箭, 宋新霞. 全同态加密研究[J]. 计算机应用研究, 2014, 31(6):1624-1631.(CHEN Z G, WANG J, SONG X X. Survey on fully homomorphic encryption[J]. Application Research of Computers, 2014, 31(6):1624-1631.) [14] 汤殿华, 祝世雄, 王林, 等. 基于RLWE的全同态加密方案[J]. 通信学报, 2014, 35(1):173-182.(TANG D H, ZHU S X, WANG L, et al. Fully homomorphic encryption scheme from RLWE[J]. Journal on Communications, 2014, 35(1):173-182.) [15] BRAKERSKI Z, VAIKUNTANATHAN V. Fully homomorphic encryption from Ring-LWE and security for key dependent messages[C]//CRYPTO 2011:Proceedings of the 31th International Cryptology Conference on Advances in Cryptology. Berlin:Springer, 2011:505-524. [16] 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. |