4.7 Article

Identity-Based Dynamic Data Auditing for Big Data Storage

Journal

IEEE TRANSACTIONS ON BIG DATA
Volume 7, Issue 6, Pages 913-921

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TBDATA.2019.2941882

Keywords

Big Data; Data integrity; Authentication; Data models; Public key; Big data; remote data auditing; dynamic data auditing; Merkle hash tree

Funding

  1. National Key Research and Development Program of China [2016YFC1000307]
  2. National Natural Science Foundation of China [61571024]

Ask authors/readers for more resources

Identity-based remote data auditing schemes can verify data integrity and provide simple identity authentication and management for multiple users. However, prior research in this area lacks support for dynamic operations. This paper proposes a new scheme that supports dynamic data operations using Merkle hash tree structure to improve efficiency and integrity assurance.
Identity-based remote data auditing schemes can verify data integrity and provide a simple identity authentication and management for multiple users. However, prior works on identity-based remote data auditing lack the support of dynamic operations. In these schemes, tag generation is linked to the index of data block, which is related to update operations such as modification, insertion and deletion. If users perform dynamic operations on a data block, the tags of all subsequent blocks need to be modified. It means that if users want to update data on a big data platform, they have to download the whole file, update the file and send the updated file to the big data platform. Such pattern will bring huge communication overhead. In this paper, we propose an identity-based dynamic data auditing scheme which supports dynamic data operations, including modification, insertion and deletion. As far as we know, there is still no other identity-based data auditing scheme that supports dynamic operations. In particular, to achieve efficient dynamic operations, we use the data structure of Merkle hash tree for block tag authentication, which helps update data with integrity assurance. Analyses of security and performance show that the proposed scheme is efficient and secure.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available