Data continuous availability verification method, server, medium and system

By using verifiable delay function and storage proof function in the data storage off-chain data storage, the continuous availability of data blocks is solved, and the problem of data loss of control after cloud storage is achieved, and high-reliability storage of data is achieved.

CN119011227APending Publication Date: 2024-11-22GUANGXI BEITOU XINCHUANG TECH INVESTMENT GRP CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411047331.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-01
Publication Date
2024-11-22

AI Technical Summary

Technical Problem

After the data off-chain data is stored in the cloud, the data owner loses control. The existing technology is difficult to ensure the continuous availability of data in case of accidental deletion or hardware failure, reducing the reliability of data outsourcing storage.

Method used

By establishing a communication link between the first server and the second server, the data continuous availability of multiple replica data blocks is verified by verified delay function and storage proof function, ensuring that the data has continuous availability after storage of the first server.

Benefits of technology

Improve the reliability of data outsourcing storage, preventing data services to the data owner when the original data is accidentally lost, and ensuring the continuous availability of outsourcing data.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119011227A_ABST
    Figure CN119011227A_ABST
Patent Text Reader

Abstract

The invention provides a data continuous availability verification method, a server, a medium and a system, and relates to the technical field of computers, the data continuous availability verification method comprises the following steps: a second server sends a plurality of copy data blocks and an initial challenge; in response to the initial challenge, determining data persistent availability attestation results for the plurality of replica data blocks based on a verifiable delay function and a storage attestation function; the data continuous availability proving result is sent to the second server, and the second server determines that the target data has continuous availability after the first server stores the target data under the condition that the data continuous availability proving result passes verification. According to the method and the device, continuous availability proving of the copy data can be realized, and the reliability of data outsourcing storage is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, and in particular to a method, server, medium and system for verifying continuous data availability. Background Art

[0002] Blockchain has become a highly reliable data storage technology with its unique distributed characteristics and security mechanisms; however, the storage and processing costs of blockchain data are relatively high, and performance will be seriously affected when the data scale is large. Therefore, off-chain data of blockchain can be stored in cloud services. By outsourcing massive off-chain data to cloud storage servers, efficient and scalable storage services can be provided at a lower storage cost.

[0003] In related technologies, after off-chain data is stored in the cloud, the data owner will lose actual control over the data. In order to ensure continuous availability of data, cloud storage services can usually ensure the public verifiability of data and improve data transmission efficiency, that is, ensure that the data owner has actual control over the outsourced stored data.

[0004] However, the data continuous availability guarantee solutions provided in related technologies are usually aimed at original data. Once the original data is accidentally deleted, hardware fails, or is damaged by human factors, the cloud storage service provider will not be able to guarantee the continuous availability of the data, reducing the continuous availability of data after outsourcing data storage. Summary of the invention

[0005] The present disclosure provides a data continuous availability verification method, server, medium and system, which can realize data continuous availability verification of replica data to improve the reliability of data outsourcing storage. The technical solution of the present disclosure is as follows:

[0006] According to a first aspect of the present disclosure, a method for verifying continuous data availability is provided. The method is applied to a first server and includes:

[0007] Receiving a plurality of replica data blocks and an initial challenge sent by the second server, wherein the plurality of replica data blocks are obtained by the second server dividing the target data to be stored into a plurality of data blocks to be stored and encrypting each data block to be stored;

[0008] In response to the initial challenge, determining a data continuous availability proof result for a plurality of replica data blocks based on a verifiable delay function and a storage proof function;

[0009] The result of the data continuous availability certification is sent to the second server, wherein the second server, when verifying the result of the data continuous availability certification, determines that the target data has continuous availability after the first server stores the target data.

[0010] According to a second aspect of the present disclosure, a method for verifying continuous data availability is provided, the method being applied to a second server and comprising:

[0011] The target data to be stored is divided into a plurality of data blocks to be stored, and each data block to be stored is encrypted to obtain a plurality of copy data blocks;

[0012] Sending the plurality of replica data blocks and the initial challenge to the first server, wherein the first server is used to determine the data continuous availability proof result of the plurality of replica data blocks according to the verifiable delay function and the storage proof function, and return the data continuous availability proof result to the second server;

[0013] If the result of the data continuous availability certification is verified successfully, it is determined that after the first server stores the target data, the target data has continuous availability.

[0014] According to a third aspect of the present disclosure, there is provided a first server, including:

[0015] Processor; and

[0016] Memory for storing programs,

[0017] The program includes instructions, which, when executed by the processor, cause the processor to execute the method as described in the first aspect.

[0018] According to a fourth aspect of the present disclosure, there is provided a second server, including:

[0019] Processor; and

[0020] Memory for storing programs,

[0021] The program includes instructions, which, when executed by the processor, cause the processor to execute the method as described in the second aspect.

[0022] According to a fifth aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to cause the computer to execute the method as described in the first aspect or the second aspect.

[0023] According to a sixth aspect of the present disclosure, a data continuous availability verification system is provided, comprising a first server and a second server, wherein:

[0024] The second server is used to divide the target data to be stored into a plurality of data blocks to be stored, encrypt each data block to be stored to obtain a plurality of replica data blocks, and send the plurality of replica data blocks and the initial challenge to the first server;

