Provable data possession scheme with constant proof size for outsourced data in public cloud

  title={Provable data possession scheme with constant proof size for outsourced data in public cloud},
  author={B. R. Purushothama and B. B. Amberker},
  journal={2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI)},
  • B. Purushothama, B. B. Amberker
  • Published 21 October 2013
  • Computer Science
  • 2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI)
Cloud computing paradigm poses several security challenges. In the context of data outsourcing on to the untrusted cloud storage server, we focus on the problem of providing the proof of data possession to the client to check the possession of the outsourced data at the cloud storage server without downloading the data. Reducing the proof size in the provable data possession scheme is a challenging issue. We have proposed a provable data possession scheme with reduced proof size to save the… 

Tables from this paper

A study on remote data integrity checking techniques in cloud
This paper discusses the taxonomy of RDIC protocols such as Provable Data Possession, Proof of Retrievability (POR), Proof of Ownership (POW) and ID-basedRDIC protocols, and compares the existing RDIC approaches based on the parameters.
An Efficient Provable Data Possession Scheme based on Counting Bloom Filter for Dynamic Data in the Cloud Storage
This paper examines the use of a Counting Bloom Filter for updating data and finds that this technique is more efficient than using PDP when changing part of the data in a simulation, and more effective if the saved data changes parts of the dynamic data.
Dynamic Provable Data Possession using the Counting Bloom Filter in Cloud Computing Environment
This paper uses Counting Bloom Filter when metadata update to improve the problem of data integrity of security problem and suggests technique is efficient than existing PDP when changes part of data in simulator result.


Publicly Auditable Provable Data Possession Scheme for Outsourced Data in the Public Cloud Using Polynomial Interpolation
This work designs publicly auditable provable data possession scheme using polynomial interpolation technique and proves the security of the scheme under the group satisfying Computational Diffie Hellman assumption against a cheating cloud server.
Provable data possession at untrusted stores
The model generates probabilistic proofs of possession by sampling random sets of blocks from the server, which drastically reduces I/O costs and the overhead at the server is low (or even constant), as opposed to linear in the size of the data.
Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing
This paper utilize and uniquely combine the public key based homomorphic authenticator with random masking to achieve the privacy-preserving public cloud data auditing system, which meets all above requirements.
Scalable and efficient provable data possession
This paper constructs a highly efficient and provably secure PDP technique based entirely on symmetric key cryptography, while not requiring any bulk encryption, and allows outsourcing of dynamic data, i.e, it efficiently supports operations, such as block modification, deletion and append.
Compact Proofs of Retrievability
The first proof-of-retrievability schemes with full proofs of security against arbitrary adversaries in the strongest model, that of Juels and Kaliski, are given.
Remote Integrity Check with Dishonest Storage Server
The security of a proposed scheme HENC is proved and a notion, trap-door compression, that captures a property on compressibility is introduced, which brings out the question of whether there are fundamental differences between the two models.
Proofs of retrievability: theory and implementation
This framework improves the previously proposed POR constructions of Juels-Kaliski and Shacham-Waters, and also sheds light on the conceptual limitations of previous theoretical models for PORs.
Pors: proofs of retrievability for large files
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
Cryptographic Cloud Storage
We consider the problem of building a secure cloud storage service on top of a public cloud infrastructure where the service provider is not completely trusted by the customer. We describe, at a high
On the Existence of 3-Round Zero-Knowledge Protocols
This paper constructs a 3-round zero-knowledge protocol for any NP language based on a novel computational assumption related to the Diffie-Hellman problem and achieves a weaker notion of zero- Knowledge: auxiliary-input non-uniform zero- knowledge.