WO2020220641A1

WO2020220641A1 - Data storage method and apparatus based on point-to-point network, and medium and server

Info

Publication number: WO2020220641A1
Application number: PCT/CN2019/118129
Authority: WO
Inventors: 雷琼
Original assignee: 平安科技（深圳）有限公司
Priority date: 2019-04-28
Filing date: 2019-11-13
Publication date: 2020-11-05
Also published as: CN110149373B; CN110149373A

Abstract

The present application belongs to the technical field of computers, and particularly relates to a data storage method and apparatus based on a point-to-point network, and a non-volatile computer-readable storage medium and a server. The method comprises: after receiving data to be stored uploaded by a terminal device, firstly, dividing the data to be stored into various data fragments, and calculating Hash values thereof; then, according to the Hash values of the various data fragments, determining, in a point-to-point network, target nodes respectively corresponding to the various data fragments; then, respectively constructing authorization information of the various data fragments, and sending the authorization information to the various target nodes; and finally, respectively receiving feedback information sent, after the authorization information is verified, by the various target nodes, and if the feedback information, regarding authorization information of a certain data fragment, of a target node corresponding to the data fragment is acknowledgment information, sending the data fragment to the target node corresponding to the data fragment for storage, thereby ensuring that the whole data storage process is safe and orderly.

Description

Data storage method, device, medium and server based on point-to-point network

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office on April 28, 2019, the application number is 201910347838.0, and the invention title is "Data storage methods, devices, media and servers based on peer-to-peer networks". The reference is incorporated in this application.

Technical field

This application belongs to the field of computer technology, and in particular relates to a data storage method, device, computer non-volatile readable storage medium, and server based on a peer-to-peer network.

Background technique

At present, most peer-to-peer networks often use random distribution and storage when storing data, and there is no effective authorization and verification mechanism in the distribution and storage process, resulting in the lack of overall coordination of the entire peer-to-peer network and the chaotic interaction process.

technical problem

In view of this, the embodiments of the present application provide a data storage method and device based on a peer-to-peer network, a computer non-volatile readable storage medium, and a server to solve the lack of overall coordination in the existing peer-to-peer network for data storage. The problem of confusion in the interaction process.

Technical solutions

The first aspect of the embodiments of the present application provides a data storage method based on a peer-to-peer network, which may include:

Receiving data to be stored uploaded by a terminal device, where the terminal device is any node in the peer-to-peer network;

Divide the data to be stored into each data segment, and calculate the hash value of each data segment by using a preset first hash function;

Determining, in the peer-to-peer network, the target node corresponding to each data fragment according to the hash value of each data fragment;

The authorization information of each data segment is constructed separately, and the authorization information is sent to each target node. The authorization information of the sth data segment is sent to the target node corresponding to the sth data segment, 1≤ s≤SN, SN is the number of data fragments;

Receive feedback information sent by each target node after verifying the authorization information, if the target node corresponding to the s-th data segment’s feedback information on the authorization information of the s-th data segment is confirmation information, then The s-th data segment is sent to the target node corresponding to the s-th data segment for storage.

The second aspect of the embodiments of the present application provides a data storage device, which may include a module for implementing the steps of the foregoing data storage method.

The third aspect of the embodiments of the present application provides a computer non-volatile readable storage medium, the computer non-volatile readable storage medium stores computer readable instructions, and the computer readable instructions are executed by a processor When realizing the steps of the above data storage method.

The fourth aspect of the embodiments of the present application provides a server, including a memory, a processor, and computer-readable instructions stored in the memory and running on the processor, and the processor executes the computer The steps of the above data storage method are implemented when the instruction is read.

Beneficial effect

In the embodiments of this application, the traditional random distribution storage method is no longer used, but the hash operation is used to coordinate and determine the object of data distribution as a whole (that is, the target node), and through authorization and distribution with the object. The verification mechanism ensures the safe and orderly progress of the entire data storage process.

Description of the drawings

FIG. 1 is a flowchart of an embodiment of a data storage method based on a peer-to-peer network in an embodiment of the application;

Figure 2 is a schematic flow chart of determining the target node corresponding to each data segment in a peer-to-peer network according to the hash value of each data segment;

Figure 3 is a schematic diagram of a hash ring;

Figure 4 is a schematic diagram of nodes in a peer-to-peer network mapped to a hash ring;

Figure 5 is a schematic diagram of searching for a target node on a hash ring;

