Welcome to the InfoSci Platform
Reference Hub10
A Publicly Verifiable Dynamic Secret Sharing Protocol for Secure and Dependable Data Storage in Cloud Computing

A Publicly Verifiable Dynamic Secret Sharing Protocol for Secure and Dependable Data Storage in Cloud Computing

P. Syam Kumar, Marie Stanislas Ashok, R. Subramanian
Copyright: © 2012 |Volume: 2 |Issue: 3 |Pages: 25
ISSN: 2156-1834|EISSN: 2156-1826|EISBN13: 9781466611153|DOI: 10.4018/ijcac.2012070101
Cite Article Cite Article

MLA

Kumar, P. Syam, et al. "A Publicly Verifiable Dynamic Secret Sharing Protocol for Secure and Dependable Data Storage in Cloud Computing." IJCAC vol.2, no.3 2012: pp.1-25. http://doi.org/10.4018/ijcac.2012070101

APA

Kumar, P. S., Ashok, M. S., & Subramanian, R. (2012). A Publicly Verifiable Dynamic Secret Sharing Protocol for Secure and Dependable Data Storage in Cloud Computing. International Journal of Cloud Applications and Computing (IJCAC), 2(3), 1-25. http://doi.org/10.4018/ijcac.2012070101

Chicago

Kumar, P. Syam, Marie Stanislas Ashok, and R. Subramanian. "A Publicly Verifiable Dynamic Secret Sharing Protocol for Secure and Dependable Data Storage in Cloud Computing," International Journal of Cloud Applications and Computing (IJCAC) 2, no.3: 1-25. http://doi.org/10.4018/ijcac.2012070101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Data storage is an important application of cloud computing, where the users can remotely store their data into the cloud. This new paradigm of data storage service also introduces security challenges, such as Confidentiality, Integrity and Availability of data. The protection of these issues in cloud is a very challenging and potentially formidable task, especially for the users with constrained resources. Therefore, an independent auditing service is required to address these issues of data stored in the cloud. The existing schemes may not scale well for this purpose. This paper proposes a publicly verifiable dynamic secret sharing scheme for the Availability, Integrity and Confidentiality of data. Their scheme takes advantages of both Secret Sharing and Tornado code which can achieve the computational security and maintain low communication overhead in terms of shortened data dispersing size. The authors’ model gives probabilistic proofs of Integrity of data by challenging random blocks from the server to reduce the computation and communication overhead, and also supports dynamic data operations to data shares in cloud using index table. Through extensive security analysis, their scheme can provide secure, dependable, and publicly verifiable cloud data storage in the Cloud against threats. Through the performance and experimental results, the authors prove that their scheme is efficient than existing schemes.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.