[1] SAHAI A, WATERS B. Fuzzy identity-based encryption[C]//Proceedings of the 24th Annual International Conference on Theory and Applications of Cryptographic Techniques, LNCS 3494. Berlin:Springer, 2005:457-473. [2] GOYAL V, PANDEY O, SAHAI A, et al. Attribute-based encryption for fine-grained access control of encrypted data[C]//Proceedings of the 13th ACM Conference on Computer and Communications Security. New York:ACM, 2006:89-98. [3] GORBUNOV S, VAIKUNTANATHAN V, WEE H. Attribute-based encryption for circuits[C]//Proceedings of the 45th ACM Symposium on Theory of Computing. New York:ACM, 2013:545-554. [4] BONEH D, GENTRY C, GORBUNOV S, et al. Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits[C]//Proceedings of the 2014 Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 8441. Berlin:Springer, 2014:533-556. [5] GENTRY C. Fully homomorphic encryption using ideal lattices[C]//Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York:ACM, 2009:169-178. [6] BRAKERSKI Z, GENTRY C, VAIKUNTANATHAN V. (Leveled) fully homomorphic encryption without bootstrapping[C]//Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. New York:ACM, 2012:309-325. [7] GENTRY C, SAHAI A, WATERS B. Homomorphic encryption from learning with errors:conceptually-simpler, asymptotically-faster, attribute-based[C]//Proceedings of the 33rd Annual Cryptology Conference, LNCS 8042. Berlin:Springer, 2013:75-92. [8] ALPERIN-SHERIFF J, PEIKERT C. Faster bootstrapping with polynomial error[C]//Proceedings of the 34rd Annual Cryptology Conference, LNCS 8616. Berlin:Springer, 2014:297-314. [9] LÓPEZ-ALT A, TROMER E, VAIKUNTANATHAN V. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption[C]//Proceedings of the 44th Annual ACM Symposium on Theory of Computing. New York:ACM, 2012:1219-1234. [10] CLEAR M, MCGOLDRICK C. Multi-identity and multi-key leveled FHE from learning with errors[C]//Proceedings of the 35th Annual Cryptology Conference, LNCS 9216. Berlin:Springer, 2015:630-656. [11] MUKHERJEE P, WICHS D. Two round multiparty computation via multi-key FHE[C]//Proceedings of the 35th Annual International Conference on Theory and Applications of Cryptographic Techniques, LNCS 9666. Berlin:Springer, 2016:735-763. [12] PEIKERT C, SHIEHIAN S. Multi-key FHE from LWE, revisited[C]//Proceedings of the 13th Theory of Cryptography Conference, LNCS 9986. Berlin:Springer, 2016:217-238. [13] BRAKERSKI Z, CASH D, TSABARY R, et al. Targeted homomorphic attribute-based encryption[C]//Proceedings of the 13th Theory of Cryptography Conference, LNCS 9986. Berlin:Springer, 2016:330-360. [14] MICCIANCIO P, PEIKERT C. Trapdoors for lattices:simpler, tighter, faster, smaller[C]//Proceedings of the 31th Annual International Conference on Theory and Applications of Cryptographic Techniques, LNCS 7237. Berlin:Springer, 2012:700-718. [15] GORBUNOV S, VAIKUNTANATHAN V, WICHS D. Leveled fully homomorphic signatures from standard lattices[C]//Proceedings of the 47th Annual ACM Symposium on Theory of Computing. New York:ACM, 2015:469-477. [16] GENTRY C, PEIKERT C, VAIKUNTANATHAN V. Trapdoors for hard lattices and new cryptographic constructions[C]//Proceedings of the 40th Annual ACM Symposium on Theory of Computing. New York:ACM, 2008:197-206. [17] BRAKERSKI Z, LANGLOIS A, PEIKERT C, et al. Classical hardness of learning with errors[C]//Proceedings of the 45th Annual ACM Symposium on Theory of Computing. New York:ACM, 2013:575-584. [18] AGRAWAL S, BONEH D, BOYEN X. Efficient lattice (H) IBE in the standard model[C]//Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 6110. Berlin:Springer, 2010:553-572. [19] LYUBASHEVSKY V, WICHS D. Simple lattice trapdoor sampling from a broad class of distributions[C]//Proceedings of the 18th IACR International Workshop on Public Key Cryptography, LNCS 9020. Berlin:Springer, 2015:716-730. [20] 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:ACM, 2005:84-93. [21] PEIKERT C. Public-key cryptosystems from the worst-case shortest vector problem:extended abstract[C]//Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York, ACM, 2009:333-342. [22] MICCIANCIO D, MOL P. Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions[C]//Proceedings of the 31st Annual Cryptology Conference, LNCS 6841. Berlin:Springer, 2011:465-484. [23] 闫玺玺,叶青,刘宇. 云环境下支持隐私保护和用户撤销的属性基加密方案[J]. 信息网络安全,2017,17(6):14-21. (YAN X X, YE Q, LIU Y. Attribute-based encryption scheme supporting privacy preserving and user revocation in the cloud environment[J]. Netinfo Security, 2017,17(6):14-21.) [24] 游林,梁家豪. 基于同态加密与生物特征的安全身份认证研究[J]. 信息网络安全,2018,18(4):1-8. (YOU L, LIANG J H. Research on secure identity authentication based on homomorphic encryption and biometric[J]. Netinfo Security, 2018,18(4):1-8.) |