An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909418667376640 |
|---|---|
| author | Islam, Tariqul Bappy, Faisal Haque Shifat, Md Nafis Ul Haque Ahmad, Farhan Hasan, Kamrul Zaman, Tarannum Shaila |
| author_facet | Islam, Tariqul Bappy, Faisal Haque Shifat, Md Nafis Ul Haque Ahmad, Farhan Hasan, Kamrul Zaman, Tarannum Shaila |
| contents | An efficient, scalable, and provably secure dynamic auditing scheme is highly desirable in the cloud storage environment for verifying the integrity of the outsourced data. Most of the existing work on remote integrity checking focuses on static archival data and therefore cannot be applied to cases where dynamic data updates are more common. Additionally, existing auditing schemes suffer from performance bottlenecks and scalability issues. To address these issues, in this paper, we present a novel dynamic auditing scheme for centralized cloud environments leveraging an enhanced version of the B-tree. Our proposed scheme achieves the immutable characteristic of a decentralized system (i.e., blockchain technology) while effectively addressing the synchronization and performance challenges of such systems. Unlike other static auditing schemes, our scheme supports dynamic insert, update, and delete operations. Also, by leveraging an enhanced B-tree, our scheme maintains a balanced tree after any alteration to a certain file, improving performance significantly. Experimental results show that our scheme outperforms both traditional Merkle Hash Tree-based centralized auditing and decentralized blockchain-based auditing schemes in terms of block modifications (e.g., insert, delete, update), block retrieval, and data verification time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_08953 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree Islam, Tariqul Bappy, Faisal Haque Shifat, Md Nafis Ul Haque Ahmad, Farhan Hasan, Kamrul Zaman, Tarannum Shaila Cryptography and Security Data Structures and Algorithms An efficient, scalable, and provably secure dynamic auditing scheme is highly desirable in the cloud storage environment for verifying the integrity of the outsourced data. Most of the existing work on remote integrity checking focuses on static archival data and therefore cannot be applied to cases where dynamic data updates are more common. Additionally, existing auditing schemes suffer from performance bottlenecks and scalability issues. To address these issues, in this paper, we present a novel dynamic auditing scheme for centralized cloud environments leveraging an enhanced version of the B-tree. Our proposed scheme achieves the immutable characteristic of a decentralized system (i.e., blockchain technology) while effectively addressing the synchronization and performance challenges of such systems. Unlike other static auditing schemes, our scheme supports dynamic insert, update, and delete operations. Also, by leveraging an enhanced B-tree, our scheme maintains a balanced tree after any alteration to a certain file, improving performance significantly. Experimental results show that our scheme outperforms both traditional Merkle Hash Tree-based centralized auditing and decentralized blockchain-based auditing schemes in terms of block modifications (e.g., insert, delete, update), block retrieval, and data verification time. |
| title | An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree |
| topic | Cryptography and Security Data Structures and Algorithms |
| url | https://arxiv.org/abs/2401.08953 |