Title :
Ensuring Dynamic Data Integrity with Public Auditability for Cloud Storage
Author :
Chen, Long ; Chen, Hongbo
Author_Institution :
Inst. of Comput. Forensics, Chongqing Univ. of Posts & Telecommun., Chongqing, China
Abstract :
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.
Keywords :
cloud computing; computational complexity; cryptography; data integrity; storage management; tree data structures; trees (mathematics); cloud computing; cloud storage; computation complexity; dynamic Merkle hash tree; dynamic data integrity scheme; dynamic data operation; leaf node index computation; public auditability; resources utilization convenience improvement; resources utilization efficiency improvement; security analysis; security loophole; tree structure; untrusted server; Authentication; Cloud computing; Complexity theory; Indexes; Protocols; Servers; cloud computing; data integrity; dynamic data; public auditability;
Conference_Titel :
Computer Science & Service System (CSSS), 2012 International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4673-0721-5
DOI :
10.1109/CSSS.2012.183