Abstract
We remark that the Wang et al.'s scheme [ IEEE Transanction Parallel Distributed Systems , 24 (6), 1172-1181, 2013] fails because the involved homomorphic encryption system is invalid in the context of the scheme. This is due to that the general arithmetic over the field $\mathbb {R}$ (the outsourced linear equations are constrained to the field) is not compatible with the modular arithmetic over any finite domain (the homomorphic encryption is constrained to the domain).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Parallel and Distributed Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
