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 Article
Secure and Constant Cost Public Cloud Storage Auditing with Deduplication
TL;DR: This paper takes care of this open issue with a novel plan in view of strategies including polynomial-based validation labels and homomorphic straight authenticators and beats existing POR and PDP plans while giving the extra usefulness of deduplication.
Journal ArticleDOI
Towards achieving flexible and verifiable search for outsourced database in cloud computing
TL;DR: A novel verifiable search scheme for outsourced database based on invertible Bloom filter (IBF), which can achieve verifiability of search result without the process of pre-counting is proposed.
Proceedings ArticleDOI
LoSt: location based storage
Gaven J. Watson,Reihaneh Safavi-Naini,Mohsen Alimomeni,Michael E. Locasto,Shivaramakrishnan Narayan +4 more
TL;DR: It is shown secure and efficient PoL schemes can be constructed by using a geolocation scheme and a Proof of Retrievability (PoR) scheme with a new added property that the authors call re-coding, which is of independent interest.
Journal ArticleDOI
Provable Data Possession of Resource-constrained Mobile Devices in Cloud Computing
TL;DR: This paper proposes a novel public PDP scheme, in which the trusted third-party agent (TPA) takes over most of the calculations from the mobile end-users, and aggregates the verification tokens of the data file into one small signature to reduce communication and storage burden.
Proceedings ArticleDOI
Public Auditing for Big Data Storage in Cloud Computing -- A Survey
TL;DR: This paper provides an analysis on authenticator-based efficient data integrity verification, summarizes the research motivations, methodologies as well as main achievements of several of the representative approaches, and tries to bring forth a blueprint for possible future developments.
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.