FIG. 6 is a schematic flowchart of separately constructing authorization information for each data segment;

FIG. 7 is a structural diagram of an embodiment of a data storage device in an embodiment of the application;

Fig. 8 is a schematic block diagram of a server in an embodiment of the application.

Embodiments of the invention

Referring to FIG. 1, an embodiment of a data storage method based on a peer-to-peer network in an embodiment of the present application may include:

Step S101: Receive the data to be stored uploaded by the terminal device.

The terminal device is any node in the point-to-point network.

In the actual use process, if a user needs to store data in his mobile phone, tablet, computer and other terminal devices in the peer-to-peer network, he can submit a data storage request to the designated server through his terminal device, and get the server After confirming, upload the data to be stored to the server through the terminal device.

Step S102: Divide the to-be-stored data into each data segment, and use a preset first hash function to calculate the hash value of each data segment respectively.

After the server receives the data to be stored, it first performs fragmentation processing, that is, according to certain rules, a data set (ie the data to be stored) is divided into multiple independent and orthogonal data subsets (ie, Each piece of data) to facilitate distributed storage.

Specifically, the server can first calculate the number of data fragments according to the following formula:

Among them, DataBytes is the number of bytes of the data to be stored, and MaxShard is the maximum number of bytes of data fragments. The specific value can be set according to the actual situation, for example, it can be set to 1024, 2048, 4096 or other Value, Ceil is a round-up function, and SN is the number of data fragments.

Then, divide the data to be stored into SN data fragments that meet the following conditions:

Among them, s is the serial number of each data segment, 1≤s≤SN, ShdBytes _s is the number of bytes of the sth data segment, Max is the maximum value function, Min is the minimum value function, and Thresh is the preset The specific value of the ratio threshold can be set according to actual conditions, for example, it can be set to 0.1, 0.2, 0.3 or other values.

After the data segmentation is completed, the server can assign a segmentation identifier to each data segmentation, and the identifier of each data segmentation is unique in the entire peer-to-peer network, any two data segmentation segments The logos are all different. Then the server can calculate the hash value of each data segment according to the following formula:

ShardHash _s = FsHashFunc(ShardID _s )

Among them, ShardID _s is the shard ID of the s-th data shard, FsHashFunc is the first hash function, and ShardHash _s is the hash value of the s-th data shard.

All hash functions have the following basic characteristic: if two hash values are not the same (according to the same hash function), then the original input of the two hash values is also different. This feature gives the hash function a deterministic result. But on the other hand, the input and output of the hash function are not uniquely corresponding. If the two hash values are the same, the two input values are likely to be the same, but they may also be different. This situation is called "hash collision ", this is usually two different input values, deliberately calculated the same output value. However, for the commonly used hash functions in the prior art, the probability of collision is extremely low, almost negligible. Input some data to calculate the hash value, and then partially change the input value, a hash with strong confusion characteristics The function will produce a completely different hash value. The first hash function and other hash functions in this embodiment may include, but are not limited to, any hash function commonly used in the prior art such as MD4, MD5, and SHA1.

Step S103: Determine a target node corresponding to each data segment in the peer-to-peer network according to the hash value of each data segment.

Specifically, step S103 may include the process shown in Fig. 2:

Step S1031: Determine the target location point on the preset hash ring corresponding to the hash value of the s-th data segment.

The hash ring is a ring formed by connecting all the function values of the first hash function clockwise or counterclockwise in order from small to large, that is, each position on the hash ring is equal to Corresponding to a function value of the first hash function, if the value range of the first hash function is [0, N] and is arranged in a clockwise order, it can form a hash function as shown in FIG. 3 Greek ring.

Step S1032, obtain each reference position point on the Hash ring.

Wherein, each reference location point is a location point corresponding to a node in the point-to-point network. The setting process of the reference position point includes:

First, obtain the identity of each node in the peer-to-peer network.

The identity of a node can be the International Mobile Equipment Identity (IMEI) of the node, which is an electronic serial number composed of 15 digits, which corresponds to each terminal device one-to-one , And the code is unique in the world. Each terminal device will be assigned a globally unique number after assembly. This number will be recorded by the manufacturer from production to delivery.

The obtained identity of each node is expressed as: NodeID ₁ , NodeID ₂ , ..., NodeID _m , ..., NodeID _M , where m is the serial number of each node, 1≤m≤M, and M is the point-to-point network The number of nodes in, NodeID _m is the identity of the mth node.