[0025] The first server is configured to receive the plurality of replica data blocks and the initial challenge sent by the second server, and in response to the initial challenge, determine a data continuous availability proof result of the plurality of replica data blocks based on a verifiable delay function and a storage proof function, and send the data continuous availability proof result to the second server;

[0026] The second server is further configured to determine, when the result of the data continuous availability certification is verified, that the target data has continuous availability after the first server stores the target data.

[0027] The data continuous availability verification method, server, medium and system provided by the present invention can, on the one hand, be combined with a verifiable delay function for proving the continuity of replica data and a storage proof for proving the availability of replica data to prove the continuous availability of the replica, thereby realizing proof of the continuous availability of the replica data and improving the reliability of outsourced data storage; on the other hand, when data needs to be outsourced for storage, the first server of the data outsourcing storage service provider can store the replica data of the target data, thereby preventing the original data from being accidentally lost. The first server can still provide data services to the data owner, thereby ensuring the continuous availability of the outsourced data. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] Further details, features and advantages of the present disclosure are disclosed in the following description of exemplary embodiments in conjunction with the accompanying drawings, in which:

[0029] Figure 1 A schematic diagram of an implementation scenario of a data continuous availability verification solution of an exemplary embodiment of the present disclosure is shown;

[0030] Figure 2 A flow chart showing a method for verifying continuous data availability according to an exemplary embodiment of the present disclosure is shown;

[0031] Figure 3 A flowchart showing another method for verifying continuous data availability according to an exemplary embodiment of the present disclosure is shown;

[0032] Figure 4 A schematic block diagram showing functional modules of a data continuous availability verification device according to an exemplary embodiment of the present disclosure is shown;

[0033] Figure 5A schematic block diagram showing functional modules of another device for verifying continuous availability of data according to an exemplary embodiment of the present disclosure is shown;

[0034] Figure 6 A schematic block diagram of a chip according to an exemplary embodiment of the present disclosure is shown;

[0035] Figure 7 A structural block diagram of an exemplary electronic device that can be used to implement the embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0036] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0037] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0038] The term "including" and its variations used in this document are open inclusions, that is, "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one other embodiment"; the term "some embodiments" means "at least some embodiments". Relevant definitions of other terms will be given in the description below. It should be noted that the concepts of "first", "second", etc. mentioned in this disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0039] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0040] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0041] In order to solve the above problems, the present disclosure provides a method for verifying the continuous availability of data, which can be applied to a media server. Figure 1FIG. 1 is a schematic diagram showing an implementation scenario of a data continuous availability verification solution provided by an exemplary embodiment of the present disclosure. Figure 1 As shown, the implementation scenario 100 includes a first server 101 and a second server 102, wherein the first server 101 is a server of a cloud storage service provider that provides data outsourcing storage services, and the second server 102 is a server of a data outsourcing storage service demander, such as a blockchain.

[0042] like Figure 1 As shown, a communication link may be established between the first server 101 and the second server 102 to implement the data continuous availability verification method.

[0043] Figure 2 A flowchart of a method for verifying data continuous availability according to an exemplary embodiment of the present disclosure is shown. The method for verifying data continuous availability can be applied to a first server, such as Figure 2 As shown, the method of the embodiment of the present disclosure may include:

[0044] Step S201, receiving a plurality of replica data blocks and an initial challenge sent by a second server;

[0045] The multiple replica data blocks are obtained by the second server dividing the target data to be stored into multiple data blocks to be stored and encrypting each data block to be stored;

[0046] Step S202, in response to the initial challenge, determining the data continuous availability proof results of the plurality of replica data blocks based on the verifiable delay function and the storage proof function;

[0047] Step S203, sending the data continuous availability certification result to the second server;

[0048] Among them, when the second server verifies the result of the data continuous availability proof, it is determined that after the first server stores the target data, the target data has continuous availability.

[0049] To summarize, the data continuous availability verification method provided by the embodiments of the present disclosure can, on the one hand, be combined with a verifiable delay function for proving the continuity of replica data and a storage proof for proving the availability of replica data to prove the continuous availability of the replica, thereby realizing proof of the continuous availability of the replica data and improving the reliability of data outsourcing storage; on the other hand, when data needs to be outsourced for storage, the first server of the data outsourcing storage service provider can store the replica data of the target data, thereby preventing the original data from being accidentally lost. The first server can still provide data services to the data owner, thereby ensuring the continuous availability of the outsourced data.

[0050] The following Figure 2 The specific implementation methods of each step in the embodiment shown are described in detail:

[0051] In step S201, the first server may receive multiple replica data blocks and an initial challenge sent by the second server. In the disclosed embodiment, the multiple replica data blocks are obtained by the second server dividing the target data to be stored into multiple data blocks to be stored and encrypting each data block to be stored.

[0052] It should be noted that in the embodiment of the present disclosure, when the second server needs to outsource the storage of target data, the target data to be stored can be divided into multiple data blocks to be stored, and each data block to be stored can be encrypted to obtain multiple copy data blocks; further, the multiple copy data blocks and the initial challenge can be sent to the first server.

[0053] Before the first server divides the target data to be stored into a plurality of data blocks to be stored, the system may be initialized to obtain a public parameter, wherein the public parameter pp may be:

[0054]

