Empirical analysis of using erasure coding in outsourcing data storage with provable security
Loading...
Authors
Bakir, Abdallah
Subjects
Proof of retrievability
proof of data possession
Erasure codes
error correcting code
cloud storage
data integrity
proof of data possession
Erasure codes
error correcting code
cloud storage
data integrity
Advisors
Gondree, Mark
Date of Issue
2016-06
Date
16-Jun
Publisher
Monterey, California: Naval Postgraduate School
Language
Abstract
Proof of retrievability (POR) and proof of data possession (PDP) are cryptographic tools for auditing big data on a storage server or in the cloud. Their goals are to verify that the server is storing data and, in case of data alteration, recovering this data. These tools provide probabilistic guarantees that the server is storing information, without accessing the entire file and providing the capability to recover the original data under certain limits. In this work, we study maximum distance separable (MDS) codes as the underlying tools providing recoverability for POR. We survey MDS codes and select Reed-Solomon and Cauchy Reed-Solomon MDS codes to be implemented into a prototype POR library. We use the liberasurecode library to evaluate multiple error-correcting code (ECC) backend implementations for these codes. We enhance the libpdp library, an open source PDP library that implements some PDP schemes, to interface with liberasurecode to measure the real-world cost of integrating erasure coding in POR implementations.
Type
Thesis
Description
Series/Report No
Department
Information Sciences (IS)
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
Copyright is reserved by the copyright owner.