Secure Outsourcing of Matrix Determinant Computation under the Malicious Cloud

被引:0
|
作者
Song, Mingyang [1 ]
Sang, Yingpeng [1 ]
机构
[1] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
关键词
matrix determinant; secure outsourcing; cloud computing; FULLY-HOMOMORPHIC-ENCRYPTION; MULTIPLICATION; ALGORITHMS;
D O I
10.3390/s21206821
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
Computing the determinant of large matrix is a time-consuming task, which is appearing more and more widely in science and engineering problems in the era of big data. Fortunately, cloud computing can provide large storage and computation resources, and thus, act as an ideal platform to complete computation outsourced from resource-constrained devices. However, cloud computing also causes security issues. For example, the curious cloud may spy on user privacy through outsourced data. The malicious cloud violating computing scripts, as well as cloud hardware failure, will lead to incorrect results. Therefore, we propose a secure outsourcing algorithm to compute the determinant of large matrix under the malicious cloud mode in this paper. The algorithm protects the privacy of the original matrix by applying row/column permutation and other transformations to the matrix. To resist malicious cheating on the computation tasks, a new verification method is utilized in our algorithm. Unlike previous algorithms that require multiple rounds of verification, our verification requires only one round without trading off the cheating detectability, which greatly reduces the local computation burden. Both theoretical and experimental analysis demonstrate that our algorithm achieves a better efficiency on local users than previous ones on various dimensions of matrices, without sacrificing the security requirements in terms of privacy protection and cheating detectability.
引用
收藏
页数:20
相关论文
共 50 条
  • [21] Practical Secure Computation Outsourcing: A Survey
    Shan, Zihao
    Ren, Kui
    Blanton, Marina
    Wang, Cong
    ACM COMPUTING SURVEYS, 2018, 51 (02)
  • [22] A Secure and Efficient Framework for Outsourcing Large-scale Matrix Determinant and Linear Equations
    Luo, Yuling
    Zhang, Shiqi
    Zhang, Shunsheng
    Liu, Junxiu
    Wang, Yanhu
    Yang, Su
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2023, 22 (05)
  • [23] Secure Outsourcing of Matrix Convolutions
    Zhang, Kaijin
    Luo, Changqing
    Li, Pan
    2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2018,
  • [24] Harnessing the Cloud for Secure and Efficient Outsourcing of Non-negative Matrix Factorization
    Pan, Shiran
    Zheng, Fangyu
    Zhu, Wen-Tao
    Wang, Qiongxiao
    2018 IEEE CONFERENCE ON COMMUNICATIONS AND NETWORK SECURITY (CNS), 2018,
  • [25] Secure and Efficient Protocol for Outsourcing Large-Scale Matrix Multiplication to the Cloud
    Wu, Yu
    Liao, Yongjian
    Liang, Yikuan
    Liu, Yulu
    IEEE ACCESS, 2020, 8 : 227556 - 227565
  • [26] A Database Adapter for Secure Outsourcing to the Cloud
    Dowsley, Rafael
    Gabel, Matthias
    Yurchenko, Kateryna
    Zipf, Valentin
    2016 8TH IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM 2016), 2016, : 503 - 508
  • [27] On Secure Outsourcing of Cryptographic Computations to Cloud
    Kuppusamy, Lakshmi
    Rangasamy, Jothi
    Gauravaram, Praveen
    SCC'14: PROCEEDINGS OF THE 2ND INTERNATIONAL WORKSHOP ON SECURITY IN CLOUD COMPUTING, 2014, : 63 - 67
  • [28] Feasibility and Infeasibility of Secure Computation with Malicious PUFs
    Dachman-Soled, Dana
    Fleischhacker, Nils
    Katz, Jonathan
    Lysyanskaya, Anna
    Schroeder, Dominique
    JOURNAL OF CRYPTOLOGY, 2020, 33 (02) : 595 - 617
  • [29] Secure Maximum (Minimum) Computation in Malicious Model
    Li S.-D.
    Xu W.-T.
    Wang W.-L.
    Zhang M.-Y.
    1600, Science Press (44): : 2076 - 2089
  • [30] Feasibility and Infeasibility of Secure Computation with Malicious PUFs
    Dachman-Soled, Dana
    Fleischhacker, Nils
    Katz, Jonathan
    Lysyanskaya, Anna
    Schroeder, Dominique
    ADVANCES IN CRYPTOLOGY - CRYPTO 2014, PT II, 2014, 8617 : 405 - 420