[0055] In formula 1, N is the modulus of RSA, G, is a hash function, f is a pseudo-random permutation, N' is the amount of replica data, S is the number of square operations modulo N that can be performed by the second server within a computing time unit, t is the audit frequency, T is the storage period of data, ek, are the evaluation keys for verifiable calculations, and ek agg Evaluation key for aggregate verifiable computations.

[0056] It can be understood that in the embodiment of the present disclosure, the first server encrypts the target data based on the public parameters and verifies the result of the continuous availability proof of the data. The encryption algorithm for encrypting the data block to be stored may include: a key generation function keyGen, an encryption algorithm Enc and a decryption algorithm Dec; the initial challenge may be in {0,1} λ is randomly selected from , and λ is a security parameter.

[0057] In an optional implementation, after the second server sends multiple replica data blocks and an initial challenge to the first server, the first server may receive the multiple replica data blocks and the initial challenge sent by the second server to obtain the initial challenge and multiple replica data blocks of the target data to be stored.

[0058] In step S202, the first server may determine, in response to the initial challenge, a data continuous availability certification result for a plurality of replica data blocks based on a verifiable delay function and a storage certification function.

[0059] In the disclosed embodiment, based on the zero-knowledge proof theory, the first server needs to respond after receiving the initial challenge sent by the second server to prove that the data stored in the first server has continuous availability.

[0060] It should be noted that in the embodiment of the present disclosure, the storage period of data is fixed. The first server can divide multiple sub-replica data blocks in the replica data block into sub-replica data block groups with at least two identical sub-replica data blocks, and limit the storage duration of each sub-replica data block group, so as to facilitate the determination of anomalies in the replica data storage process and improve the reliability of the proof results of the generated replica data.

[0061] In an optional embodiment, the process of determining the data continuous availability proof results of multiple replica data blocks by the first server based on a verifiable delay function (VDF) and a proof of storage function (POS) may include: dividing multiple sub-replica data blocks in each replica data block into at least two sub-replica data block groups; then, for each sub-replica data block group associated with each replica data block, determining the proof result of each sub-replica data block in the sub-replica data block group based on the verifiable delay function and the proof of storage function; further, for each sub-replica data block in the sub-replica data block group, the proof result of the verifiable delay function and the proof of storage function, and, The Merkle tree formed by the response challenge of each sub-replica data block in the sub-replica data block group is verified to obtain the proof result of each sub-replica data block group associated with each replica data block; finally, the proof results corresponding to each sub-replica data block group are aggregated to obtain the aggregated proof result of data continuous availability of multiple replica data blocks, and the aggregated proof result of data continuous availability of multiple replica data blocks is determined as the proof result of data continuous availability of multiple replica data blocks; wherein the proof result includes the verifiable delay function proof result, the storage proof function proof result and the response challenge associated with each sub-replica data block, and the number of sub-replica data blocks in each sub-replica data block group is a preset number value, wherein the preset number value can be determined based on actual needs, and the embodiments of the present disclosure are not limited to this. The multiple sub-replica data blocks in each replica data block can be divided into at least two sub-replica data block groups with the same number of sub-replica data blocks, and the proof results of each group of sub-replica data block groups can be determined, which can improve the reliability of the data continuous availability proof results of the replica data determined under a fixed storage period; at the same time, the proof results corresponding to each sub-replica data block group can be aggregated and provided to the second server for verification, preventing the first server from verifying the proof results of each sub-replica data block group multiple times, thereby improving the verification efficiency of data continuous availability and reducing the resource consumption of the first server and the second server.

[0062] In an optional embodiment, the process by which the first server determines the proof result for each sub-replica data block in the sub-replica data block group based on the verifiable delay function and the storage proof function may include: starting from the first sub-replica data block in the sub-replica data block group, processing each current sub-replica data block based on the verifiable delay function to obtain the verifiable delay function proof result of the current sub-replica data block, and processing the current sub-replica data block based on the storage proof function to obtain the storage proof function proof result of the current sub-replica data block; then, processing the verifiable delay function proof result of the current sub-replica data block and the storage proof function proof result according to the hash algorithm to obtain a response challenge for the current sub-replica data block; further, repeating the above process of determining the response challenge for the current sub-replica data block until each sub-replica data block in the sub-replica data block group is traversed to obtain the proof result for each sub-replica data block in the sub-replica data block group. You can start from the first sub-replica data block in each sub-replica data block group, traverse each sub-replica data block in each sub-replica data block group, and obtain the verifiable delay function proof result, storage proof function proof result and response challenge associated with each sub-replica data block to improve the reliability of the proof result of the obtained replica data.

[0063] For example, assume that each replica data block F i contains n sub-replica data blocks, then F i =(m i1 ,m i2 ,…,m in ), divide the n sub-replica data blocks into a sub-replica data block group including b sub-replica data blocks, and for each sub-replica data block group, traverse each sub-replica data block in each sub-replica data block group to obtain a proof result of each sub-replica data block, wherein the first server processes each current sub-replica data block based on the verifiable delay function to obtain a process of the verifiable delay function proof result of the current sub-replica data block, which can be implemented based on Formula 2, wherein Formula 2 is:

[0064]

[0065] In formula 2, represents the jth child replica data block in the αth child replica data block group of the i-th replica data block, Pos represents the verifiable delay function, Represents the verifiable delay function proof result of the j-th child replica data block in the α-th child replica data block group of the ith replica data block.

