[1] HOHENBERGER S, LYSYANSKAYA A. How to securely outsource cryptographic computations [C]//TCC 2005: Proceedings of the Second Theory of Cryptography Conference, LNCS 3378. Berlin: Springer, 2005: 264-282. [2] CHEN X, LI J, MA J, et al. New algorithms for secure outsourcing of modular exponentiations [C]//ESORICS 2012: Proceedings of the 17th European Symposium on Research in Computer Security, LNCS 7459. Berlin: Springer, 2012: 541-556. [3] MA X, LI J, ZHANG F. Efficient and secure batch exponentiations outsourcing in cloud computing [C]//ICINCoS 2012: Proceedings of the 2012 4th International Conference on Intelligent Networking and Collaborative Systems. Piscataway: IEEE, 2012: 600-605. [4] WANG C, REN K, WANG J. Harnessing the cloud for securely solving large-scale systems of linear equations [C]//ICDCS 2011: Proceedings of the 2011 31st International Conference on Distributed Computing Systems. Piscataway: IEEE, 2011: 549-558. [5] WANG C, REN K, WANG J. Secure and practical outsourcing of linear programming in cloud computing [C]//INFOCOM 2011: Proceedings of the 30th IEEE International Conference on Computer Communications. Piscataway: IEEE, 2011: 820-828. [6] LEI X, LIAO X, HUANG T, et al. Outsourcing large matrix inversion computation to a public cloud [J]. IEEE Transactions on Cloud Computing, 2013, 1(1): 78-87. [7] HU X, PEI D, TANG C. Verifiable and secure outsourcing of matrix calculation and its application [J]. Scientia Sinica Informationis, 2013, 43(7): 842-852.(胡杏,裴定一,唐春明.可验证安全外包矩阵计算及其应用[J].中国科学:信息科学,2013,43(7):842-852.) [8] REN X, HUANG H. Secure and efficient protocol for outsourcing large matrix determinant computation to semi-honest cloud [J]. Computer Engineering and Applications, 2014, 50(10):82-86. (任晓霞,黄宏宇. 安全高效的大矩阵行列式计算云外包协议[J]. 计算机工程与应用,2014,50(10):82-86.) [9] ZHANG M. Markov chain based on square matrix of factorial power [J]. Journal of Beijing Institute of Graphic Communication, 2009, 17(6): 71-73.(张梅荣. 基于方阵乘幂的马尔可夫链问题研究[J]. 北京印刷学院学报, 2009, 17(6): 71-73.) [10] FORD N J, LUMB P M. Mixed-type functional differential equations: a numerical approach [J]. Journal of Computational and Applied Mathematics, 2009, 229(2): 471-479. [11] DENG Y. A note on the square matrix high power calculation methods [J]. College Mathematics, 2010, 26(4): 153-156. (邓勇.关于方阵高次幂计算方法的一个注记[J]. 大学数学,2010,26(4):153-156.) [12] WANG H. Several kinds of solutions about the high-power of square matrix [J]. Journal of Anqing Teachers College: Natural Science Edition, 2008, 14(4): 70-72.(王汉斌. 方阵高次幂的几种解法[J]. 安庆师范学院学报:自然科学版,2008,14(4): 70-72.) [13] BRUALDI R A. Introductory combinatorics [M]. 5th ed. Beijing: China Machine Press, 2012:330-337. (BRUALDI R A. 组合数学[M].冯速,译.5版.北京:机械工业出版社, 2012:330-337.) [14] ZHOU W. Theory of numbers, groups and finite fields [M]. Beijing: Tsinghua University Press, 2013: 3-8. (周炜. 数论、群论、有限域[M]. 北京:清华大学出版社,2013:3-8.) [15] WILLIAMS V V. Multiplying matrices faster than coppersmith-winograd [C]//STOC 2012: Proceedings of the 2012 44th Annual ACM Symposium on Theory of Computing. New York: ACM, 2012: 887-898. |