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, s...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 BES 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）.展开更多
With the development of cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Therefore,much of growing interest has been pursed in the context of the integrity verifica...With the development of cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Therefore,much of growing interest has been pursed in the context of the integrity verification of cloud storage.Provable data possession(PDP)and Proofs of retrievablity(POR)are two kinds of important scheme which can guarantee the data integrity in the cloud storage environments.The main difference between them is that POR schemes store a redundant encoding of the client data on the server so as to she has the ability of retrievablity while PDP does not have.Unfortunately,most of POR schemes support only static data.Stefanov et al.proposed a dynamic POR,but their scheme need a large of amount of client storage and has a large audit cost.Cash et al.use Oblivious RAM(ORAM)to construct a fully dynamic POR scheme,but the cost of their scheme is also very heavy.Based on the idea which proposed by Cash,we propose dynamic proofs of retrievability via Partitioning-Based Square Root Oblivious RAM(DPoR-PSR-ORAM).Firstly,the notions used in our scheme are defined.The Partitioning-Based Square Root Oblivious RAM(PSR-ORAM)protocol is also proposed.The DPOR-PSR-ORAM Model which includes the formal definitions,security definitions and model construction methods are described in the paper.Finally,we give the security analysis and efficiency analysis.The analysis results show that our scheme not only has the property of correctness,authenticity,next-read pattern hiding and retrievabiltiy,but also has the high efficiency.展开更多
基金supported in part by the US National Science Foundation under grant CNS-1115548 and a grant from Cisco Research
文摘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 BES 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）.
基金This work is supported,in part,by the National Natural Science Foundation of China under grant No.61872069in part,by the Fundamental Research Funds for the Central Universities(N171704005)in part,by the Shenyang Science and Technology Plan Projects(18-013-0-01).
文摘With the development of cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Therefore,much of growing interest has been pursed in the context of the integrity verification of cloud storage.Provable data possession(PDP)and Proofs of retrievablity(POR)are two kinds of important scheme which can guarantee the data integrity in the cloud storage environments.The main difference between them is that POR schemes store a redundant encoding of the client data on the server so as to she has the ability of retrievablity while PDP does not have.Unfortunately,most of POR schemes support only static data.Stefanov et al.proposed a dynamic POR,but their scheme need a large of amount of client storage and has a large audit cost.Cash et al.use Oblivious RAM(ORAM)to construct a fully dynamic POR scheme,but the cost of their scheme is also very heavy.Based on the idea which proposed by Cash,we propose dynamic proofs of retrievability via Partitioning-Based Square Root Oblivious RAM(DPoR-PSR-ORAM).Firstly,the notions used in our scheme are defined.The Partitioning-Based Square Root Oblivious RAM(PSR-ORAM)protocol is also proposed.The DPOR-PSR-ORAM Model which includes the formal definitions,security definitions and model construction methods are described in the paper.Finally,we give the security analysis and efficiency analysis.The analysis results show that our scheme not only has the property of correctness,authenticity,next-read pattern hiding and retrievabiltiy,but also has the high efficiency.
