The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
New Algorithms for Secure Outsourcing of Large-Scale Systems of Linear Equations
Abstract
With the rapid development in availability of cloud services, the techniques for securely outsourcing the prohibitively expensive computations to untrusted servers are getting more and more attentions in the scientific community. In this paper, we investigate secure outsourcing for large-scale systems of linear equations, which are the most popular problems in various engineering disciplines. For the first time, we utilize the sparse matrix to propose a new secure outsourcing algorithm of large-scale linear equations in the fully malicious model. Compared with the state-of-the-art algorithm, the proposed algorithm only requires (optimal) one round communication (while the algorithm requires $L$ rounds of interactions between the client and cloud server, where $L$ denotes the number of iteration in iterative methods). Furthermore, the client in our algorithm can detect the misbehavior of cloud server with the (optimal) probability 1. Therefore, our proposed algorithm is superior in both efficiency and checkability. We also provide the experimental evaluation that demonstrates the efficiency and effectiveness of our algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Self-testing/correcting with applications to numerical problems
Blum, M., Luby, M., & Rubinfeld, R. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90044-w · Cited by 712
Cited by
Secure Multi-Party Computation: Theory, practice and applications
Zhao, C., Zhao, S., Zhao, M., Chen, Z., Gao, C.-Z., Li, H., & Tan, Y.-A. (2019) · Information Sciences · doi:10.1016/j.ins.2018.10.024 · Cited by 508
Bus-Trajectory-Based Street-Centric Routing for Message Delivery in Urban Vehicular Ad Hoc Networks
Sun, G., Zhang, Y., Liao, D., Yu, H., Du, X., & Guizani, M. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2828651 · Cited by 270
Shen, J., Gui, Z., Ji, S., Shen, J., Tan, H., & Tang, Y. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.01.003 · Cited by 267
Zhang, H., Yu, J., Tian, C., Zhao, P., Xu, G., & Lin, J. (2018) · IEEE Access · doi:10.1109/access.2018.2857205 · Cited by 45
Farajallah, M., Assad, S. E., & Deforges, O. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6015-4 · Cited by 19
Metadata
- Authors
- Chen, X., Huang, X., Li, J., Ma, J., Lou, W., & Wong, D. S.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2015-01
- Volume
- 10
- Issue
- 1
- Pages
- 69-78
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2093909024
- Cited by
- 219
- References
- 2
- FWCI
- 13.20
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: New Algorithms for Secure Outsourcing of Large-Scale Systems of Linear Equations. https://app.cochat.ai/papers/10.1109/tifs.2014.2363765
- The paper
- Chen, X., Huang, X., Li, J., Ma, J., Lou, W., & Wong, D. S. (2015). New Algorithms for Secure Outsourcing of Large-Scale Systems of Linear Equations. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2014.2363765
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.