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
Book ChapterDOI
An Efficient Provable Multi-copy Data Possession Scheme with Data Dynamics.
TL;DR: An efficient provable multi-copy data possession scheme with data dynamics (EPMDP) is proposed, which is a kind of authenticated 2-3 tree with arrays in ordered leaves (A2-3AOL) and used to construct EPMDP and has strong security and good performance.
Privacy-preserving access control techniques in distributed systems
TL;DR: This thesis proposes privacy-preserving access control schemes where users’ personal sensitive information, such as access credentials, identities and attributes, can be protected and develops two identity-based data storage schemes, which are secure against collusion attacks.
Proceedings ArticleDOI
A Novel Third Party Integrity Checker (TPIC) based Data Auditing for Security of the Dynamic Streaming Client Data in a Cloud Infrastructure
TL;DR: The Third Party Integrity Checker (TPIC) based data auditing for security of the dynamic streaming client data in a cloud infrastructure allows the integrity checking of the periodically changing dynamic data.
Proceedings ArticleDOI
Poster: Proofs of Retrievability with Low Server Storage
Michael Hanling,Gaspard Anthoine,Jean-Guillaume Dumas,Aude Maignan,Clément Pernet,Daniel S. Roche +5 more
TL;DR: Compared to existing audit routines, the server computation cost and bandwidth are higher, but the server storage cost is minimal, and preliminary work indicates that deploying this scheme may be less costly in commercial cloud settings, depending on the cost structure and frequency of audits.
Dissertation
Cloud security - An approach with modern cryptographic solutions
TL;DR: This thesis reviews the new cryptographic techniques used to protect and process encrypted data in a remote cloud storage and proposes a cryptographic scheme which uses fingerprint scanning for user authentication and AES technique of 128/192/256 bit cipher key for encryption and decryption of user's data.
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.