[0066] Similarly, the first server processes the current sub-replica data block based on the storage proof function to obtain the storage proof function proof result of the current sub-replica data block, which can be implemented based on Formula 3, where Formula 3 is:

[0067]

[0068] In Formula 3, VDF represents the storage proof function, Represents the storage proof function proof result of the j-th sub-replica data block in the α-th sub-replica data block group of the ith replica data block.

[0069] In an optional embodiment, the first server verifies the verifiable delay function proof result, storage proof function proof result, and Merkle tree composed of response challenges of each sub-replica data block in the sub-replica data block group, and the process of obtaining the proof result of each sub-replica data block group associated with each replica data block may include: respectively verifying the verifiable delay function proof result and storage proof function proof result of each sub-replica data block in the sub-replica data block group, and obtaining the correctness verification result corresponding to the proof result of each sub-replica data block in the sub-replica data block group; then, verifying the Merkle tree composed of response challenges of each sub-replica data block in the sub-replica data block group, and obtaining the response challenge sequentiality verification result corresponding to the sub-replica data block group; further, determining the correctness verification result corresponding to the proof result of each sub-replica data block in the sub-replica data block group, and the response challenge sequentiality verification result corresponding to the sub-replica data block group as the proof result of each sub-replica data block group associated with each replica data block. The correctness of the proof result of each sub-replica data block in each sub-replica data block group can be verified, and the order of response challenges of multiple sub-replica data blocks in the sub-replica data block group can be verified, to prevent the proof result of each sub-replica data block group associated with each replica data block from being generated when the verifiable delay function proof result or storage proof function proof result of the sub-replica data block is incorrect, or the response challenge generation order of multiple sub-replica data blocks in the sub-replica data block group is incorrect, thereby realizing proof of continuous availability of replica data.

[0070] Among them, the correctness verification process of the proof result of the verifiable delay function can be implemented based on the verifiable delay function, and the verification process of the proof result of the storage proof function can be implemented based on the storage proof function.

[0071] For example, the first server verifies the verifiable delay function proof result, the storage proof function proof result, and the Merkle tree composed of the response challenge of each sub-replica data block in the sub-replica data block group, and the process of obtaining the proof result of each sub-replica data block group associated with each replica data block can be implemented based on Formula 4, where Formula 4 is:

[0072]

[0073] In formula 4, It indicates that the proof result of the storage proof function of the j-th sub-replica data block in the α-th sub-replica data block group of the ith replica data block is verified based on the storage proof function. The verification result can be 1 or 0, wherein a verification result of 1 indicates that the verification is passed, i.e., the proof result of the storage proof function of the j-th sub-replica data block in the α-th sub-replica data block group of the ith replica data block is a correct result; a verification result of 0 indicates that the verification is not passed, i.e., the proof result of the storage proof function of the j-th sub-replica data block in the α-th sub-replica data block group of the ith replica data block is an incorrect result.

[0074] In formula 4, It indicates that the verifiable delay function proof result of the j-th sub-replica data block in the α-th sub-replica data block group of the ith replica data block is verified based on the verifiable delay function. The verification result can be 1 or 0, wherein a verification result of 1 indicates that the verification is passed, that is, the verifiable delay function proof result of the j-th sub-replica data block in the α-th sub-replica data block group of the ith replica data block is a correct result; a verification result of 0 indicates that the verification is not passed, that is, the verifiable delay function proof result of the j-th sub-replica data block in the α-th sub-replica data block group of the ith replica data block is an incorrect result.

[0075] In Formula 4, C i in the leaf K,and C i+1 in the leafK+1 represents the verification of the Merkle tree composed of the response challenge of each sub-replica data block in the sub-replica data block group, where C i in the leafK represents the response of the Kth node in the Merkle tree to challenge C i , and C i+1 in the leafK+1 means the K+1th node in the Merkle tree responds to challenge C i+1 ; Represents the proof result of the αth sub-replica data block group associated with the ith replica data block.

[0076] For example, the first server aggregates the proof results corresponding to each sub-replica data block group to obtain the data continuous availability aggregated proof results of multiple replica data blocks, which can be implemented based on Formula 5, where Formula 5 is:

[0077]

[0078] In formula 5, Indicates that based on the aggregate signature algorithm, the proof results of each sub-copy data block group α associated with each copy data block are aggregated, π agg Represents the aggregated proof result of continuous data availability of multiple replica data blocks.

[0079] It should be noted that in the embodiments of the present disclosure, there is a situation where the number of sub-replica data blocks in a replica data block is not an integer multiple of a preset number value. Since the proof process for each sub-replica data block group is basically the same, after the sub-replica data blocks in each replica data block are grouped, if the actual number of sub-replica data blocks in the last sub-replica data block group associated with a replica data block is less than the preset number value, continuing to judge the abnormality in the replica data storage process according to the limited storage time of each sub-replica data block group, and improving the reliability of the proof result of the generated replica data, there may be a situation where the judgment result is inaccurate.

[0080] In an optional embodiment, after dividing the multiple sub-replica data blocks in each replica data block into at least two sub-replica data block groups, the first server may also: for each replica data block, if it is determined that the number of sub-replica data blocks included in the last sub-replica data block group in the at least two sub-replica data block groups associated with the replica data block is less than a preset number value, then filter the last sub-replica data block group in the at least two sub-replica data block groups to obtain an updated sub-replica data block group associated with each replica data block. After dividing the sub-replica data blocks in the replica data block into sub-replica data block groups, when it is determined that the number of sub-replica data blocks in the last sub-replica data block group is insufficient, the last sub-replica data block group may be filtered to further improve the reliability of the data continuous availability certification results of the multiple replica data blocks determined.

