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
Advanced Cooperative Provable Data Possession based Data Integrity Verification for Multi-Cloud Storage
Vaibhav Bharati,M. R. Patil +1 more
TL;DR: PDP model for integrity verification of data on distributed multicloud storage by using web-servers and Trusted Third Party is proposed and techniques such as, Advanced Cooperative Provable Data Possession, Homomorphic Verifiable Response and Hash Index Hierarchy for Multiprover Zero Knowledge Proof System which is an Interactive Proof System are proposed.
Journal ArticleDOI
An Efficient Integrity Verification and Authentication Scheme over the Remote Data in the Public Clouds for Mobile Users
TL;DR: A novel scheme is introduced to verify the integrity of the data stored in the remote cloud servers in the context of mobile users and the proposed protocol is provably secure exhibiting soundness, completeness, and data privacy making it an ideal scheme for implementation in the real-world applications.
Journal ArticleDOI
Security and Integrity of Data in Cloud Computing Based on Feature Extraction of Handwriting Signature
TL;DR: This paper proposes the use of encrypted data integrity by presenting the feature extraction of handwriting signature in a modern encryption scheme that preserves the integrity of data in cloud server and presents a proof of data integrity in the cloud.
Proceedings ArticleDOI
Provably Secure Virus Detection: Using The Observer Effect Against Malware.
TL;DR: This work provides a formal model and cryptographic security definitions of attestation for systems with dynamic memory, and suggests novel provably secure attestation schemes that use the very insertion of the malware itself to allow for the systems to detect it.
Journal ArticleDOI
A Secure and Effective Anonymous Integrity Checking Protocol for Data Storage in Multicloud
TL;DR: An identity-based data storage and integrity verification protocol on untrusted cloud is proposed that can guarantee fair results without any third verifying auditor and the theoretical analysis and simulation results show that the protocols are secure and efficient.
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.