How to Securely and Efficiently Solve the Large-Scale Modular System of Linear Equations on the Cloud

被引:0
作者
Tian, Chengliang [1 ]
Yu, Jia [1 ]
Meng, Panpan [1 ]
Zhang, Guoyan [2 ]
Tian, Weizhong [3 ]
Zhang, Yan [4 ]
机构
[1] Qingdao Univ, Coll Comp Sci & Technol, Qingdao 266071, Shandong, Peoples R China
[2] Shandong Univ, Sch Cyber Sci & Technol, Key Lab Cryptol Technol & Informat Secur, Minist Educ, Qingdao 266237, Shandong, Peoples R China
[3] Shenzhen Technol Univ, Coll Big Data & Internet, Shenzhen 518118, Guangdong, Peoples R China
[4] Qingdao Univ Sci & Technol, Coll Electromech Engn, Qingdao 266061, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Outsourcing; Cloud computing; Protocols; Mathematical models; Servers; Task analysis; Sparse matrices; Client-server system; computation outsourcing; large-scale linear system of equations; privacy-preserving; verifiability; ALGORITHMS; OUTSOURCE; SIEVE;
D O I
10.1109/TCC.2024.3408240
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud-assisted computation empowers resource-constrained clients to efficiently tackle computationally intensive tasks by outsourcing them to resource-rich cloud servers. In the current era of Big Data, the widespread need to solve large-scale modular linear systems of equations (LMLSE) of the form Ax equivalent to b mod q poses a significant challenge, particularly for lightweight devices. This paper delves into the secure outsourcing of LMLSE under a malicious single-server model and, to the best of our knowledge, introduces the inaugural protocol tailored to this specific context. The cornerstone of our protocol lies in the innovation of a novel matrix encryption method based on sparse unimodular matrix transformations. This novel technique bestows our protocol with several key advantages. First and foremost, it ensures robust privacy for all computation inputs, encompassing A, b, q, and the output x, as validated by thorough theoretical analysis. Second, the protocol delivers optimal verifiability, enabling clients to detect cloud server misbehavior with an unparalleled probability of 1. Furthermore, it boasts high efficiency, requiring only a single interaction between the client and the cloud server, significantly reducing local-client time costs. For an m-by-n matrix A, a given parameter lambda = omega(log q), and rho=2.371552, the time complexity is diminished from O(max{mn(rho-1),m(rho-2)n(2)}<middle dot>(logq)(2)) to O((mn+m(2))lambda log q + mn(log q)(2)). The comprehensive results of our experimental performance evaluations substantiate the protocol's practical efficiency and effectiveness.
引用
收藏
页码:913 / 927
页数:15
相关论文
共 57 条
[1]  
Apostol T., 1998, Undergraduate Texts in Mathematics
[2]  
Atallah M.J., 2010, Proc. ACM Symp. on Information, P48, DOI DOI 10.1145/1755688.1755695
[3]  
Atallah MJ, 2001, ADV COMPUT, V54, P215
[4]   Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields [J].
Barbulescu, Razvan ;
Gaudry, Pierrick ;
Guillevic, Aurore ;
Morain, Francois .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2015, PT I, 2015, 9056 :129-155
[5]  
Bernstein D. S., 2005, MATRIX MATH THEORY F
[6]  
Bona Miklos., 2004, DISCRETE MATH ITS AP
[7]   Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud [J].
Chen, Fei ;
Xiang, Tao ;
Yang, Yuanyuan .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (03) :2141-2151
[8]   New Algorithms for Secure Outsourcing of Large-Scale Systems of Linear Equations [J].
Chen, Xiaofeng ;
Huang, Xinyi ;
Li, Jin ;
Ma, Jianfeng ;
Lou, Wenjing ;
Wong, Duncan S. .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2015, 10 (01) :69-78
[9]   New Algorithms for Secure Outsourcing of Modular Exponentiations [J].
Chen, Xiaofeng ;
Li, Jin ;
Ma, Jianfeng ;
Tang, Qiang ;
Lou, Wenjing .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (09) :2386-2396
[10]  
Cheng Qian, 2015, Cloud Computing and Security. First International Conference, ICCCS 2015. Revised Selected Papers: LNCS 9483, P25, DOI 10.1007/978-3-319-27051-7_3