By Topic

Ensuring Dynamic Data Integrity with Public Auditability for Cloud Storage

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Long Chen ; Inst. of Comput. Forensics, Chongqing Univ. of Posts & Telecommun., Chongqing, China ; Hongbo Chen

Cloud computing brings about not only the improvement of resources utilization efficiency and conveniences, but also great challenges in the field of data security and privacy protection. One major challenge is to verify data integrity at untrusted server under the condition of supporting public audit ability and dynamic data operation. This paper analyzes the efficiency issues and security loophole of a current scheme, constructs dynamic Merkle hash tree with relative index to compute the index of leaf node quickly, and proposes an improved dynamic data integrity scheme based on this tree structure for cloud storage. The performances and security analysis show that our scheme is efficient and secure, the computation complexity of dynamic data operation and integrity verification reaches O (log n) definitely.

Published in:

Computer Science & Service System (CSSS), 2012 International Conference on

Date of Conference:

11-13 Aug. 2012