An Efficient Public Auditing Protocol With Novel Dynamic Structure for Cloud Data

• Published in: IEEE transactions on information forensics and security Vol. 12; no. 10; pp. 2402 - 2415
• Main Authors: Jian Shen, Jun Shen, Xiaofeng Chen, Xinyi Huang, Susilo, Willy
• Format: Journal Article
• Language: English
• Published: IEEE 01-10-2017
• Subjects: Arrays; Auditing protocol; batch auditing; Cloud computing; cloud storage; dynamic databases; Indexes; Outsourcing; Protocols; Security; Switches
• ISSN: 1556-6013; 1556-6021
• DOI: 10.1109/TIFS.2017.2705620

With the rapid development of cloud computing, cloud storage has been accepted by an increasing number of organizations and individuals, therein serving as a convenient and on-demand outsourcing application. However, upon losing local control of data, it becomes an urgent need for users to verify whether cloud service providers have stored their data securely. Hence, many researchers have devoted themselves to the design of auditing protocols directed at outsourced data. In this paper, we propose an efficient public auditing protocol with global and sampling blockless verification as well as batch auditing, where data dynamics are substantially more efficiently supported than is the case with the state of the art. Note that, the novel dynamic structure in our protocol consists of a doubly linked info table and a location array. Moreover, with such a structure, computational and communication overheads can be reduced substantially. Security analysis indicates that our protocol can achieve the desired properties. Moreover, numerical analysis and real-world experimental results demonstrate that the proposed protocol achieves a given efficiency in practice.