Then, a preset second hash function is used to hash the identity of each node in the peer-to-peer network to obtain the hash value of each node.

Specifically, the hash value of each node can be calculated separately according to the following formula:

NodeHash _m = SdHashFunc(NodeID _m )

Wherein, SdHashFunc is the second hash function, and the value range of the second hash function is consistent with the value range of the first hash function, so as to ensure that the two can be mapped to the same hash ring , NodeHash _m is the hash value of the mth node.

Finally, the location point on the hash ring corresponding to the hash value of the mth node is determined as the reference location point corresponding to the mth node.

Figure 4 shows the situation where the hash values of the four nodes are respectively mapped to the hash ring, and the location points corresponding to NodeHash ₁ , NodeHash ₂ , NodeHash ₃ , and NodeHash ₄ are the respective reference location points.

Step S1033: Search for the reference location point clockwise or counterclockwise from the target location point, and determine the node corresponding to the first reference location point found as the target node corresponding to the s-th data segment .

5 as an example, the first data fragments from the hash value corresponding to the target position ShardHash ₁ clockwise to find the point, the position of the first reference point is found NodeHash ₂ corresponding location point, then the point The second node in the network is determined as the target node corresponding to the first data fragment.

Through the above method, the following storage correspondence can be determined:

数据分片Data fragmentation	目标节点Target node

数据分片1、数据分片2Data Shard 1, Data Shard 2	节点2Node 2
数据分片3Data fragment 3	节点3Node 3
数据分片4、数据分片5Data Shard 4, Data Shard 5	节点4Node 4
数据分片6、数据分片7Data Shard 6, Data Shard 7	节点1 Node 1

If the counterclockwise search method is adopted, the specific process is similar to the counterclockwise search process. For details, please refer to the above process, which will not be repeated here.

Step S104: Construct authorization information of each data segment respectively, and send the authorization information to each target node respectively.

Specifically, the process of constructing authorization information may include the steps shown in FIG. 6:

Step S1041 encapsulate the fragment identification, hash value, target node identification, authorization aging information, and certificate hash value of the sth data fragment into authorized content of the sth data fragment.

The authorization aging information is generally a point in time, that is, the point in time when the authorization information becomes invalid, and the authorization information is valid before this point in time.

The certificate hash value is a hash value obtained by performing a hash operation on the electronic certificate of the peer-to-peer network.

Preferably, the authorized content may also include Nonce, which is an arbitrary or non-repeated random value that is used only once, to ensure that the information is not reused in order to resist replay attacks.

Step S1042, using a preset third hash function to perform a hash calculation on the authorized content of the s-th data segment to obtain an authorization summary of the s-th data segment.

Step S1043: Use a preset data encryption algorithm to encrypt the authorization digest of the s-th data segment to obtain a digital signature of the s-th data segment.

The digital signature plays two roles here. First, it can confirm that the authorized content comes from the server. Second, it can confirm that the authorized content has not been tampered with during the transmission process and no data has been lost. Because of the characteristics of the hash function, as long as any bit in the authorized content changes, the authorization digest calculated by the hash function will change. Therefore, if the authorized content does not change during the transmission process, it can be Make sure that the authorized content has not been tampered with and that the authorized content has been completely transmitted.

Step S1044: Construct the authorized content of the sth data segment, the digital signature, and the electronic certificate into authorization information of the sth data segment.

The electronic certificate is issued by a root certificate trusted by each node in the peer-to-peer network, and is used to prove the authenticity of the public key of the server, so that each node can use the public key provided by the server to perform subsequent decryption operations.

After the above authorization information construction process is completed, the authorization information of the sth data segment is sent to the target node corresponding to the sth data segment.

Step S105: Receive feedback information sent by each target node after verifying the authorization information, and store each data fragment according to the feedback message.

After any target node receives the authorization information sent by the server, it can perform four-fold verification through the following process:

The first verification: extract the electronic certificate in the authorization information and perform a hash operation on it to obtain its hash value, record the hash value as verify_hash, then extract the certificate hash value in the authorization information, and record it For platform_certificate_hash, compare the two. If the comparison between the two is inconsistent, it means that the electronic certificate has been tampered with, and the current target node can reject the authorization information received this time and send rejection information to the server. If the two are consistent, it means that the electronic certificate has not been tampered with, and the subsequent verification process continues.

