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
Proceedings ArticleDOI
Research on trust-based access control model in cloud computing
TL;DR: A trust-based dynamic access control model for cloud computing environment inspired by the GTRBAC model is proposed, where the users can validate their legal identities and acquire their access control privileges according to the role information and the trust-degree in the lightweight certificates.
Journal ArticleDOI
Cryptanalysis and improvement of Panda - public auditing for shared data in cloud and internet of things
TL;DR: This analysis shows that Panda is vulnerable to integrity forgery attack, which can be performed by malicious cloud servers to forge a valid auditing proof against any auditing challenge even without correct data storage, and proposes an improvement of Panda together with data privacy preserving and sound public auditing while incurring optimal communication and computation overhead.
Identifying Data Integrity in the Cloud Storage
Saranya Eswaran,Sunitha Abburu +1 more
TL;DR: The aim of this research is ensuring the integrity of the data and providing the proof that data is in secured manner and providing Cryptographic key to secure the data in the cloud.
Journal ArticleDOI
Auditing a Cloud Provider’s Compliance With Data Backup Requirements: A Game Theoretical Analysis
TL;DR: This paper considers the case in which each type of data is replicated a number of times, which can depend on a set of parameters including, among others, its size and sensitivity, and formulates the problem as a two player non-cooperative game.
Proceedings ArticleDOI
Towards self-repairing replication-based storage systems using untrusted clouds
Bo Chen,Reza Curtmola +1 more
TL;DR: The main insight behind RDC -- SR is that the replicas are differentiated based on a controllable amount of masking, which offers R DC -- SR flexibility in handling different adversarial strengths.
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.