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
相关论文
共 40 条
  • [1] Anderson E., 1999, LAPACK USERSGUIDE, Vthird
  • [2] Unbounded Dynamic Predicate Compositions in Attribute-Based Encryption
    Attrapadung, Nuttapong
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT I, 2019, 11476 : 34 - 67
  • [3] On the Security and Privacy Challenges of Virtual Assistants
    Bolton, Tom
    Dargahi, Tooska
    Belguith, Sana
    Al-Rakhami, Mabrook S.
    Sodhro, Ali Hassan
    [J]. SENSORS, 2021, 21 (07)
  • [4] Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
    Brakerski, Zvika
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2012, 2012, 7417 : 868 - 886
  • [5] Conceptual re-engineering: from explication to reflective equilibrium
    Brun, Georg
    [J]. SYNTHESE, 2020, 197 (03) : 925 - 954
  • [6] SHOSVD: Secure Outsourcing of High-Order Singular Value Decomposition
    Chen, Jinrong
    Liu, Lin
    Chen, Rongmao
    Peng, Wei
    [J]. INFORMATION SECURITY AND PRIVACY, ACISP 2020, 2020, 12248 : 309 - 329
  • [7] Chen YM, 2012, LECT NOTES COMPUT SC, V7237, P502, DOI 10.1007/978-3-642-29011-4_30
  • [8] Chen Z, P 2018 IEEE INT C CO, P1
  • [9] TFHE: Fast Fully Homomorphic Encryption Over the Torus
    Chillotti, Ilaria
    Gama, Nicolas
    Georgieva, Mariya
    Izabachene, Malika
    [J]. JOURNAL OF CRYPTOLOGY, 2020, 33 (01) : 34 - 91
  • [10] da Silva DWHA, 2019, 2019 IEEE 10TH ANNUAL UBIQUITOUS COMPUTING, ELECTRONICS & MOBILE COMMUNICATION CONFERENCE (UEMCON), P241, DOI 10.1109/UEMCON47517.2019.8992917