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
Proceedings ArticleDOI
Lock and Load: A Model for Free Blockchain Transactions through Token Locking
TL;DR: A model for free transactions on the blockchain where a client can lock their tokens to generate new tokens for storage providers, and how this reward mechanism can help to facilitate an audit of the storage provider.
Posted Content
MuR-DPA: Top-down Levelled Multi-replica Merkle Hash Tree Based Secure Public Auditing for Dynamic Big Data Storage on Cloud.
TL;DR: Compared to existing integrity verification and public auditing schemes, the proposed MuR-DPA scheme can not only incur much less communication overhead for both update verification and integrity verification of cloud datasets with multiple replicas, but also provide enhanced security against dishonest cloud service providers.
Journal ArticleDOI
Bi-directional and concurrent proof of ownership for stronger storage services with de-duplication
Taek-Young Youn,Ku Young Chang +1 more
TL;DR: A generic strategy which can help to construction a bi-directional and concurrent proof of ownership technique from an ordinary proof of Ownership technique is described, and an efficient hash-based scheme with security proof in the random oracle model is given.
Journal ArticleDOI
Toward Owners’ Control in Digital Data Markets
TL;DR: The issues and challenges toward empowering individuals to use a data market platform for trading their data while keeping control over them are discussed and existing techniques can be possibly adapted to address these issues.
Journal ArticleDOI
Efficient Integrity Verification Scheme for Medical Data Records in Cloud-Assisted Wireless Medical Sensor Networks
TL;DR: An efficient integrity verification scheme for medical data records in cloud-assisted WMSNs is proposed, based on elliptic curve digital signature algorithm, and linearly homomorphic authenticator is constructed, so that the third party auditor (TPA) can verify the the integrity ofmedical data records without bringing in new security threats.