Remote Dynamic Data Integrity Checking Scheme for Multi-cloud and Multi-replica

More and more data owners would like to store their data to cloud servers in order to reduce their localstorage burden along with rapid development of cloud servers.However,data owners will lose the direct control over their data after uploading to cloud servers.Data integrity checking is essential to ensure the integrity of remote data stored on cloud servers.It allows data owners to verify the integrity of the outsourced data without downloading all the data.To improve the availability and durability of outsourced data,data owners store multiple copies on multiple cloud servers.It is necessary to protect data owners' identity privacy in public cloud environment because public cloud servers are not completely trustworthy.When data owners want to modi-fy the data stored on the cloud servers,data dynamic operations such as data modification,data deletion,and data insertion are of great significance.Therefore,a remote dynamic data integrity checking scheme in a multi-cloud and multi-replica environment is proposed.The scheme combines the ring signature algorithm with a multi-cloud and multi-replica environment to effectively protect the privacy of data owners' identity,so that data owners do not have to worry about the problems due to identity exposure.At the same time,a new data structure,divide and conquer adjacency table,is introduced to implement dynamic operations of data in multi-cloud environment.The divide and conquer adjacency table searches the specified data through indexes and completes the insertion and deletion of data by modifying the pointers,which enhances updating efficiency compared to other data structures such as Merkle tree.The proposed scheme is secure based on the standard difficulty problem.This scheme makes use of identity-based public key cryptosystem and eliminates complex certificate management.Through performance and security analysis,the scheme satisfies unconditional anonymity,dynamics,and remote data integrity verification.

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2025-05-01
DOI
https://doi.org/10.11896/jsjkx.240300027
Primary Topic
Semantic Web and Ontologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Remote Dynamic Data Integrity Checking Scheme for Multi-cloud and Multi-replica

SHILAP Revista de lepidopterología
Semantic Web and Ontologies
article

Remote Dynamic Data Integrity Checking Scheme for Multi-cloud and Multi-replica

article en

Abstract

More and more data owners would like to store their data to cloud servers in order to reduce their localstorage burden along with rapid development of cloud servers.However,data owners will lose the direct control over their data after uploading to cloud servers.Data integrity checking is essential to ensure the integrity of remote data stored on cloud servers.It allows data owners to verify the integrity of the outsourced data without downloading all the data.To improve the availability and durability of outsourced data,data owners store multiple copies on multiple cloud servers.It is necessary to protect data owners' identity privacy in public cloud environment because public cloud servers are not completely trustworthy.When data owners want to modi-fy the data stored on the cloud servers,data dynamic operations such as data modification,data deletion,and data insertion are of great significance.Therefore,a remote dynamic data integrity checking scheme in a multi-cloud and multi-replica environment is proposed.The scheme combines the ring signature algorithm with a multi-cloud and multi-replica environment to effectively protect the privacy of data owners' identity,so that data owners do not have to worry about the problems due to identity exposure.At the same time,a new data structure,divide and conquer adjacency table,is introduced to implement dynamic operations of data in multi-cloud environment.The divide and conquer adjacency table searches the specified data through indexes and completes the insertion and deletion of data by modifying the pointers,which enhances updating efficiency compared to other data structures such as Merkle tree.The proposed scheme is secure based on the standard difficulty problem.This scheme makes use of identity-based public key cryptosystem and eliminates complex certificate management.Through performance and security analysis,the scheme satisfies unconditional anonymity,dynamics,and remote data integrity verification.

SHILAP Revista de lepidopterología
Nanjing University of Posts and Telecommunications (CN)
Openalex Percentile: Top 25%
Semantic Web and Ontologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.