[0081] In step S203, the first server sends the data continuous availability certification result to the second server.

[0082] Among them, when the second server verifies the result of the data continuous availability proof, it is determined that after the first server stores the target data, the target data has continuous availability.

[0083] The above mainly introduces the solution provided by the embodiment of the present disclosure from the perspective of the first server. It can be understood that in order to realize the above functions, the first server includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present disclosure.

[0084] Figure 3 A flow chart of a method for verifying data continuous availability according to an exemplary embodiment of the present disclosure is shown. The method for verifying data continuous availability can be applied to a second server, such as Figure 3 As shown, the method of the embodiment of the present disclosure may include:

[0085] Step S301, dividing the target data to be stored into a plurality of data blocks to be stored, and encrypting each data block to be stored to obtain a plurality of copy data blocks;

[0086] Step S302, sending a plurality of replica data blocks and an initial challenge to a first server;

[0087] Among them, the first server is used to determine the data continuous availability proof results of multiple replica data blocks based on the verifiable delay function and the storage proof function, and return the data continuous availability proof results to the second server; it can be understood that the process of the first server determining the data continuous availability proof results of multiple replica data blocks based on the verifiable delay function and the storage proof function can refer to the above-mentioned embodiment, and the present disclosure will not elaborate on this.

[0088] Step S303: If the result of the data continuous availability certification is verified, it is determined that after the first server stores the target data, the target data has continuous availability.

[0089] The process of verifying the result of the continuous availability of data by the second server can be implemented based on the aggregate signature verification algorithm, wherein the process can be implemented based on Formula 6, wherein Formula 6 is:

[0090] Agg.Verify(π agg )→{0,1}; (Formula 6)

[0091] In Formula 6, Agg.Verify(π agg) indicates verification of the result of the proof of continuous availability of data based on the aggregate signature verification algorithm, wherein the verification result can be 0 or 1. A verification result of 1 indicates that the verification is passed, which means that after the first server stores the target data, the target data has continuous availability; a verification result of 0 indicates that the verification is not passed, which means that after the first server stores the target data, the target data does not have continuous availability.

[0092] In summary, in the data continuous availability verification method provided by the embodiment of the present disclosure, the second server of the data storage service demander can send the copy data of the target data to be stored and the initial challenge to the first server used to provide data outsourcing storage, so that the first server combines the verifiable delay function used to prove the continuity of the copy data, and the storage proof used to prove the availability of the copy data, to prove the continuous availability of the copy data, and after the second server obtains the proof result and the proof of the continuous availability of the copy data is verified, it is determined that the copy of the target data has continuous availability in the first server, thereby realizing the proof of continuous availability of the copy data and improving the reliability of the data outsourcing storage.

[0093] The above mainly introduces the solution provided by the embodiment of the present disclosure from the perspective of the second server. It is understandable that, in order to realize the above functions, the second server includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present disclosure.

[0094] A data continuous availability verification system according to an exemplary embodiment of the present disclosure includes a first server and a second server.

[0095] The second server is used to divide the target data to be stored into multiple data blocks to be stored, encrypt each data block to be stored, obtain multiple replica data blocks, and send the multiple replica data blocks and the initial challenge to the first server.

[0096] The first server is used to receive multiple replica data blocks and an initial challenge sent by the second server, and in response to the initial challenge, determine the data continuous availability proof result of the multiple replica data blocks based on a verifiable delay function and a storage proof function, and send the data continuous availability proof result to the second server.

[0097] The second server is also used to determine that the target data has continuous availability after the first server stores the target data when the result of the data continuous availability certification is verified.

[0098] In summary, in the data continuous availability verification method provided by the embodiment of the present disclosure, the second server of the data storage service demander can send the copy data of the target data to be stored and the initial challenge to the first server used to provide data outsourcing storage, so that the first server combines the verifiable delay function used to prove the continuity of the copy data, and the storage proof used to prove the availability of the copy data, to prove the continuous availability of the copy data, and obtain the data continuous availability proof result, and send the proof result to the second server. After the second server proves and verifies the continuous availability of the copy data, it is determined that the copy of the target data has continuous availability in the first server, thereby realizing data continuous availability verification of the copy data, so as to improve the reliability of data outsourcing storage.

[0099] The embodiment of the present disclosure can divide the functional units of the first server according to the above method example. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiment of the present disclosure is schematic and is only a logical functional division. There may be other division methods in actual implementation.

[0100] In the case of dividing each functional module according to each function, an exemplary embodiment of the present disclosure provides a data continuous availability verification device, which may be a first server or a chip applied to the first server. Figure 4 FIG. 2 shows a schematic block diagram of functional modules of a data continuous availability verification device according to an exemplary embodiment of the present disclosure. Figure 4 As shown, the data continuous availability verification device 400 includes:

[0101] The receiving module 401 is configured to receive a plurality of replica data blocks and an initial challenge sent by the second server, wherein the plurality of replica data blocks are obtained by the second server dividing the target data to be stored into a plurality of data blocks to be stored and encrypting each data block to be stored;

