Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Secure and Efficient Protocol for Outsourcing Large-Scale Systems of Linear Equations to the Cloud

Cheng Qian, Jian Wang

Published Jan 1, 2015• 5 citations
Publisher
DOI
10.1007/978-3-319-27051-7_3

Related papers

Privacy-preserving large-scale systems of linear equations in outsourcing storage and computation

Dongmei Li, Xiaolei Dong, Zhenfu Cao +1 more

Science China Information Sciences•Feb 2, 2018•7 citations

More Secure Outsource Protocol for Matrix Multiplication in Cloud Computing

Xu An Wang, Shuaishuai Zhu, Arun Kumar Sangaiah +2 more

Lecture notes on data engineering and communications technologies•Oct 16, 2018•3 citations

Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud

Fei Chen, Tao Xiang, Yuanyuan Yang

Journal of Parallel and Distributed Computing•Dec 8, 2013•68 citations

Elliptic Curve Based Secure Outsourced Computation in Multi-party Cloud Environment

V. Thangam, K. Chandrasekaran

Communications in computer and information science•Jan 1, 2016•1 citation

A Secure and Efficient Computation Outsourcing Scheme for Multi-users

Vemuri Sudarsan Rao, N. Satyanarayana

Communications in computer and information science•Jan 1, 2018•1 citation

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

Chengliang Tian, Jia Yu, Panpan Meng +3 more

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 ($\mathcal {LMLSE}$) of the form$\mathbf {A}\mathbf {x}\equiv \mathbf {b}\;{\rm mod}\;{q}$poses a significant challenge, particularly for lightweight devices. This paper delves into the secure outsourcing of$\mathcal {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$\mathbf {A},\mathbf {b}, q$, and the output$\mathbf {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$\mathbf {A}$, a given parameter$\lambda =\omega (\log q)$, and$\rho =2.371552$, the time complexity is diminished from$O(\max \lbrace m n^{\rho -1}, m^{\rho -2} n^{2}\rbrace \cdot (\log q)^{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.

IEEE Transactions on Cloud Computing•Jun 3, 2024•2 citations
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\mathcal {LMLSE}LMLSE) of the formAx≡b  mod  q\mathbf {A}\mathbf {x}\equiv \mathbf {b}\;{\rm mod}\;{q}Ax≡bmodqposes a significant challenge, particularly for lightweight devices. This paper delves into the secure outsourcing ofLMLSE\mathcal {LMLSE}LMLSEunder 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, encompassingA,b,q\mathbf {A},\mathbf {b}, qA,b,q, and the outputx\mathbf {x}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 anmmm-by-nnnmatrixA\mathbf {A}A, a given parameterλ=ω(log⁡q)\lambda =\omega (\log q)λ=ω(logq), andρ=2.371552\rho =2.371552ρ=2.371552, the time complexity is diminished fromO(max⁡{mnρ−1,mρ−2n2}⋅(log⁡q)2)O(\max \lbrace m n^{\rho -1}, m^{\rho -2} n^{2}\rbrace \cdot (\log q)^{2})O(max{mnρ−1,mρ−2n2}⋅(logq)2)toO((mn+m2)λlog⁡q+mn(log⁡q)2)O((mn+m^{2})\lambda \log q+mn(\log q)^{2})O((mn+m2)λlogq+mn(logq)2). The comprehensive results of our experimental performance evaluations substantiate the protocol's practical efficiency and effectiveness.