arXiv · 1603.07399
A note on "achieving security, robust cheating resistance, and high-efficiency for outsourcing large matrix multiplication computation to a malicious cloud"
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.
Explore related subjects
Keep this discovery
Zhengjun Cao, Lihua Liu. 2016-03-24. A note on "achieving security, robust cheating resistance, and high-efficiency for outsourcing large matrix multiplication computation to a malicious cloud". https://arxiv.org/abs/1603.07399
Cite the original work for its findings. Save a collection to share your selection of sources.