Enabling Efficient User Revocation in Identity-based Cloud Storage Auditing for Shared Big Data

Zhang, Yue; Yu, Jia; Hao, Rong; Wang, Cong; Ren, Kui

doi:10.1109/tdsc.2018.2829880

Cited by 120 publications

(88 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to achieve efficient user revocation, Wang et al [33] designed a shared data integrity auditing scheme supporting user revocation by making use of the proxy re-signature. Based on the identity-based setting, Zhang et al [34] constructed a cloud storage auditing scheme for shared data supporting real efficient user revocation. To realize the data sharing with sensitive information hiding, Shen et al [35] designed an identity-based cloud storage auditing scheme for shared data.…”

Section: A Related Workmentioning

confidence: 99%

Data Integrity Auditing without Private Key Storage for Secure Cloud Storage

Shen

Qin

et al. 2021

IEEE Trans. Cloud Comput.

Self Cite

View full text Add to dashboard Cite

Using cloud storage services, users can store their data in the cloud to avoid the expenditure of local data storage and maintenance. To ensure the integrity of the data stored in the cloud, many data integrity auditing schemes have been proposed. In most, if not all, of the existing schemes, a user needs to employ his private key to generate the data authenticators for realizing the data integrity auditing. Thus, the user has to possess a hardware token (e.g. USB token, smart card) to store his private key and memorize a password to activate this private key. If this hardware token is lost or this password is forgotten, most of the current data integrity auditing schemes would be unable to work. In order to overcome this problem, we propose a new paradigm called data integrity auditing without private key storage and design such a scheme. In this scheme, we use biometric data (e.g. iris scan, fingerprint) as the user's fuzzy private key to avoid using the hardware token. Meanwhile, the scheme can still effectively complete the data integrity auditing. We utilize a linear sketch with coding and error correction processes to confirm the identity of the user. In addition, we design a new signature scheme which not only supports blockless verifiability, but also is compatible with the linear sketch. The security proof and the performance analysis show that our proposed scheme achieves desirable security and efficiency.

show abstract

Section: A Related Workmentioning

confidence: 99%

Data Integrity Auditing without Private Key Storage for Secure Cloud Storage

Shen

Qin

et al. 2021

IEEE Trans. Cloud Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, when the user is revoked, the cloud server is allowed to replace the previously signed data block of the revoked user to a legal group instead of the group member, which can cause efficiency problem. In addition, in scheme [8], the authors propose to enable efficient user revocation in identity-based cloud storage auditing for shared big data. On the other hand, Yu et al [8,9] proposed the issue of key security among cloud users.…”

Section: Related Workmentioning

confidence: 99%

“…In addition, in scheme [8], the authors propose to enable efficient user revocation in identity-based cloud storage auditing for shared big data. On the other hand, Yu et al [8,9] proposed the issue of key security among cloud users. In these schemes, the key exposure in one time period does not affect the security of cloud storage auditing in other time periods and verifiable out-sourcing of key updates.…”

Section: Related Workmentioning

confidence: 99%

Integrity Audit of Shared Cloud Data with Identity Tracking

Yun

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

More and more users are uploading their data to the cloud without storing any copies locally. Under the premise that cloud users cannot fully trust cloud service providers, how to ensure the integrity of users’ shared data in the cloud storage environment is one of the current research hotspots. In this paper, we propose a secure and effective data sharing scheme for dynamic user groups. (1) In order to realize the user identity tracking and the addition and deletion of dynamic group users, we add a new role called Rights Distribution Center (RDC) in our scheme. (2) To protect the privacy of user identity, when performing third party audit to verify data integrity, it is not possible to determine which user is a specific user. Therefore, the fairness of the audit can be promoted. (3) Define a new integrity audit model for shared cloud data. In this scheme, the user sends the encrypted data to the cloud and the data tag to the Rights Distribution Center (RDC) by using data blindness technology. Finally, we prove the security of the scheme through provable security theory. In addition, the experimental data shows that our proposed scheme is more efficient and scalable than the state-of-the-art solution.

show abstract

“…The TPA auditing technique is used effectively to guarantee the DI and data encryption system is used in the TPA to secure the data. Recent method involves in the TPA aried [11][12][13][14][15] in this section to analyze its performance. Anbuchelian, et al [11] established secure cryptography hashing algorithm in the TPA to improve the security.…”

Section: Related Workmentioning

confidence: 99%

Modified Dynamic Hash Table with Threshold RSA for Dynamic and Public Auditing on Cloud Data

Babu¹,

D²

2019

IJITEE

View full text Add to dashboard Cite

Cloud storage is one of the major application in the cloud, which can provide the on-demand outsourcing data service for both organizations as well as individuals. The Data Integrity (DI) check in the cloud is applied by the user to ensure the integrity of data. The Third Party Auditing (TPA) technique is later introduced to check the cloud DI. Many research has been carried out in the public auditing to minimize the computation cost of the integrity check. The most existing method involves in lack of security and low computation overhead. In this research, the Modified Dynamic Hash Table with threshold Rivest, Shamir, and Adelman Algorithm (RSA) algorithm (MDHT-RSA) is proposed to improve the security and reduce the computation cost. The threshold RSA cryptography system increase the security by generating the secret key to the user and reduce the computation cost. The Modified Dynamic Hash Table (MDHT) is used to record the data information for dynamic auditing, which is located in the TPA. The MDHT is differed from the Dynamic hash table, that the MDHT doesn’t contain the tag block whereas the dynamic hash table has the tag block. The MDHT-RSA is analyzed with the computation cost and compared with existing method. The experimental result proved that the MDHT-RSA method has low computation cost than state-of-art method in public auditing. The verification cost of the MDHT-RSA is 1.3 s while a state-of-art method DHT-PA has the 1.35 s for the 200 blocks of data.

show abstract

Enabling Efficient User Revocation in Identity-based Cloud Storage Auditing for Shared Big Data

Cited by 120 publications

References 36 publications

Data Integrity Auditing without Private Key Storage for Secure Cloud Storage

Data Integrity Auditing without Private Key Storage for Secure Cloud Storage

Integrity Audit of Shared Cloud Data with Identity Tracking

Modified Dynamic Hash Table with Threshold RSA for Dynamic and Public Auditing on Cloud Data

Contact Info

Product

Resources

About