A note on "achieving security, robust cheating resistance, and high-efficiency for outsourcing large matrix multiplication computation to a malicious cloud"
Zhengjun Cao, Lihua Liu

TL;DR
This paper critically analyzes Lei et al.'s scheme for secure, efficient outsourcing of large matrix multiplication to malicious clouds, highlighting its flaws and practical limitations.
Contribution
It identifies fundamental flaws in Lei et al.'s scheme, particularly over the infinite field R, and discusses the impracticality of its communication costs.
Findings
Lei et al.'s scheme fails over the infinite field R due to verification issues.
Computational errors over R are significant and must be addressed.
Communication costs may outweigh computational benefits in the scheme.
Abstract
We show that the Lei et al.'s scheme [Information Sciences, 280 (2014), 205-217] fails, because the verifying equation does not hold over the infinite field R. For the field R, the computational errors should be considered seriously. We also remark that the incurred communication cost in the scheme could be overtake the computational gain, which makes it somewhat artificial.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Stochastic Gradient Optimization Techniques · Complexity and Algorithms in Graphs
