Title: A probabilistic verification algorithm against spoofing attacks on remote data storage

Authors: Guangwei Xu; Yanbin Yang; Cairong Yan; Yanglan Gan

Addresses: School of Computer Science and Technology, Donghua University, Shanghai, China ' School of Computer Science and Technology, Donghua University, Shanghai, China ' School of Computer Science and Technology, Donghua University, Shanghai, China ' School of Computer Science and Technology, Donghua University, Shanghai, China

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.

Keywords: data integrity; probabilistic verification; metadata replacement; spoofing attacks; remote data storage; data security; homomorphism; simulation; computation overheads.

DOI: 10.1504/IJHPCN.2016.076264

International Journal of High Performance Computing and Networking, 2016 Vol.9 No.3, pp.218 - 229

Received: 15 Oct 2014
Accepted: 05 Apr 2015

Published online: 30 Apr 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article