Second verification: use the root certificate trusted by the target node to verify the electronic certificate in the authorization information. If the verification fails, it means that the electronic certificate is not a real electronic certificate, and the current target node can reject the receipt Authorization information, and send rejection information to the server. If the verification is passed, it means that the electronic certificate is a real electronic certificate, and the subsequent verification process continues.

The third verification: extract the digital signature from the authorization information and verify it. Specifically, first extract the authorized content in the authorization information, and use the third hash function to calculate the authorization digest, then extract the public key from the electronic certificate, and use the public key to decrypt the digital signature to obtain the decrypted data , And finally compare the calculated authorization summary with the decrypted data. If the two comparisons are inconsistent, it means that the authorized content has been tampered with, and the current target node can reject the authorization information received this time and send it to the server Reject information. If the two are consistent, it means that the authorized content has not been tampered with, and the subsequent verification process continues.

Fourth verification: extract the target node ID in the authorization information, and determine whether the node ID of the current target node is consistent with it. If the two are inconsistent, it means that the current target node is not the node that needs to perform storage data sharding, then the current target The node can reject the authorization information received this time and send the rejection information to the server. If the two are the same, it means that the current target node is the node that needs to perform storage data sharding. At this time, the current target node will send a confirmation message to the server.

After the server receives the feedback information sent by each target node after verifying the authorization information, it judges it, if the target node corresponding to the sth data segment has an authorization information for the sth data segment If the feedback information is rejection information, the authorization information of the s-th data segment is reconstructed according to step S104, and the authorization information is resent to the target node corresponding to the s-th data segment, until the authorization information corresponding to the s-th data segment is received. The data fragment corresponds to the confirmation message sent by the target node. If the feedback information of the authorization information of the s-th data segment by the target node corresponding to the s-th data segment is confirmation information, the s-th data segment is sent to the target node corresponding to the s-th data segment Store it.

After the target node receives the data fragment sent by the server, it compares the fragment ID of the data fragment with the fragment ID in the authorization information. If the two comparisons are inconsistent, it means that the data fragment is received incorrectly. The server sends error feedback information. If the two are consistent, the data fragmentation is correct. The content of the data fragmentation is further checked, the hash value of the data fragment is calculated, and the hash value is compared with the authorization information. The hash value is compared. If the two comparisons are inconsistent, it means that the content of the currently received data segment has been tampered with, and an error feedback message is sent to the server. If the two are consistent, it means the currently received data segment. The content of the film is complete and correct, and it is stored in the current node for storage.

In summary, in the embodiments of the present application, the traditional random distribution storage method is no longer used, but the hash operation is used to coordinate the overall determination of the data distribution object (that is, the target node), and the distribution object The authorization and verification mechanism between them ensures the safe and orderly progress of the entire data storage process.

It should be understood that the size of the sequence number of each step in the foregoing embodiment does not mean the order of execution. The execution sequence of each process should be determined by its function and internal logic, and should not constitute any limitation to the implementation process of the embodiment of the present application.

Corresponding to the data storage method based on a peer-to-peer network described in the above embodiment, FIG. 7 shows a structural diagram of an embodiment of a data storage device provided in an embodiment of the present application.

In this embodiment, a data storage device may include:

The data receiving module 701 is configured to receive data to be stored uploaded by a terminal device, where the terminal device is any node in the peer-to-peer network;

The data division module 702 is configured to divide the data to be stored into data fragments;

The slice hash value calculation module 703 is configured to use the preset first hash function to calculate the hash value of each data slice respectively;

The target node determining module 704 is configured to determine a target node corresponding to each data segment in the peer-to-peer network according to the hash value of each data segment;

The authorization information construction module 705 is used for separately constructing authorization information of each data segment;

The authorization information sending module 706 is configured to send the authorization information to each target node respectively, where the authorization information of the sth data segment is sent to the target node corresponding to the sth data segment, 1≤s≤SN , SN is the number of data fragments;

The feedback information receiving module 707 is configured to receive feedback information sent by each target node after verifying the authorization information;

The data segment sending module 708 is configured to send the sth data segment to the sth data segment if the feedback information of the target node corresponding to the sth data segment to the authorization information of the sth data segment is confirmation information. The target node corresponding to the s data fragments is stored.

Further, the data division module may include:

The number of fragments calculation unit is used to calculate the number of data fragments;

The data division unit is configured to divide the data to be stored into SN data fragments.

Further, the target node determining module may include:

