期刊文献+

可验证安全外包矩阵计算及其应用 被引量:22

Verifiable and secure outsourcing of matrix calculation and its application
原文传递
导出
摘要 矩阵计算在科学计算和密码学领域中都有着重要的作用.许多密码协议、科学和数值计算问题都涉及到了矩阵计算.然而,对那些计算能力有限的用户来说,独立完成矩阵计算并不是件容易的事情.云计算拥有强大的计算资源,它使得用户的计算能力不再受限于他们的资源约束型设备,他们可以外包工作量给云.本文围绕矩阵计算展开研究,针对矩阵乘积、矩阵的行列式以及矩阵的逆这3种运算,分别设计了切实可行的可验证安全外包协议.与已有的关于这3种可验证外包计算的协议相比,我们的协议在效率和安全性方面都有了改进,而且我们的协议不需要任何的密码学假设.本文中,还为我们的协议给出两个具体应用,即为"大型线性方程组的求解"以及"基于纠错码的密码体制的实现"这两个问题分别构造了高效的可验证外包计算协议. Matrix calculation plays an important role in both scientific computation and cryptography. Many cryptographic protocols, scientific computations, and numerical computations are based on matrix calculation. However, it is difficult to finish matrix calculation independently for these customers whose computation abilities are limited. Cloud Computing has a great deal of computational resources, which enable customers with limited computational resources to outsource their mass computing to the cloud. In this paper we design secure, verifiable, and practical outsourcing protocols for matrix calculation, including matrix multiplication, computing the deter- minant and inverse of a matrix. Compared with those existing outsourcing protocols, our protocols have obvious improvement concerning both efficiency and security. ~rthermore, no cryptographic assumption is needed in our protocols. Finally, we give two applications for our outsourcing protocols; one is to construct an outsourcing protocol for solving the large-scale systems of linear equations, and the other is to design an outsourcing protocol for realizing a cryptosystem based on error-correction code.
出处 《中国科学:信息科学》 CSCD 2013年第7期842-852,共11页 Scientia Sinica(Informationis)
基金 国家自然科学基金(批准号:11271003) 香港特区自然科学基金(批准号:CityU123511) 国家教育部博士点基金(批准号:20094410110001) 广东省高层次人才项目 广东省自然科学基金(批准号:S2012010009950)资助项目
关键词 云计算 外包计算 矩阵乘积 矩阵行列式 逆矩阵 cloud computing outsourcing computation matrix multiplication determinant of a matrix matrix inversion
  • 相关文献

参考文献20

  • 1Sun Microsystems, Inc. Building customer trust in cloud computing with transparent security. 2009. https://www.sun. com/offers/det ails/sun_transparency.xml.
  • 2Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. Maryland, 2009. 169-178.
  • 3Gentry C. Toward basing fully homomorphic encryption on worst-case hardness. In: Proceedings of the 30th Annual Cryptology Conference. Santa Barbara, 2010. 116-137.
  • 4van Dijk M, Gentry C, Halevi S, et al. Fully homomorphic encryption over integers, In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Riviera, 2010. 24-43.
  • 5Smart N P, Vercauteren F. Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Pro- ceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography. Paris, 2010. 420-443.
  • 6Stehle D, Steinfeld R. Faster fully homomorphic encryption. In: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security. Singapore, 2010. 377-394.
  • 7Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Riviera, 2010. 1-23.
  • 8Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption (standard) LWE. In: IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). Palm Springs, 2011. 97-106.
  • 9Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Proceedings of the 31st Annual Cryptology Conference. Santa Barbara, 2011. 501-521.
  • 10Benjamin D, Atallah M J. Private and cheating-free outsourcing of algebraic computations. In: Proceedings of the 6th Conference on Privacy, Security, and Trust (PST). New Brunswick, 2008. 240 -245.

同被引文献273

  • 1吴吉义,沈千里,章剑林,沈忠华,平玲娣.云计算:从云安全到可信云[J].计算机研究与发展,2011,48(S1):229-233. 被引量:54
  • 2罗文俊,李祥.多方安全矩阵乘积协议及应用[J].计算机学报,2005,28(7):1230-1235. 被引量:34
  • 3HOHENBERGER S, LYSYANSKAYA A. How to securely outsource cryptographic computations [ C]//TCC 2005: Proceedings of the Sec- ond Theory of Cryptography Conference, LNCS 3378. Berlin: Spring- er, 2005:264-282.
  • 4CHEN X, LI J, MA J, et al. New algorithms for secure outsourcing of modular exponentiations [ C]// ESORICS 2012: Proceeditags of the 17th European Symposium on Research in Computer Security, LNCS7459. Berlin: Springer, 2012:541-556.
  • 5MA 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.
  • 6WANG C, REN K, WANG J. Harnessing the cloud for securely sol- ving large-scale systems of linear equations [ C]// ICDCS 2011: Proceedings of the 2011 31 st International Conference on Distributed Computing Systems. Piscataway: 1EEE, 2011 : 549 - 558.
  • 7WANG 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.
  • 8LEI X, LIAO X, HUANG T, et al. Outsourcing large matrix inver- sion computation to a public cloud [ J]. IEEE Transactions on Cloud Computing, 2013, 1(1) : 78 - 87.
  • 9FORD N J, LUMB P M. Mixed-type functional differential equa- tions: a numerical approach [ J]. Journal of Computational and Ap- plied Mathematics, 2009, 229(2): 471-479.
  • 10BRUALDIRA.组合数学[M].冯速,译.5版.北京:机械工业出版社,2012:330-337.

引证文献22

二级引证文献257

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部