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
DissertationDOI
Usable assured deletion in the cloud
TL;DR: This thesis provides a conceptual framework for the design of usable assured deletion in the cloud and formulates user requirements and principles for usable assured Deleting in a usable way and identifies the cloud provider requirements for usable assurances.
Journal ArticleDOI
An alternative approach to public cloud data auditing supporting data dynamics
TL;DR: A scheme which explores the linear homomorphic signature and the sequence Merkle hash tree to construct the homomorphic linear authenticator for the PoR protocols and can be regarded as a novel paradigm.
Journal ArticleDOI
Provable Storage Medium for Data Storage Outsourcing
TL;DR: This paper addresses the problem of properly establishing specific clauses in the service level agreement (SLA) intended to guarantee a short and predictable retrieval time, and introduces the concept of Provable Storage Medium (PSM), to denote the ability of a user to efficiently verify that the provider is complying to this aspect of the SLA.
Proceedings ArticleDOI
Intelligent temporal role based access control for data storage in cloud database
TL;DR: A new security mechanism for cloud computing with a focus on access control is proposed and the traditional RBAC is modified to suit the security cloud requirements of databases by providing temporal extensions and intelligent agents.
Journal ArticleDOI
An efficient management scheme of blockchain-based cloud user information using probabilistic weighting
Yoon-Su Jeong,Byeongtae Ahn +1 more
TL;DR: A blockchain-based cloud user information management scheme is proposed using stochastic weights to confirm that the information of users receiving cloud services has not been tampered with, and allows the provision of reliable real-time cloud services by creating a stoChastic sum of weights for the first and last users that make up the cloud.