[0102] A first determination module 402 is configured to determine, in response to the initial challenge, a data continuous availability certification result of a plurality of replica data blocks based on a verifiable delay function and a storage certification function;

[0103] The first sending module 403 is configured to send the data continuous availability proof result to the second server, wherein the second server, when verifying the data continuous availability proof result, determines that the target data has continuous availability after the first server stores the target data.

[0104] Optionally, the first determining module 402 is configured to:

[0105] Divide the multiple sub-replica data blocks in each replica data block into at least two sub-replica data block groups;

[0106] For each sub-replica data block group associated with each replica data block, based on the verifiable delay function and the storage proof function, determine a proof result for each sub-replica data block in the sub-replica data block group, wherein the proof result includes a verifiable delay function proof result, a storage proof function proof result, and a response challenge associated with each sub-replica data block, and the number of sub-replica data blocks in each sub-replica data block group is a preset number value;

[0107] Verify the verifiable delay function proof result, storage proof function proof result, and Merkle tree consisting of the response challenge of each sub-replica data block in the sub-replica data block group, and obtain the proof result of each sub-replica data block group associated with each replica data block;

[0108] Aggregate the certification results corresponding to each sub-replica data block group to obtain the aggregated certification results of data continuous availability of multiple replica data blocks, and determine the aggregated certification results of data continuous availability of the multiple replica data blocks as the certification results of data continuous availability of the multiple replica data blocks.

[0109] Optionally, the first determining module 402 is configured to:

[0110] Starting from the first sub-replica data block in the sub-replica data block group, processing each current sub-replica data block based on the verifiable delay function to obtain a verifiable delay function proof result of the current sub-replica data block, and processing the current sub-replica data block based on the storage proof function to obtain a storage proof function proof result of the current sub-replica data block;

[0111] Processing the verifiable delay function proof result of the current sub-replica data block according to the hash algorithm, and storing the proof function proof result to obtain a response challenge of the current sub-replica data block;

[0112] Repeat the above process of determining the response challenge of the current sub-replica data block until each sub-replica data block in the sub-replica data block group is traversed to obtain the proof result for each sub-replica data block in the sub-replica data block group.

[0113] Optionally, the first determining module 402 is configured to:

[0114] Verifying the verifiable delay function proof result and the storage proof function proof result of each sub-replica data block in the sub-replica data block group respectively, and obtaining a correctness verification result corresponding to the proof result of each sub-replica data block in the sub-replica data block group;

[0115] Verify the Merkle tree formed by the response challenge of each sub-replica data block in the sub-replica data block group, and obtain the response challenge sequence verification result corresponding to the sub-replica data block group;

[0116] The correctness verification result corresponding to the proof result of each sub-replica data block in the sub-replica data block group and the response challenge sequentiality verification result corresponding to the sub-replica data block group are determined as the proof result of each sub-replica data block group associated with each replica data block.

[0117] Optionally, the data continuous availability verification device 400 further includes a pre-processing module 404 configured to:

[0118] For each replica data block, if it is determined that the number of sub-replica data blocks contained in the last sub-replica data block group among at least two sub-replica data block groups associated with the replica data block is less than the preset number value, the last sub-replica data block group among the at least two sub-replica data block groups is filtered to obtain an updated sub-replica data block group associated with each replica data block.

[0119] The embodiment of the present disclosure can divide the functional units of the second server according to the above method example. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiment of the present disclosure is schematic and is only a logical functional division. There may be other division methods in actual implementation.

[0120] In the case of dividing each functional module according to each function, an exemplary embodiment of the present disclosure provides a data continuous availability verification device, which may be a second server or a chip applied to the second server. Figure 5 FIG. 2 shows a schematic block diagram of functional modules of a data continuous availability verification device according to an exemplary embodiment of the present disclosure. Figure 5 As shown, the data continuous availability verification device 500 includes:

[0121] The processing module 501 is configured to divide the target data to be stored into a plurality of data blocks to be stored, and encrypt each data block to be stored to obtain a plurality of replica data blocks;

[0122] A second sending module 502 is configured to send the plurality of replica data blocks and the initial challenge to the first server, wherein the first server is used to determine the data continuous availability proof result of the plurality of replica data blocks according to the verifiable delay function and the storage proof function, and return the data continuous availability proof result to the second server;

[0123] The second determination module 503 is configured to determine that the target data has continuous availability after the first server stores the target data if the result of the data continuous availability certification is verified.

[0124] Figure 6 Schematic block diagram of a chip according to an exemplary embodiment of the present disclosure is shown. Figure 6 As shown, the chip 600 includes one or more (including two) processors 601 and a communication interface 602. The communication interface 602 can support the first server or the second server to perform the data sending and receiving steps in the above-mentioned data continuous availability verification method, and the processor 601 can support the first server or the second server to perform the data processing steps in the above-mentioned data continuous availability verification method.

[0125] Optional, such as Figure 6 As shown, the chip 600 also includes a memory 603, which may include a read-only memory and a random access memory, and provides operation instructions and data to the processor. A portion of the memory may also include a non-volatile random access memory (NVRAM).

