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
Improved Write Access Control and Stronger Freshness Guarantee to Outsourced Data
Naveen Kumar,Anish Mathuria +1 more
TL;DR: The misbehavior by users who attempt to modify the own written data files is addressed using proof messages from the service provider so that a read request will return the latest version of the data file at least until the time when the datafile is sent from theservice provider to a reader.
Proceedings ArticleDOI
Secure public-auditing cloud storage enabling data dynamics in the standard model
TL;DR: This work employs a data integrity auditing protocol based on the strong RSA assumption, and extends it to enable a third party auditor to audit client's data without learning the data content, which achieves high security level in the standard model.
On the Security of an Mutual Verifiable Provable Data Auditing in Public Cloud Storage.
Jianhong Zhang,Pengyan Li,Min Xu +2 more
TL;DR: An improved PDP scheme is given to overcome the above flaws and is shown to be secure under the ChosenTarget-CDH problem and the CDH problem.
Book ChapterDOI
Deduplication-friendly watermarking for multimedia data in public clouds
TL;DR: To store large volumes of cloud data, cloud storage providers (CSPs) use deduplication, by which if data from multiple owners are identical, only one unique copy will be stored, benefiting both CSPs and data owners.
Data Partitioning Technique to Improve Cloud Data Storage Security
TL;DR: The key idea behind this paper is to develop a dynamic load balancing algorithm to balance the load across the storage nodes during the expansion of private cloud storage.