The target location point determination unit is configured to determine a target location point on a preset hash ring corresponding to the hash value of the s-th data segment, where the hash ring is determined by the first hash function All the function values of is connected clockwise or counterclockwise in order from small to large to form a circular ring, that is, each position point on the hash ring corresponds to a function value of the first hash function;

A reference location point acquiring unit, configured to acquire each reference location point on the Hash ring, where each reference location point is a location point corresponding to a node in the point-to-point network;

The target node determining unit is configured to search for the reference location point clockwise or counterclockwise from the target location point, and determine the node corresponding to the first reference location point found as the s-th data slice The corresponding target node.

Further, the data storage device may further include:

An identity acquisition module, used to acquire the identity of each node in the peer-to-peer network;

The node hash value calculation module is configured to use a preset second hash function to hash the identity of each node in the peer-to-peer network to obtain the hash value of each node. The second hash The value range of the function is consistent with the value range of the first hash function;

The reference location point determination module is used to determine the location point on the hash ring corresponding to the hash value of the mth node as the reference location point corresponding to the mth node, 1≤m≤M, where M is State the number of nodes in the point-to-point network.

Further, the authorization information construction module may include:

The authorized content encapsulation unit is used to encapsulate the fragment identification, hash value, target node identification, authorization aging information, and certificate hash value of the sth data fragment into the authorized content of the sth data fragment, the certificate The hash value is a hash value obtained by performing a hash operation on the electronic certificate of the peer-to-peer network;

The authorization summary calculation unit is configured to use a preset third hash function to hash the authorized content of the s-th data segment to obtain the authorization summary of the s-th data segment;

The data encryption unit is used to encrypt the authorization digest of the s-th data segment using a preset data encryption algorithm to obtain the digital signature of the s-th data segment;

The authorization information construction unit is used to construct the authorization content of the sth data segment, the digital signature, and the electronic certificate into the authorization information of the sth data segment.

Those skilled in the art can clearly understand that, for the convenience and conciseness of description, the specific working process of the devices, modules and units described above can refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

In the above-mentioned embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail or recorded in an embodiment, reference may be made to related descriptions of other embodiments.

FIG. 8 shows a schematic block diagram of a server provided by an embodiment of the present application. For ease of description, only the parts related to the embodiment of the present application are shown.

In this embodiment, the server 8 may include: a processor 80, a memory 81, and computer-readable instructions 82 stored in the memory 81 and executable on the processor 80, such as executing the aforementioned point-to-point based Computer-readable instructions for network data storage methods. When the processor 80 executes the computer-readable instructions 82, the steps in the foregoing embodiments of the data storage method based on a peer-to-peer network are implemented, such as steps S101 to S105 shown in FIG. 1. Alternatively, when the processor 80 executes the computer-readable instructions 82, the functions of the modules/units in the foregoing device embodiments are implemented, for example, the functions of the modules 701 to 708 shown in FIG.

Exemplarily, the computer-readable instruction 82 may be divided into one or more modules/units, and the one or more modules/units are stored in the memory 81 and executed by the processor 80, To complete this application. The one or more modules/units may be a series of computer-readable instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the computer-readable instructions 82 in the server 8.

The processor 80 may be a central processing unit (Central Processing Unit, CPU), other general-purpose processors, digital signal processors (Digital Signal Processors, DSP), application specific integrated circuits (ASICs), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.

The memory 81 may be an internal storage unit of the server 8, such as a hard disk or memory of the server 8. The memory 81 may also be an external storage device of the server 8, such as a plug-in hard disk equipped on the server 8, a Smart Media Card (SMC), or a Secure Digital (SD) card, Flash Card, etc. Further, the memory 81 may also include both an internal storage unit of the server 8 and an external storage device. The memory 81 is used to store the computer-readable instructions and other instructions and data required by the server 8. The memory 81 can also be used to temporarily store data that has been output or will be output.

The functional units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or software functional unit.

If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer non-volatile readable storage medium. Based on this understanding, the technical solution of this application essentially or the part that contributes to the existing technology or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium , Including several computer-readable instructions to enable a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disks or optical disks, etc., which can store computer-readable instructions. Medium.

