Dynamic-Hash-Table Based Public Auditing for Secure Cloud Storage

2017 ◽  
Vol 10 (5) ◽  
pp. 701-714 ◽  
Author(s):  
Hui Tian ◽  
Yuxiang Chen ◽  
Chin-Chen Chang ◽  
Hong Jiang ◽  
Yongfeng Huang ◽  
...  
Author(s):  
BALAKRISHNAN K ◽  
VIDHYA R

Public auditing scheme for secure cloud storage based on dynamic hash table, which is a new two-dimensional data structure located at a third-party auditor (TPA) to record the data property information for dynamic auditing. Differing form the existing works, the proposed scheme migrates the authorized information from the cloud services provider to the TPA and thereby significantly reduces the computational cost and communication overhead. Our scheme can also achieve higher updating efficiency than the state of the art schemes. In addition, we extend our scheme to support privacy preservation by combining the homomorphic authenticator based on the public key with the random masking generated by the TPA and achieve batch auditing by employing the aggregate BLS signature technique. We formally prove the security of the proposed scheme and evaluate the auditing performance by detailed experiments and comparisons with the existing ones. The results demonstrate that the proposed scheme can effectively achieve secure auditing for cloud storage and outperform the previous schemes’ in computation complexity, storage costs, and communication overhead.


2019 ◽  
Vol 9 (4) ◽  
pp. 1-20
Author(s):  
Syam Kumar Pasupuleti

Cloud storage allows users to store their data in the cloud to avoid local storage and management costs. Since the cloud is untrusted, the integrity of stored data in the cloud has become an issue. To address this problem, several public auditing schemes have been designed to verify integrity of the data in the cloud. However, these schemes have two drawbacks: public auditing may reveal sensitive data to verifier and does not address the data recovery problem efficiently. This article proposes a new privacy-preserving public auditing scheme with data dynamics to secure the data in the cloud based on an exact regenerated code. This scheme encodes the data for availability, then masks the encoded blocks with randomness for privacy of data and enables a public auditor to verify the integrity of the data. Further, this scheme also supports dynamic data updates. In addition, security and performance analysis proves that proposed scheme is provably secure and efficient.


Author(s):  
Syam Kumar Pasupuleti

Cloud storage allows users to store their data in the cloud to avoid local storage and management costs. Since the cloud is untrusted, the integrity of stored data in the cloud has become an issue. To address this problem, several public auditing schemes have been designed to verify integrity of the data in the cloud. However, these schemes have two drawbacks: public auditing may reveal sensitive data to verifier and does not address the data recovery problem efficiently. This article proposes a new privacy-preserving public auditing scheme with data dynamics to secure the data in the cloud based on an exact regenerated code. This scheme encodes the data for availability, then masks the encoded blocks with randomness for privacy of data and enables a public auditor to verify the integrity of the data. Further, this scheme also supports dynamic data updates. In addition, security and performance analysis proves that proposed scheme is provably secure and efficient.


2016 ◽  
Vol 43 (4) ◽  
pp. 497-508
Author(s):  
Mokryeon Baek ◽  
Dongmin Kim ◽  
Ik Rae Jeong

2013 ◽  
Vol 62 (2) ◽  
pp. 362-375 ◽  
Author(s):  
Cong Wang ◽  
Sherman S.M. Chow ◽  
Qian Wang ◽  
Kui Ren ◽  
Wenjing Lou

2014 ◽  
Vol 16 (4) ◽  
pp. 33-38 ◽  
Author(s):  
Salve Bhagyashri ◽  
◽  
Prof. Y.B Gurav

Sign in / Sign up

Export Citation Format

Share Document