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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.