[0126] In some embodiments, Figure 6 As shown, the processor 601 performs corresponding operations by calling the operation instructions stored in the memory (the operation instructions may be stored in the operating system). The processor 601 controls the processing operations of either the first server or the second server, and the processor may also be referred to as a central processing unit (CPU). The memory 603 may include a read-only memory and a random access memory, and provides instructions and data to the processor 601. A portion of the memory 603 may also include NVRAM. For example, in an application, the memory, the communication interface, and the memory are coupled together through a bus system, wherein the bus system may include a power bus, a control bus, and a status signal bus in addition to a data bus. However, for the sake of clarity, in Figure 6Various buses are labeled as bus system 604 .

[0127] The method disclosed in the above-mentioned embodiment of the present disclosure can be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above-mentioned processor may be a general-purpose processor, a digital signal processor (digital signal processing, DSP), an ASIC, a field-programmable gate array (field-programmable gate array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present disclosure can be implemented or executed. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. The steps of the method disclosed in conjunction with the embodiment of the present disclosure can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software module may be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in conjunction with its hardware.

[0128] The exemplary embodiment of the present disclosure also provides an electronic device, which is a first server or a second server, and includes: at least one processor; and a memory connected to the at least one processor. The memory stores a computer program that can be executed by the at least one processor, and the computer program is used to enable the electronic device to perform the method according to the embodiment of the present disclosure when executed by the at least one processor.

[0129] The exemplary embodiments of the present disclosure also provide a non-transitory computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor of a computer, is used to cause the computer to perform the method according to the embodiments of the present disclosure.

[0130] The exemplary embodiments of the present disclosure further provide a computer program product, including a computer program, wherein when the computer program is executed by a processor of a computer, the computer is used to enable the computer to perform the method according to the embodiments of the present disclosure.

[0131] refer to Figure 7, a block diagram of an electronic device 700 that can be used as the first server or second server of the present disclosure will now be described, which is an example of a hardware device that can be applied to various aspects of the present disclosure. The electronic device is intended to represent various forms of digital electronic computer devices, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0132] like Figure 7 As shown, the electronic device 700 includes a computing unit 701, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 702 or a computer program loaded from a storage unit 708 into a random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the electronic device 700 can also be stored. The computing unit 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.

[0133] A plurality of components in the electronic device 700 are connected to the I / O interface 705, including: an input unit 706, an output unit 707, a storage unit 708, and a communication unit 709. The input unit 706 may be any type of device capable of inputting information to the electronic device 700, and the input unit 706 may receive input digital or character information, and generate key signal inputs related to user settings and / or function control of the electronic device. The output unit 707 may be any type of device capable of presenting information, and may include but is not limited to a display, a speaker, a video / audio output terminal, a vibrator, and / or a printer. The storage unit 708 may include but is not limited to a disk, an optical disk. The communication unit 709 allows the electronic device 700 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks, and may include but is not limited to a modem, a network card, an infrared communication device, a wireless communication transceiver, and / or a chipset, such as a Bluetooth™ device, a WiFi device, a WiMax device, a cellular communication device, and / or the like.

[0134] The computing unit 701 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 701 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 701 performs the various methods and processes described above. For example, in some embodiments, the method of the embodiment of the present disclosure may be implemented as a computer software program, which is tangibly included in a machine-readable medium, such as a storage unit 708. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 700 via the ROM 702 and / or the communication unit 709. In some embodiments, the computing unit 701 may be configured to perform the method of the embodiment of the present disclosure by any other appropriate means (e.g., by means of firmware).

[0135] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0136] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0137] As used in this disclosure, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and / or device (e.g., disk, optical disk, memory, programmable logic device (PLD)) for providing machine instructions and / or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal for providing machine instructions and / or data to a programmable processor.

[0138] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0139] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0140] A computer system may include clients and servers. Clients and servers are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship to each other.

[0141] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instruction is loaded and executed on a computer, the process or function described in the embodiment of the present disclosure is executed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a terminal, a user device or other programmable device. The computer program or instruction may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer program or instruction may be transmitted from one website site, computer, server or data center to another website site, computer, server or data center by wired or wireless means. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server, data center, etc. that integrates one or more available media. The available medium may be a magnetic medium, for example, a floppy disk, a hard disk, a tape; it may also be an optical medium, for example, a digital video disc (DVD); it may also be a semiconductor medium, for example, a solid state drive (SSD).

[0142] Although the present disclosure has been described in conjunction with specific features and embodiments thereof, it is apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present disclosure. Accordingly, this specification and the drawings are merely exemplary illustrations of the present disclosure as defined by the appended claims, and are deemed to have covered any and all modifications, variations, combinations or equivalents within the scope of the present disclosure. Obviously, those skilled in the art may make various modifications and variations to the present disclosure without departing from the spirit and scope of the present disclosure. Thus, if these modifications and variations of the present disclosure fall within the scope of the claims of the present disclosure and their equivalents, the present disclosure is also intended to include these modifications and variations.

Claims

1. A method for verifying continuous data availability, characterized in that: The method is applied to a first server, comprising: Receiving a plurality of replica data blocks and an initial challenge sent by the second server, wherein the plurality of replica data blocks are obtained by the second server dividing the target data to be stored into a plurality of data blocks to be stored and encrypting each data block to be stored; In response to the initial challenge, determining a data continuous availability proof result for a plurality of replica data blocks based on a verifiable delay function and a storage proof function; The result of the data continuous availability certification is sent to the second server, wherein the second server, when verifying the result of the data continuous availability certification, determines that the target data has continuous availability after the first server stores the target data.

