Publicly verifiable and efficiency/security-adjustable outsourcing scheme for solving large-scale modular system of linear equations

被引:0
作者
Panpan Meng
Chengliang Tian
Xiangguo Cheng
机构
[1] College of Computer Science and Technology,
[2] Qingdao University,undefined
[3] Business School,undefined
[4] Qingdao University,undefined
[5] State Key Laboratory of Information Security,undefined
[6] Institute of Information Engineering,undefined
[7] Chinese Academy of Sciences,undefined
来源
Journal of Cloud Computing | / 8卷
关键词
Cloud computing; Secure computation outsourcing; Modular system of linear equations; Unimodular matrix transformation; Privacy-preserving;
D O I
暂无
中图分类号
学科分类号
摘要
Solving large-scale modular system of linear equations (ℒℳSℒE\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {LMSLE}$\end{document}) is pervasive in modern computer and communication community, especially in the fields of coding theory and cryptography. However, it is computationally overloaded for lightweight devices arisen in quantity with the dawn of the things of internet (IoT) era. As an important form of cloud computing services, secure computation outsourcing has become a popular topic. In this paper, we design an efficient outsourcing scheme that enables the resource-constrained client to find a solution of the ℒℳSℒE\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {LMSLE}$\end{document} with the assistance of a public cloud server. By utilizing affine transformation based on sparse unimodular matrices, our scheme has three merits compared with previous work: 1) Our scheme is efficiency/security-adjustable. Our encryption method is dynamic, and it can balance the security and efficiency to match different application scenarios by skillfully control the number of unimodular matrices. 2) Our scheme is versatile. It is suit for generic m-by-n coefficient matrix A, no matter it is square or not. 3) Our scheme satisfies public verifiability and achieves the optimal verification probability. It enables any verifier which is not necessarily the client to verify the correctness of the results returned from the cloud server with probability 1. Finally, theoretical analysis and comprehensive experimental results confirm our scheme’s security and high efficiency.
引用
收藏
相关论文
共 64 条
  • [1] Singh KJ(2017)Create your own internet of things: A survey of iot platforms IEEE Consum Electron Mag 6 57-68
  • [2] Kapoor DS(2014)Internet of things in industries: A survey IEEE Trans Ind Informa 10 2233-2243
  • [3] Xu LD(2019)An attack-resistant trust inference model for securing routing in vehicular ad hoc networks IEEE Trans Veh Technol 68 7108-7120
  • [4] He W(2019)An efficient social-like semantic-aware service discovery mechanism for large-scale internet of things Comput Netw 152 210-220
  • [5] Li S(2018)Towards a novel trust-based multicast routing for vanets Secur Commun Netw 2018 1-1
  • [6] Xia H(2018)Practical secure computation outsourcing: A survey Acm Comput Surv 51 1-40
  • [7] Zhang S(2020)How to securely outsource the extended euclidean algorithm for large-scale polynomials over finite fields Information Sciences 512 641-660
  • [8] Li Y(2013)Outsourcing large matrix inversion computation to a public cloud IEEE Trans Cloud Comput 1 1-1
  • [9] Pan Z(2019)Practical and secure outsourcing algorithms of matrix operations based on a novel matrix encryption method IEEE Access 7 53823-53838
  • [10] Peng X(2015)New algorithms for secure outsourcing of large-scale systems of linear equations IEEE Trans Inf Forensic Secur 10 69-78