[1] MEZGHANI K, AYADI F. Factors explaining IS managers attitudes toward cloud computing adoption[J]. International Journal of Technology and Human Interaction, 2016, 12(1):1-20. [2] GENTRY C. Fully homomorphic encryption using ideal lattices[C]//STOC'09:Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York:ACM, 2009:169-178. [3] APPLEBAUM B, ISHAI Y, KUSHILEVITZ E. From secrecy to soundness:efficient verification via secure computation[C]//Proceedings of the 2010 International Colloquium on Automata, Languages, and Programming, LNCS 6198. Berlin:Springer, 2010:152-163. [4] CHUNG K M, KALAI Y, VADHAN S. Improved delegation of computation using fully homomorphic encryption[C]//Proceedings of the 2010 Annual Cryptology Conference, LNCS 6223. Berlin:Springer, 2010:483-501. [5] GENNARO R, GENTRY C, PARNO B. Non-interactive verifiable computing:outsourcing computation to untrusted workers[C]//Proceedings of the 2010 Annual Cryptology Conference, LNCS 6223. Berlin:Springer, 2010:465-482. [6] GENNARO R, WICHS D. Fully homomorphic message authenticators[C]//Proceedings of the 2013 International Conference on the Theory and Application of Cryptology and Information Security, LNCS 8270. Berlin:Springer, 2013:301-320. [7] DAN B, LYNN B, SHACHAM H. Short signatures from the Weil pairing[C]//Proceedings of the 2001 International Conference on the Theory and Application of Cryptology and Information Security, LNCS 2248. Berlin:Springer, 2001:514-532. [8] CATALANO D, FIORE D, GENNARO R, et al. Practical homomorphic MACs for arithmetic circuits[C]//Proceedings of the 2013 Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 7881. Berlin:Springer, 2013:336-352. [9] BENABBAS S, GENNARO R, VAHLIS Y. Verifiable delegation of computation over large datasets[C]//CRYPTO'11:Proceedings of the 31st Annual Conference on Advances in Cryptology. Berlin:Springer, 2011:111-131. [10] FIORE D, GENNARO R. Publicly verifiable delegation of large polynomials and matrix computations, with applications[C]//CCS'12:Proceedings of the 2012 ACM Conference on Computer and Communications Security. New York:ACM, 2012:501-512. [11] PARNO B, RAYKOVA M, VAIKUNTANATHAN V. How to delegate and verify in public:verifiable computation from attribute-based encryption[C]//Proceedings of the 2012 Theory of Cryptography Conference, LNCS 7194. Berlin:Springer, 2012:422-439. [12] SCHWARTZ J T. Fast probabilistic algorithms for verification of polynomial identities[J]. Journal of the ACM, 1980, 27(4):701-717. [13] CATALANO D, FIORE D, GENNARO R, et al. Generalizing homomorphic MACs for arithmetic circuit[EB/OL].[2018-01-09]. https://www.iacr.org/archive/pkc2014/83830238/83830238.pdf. |