A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing relevant hardware through computer-readable instructions. The computer-readable instructions can be stored in a non-volatile computer. In a readable storage medium, when the computer-readable instructions are executed, they may include the processes of the above-mentioned method embodiments. Wherein, any reference to memory, storage, database or other media used in the embodiments provided in this application may include non-volatile and/or volatile memory. Non-volatile memory may include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. As an illustration and not a limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous chain Channel (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

The above-mentioned embodiments are only used to illustrate the technical solutions of the present application, not to limit them; although the present application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that it can still implement the foregoing The technical solutions described in the examples are modified, or some of the technical features are equivalently replaced; these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

A data storage method based on a peer-to-peer network, characterized in that it comprises:

Receiving data to be stored uploaded by a terminal device, where the terminal device is any node in the peer-to-peer network;

Divide the data to be stored into each data segment, and calculate the hash value of each data segment by using a preset first hash function;

Determining, in the peer-to-peer network, the target node corresponding to each data fragment according to the hash value of each data fragment;

The authorization information of each data segment is constructed separately, and the authorization information is sent to each target node. The authorization information of the sth data segment is sent to the target node corresponding to the sth data segment, 1≤ s≤SN, SN is the number of data fragments;

Receive feedback information sent by each target node after verifying the authorization information, if the target node corresponding to the s-th data segment’s feedback information on the authorization information of the s-th data segment is confirmation information, then The s-th data segment is sent to the target node corresponding to the s-th data segment for storage.
The data storage method according to claim 1, wherein the dividing the data to be stored into data fragments comprises:

Calculate the number of data fragments according to the following formula:

Wherein, DataBytes is the number of bytes of the data to be stored, MaxShard is the maximum number of bytes of data fragments, and Ceil is a round-up function;

The data to be stored is divided into SN data fragments meeting the following conditions:

Among them, ShdBytes s is the number of bytes of the s-th data fragment, Max is the maximum value function, Min is the minimum value function, and Thresh is the preset ratio threshold.
The data storage method according to claim 1, wherein the determining the target node corresponding to each data segment in the peer-to-peer network according to the hash value of each data segment comprises:

Determine the target location point on the preset hash ring corresponding to the hash value of the s-th data segment. The hash ring is composed of all the function values of the first hash function in descending order The circular ring formed by sequentially connecting clockwise or counterclockwise, that is, each position point on the hash ring corresponds to a function value of the first hash function;

Acquiring each reference location point on the hash ring, where each reference location point is a location point corresponding to a node in the point-to-point network;

The reference location point is searched clockwise or counterclockwise from the target location point, and the node corresponding to the first reference location point found is determined as the target node corresponding to the s-th data segment.
The data storage method according to claim 3, wherein the process of setting the reference position point comprises:

Acquiring the identity of each node in the peer-to-peer network;

Use the preset second hash function to hash the identity of each node in the peer-to-peer network to obtain the hash value of each node. The value range of the second hash function is the same as that of the first The value range of the hash function is consistent;

The position point on the hash ring corresponding to the hash value of the mth node is determined as the reference position point corresponding to the mth node, 1≤m≤M, and M is the number of nodes in the point-to-point network.
The data storage method according to any one of claims 1 to 4, wherein the authorization information for separately constructing each data segment comprises:

Encapsulate the fragment identification, hash value, target node identification, authorization aging information, and certificate hash value of the sth data fragment into the authorized content of the sth data fragment, and the certificate hash value is The hash value obtained by hashing the electronic certificate of the peer-to-peer network;

Use the preset third hash function to hash the authorized content of the s-th data segment to obtain the authorization summary of the s-th data segment;

Use a preset data encryption algorithm to encrypt the authorization digest of the s-th data segment to obtain the digital signature of the s-th data segment;

The authorized content of the sth data segment, the digital signature, and the electronic certificate are constructed as the authorization information of the sth data segment.
A data storage device, characterized by comprising:

A data receiving module for receiving data to be stored uploaded by a terminal device, the terminal device being any node in a peer-to-peer network;

A data division module, used to divide the data to be stored into data fragments;

The slice hash value calculation module is used to calculate the hash value of each data slice using the preset first hash function;

A target node determining module, configured to determine the target node corresponding to each data segment in the peer-to-peer network according to the hash value of each data segment;

The authorization information construction module is used to separately construct the authorization information of each data segment;

The authorization information sending module is used to send the authorization information to each target node, wherein the authorization information of the s-th data segment is sent to the target node corresponding to the s-th data segment, 1≤s≤SN, SN is the number of data fragments;

The feedback information receiving module is configured to respectively receive the feedback information sent by each target node after verifying the authorization information;

The data segment sending module is used to send the sth data segment to the sth data segment if the feedback information of the target node corresponding to the sth data segment to the authorization information of the sth data segment is confirmation information. The target node corresponding to each data fragment is stored.
The data storage device according to claim 6, wherein the data dividing module comprises:

The number of fragments calculation unit is used to calculate the number of data fragments according to the following formula:

Wherein, DataBytes is the number of bytes of the data to be stored, MaxShard is the maximum number of bytes of data fragments, and Ceil is a round-up function;

The data dividing unit is configured to divide the data to be stored into SN data fragments that meet the following conditions:

Among them, ShdBytes s is the number of bytes of the s-th data fragment, Max is the maximum value function, Min is the minimum value function, and Thresh is the preset ratio threshold.
The data storage device according to claim 6, wherein the target node determination module comprises:

The target location point determination unit is configured to determine a target location point on a preset hash ring corresponding to the hash value of the s-th data segment, where the hash ring is determined by the first hash function All the function values of is connected clockwise or counterclockwise in order from small to large to form a circular ring, that is, each position point on the hash ring corresponds to a function value of the first hash function;

A reference location point acquiring unit, configured to acquire each reference location point on the Hash ring, where each reference location point is a location point corresponding to a node in the point-to-point network;

The target node determining unit is configured to search for the reference location point clockwise or counterclockwise from the target location point, and determine the node corresponding to the first reference location point found as the s-th data slice The corresponding target node.
8. The data storage device according to claim 8, further comprising:

An identity acquisition module, used to acquire the identity of each node in the peer-to-peer network;

The node hash value calculation module is configured to use a preset second hash function to hash the identity of each node in the peer-to-peer network to obtain the hash value of each node. The second hash The value range of the function is consistent with the value range of the first hash function;

The reference location point determination module is used to determine the location point on the hash ring corresponding to the hash value of the mth node as the reference location point corresponding to the mth node, 1≤m≤M, where M is State the number of nodes in the point-to-point network.
The data storage device according to any one of claims 6 to 9, wherein the authorization information construction module may comprise:

The authorized content encapsulation unit is used to encapsulate the fragment identification, hash value, target node identification, authorization aging information, and certificate hash value of the sth data fragment into the authorized content of the sth data fragment, the certificate The hash value is a hash value obtained by performing a hash operation on the electronic certificate of the peer-to-peer network;

The authorization summary calculation unit is configured to use a preset third hash function to hash the authorized content of the s-th data segment to obtain the authorization summary of the s-th data segment;

The data encryption unit is used to encrypt the authorization digest of the s-th data segment using a preset data encryption algorithm to obtain the digital signature of the s-th data segment;

The authorization information construction unit is used to construct the authorization content of the sth data segment, the digital signature, and the electronic certificate into the authorization information of the sth data segment.
A computer non-volatile readable storage medium, the computer non-volatile readable storage medium storing computer readable instructions, wherein the computer readable instructions are executed by a processor to implement the following steps:

Receiving data to be stored uploaded by a terminal device, where the terminal device is any node in a peer-to-peer network;

Divide the data to be stored into each data segment, and calculate the hash value of each data segment by using a preset first hash function;

Determining, in the peer-to-peer network, the target node corresponding to each data fragment according to the hash value of each data fragment;

The authorization information of each data segment is constructed separately, and the authorization information is sent to each target node. The authorization information of the sth data segment is sent to the target node corresponding to the sth data segment, 1≤ s≤SN, SN is the number of data fragments;

Receive feedback information sent by each target node after verifying the authorization information. If the target node corresponding to the s-th data segment's feedback information on the authorization information of the s-th data segment is confirmation information, then The s-th data segment is sent to the target node corresponding to the s-th data segment for storage.
The computer non-volatile readable storage medium according to claim 11, wherein the dividing the to-be-stored data into data fragments comprises:

Calculate the number of data fragments;

The data to be stored is divided into SN data fragments.
The computer non-volatile readable storage medium according to claim 11, wherein the determining in the peer-to-peer network according to the hash value of each data fragment comprises: :

Determine the target location point on the preset hash ring corresponding to the hash value of the s-th data segment. The hash ring is composed of all the function values of the first hash function in descending order The circular ring formed by sequentially connecting clockwise or counterclockwise, that is, each position point on the hash ring corresponds to a function value of the first hash function;

Acquiring each reference location point on the hash ring, where each reference location point is a location point corresponding to a node in the point-to-point network;

The reference location point is searched clockwise or counterclockwise from the target location point, and the node corresponding to the first reference location point found is determined as the target node corresponding to the s-th data segment.
The computer non-volatile readable storage medium according to claim 13, wherein the process of setting the reference position point comprises:

Acquiring the identity of each node in the peer-to-peer network;

Use the preset second hash function to hash the identity of each node in the peer-to-peer network to obtain the hash value of each node. The value range of the second hash function is the same as that of the first The value range of the hash function is consistent;

The position point on the hash ring corresponding to the hash value of the mth node is determined as the reference position point corresponding to the mth node, 1≤m≤M, and M is the number of nodes in the point-to-point network.
The computer non-volatile readable storage medium according to any one of claims 11 to 14, wherein the authorization information for separately constructing each data segment comprises:

Encapsulate the fragment identification, hash value, target node identification, authorization aging information, and certificate hash value of the sth data fragment into the authorized content of the sth data fragment, and the certificate hash value is The hash value obtained by hashing the electronic certificate of the peer-to-peer network;

Use the preset third hash function to hash the authorized content of the s-th data segment to obtain the authorization summary of the s-th data segment;

Use a preset data encryption algorithm to encrypt the authorization digest of the s-th data segment to obtain the digital signature of the s-th data segment;

The authorized content of the sth data segment, the digital signature, and the electronic certificate are constructed as the authorization information of the sth data segment.
A server includes a memory, a processor, and computer readable instructions stored in the memory and running on the processor, wherein the processor executes the computer readable instructions to implement the following steps :

Receiving data to be stored uploaded by a terminal device, where the terminal device is any node in a peer-to-peer network;

Divide the data to be stored into each data segment, and calculate the hash value of each data segment by using a preset first hash function;

Determining, in the peer-to-peer network, the target node corresponding to each data fragment according to the hash value of each data fragment;

The authorization information of each data segment is constructed separately, and the authorization information is sent to each target node. The authorization information of the sth data segment is sent to the target node corresponding to the sth data segment, 1≤ s≤SN, SN is the number of data fragments;

Receive feedback information sent by each target node after verifying the authorization information, if the target node corresponding to the s-th data segment’s feedback information on the authorization information of the s-th data segment is confirmation information, then The s-th data segment is sent to the target node corresponding to the s-th data segment for storage.
The server according to claim 16, wherein the dividing the to-be-stored data into data fragments comprises:

Calculate the number of data fragments;

The data to be stored is divided into SN data fragments.
The server according to claim 16, wherein the determining, in the peer-to-peer network, the target node corresponding to each data fragment according to the hash value of each data fragment comprises:

Determine the target location point on the preset hash ring corresponding to the hash value of the s-th data segment. The hash ring is composed of all the function values of the first hash function in descending order The circular ring formed by sequentially connecting clockwise or counterclockwise, that is, each position point on the hash ring corresponds to a function value of the first hash function;

Acquiring each reference location point on the hash ring, where each reference location point is a location point corresponding to a node in the point-to-point network;

The reference location point is searched clockwise or counterclockwise from the target location point, and the node corresponding to the first reference location point found is determined as the target node corresponding to the s-th data segment.
The server according to claim 18, wherein the process of setting the reference position point comprises:

Acquiring the identity of each node in the peer-to-peer network;

Use the preset second hash function to hash the identity of each node in the peer-to-peer network to obtain the hash value of each node. The value range of the second hash function is the same as that of the first The value range of the hash function is consistent;

The position point on the hash ring corresponding to the hash value of the mth node is determined as the reference position point corresponding to the mth node, 1≤m≤M, and M is the number of nodes in the point-to-point network.
The server according to any one of claims 16 to 19, wherein the authorization information for separately constructing each data segment comprises:

Encapsulate the fragment identification, hash value, target node identification, authorization aging information, and certificate hash value of the sth data fragment into the authorized content of the sth data fragment, and the certificate hash value is The hash value obtained by hashing the electronic certificate of the peer-to-peer network;

Use the preset third hash function to hash the authorized content of the s-th data segment to obtain the authorization summary of the s-th data segment;

Use a preset data encryption algorithm to encrypt the authorization digest of the s-th data segment to obtain the digital signature of the s-th data segment;

The authorized content of the sth data segment, the digital signature, and the electronic certificate are constructed as the authorization information of the sth data segment.