Table of Content

Open Access iconOpen Access

ARTICLE

Dynamic Proofs of Retrievability Based on Partitioning-Based Square Root Oblivious RAM

Jian Xu1,2,*, Zhihao Jiang1, Andi Wang1, Chen Wang1, Fucai Zhou1

Software College, Northeastern University, Shenyang, 110169, China.
State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093, China.

* Corresponding Author: Jian Xu. Email: email.

Computers, Materials & Continua 2018, 57(3), 589-602. https://doi.org/10.32604/cmc.2018.03820

Abstract

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.

Keywords


Cite This Article

APA Style
Xu, J., Jiang, Z., Wang, A., Wang, C., Zhou, F. (2018). Dynamic proofs of retrievability based on partitioning-based square root oblivious RAM. Computers, Materials & Continua, 57(3), 589-602. https://doi.org/10.32604/cmc.2018.03820
Vancouver Style
Xu J, Jiang Z, Wang A, Wang C, Zhou F. Dynamic proofs of retrievability based on partitioning-based square root oblivious RAM. Comput Mater Contin. 2018;57(3):589-602 https://doi.org/10.32604/cmc.2018.03820
IEEE Style
J. Xu, Z. Jiang, A. Wang, C. Wang, and F. Zhou "Dynamic Proofs of Retrievability Based on Partitioning-Based Square Root Oblivious RAM," Comput. Mater. Contin., vol. 57, no. 3, pp. 589-602. 2018. https://doi.org/10.32604/cmc.2018.03820

Citations




cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2729

    View

  • 1236

    Download

  • 0

    Like

Share Link