An Efficient Dynamic Proof of Retrievability Scheme.docVIP

An Efficient Dynamic Proof of Retrievability Scheme Data security is a significant issue in cloud storage systems. After outsourcing data to cloud servers， clients lose physical control over the data. To guarantee clients that their data is intact on the server side， some mechanism is needed for clients to periodically check the integrity of their data. Proof of retrievability （PoR） is designed to ensure data integrity. However， most prior PoR schemes focus on static data， and existing dynamic PoR is inefficient. In this paper， we propose a new version of dynamic PoR that is based on a B+ tree and a Merkle hash tree. We propose a novel authenticated data structure， called Cloud Merkle B+ tree （CMBT）. By combining CMBT with the BLS signature， dynamic operations such as insertion， deletion， and modification are supported. Compared with existing PoR schemes， our scheme improves worst-case overhead from O （n ） to O （log n ）. cloud storage； proof of retrievability； data integrity； B+ tree 1 Introduction loud storage is an online storage model. A cloud storage business provides data access and storage services with pay-as-you-go options. Developers and users can easily adapt resources to their needs and do not need to know the physical location or configuration of the system that delivers services. This elasticity， provided without any need for investment， is attracting more and more people to use cloud storage. Although it is as a promising service model， cloud storage also creates security problems. One of the main problems is the integrity of data stored in the cloud. After outsourcing the data to an offsite storage system and deleting the local copies， a client is relieved of the burden of storage. At the same time， it loses its physical control over the data. A cloud storage system is maintained by a third party who rarely has an infallible security system. Therefore， it is extremely important for the clients to have an effective way of periodically checking the inte