2. The method for verifying the continuous availability of data according to claim 1, characterized in that: The method of determining the data continuous availability proof results of the plurality of replica data blocks based on the verifiable delay function and the storage proof function includes: Divide the multiple sub-replica data blocks in each replica data block into at least two sub-replica data block groups; For each sub-replica data block group associated with each replica data block, based on the verifiable delay function and the storage proof function, determine a proof result for each sub-replica data block in the sub-replica data block group, wherein the proof result includes a verifiable delay function proof result, a storage proof function proof result, and a response challenge associated with each sub-replica data block, and the number of sub-replica data blocks in each sub-replica data block group is a preset number value; Verify the verifiable delay function proof result, storage proof function proof result, and Merkle tree consisting of the response challenge of each sub-replica data block in the sub-replica data block group, and obtain the proof result of each sub-replica data block group associated with each replica data block; Aggregate the certification results corresponding to each sub-replica data block group to obtain the aggregated certification results of data continuous availability of multiple replica data blocks, and determine the aggregated certification results of data continuous availability of the multiple replica data blocks as the certification results of data continuous availability of the multiple replica data blocks.

3. The method for verifying the continuous availability of data according to claim 2, characterized in that: The step of determining the proof result for each sub-replica data block in the sub-replica data block group based on the verifiable delay function and the storage proof function includes: Starting from the first sub-replica data block in the sub-replica data block group, processing each current sub-replica data block based on the verifiable delay function to obtain a verifiable delay function proof result of the current sub-replica data block, and processing the current sub-replica data block based on the storage proof function to obtain a storage proof function proof result of the current sub-replica data block; Processing the verifiable delay function proof result of the current sub-replica data block according to the hash algorithm, and storing the proof function proof result to obtain a response challenge of the current sub-replica data block; Repeat the above process of determining the response challenge of the current sub-replica data block until each sub-replica data block in the sub-replica data block group is traversed to obtain the proof result for each sub-replica data block in the sub-replica data block group.

4. The method for verifying the continuous availability of data according to claim 2, characterized in that: The method verifies the verifiable delay function proof result, the storage proof function proof result, and the Merkle tree composed of the response challenge of each sub-replica data block in the sub-replica data block group, and obtains the proof result of each sub-replica data block group associated with each replica data block, including: Verifying the verifiable delay function proof result and the storage proof function proof result of each sub-replica data block in the sub-replica data block group respectively, and obtaining a correctness verification result corresponding to the proof result of each sub-replica data block in the sub-replica data block group; Verify the Merkle tree formed by the response challenge of each sub-replica data block in the sub-replica data block group, and obtain the response challenge sequence verification result corresponding to the sub-replica data block group; The correctness verification result corresponding to the proof result of each sub-replica data block in the sub-replica data block group and the response challenge sequentiality verification result corresponding to the sub-replica data block group are determined as the proof result of each sub-replica data block group associated with each replica data block.

5. The method for verifying the continuous availability of data according to claim 2, characterized in that: After dividing the multiple sub-replica data blocks in each replica data block into at least two sub-replica data block groups, the method includes: For each replica data block, if it is determined that the number of sub-replica data blocks contained in the last sub-replica data block group among at least two sub-replica data block groups associated with the replica data block is less than the preset number value, the last sub-replica data block group among the at least two sub-replica data block groups is filtered to obtain an updated sub-replica data block group associated with each replica data block.

6. A method for verifying continuous data availability, characterized in that: The method is applied to the second server, comprising: The target data to be stored is divided into a plurality of data blocks to be stored, and each data block to be stored is encrypted to obtain a plurality of copy data blocks; Sending the plurality of replica data blocks and the initial challenge to the first server, wherein the first server is used to determine the data continuous availability proof result of the plurality of replica data blocks according to the verifiable delay function and the storage proof function, and return the data continuous availability proof result to the second server; If the result of the data continuous availability certification is verified successfully, it is determined that after the first server stores the target data, the target data has continuous availability.

7. A first server, characterized in that: include: processor; as well as, Memory for storing programs, The program includes instructions, which, when executed by the processor, cause the processor to perform the method according to any one of claims 1 to 5.

8. A second server, characterized in that: include: processor; as well as, Memory for storing programs, The program includes instructions, which, when executed by the processor, cause the processor to perform the method according to claim 6.

9. A non-transitory computer-readable storage medium storing computer instructions, characterized in that: The computer instructions are used to cause the computer to execute the method according to any one of claims 1 to 5 or claim 6.

10. A data continuous availability verification system, characterized in that: It includes a first server and a second server, wherein: The second server is used to divide the target data to be stored into a plurality of data blocks to be stored, encrypt each data block to be stored to obtain a plurality of replica data blocks, and send the plurality of replica data blocks and the initial challenge to the first server; The first server is configured to receive the plurality of replica data blocks and the initial challenge sent by the second server, and in response to the initial challenge, determine a data continuous availability proof result of the plurality of replica data blocks based on a verifiable delay function and a storage proof function, and send the data continuous availability proof result to the second server; The second server is further configured to determine, when the result of the data continuous availability certification is verified, that the target data has continuous availability after the first server stores the target data.