Abstract
Aimed at the huge number of files in cloud storage and the low audit efficiency of single-node audit mode, this paper proposes a multi-agent-based cloud storage multi-copy data integrity check scheme. The scheme uses a bilinear mapping method to construct the key generation process and a multi-branch authentication tree to perform multi-copy data signature to implement multi-copy authentication, signature, and verification. It also uses a directed acyclic graph (DAG) to represent the task relationship in the workflow, task and resource allocation based on QoS demand preference settings to schedule multiple tasks. Experimental results show that the proposed scheme has obvious advantages over existing schemes in terms of communication, storage overhead, and audit efficiency, with an average audit efficiency improvement of 20%.
Highlights
With the increasing development of cloud computing technology, public cloud storage services have been widely used, and the number of users of public cloud storage products such as DropBox, Google Drive, Kingsoft Express and so on has grown rapidly [1], [2]
The Provable Data Possession (PDP) [3], [4] is an important method for verifying the integrity of data stored in the cloud
According to the relationship between the tasks in the directed acyclic graph (DAG) graph, firs prioritize the tasks and calculate the key factors of the tasks according to the formula to form the priority scheduling queue, and assign the tasks to the optimal resources according to the QoS demand settings
Summary
With the increasing development of cloud computing technology, public cloud storage services have been widely used, and the number of users of public cloud storage products such as DropBox, Google Drive, Kingsoft Express and so on has grown rapidly [1], [2]. According to the constructed multi-copy and multibranch authentication tree, retrieve and calculate the node value and the root node value of the challenge data block; Second, generate the challenge request information and send it to the replica storage server. The specific process is as follows: (1) After receiving the challenge message chal, the CSP primary storage server queries the leaf nodes of the corresponding data block of chal = {(i, vi)}s1≤i≤se according to the constructed multi-copy and multi-branch authentication tree, records the authentication auxiliary information { i}s1≤i≤se of these leaf nodes, and calculates the corresponding first replica data node value R1 and root node value R 0 in the challenge information. (3) The k-th copy storage server calculates the corresponding node value Rk and the holding evidence μk and δk of the challenge data block according to the challenge request message chalk = {(k, i, vi)}.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
