English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

An efficient, scalable, and provably secure dynamic auditing scheme is highlydesirable in the cloud storage environment for verifying the integrity of theoutsourced data. Most of the existing work on remote integrity checking focuseson static archival data and therefore cannot be applied to cases where dynamicdata updates are more common. Additionally, existing auditing schemes sufferfrom performance bottlenecks and scalability issues. To address these issues,in this paper, we present a novel dynamic auditing scheme for centralized cloudenvironments leveraging an enhanced version of the B-tree. Our proposed schemeachieves the immutable characteristic of a decentralized system (i.e.,blockchain technology) while effectively addressing the synchronization andperformance challenges of such systems. Unlike other static auditing schemes,our scheme supports dynamic insert, update, and delete operations. Also, byleveraging an enhanced B-tree, our scheme maintains a balanced tree after anyalteration to a certain file, improving performance significantly. Experimentalresults show that our scheme outperforms both traditional Merkle HashTree-based centralized auditing and decentralized blockchain-based auditingschemes in terms of block modifications (e.g., insert, delete, update), blockretrieval, and data verification time.

An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree