NDLI: A dynamic Proof of Retrievability (PoR) scheme with O(logn) complexity

Content Provider	IEEE Xplore Digital Library
Author	Zhen Mo Yian Zhou Shigang Chen
Copyright Year	2012
Description	Author affiliation: Department of Computer & Information Science & Engineering University of Florida, Gainesville, FL 32611, USA (Zhen Mo; Yian Zhou; Shigang Chen)
Abstract	Cloud storage has been gaining popularity because its elasticity and pay-as-you-go manner. However, this new type of storage model also brings security challenges. This paper studies the problem of ensuring data integrity in cloud storage. In the Proof of Retrievability (PoR) model, after outsourcing the preprocessed data to the server, the client will delete its local copies and only store a small amount of meta data. Later the client will ask the server to provide a proof that its data can be retrieved correctly. However, most of the prior PoR works apply only to static data. The existing dynamic version of PoR scheme has an efficiency problem. In this paper, we extend the static PoR scheme to dynamic scenario. That is, the client can perform update operations, e.g., insertion, deletion and modification. After each update, the client can still detect the data losses even if the server tries to hide them. We develop a new version of authenticated data structure based on a B+ tree and a merkle hash tree. We call it Cloud Merkle B+ tree (CMBT). By combining the CMBT with the BLS signature, we propose a dynamic version of PoR scheme. Compared with the existing dynamic PoR scheme, our worst case communication complexity is O(logn) instead of O(n).
Starting Page	912
Ending Page	916
File Size	202571
Page Count	5
File Format	PDF
ISBN	9781457720529
ISSN	15503607
e-ISBN	9781457720536
e-ISBN	9781457720512
DOI	10.1109/ICC.2012.6364056
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-06-10
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Servers Cloud computing Indexes Security Complexity theory Computers Data structures
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A robust scheme on proof of data retrievability in cloud

Enabling dynamic proof of retrievability in regenerating-coding-based cloud storage

SW-POR: A Novel POR Scheme Using Slepian-Wolf Coding for Cloud Storage

Data traceability in cloud environment

Fair and dynamic proofs of retrievability

SHoPS: Set Homomorphic Proof of Data Possession Scheme in Cloud Storage Applications

PGV: A Storage Enforcing Remote Verification Scheme

An Efficient Proof of Retrievability with Public Auditing in Cloud Computing

Dynamic proofs of retrievability from Chameleon-Hashes

A dynamic Proof of Retrievability (PoR) scheme with O(logn) complexity

Similar Documents

A robust scheme on proof of data retrievability in cloud

Enabling dynamic proof of retrievability in regenerating-coding-based cloud storage

SW-POR: A Novel POR Scheme Using Slepian-Wolf Coding for Cloud Storage

Data traceability in cloud environment

Fair and dynamic proofs of retrievability

SHoPS: Set Homomorphic Proof of Data Possession Scheme in Cloud Storage Applications

PGV: A Storage Enforcing Remote Verification Scheme

An Efficient Proof of Retrievability with Public Auditing in Cloud Computing

Dynamic proofs of retrievability from Chameleon-Hashes

A dynamic Proof of Retrievability (PoR) scheme with O(logn) complexity