4.6 Article

Practical and Secure Outsourcing Algorithms of Matrix Operations Based on a Novel Matrix Encryption Method

Journal

IEEE ACCESS
Volume 7, Issue -, Pages 53823-53838

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2913591

Keywords

Cloud computing; outsourcing computation; matrix operations; privacy; efficiency

Funding

  1. National Natural Science Foundation of China [61702294, 61572267]
  2. Natural Science Foundation of Shandong Province [ZR2016FQ02]
  3. National Development Foundation of Cryptography [MMJJ20170126, MMJJ20170118]
  4. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences [2016-MS-23, 2017-MS-21]
  5. Applied Basic Research Project of Qingdao City [17-1-1-10-jch]

Ask authors/readers for more resources

With the recent growth and commercialization of cloud computing, outsourcing computation has become one of the most important cloud services, which allows the resource-constrained clients to efficiently perform large-scale computation in a pay-per-use manner. Meanwhile, outsourcing large scale computing problems and computationally intensive applications to the cloud has become prevalent in the science and engineering computing community. As important fundamental operations, large-scale matrix multiplication computation (MMC), matrix inversion computation (MIC), and matrix determinant computation (MDC) have been frequently used. In this paper, we present three new algorithms to enable secure, verifiable, and efficient outsourcing of MMC, MIC, and MDC operations to a cloud that may be potentially malicious. The main idea behind our algorithms is a novel matrix encryption/decryption method utilizing consecutive and sparse unimodular matrix transformations. Compared to previous works, this versatile technique can be applied to many matrix operations while achieving a good balance between security and efficiency. First, the proposed algorithms provide robust confidentiality by concealing the local information of the entries in the input matrices. Besides, they also protect the statistic information of the original matrix. Moreover, these algorithms are highly efficient. Our theoretical analysis indicates that the proposed algorithms reduce the time overhead on the client side from O(n(2.3728639)) to O(n(2)). Finally, the extensive experimental evaluations demonstrate the practical efficiency and effectiveness of our algorithms.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available