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
A secure and scalable data integrity auditing scheme based on hyperledger fabric
TL;DR: This paper proposes an efficient decentralized data integrity auditing scheme based on Hyperledger Fabric (HF-Audit), a popular consortium blockchain, and uses HyperLedger Fabric as a communication platform, where TPA can be dynamically selected for each auditing task.
Book ChapterDOI
An Overview of Issues and Recent Developments in Cloud Computing and Storage Security
TL;DR: The goal of this chapter is to provide a broad overview of recent literature covering various aspects of cloud security, including recently discovered attacks on cloud providers and their countermeasures, as well as protection mechanisms that aim at improving privacy and integrity of client's data and computations.
Proceedings ArticleDOI
A dynamic Proof of Retrievability (PoR) scheme with O(logn) complexity
Zhen Mo,Yian Zhou,Shigang Chen +2 more
TL;DR: A new version of authenticated data structure based on a B+ tree and a merkle hash tree is developed and a dynamic version of PoR scheme is proposed, which can be extended to dynamic scenario and its worst case communication complexity is O(logn) instead of O(n).
Journal ArticleDOI
Security transparency: the next frontier for security research in the cloud
TL;DR: It is argued that undertaking some initiatives in that direction is a key to sustaining the current momentum of the cloud, and proposes some routes towards related solutions by discussing a number of desiderata for establishing a better security transparency between a Cloud Service Provider (CSP) and a Cloud service Consumer (CSC).
Journal ArticleDOI
Adaptive SOA Solution Stack
TL;DR: This paper presents the concept of an Adaptive SOA Solution Stack (AS3), an extension of the S3 model, implemented via uniform application of the AS3 element pattern across different layers of the model.
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.