计算机应用 ›› 2015, Vol. 35 ›› Issue (2): 383-386.DOI: 10.11772/j.issn.1001-9081.2015.02.0383

• 信息安全 • 上一篇    下一篇

方阵幂安全外包云计算

刘午阳, 廖晓峰   

  1. 重庆大学 计算机学院, 重庆 400044
  • 收稿日期:2014-09-15 修回日期:2014-11-18 出版日期:2015-02-10 发布日期:2015-02-12
  • 通讯作者: 刘午阳
  • 作者简介:刘午阳(1988-),男,湖北宜昌人,硕士研究生,主要研究方向:安全外包云计算; 廖晓峰(1964-),男,重庆人,教授,博士生导师,主要研究方向:人工神经网络、无线传感器网络、混沌密码学。
  • 基金资助:

    国家自然科学基金资助项目(61472331);重庆市自然科学基金重点资助项目(CSTC2009BA2024)。

Secure outsourcing computation of square matrix power to public cloud

LIU Wuyang, LIAO Xiaofeng   

  1. College of Computer Science, Chongqing University, Chongqing 400044, China
  • Received:2014-09-15 Revised:2014-11-18 Online:2015-02-10 Published:2015-02-12

摘要:

为解决计算能力有限的对象(用户)所面临的大维数方阵的高次幂计算问题,利用云计算平台(云端),提出一个安全可验证的方阵幂云计算外包协议。协议中,用户首先构造一个随机置换,再结合克罗内克函数,生成一个非奇异方阵,并求得其逆矩阵,这两个方阵即为密钥;用户用此密钥完成对原方阵的加密,然后将加密所得方阵和原有的幂数发送给云端;云端完成加密所得方阵的求幂运算,并将计算所得方阵返回给用户;用户使用持有的密钥解密云端返回方阵,并随机选取若干解密所得方阵中的元素与相应的正确值进行对比,以验证解密所得方阵是否正确。经过理论分析可知,此协议满足外包协议的四个基本要求,即正确性、安全性、可验证性和高效性。基于此协议模型,在仿真实验中,将方阵幂问题分为方阵维数固定幂数变化和幂数固定方阵维数变化两种情形分别进行仿真。实验结果表明,这两种情形下,与用户自身完成原计算任务相比,外包计算均能大幅减少用户的计算耗时,获得较好的外包性能,且随着方阵维数和幂数的增加,外包效果更加明显。

关键词: 方阵幂, 云计算, 安全外包计算, 可验证, 克罗内克函数, 随机置换

Abstract:

Computing the high power of huge-dimension square matrix is a hard job for those entities (clients) with limited compute capability. To resolve this problem, a secure and verifiable cloud computation outsourcing protocol of square matrix power was designed using the cloud computing platform. In the protocol, the client firstly constructed a random permutation and generated a secret key which included a non-singular square matrix and its inverse matrix by combining the permutation with the Kronecker function. Secondly, the original square matrix was encrypted with the secret key by the client, and then the encrypted matrix was sent to the cloud along with the original exponent. After completing the calculation of the encrypted square matrix power, the cloud returned the result to the client. The client decrypted the returned result with its own secret key and correspondingly compared the elements which were randomly chosen by the client with the correct values to verify the correctness of the result. Theoretical analysis shows that the protocol meets the requirements of outsourcing protocol well, including correctness, security, verifiability and high efficiency. Based on this protocol model, the simulation experiments were conducted in two aspects: dimension fixed exponent changing and exponent fixed dimension changing. Finally the experiment result indicates that, compared with completing the original job by client himself, the outsourcing computation can substantially reduce the time consumption of the client in both cases and get a desirable outsourcing performance which becomes better with the increase of dimension and exponent.

Key words: square matrix power, cloud computing, secure outsourcing computation, verifiable, Kronecker function, random permutation

中图分类号: