Open AccessPosted Content
PORs: Proofs of Retrievability for Large Files
Ari Juels,Burton S. Kaliski +1 more
TLDR
This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.Abstract:
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.read more
Citations
More filters
Journal ArticleDOI
Review: A survey on security issues in service delivery models of cloud computing
S. Subashini,V. Kavitha +1 more
TL;DR: A survey of the different security risks that pose a threat to the cloud is presented and a new model targeting at improving features of an existing model must not risk or threaten other important features of the current model.
Posted Content
Provable Data Possession at Untrusted Stores.
Giuseppe Ateniese,Randal Burns,Reza Curtmola,Joseph Herring,Lea Kissner,Zachary N. J. Peterson,Dawn Song +6 more
TL;DR: Ateniese et al. as discussed by the authors introduced the provable data possession (PDP) model, which allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it.
Book ChapterDOI
The knowledge complexity of interactive proof-systems
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage.
Journal ArticleDOI
Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing
TL;DR: To achieve efficient data dynamics, the existing proof of storage models are improved by manipulating the classic Merkle Hash Tree construction for block tag authentication, and an elegant verification scheme is constructed for the seamless integration of these two salient features in the protocol design.
Proceedings ArticleDOI
Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing
TL;DR: This paper utilize and uniquely combine the public key based homomorphic authenticator with random masking to achieve the privacy-preserving public cloud data auditing system, which meets all above requirements.
References
More filters
Journal ArticleDOI
On the security of auditing mechanisms for secure cloud storage
TL;DR: This paper investigates the active adversary attacks in three auditing mechanisms for shared data in the cloud, including two identity privacy-preserving auditing techniques called Oruta and Knox, and a distributed storage integrity auditing mechanism, and shows that these schemes become insecure when active adversaries are involved in thecloud storage.
Journal ArticleDOI
DeyPoS: Deduplicatable Dynamic Proof of Storage for Multi-User Environments
TL;DR: An efficient construction called DeyPoS is proposed, to achieve dynamic Proof of Storage and secure cross-user deduplication, simultaneously, and to build a novel tool called Homomorphic AuthenticatedTree (HAT) to address challenges such as structure diversity and private tag generation.
Proceedings ArticleDOI
Integrity Verification of Multiple Data Copies over Untrusted Cloud Servers
Ayad Barsoum,M. Anwar Hasan +1 more
TL;DR: A pairing-based provable multi-copy data possession (PB-PMDP) scheme, which provides evidence to the customers that all outsourced copies are actually stored and remain intact, and allows authorized users to seamlessly access the file copies stored by the CSP, and supports public verifiability.
Journal ArticleDOI
Provable multiple replication data possession with full dynamics for secure cloud storage
TL;DR: This paper proposes a provable multiple replication data possession protocol with full dynamics, named MR‐DPDP, and utilizes a novel authenticated data structure called Merkle hash tree with rank to support both full dynamic data updates and efficient integrity verification.
Journal ArticleDOI
FRR: Fair remote retrieval of outsourced private medical records in electronic health networks
TL;DR: This paper realizes the first FRR scheme by exploiting fair multi-member key exchange and homomorphic privately verifiable tags and is provably secure in the random oracle model (ROM).