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
Verifying remote data integrity in peer-to-peer data storage: A comprehensive survey of protocols
TL;DR: This paper surveys protocols that verify remote data possession and analyzes several of these protocols, comparing them with respect to expected security guarantees and discuss their limitations.
Journal ArticleDOI
Ownership-hidden group-oriented proofs of storage from pre-homomorphic signatures
Yujue Wang,Yujue Wang,Qianhong Wu,Qianhong Wu,Bo Qin,Bo Qin,Xiaofeng Chen,Xinyi Huang,Jungang Lou +8 more
TL;DR: This paper introduces and formalizes a notion of ownership-hidden group-oriented proofs of storage (OPoS), presents a generic OPoS construction from pre-homomorphic signatures, and proposes an OPoS instantiation by employing the Boneh–Boyen short signature.
Journal ArticleDOI
Multiple-replica integrity auditing schemes for cloud data storage
TL;DR: This paper presents the system model and security threats of outsourcing data to the cloud with classification of ongoing developments, and summarize and analyze the state‐of‐the‐art multiple‐replica integrity auditing schemes in cloud data storage.
Proceedings ArticleDOI
Sharing Proofs of Retrievability across Tenants
TL;DR: This paper proposes a novel storage-efficient POR, dubbed SPORT, which transparently supports multi-tenancy and data deduplication, and enables tenants to securely share the same POR tags in order to verify the integrity of their dedUplicated files.
Journal ArticleDOI
A new publicly verifiable data possession on remote storage
Chun-ming Tang,Xiao-jun Zhang +1 more
TL;DR: A new verifiable data possession construction supporting both private and public verifiability simultaneously is proposed from a linearly homomorphic cryptography method, which allows a server to integrate l selected block-tag pairs into a single block- tag pair as a response to user’s query.
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.