The full text of this article


A probabilistic verification algorithm against spoofing attacks on remote data storage
by Guangwei Xu; Yanbin Yang; Cairong Yan; Yanglan Gan
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 9, No. 3, 2016


Abstract: Remote data storage is a promising service and deployed in large-scale. The verification of data integrity is an important measure to protect the data from data corruption or loss in remote data storage environments. Current verification algorithms are mainly oriented to the service providers who may provide the false verification metadata or force the user to take fewer verification requests owing to the verification expense. To solve these issues, we propose a probabilistic verification algorithm to execute the routine verification and apply the homomorphism-based method to perform the challenge verification. The algorithm improves the metadata generation and innovates the metadata replacement to decrease the cost of verification and avoid the limitation of the traditional hash-based verification only executing for finite rounds. Theoretic analysis and simulation results demonstrate that our algorithm resists the spoofing attack as well as the excessive computation overhead at the expense of less cost in terms of verification data storage, transmission, and computation.

Online publication date: Wed, 13-Apr-2016


is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:


    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email