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
Efficient Verifiable Databases With Insertion/Deletion Operations From Delegating Polynomial Functions
TL;DR: This paper introduces a new primitive called Merkle sum hash tree and uses it to design a new VDB scheme that supports for all updating operations from delegating polynomial functions and formally proves that the proposed construction can achieve the desired security properties when the subgroup member assumption holds.
Journal ArticleDOI
Optimized Public Auditing and Data Dynamics for Data Storage Security in Cloud Computing
TL;DR: This paper optimizing an existing third party auditing protocol and making it resistant to replace, replay and forge attacks launched by malicious insiders at cloud storage server to solve the problem of data-integrity verification by a third party auditor for the client's data residing on a cloudstorage server.
Proceedings Article
Efficient simultaneous privately and publicly verifiable robust provable data possession from elliptic curves
Christian Hanser,Daniel Slamanig +1 more
TL;DR: In this paper, the authors proposed the first simultaneous privately and publicly verifiable (robust) PDP protocol, which allows the data owner to use the more efficient private verification and anyone else to run the public verification algorithm.
Proceedings ArticleDOI
A Metadata Based Storage Model for Securing Data in Cloud Environment
S. Subashini,Kavitha +1 more
TL;DR: A metadata based data segregation and storage methodology is proposed which ensures that data is invaluable during static residence and gains value only during acquisition or updation.
Proceedings ArticleDOI
Assured Deletion in the Cloud: Requirements, Challenges and Future Directions
TL;DR: This work analyzes assured deletion requirements for the cloud, identifying cloud features that pose a threat to assured deletion, and describing various assured deletion challenges, and proposes an initial assured deletion architecture for cloud settings.
References
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.
Journal ArticleDOI
Efficient dispersal of information for security, load balancing, and fault tolerance
TL;DR: Information Dispersal Algorithm (IDA) has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission ofInformation in networks, and to communications between processors in parallel computers.
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.
Proceedings Article
Raptor codes
TL;DR: For a given integer k, and any real /spl epsiv/>0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + /spl Epsiv/) is sufficient to recover the original k symbols, with high probability as mentioned in this paper.