CN112600898A

CN112600898A - Electronic archive storage method based on block chain technology

Info

Publication number: CN112600898A
Application number: CN202011421461.8A
Authority: CN
Inventors: 杨志高; 温贤强
Original assignee: Nanjing Erren Technology Co Ltd
Current assignee: Nanjing Erren Technology Co Ltd
Priority date: 2020-12-07
Filing date: 2020-12-07
Publication date: 2021-04-02
Anticipated expiration: 2040-12-07
Also published as: CN112600898B

Abstract

The invention discloses an electronic archive storage method based on a block chain technology, which comprises the following steps: each demand party signs an intelligent contract of the storage service according to the storage service demand of each demand party and the corresponding storage party, and the intelligent contract of the storage service is linked to take effect; the method comprises the following steps that a demand party processes an electronic file to be stored into a storage block, storage demand information is issued to a corresponding storage party to trigger a storage service intelligent contract between the demand party and the corresponding storage party, the storage party stores a relevant storage block into a storage space corresponding to the storage party, and storage transaction information is generated and submitted to a block chain; the storage block is only stored in a demand party and a storage party, and the storage service intelligent contract signing transaction, the storage service intelligent contract contracting transaction, the storage block deleting transaction and the like are defined into blockchain transaction information which is submitted to a blockchain and stored in the blockchain after being linked according to a blockchain common identification mechanism, so that the safe and efficient storage and daily management of the archive data are realized.

Description

Electronic archive storage method based on block chain technology

Technical Field

The invention relates to the technical field of electronic archive storage, in particular to an electronic archive storage method based on a block chain technology.

Background

With the continuous progress of society and the continuous development of information technology, more and more files exist in an electronic form, and electronic files are formed. However, electronic archives, like other electronic data, are easily damaged, i.e. easily tampered, forged, destroyed or destroyed, and are not marked after being damaged, and are difficult to be identified and judged. Electronic files are also a type of file that needs to maintain its real and long-term availability, while electronic files are vulnerable to corruption, with a serious conflict between the two. Therefore, how to avoid the destruction of the electronic archive, so that the electronic archive can be maintained to be real and usable for a long time, is an urgent problem to be solved in the current electronic archive management, that is, how to reliably store the electronic archive for a long time and can prove that the electronic archive is real at any time.

The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. The blockchain has the characteristics of tamper resistance and distributed storage. However, at present, only a small number of files with lower security level can be stored in the blockchain node in the form of ordinary documents, and for electronic files with higher security level requirements, the distributed storage of files in the blockchain node may cause a potential safety hazard that is difficult to efficiently and integrally automate management. How to effectively utilize the block chain to perform safe, effective and fully controllable management on the electronic file with higher security level requirement becomes a problem to be solved urgently.

Disclosure of Invention

Aiming at the defects in the prior art, the invention provides an electronic file storage method based on a block chain technology, wherein a storage block is only stored on a demand party and a storage party, and block chain transaction information such as storage service intelligent contract signing transaction, storage service intelligent contract contracting transaction, storage block deleting transaction and the like is defined to be stored in the block chain after being submitted to the block chain according to a block chain common identification mechanism, so that the safe and efficient storage and daily management of file data are realized.

In order to achieve the purpose, the invention adopts the following technical scheme:

an electronic archive storage method based on a block chain technology comprises the following steps:

s1, dividing the identity of one node in the block chain relative to another node into a demand party, a storage party and a non-storage relation, each demand party signs an intelligent contract of the storage service according to the demand of the storage service and the storage party corresponding to the demand party, and the intelligent contract of the storage service is uplink effective; one demand side corresponds to at least one storage side, and each storage side corresponds to at least one demand side;

s2, the demander processes the electronic file to be stored into a storage block, issues storage demand information to the corresponding storage party to trigger a storage service intelligent contract between the two, the storage party verifies the received storage demand information and the storage block respectively in combination with the storage service intelligent contract, and stores the relevant storage block into the storage space corresponding to the storage party according to the signed storage service intelligent contract after the verification is passed, generates storage transaction information and submits the storage transaction information to a block chain;

and S3, the demand side and the storage side manage and verify the authenticity of the storage block according to the storage block information or the storage transaction information.

In order to optimize the technical scheme, the specific measures adopted further comprise:

further, in step S1, the content of the storage service intelligent contract to be signed sent by the demander includes a demander archive code, a demander block number, a storage space size for requesting signing, a storage party archive code, a storage party block number and a demander signature;

and the storage party evaluates the intelligent contract of the storage service to be signed, submits the intelligent contract to the block chain after the evaluation passes and the signature of the storage party is attached to the intelligent contract of the storage service to be signed, and the intelligent contract of the storage service becomes effective if the cochain is successful.

Further, the electronic archive storage method comprises the following steps:

the demander calculates the growth characteristics of subsequent electronic file data by utilizing historical electronic file data according to a preset signing period, and calculates the total amount of storage space required by the next signing period by combining the existing electronic file data;

if the total number of the storage spaces required by the next signing period is larger than the total number of the existing storage spaces, calculating to obtain a newly added storage space and the maximum storage copy number, evaluating the currently signed intelligent contract of the storage service to determine whether the requirements of the newly added storage space required by the next signing period and the corresponding maximum storage copy number can be met, if not, automatically generating the intelligent contract of the storage service to be signed according to the evaluation result, and requesting to add a new storage party or add the storage space of the existing storage party;

and if the total number of the storage spaces required by the next signing period is less than the total number of the existing storage spaces and the difference value between the two storage spaces reaches a preset difference value threshold, combining the maximum number of the storage copies, the information of the storage blocks to be invalidated and the free storage space of the existing storage party, and requesting to remove or update the corresponding storage service intelligent contract with part of the storage party so as to reduce the total number of the storage spaces.

Further, the storage block comprises a block head and a block body;

the block header comprises an archive code of a demand party, a block number of the demand party and signature data of the demand party on information except a signature field in the storage block;

the block body comprises a certain amount of archive data blocks, each archive data block comprises an archive number corresponding to the archive data, an abstract obtained by Hash before encryption of the electronic archive, keys randomly generated and in one-to-one correspondence with the electronic archive, a key ciphertext obtained by encrypting the key by using a public key of a demand side, and archive ciphertext data obtained by encrypting the electronic archive by using the key.

Further, the file name naming rule of the storage block is as follows: requiring party archive code-requiring party wholesale number-yyyyMMddHHmmss-8 bit random number, Dat; where yyymmddhhmmss is the time at which the memory block was generated.

Further, the storage transaction information comprises storage demand information, corresponding storage electronic archive information and a storage party signature;

the stored electronic archive information only comprises an archive number corresponding to archive data and an abstract obtained by Hash before encryption of the electronic archive.

Further, the storage demand information comprises a demand party archive code, a demand party block number, a storage block size, a storage block hash value, a storage block acquisition mode, a storage party archive code, a storage party block number and a demand party signature;

the acquisition mode of the storage block comprises online acquisition and offline acquisition.

Further, in step S2, after the demander sends the storage demand information for a preset duration, the demander queries the stored uplink transaction information corresponding to the storage block, and if no relevant information is found, sends a storage demand processing query message to the storage party to query the result of the current stored transaction, where the storage demand processing query message at least includes a storage block hash value, the storage party returns a storage demand processing query response to the demander, and the storage demand processing query response includes the storage block hash value, the first result code, and the first result description;

the first result description comprises one of pending, in-process, waiting for a memory block, processing completed, no memory information received, memory requirement information exception, insufficient memory space, failure to acquire a memory block, incorrect memory block, memory transaction uplink failure and unknown error.

Further, in step S3, the demander performs all deletion processing on the relevant archive by initiating a storage block deletion transaction;

the storage block deletion transaction comprises a requiring party archive code, a requiring party block number, a storing party archive code, a storing party block number, a storage block hash value and a requiring party signature.

Further, in step S3, the demander makes the storage party give a storage block acquisition request response containing storage block data by initiating a storage block acquisition request to acquire a storage block;

the storage block acquisition request and the storage block acquisition request response both comprise a storage transaction hash value, and the storage block acquisition request response further comprises a second result code and a second result description;

the second result description comprises one of the storage block acquisition request is illegal, the storage block does not exist, the storage block data is returned and an unknown error.

The invention has the beneficial effects that:

(1) the storage block provided by the invention is only provided on a demand side and a storage side, other nodes of the block chain are not provided, and the transaction information belonging to the block chain, such as the storage service intelligent contract signing transaction, the storage service intelligent contract contracting transaction, the storage block deleting transaction and the like, is submitted to the block chain according to a block chain consensus mechanism and then is stored in the block chain.

(2) The storage transaction and the storage block association are realized through the storage block Hash, and the storage block and the block chain association are indirectly realized. The storage blocks are not stored in the block chain, the storage and processing burden of the block chain nodes can be effectively reduced, the demand side signs the storage service intelligent contract to store the electronic archive data through a plurality of storage sides, the distributed storage of the electronic archive data can be realized, and the storage safety of the electronic archive data is ensured.

(3) The Hash value of the electronic file cannot be tampered after being used as information in the storage transaction, and the authenticity of the electronic file can be verified by verifying whether the Hash value of the electronic file has the corresponding storage transaction.

(4) The intelligent contract-clearing mechanism for the storage block deletion and storage service can use the storage space according to actual needs, and improves the utilization rate of the storage space. And the demand side calculates the storage space required by the demand side regularly, and the corresponding storage service intelligent contract is automatically adjusted by combining the maximum storage copy number, the storage space demand information and the like, so that the maximum utilization of all the storage spaces is realized.

(5) The storage block maintenance mechanism provided by the invention ensures that the data stored by each storage party is consistent, and the storage block can be timely discovered and repaired if being tampered.

Drawings

FIG. 1 is a flow chart of a method for storing an electronic file based on a block chain technique according to the present invention.

Fig. 2 is a schematic diagram of a storage service intelligent contract requirement information data structure of the present invention.

Fig. 3 is a schematic diagram of a storage service smart contract signing transaction structure of the present invention.

FIG. 4 is a schematic diagram of a storage service intelligent contract settlement transaction structure of the present invention.

FIG. 5 is a schematic diagram of a memory block structure according to the present invention.

FIG. 6 is a schematic diagram of a storage requirement information structure according to the present invention.

FIG. 7 is a schematic diagram of a storage transaction structure of the present invention.

FIG. 8 is a diagram illustrating a storage requirement processing query message structure according to the present invention.

FIG. 9 is a diagram illustrating a storage requirement processing query response message structure according to the present invention.

FIG. 10 is a block delete transaction structure of the present invention.

FIG. 11 is a diagram illustrating a structure of a memory block acquire request according to the present invention.

Fig. 12 is a schematic diagram of a memory block fetch request response message structure according to the present invention.

FIG. 13 is a schematic diagram of a main flow of storage space planning of a demand side according to the present invention.

FIG. 14 is a signed storage service intelligent contract flow diagram of the present invention.

FIG. 15 is a diagram of a smart contract flow diagram for a decommission service of the present invention.

FIG. 16 is a schematic diagram of the main flow of storing data according to the present invention.

FIG. 17 is a flow diagram of the storage side processing storage demand of the present invention.

FIG. 18 is a flow chart illustrating the storage request information processing of the pending cache pool on the storage side according to the present invention.

FIG. 19 is a flow chart illustrating the process of storing results by the requester according to the present invention.

FIG. 20 is a flow diagram of a storage processing request processing query message of the present invention.

FIG. 21 is a block delete transaction processing flow diagram of the present invention.

Fig. 22 is a flowchart illustrating the maintenance of the memory block by the memory block information according to the present invention.

FIG. 23 is a flow diagram illustrating the maintenance of memory blocks per memory transaction in accordance with the present invention.

FIG. 24 is a flow diagram illustrating the process of fetching memory blocks from other memory parties in accordance with the present invention.

Fig. 25 is a schematic diagram of a memory block acquire request response processing flow according to the present invention.

FIG. 26 is a flow chart illustrating an electronic file retrieval process according to the present invention.

FIG. 27 is a schematic diagram of an electronic file authenticity verification process according to the present invention.

Detailed Description

The present invention will now be described in further detail with reference to the accompanying drawings.

It should be noted that the terms "upper", "lower", "left", "right", "front", "back", etc. used in the present invention are for clarity of description only, and are not intended to limit the scope of the present invention, and the relative relationship between the terms and the terms is not limited by the technical contents of the essential changes.

Some terms in the present invention explain:

an archive: a specialized organization that centrally manages a particular range of files.

All the steps: the archives which are formed by a national institution, a social organization or an individual and have organic connection are integrated.

A file-setting unit: a national institution, social organization, or individual that constitutes a portfolio of archives. The file business of a filing unit is uniformly managed by a certain archive, and files are periodically handed over to the archive. The files are managed by corresponding file-establishing units before being handed over to the archives, and are managed by the archives uniformly after being handed over to the archives. The invention refers to the file-establishing unit which mainly refers to the national institution or social organization.

Archive code: the national archives are uniformly coded by the national archives bureau, namely, the archives codes of the archives are distributed, and one archive can be uniquely distinguished according to the codes.

The whole section number: the archives at all levels are numbers distributed to units which enter the archives or are possible to enter the archives and are used for distinguishing archive units, and the wholesale numbers in the jurisdiction range of the same archives are unique, but the wholesale numbers in different archives are not unique. The archive is also a filing unit, and the whole file number of the archive is as follows: 0000, other values may be assigned as needed.

One file unit can be uniquely distinguished nationwide through the archive code + the whole number.

The electronic file referred to in the present invention means an electronic file stored in a filing unit archive or in a filing office.

The invention applies the asymmetric encryption technology, and the common asymmetric encryption algorithm is as follows: RSA, Elgamal, knapsack algorithm, Rabin, D-H, ECC (elliptic curve cryptography algorithm), etc. The data encryption and decryption are completed through different keys, the encryption and decryption keys appear in pairs, namely a private key and a public key pair, and the private key is secret and the public key is public. Each file establishment unit and each archive office select one of the asymmetric encryption algorithms to generate respective public key and private key pairs. The private keys are respectively kept by each file-establishing unit and each archive, and the public keys are issued to the block chain for subsequent use.

The invention applies a symmetric encryption technology, and common symmetric encryption algorithms are as follows: DES, 3DES, AES128, AES192, AES256, AES512, Blowfish, etc. The data is encrypted by using a certain key and a selected encryption algorithm, and the encrypted data can be decrypted only by using the key during encryption and the same encryption algorithm used during encryption.

The invention applies the electronic file hash calculation technology, and the common hash algorithm is as follows: MD4, MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA-512, etc. The electronic file can generate a character string (also called a summary and a Hash value) with a fixed length by using a Hash algorithm selected by a Hash technology. In general, digests generated for different electronic files by using the same hash algorithm are different, and digests generated for the same electronic file by using the same hash algorithm are the same.

The invention applies the digital signature technology, generates the summary of the data to be protected by using a certain Hash algorithm, encrypts the summary by using a private key of a signer and an asymmetric algorithm to obtain the encrypted data which is the signature data, and sends the signature data and the data to be protected together. The verifier decrypts the signature data by using the public key of the signer and the corresponding asymmetric encryption algorithm to obtain a decrypted digest, then uses the same hash algorithm to generate a digest (called as a new digest) for the data needing to be protected, if the decrypted digest is consistent with the new digest, the data can be proved to be sent by the signer, otherwise, the data is not sent by the signer.

The block chain technology applied by the invention comprises a block chain constructed by using distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like, and meanwhile, the block chain also supports an intelligent contract, so that the storage process of the electronic file can be further optimized through the intelligent contract. As an embodiment, the blockchain of the present invention operates in a government network, through which the various archive units and the various archives can be interconnected, and of course, the blockchain of the present invention can also operate in other networks connecting the various archive units and the various archives.

With reference to fig. 1, the present invention provides an electronic archive storage method based on a block chain technique, the electronic archive storage method includes the following steps:

s1, dividing the identity of one node in the block chain relative to another node into a demand party, a storage party and a non-storage relation, each demand party signs an intelligent contract of the storage service according to the demand of the storage service and the storage party corresponding to the demand party, and the intelligent contract of the storage service is uplink effective; one demand side corresponds to at least one storage side, and each storage side corresponds to at least one demand side.

And S2, the demand side processes the electronic file to be stored into a storage block, issues storage demand information to the corresponding storage side to trigger a storage service intelligent contract between the demand side and the storage block, the storage side verifies the received storage demand information and the storage block respectively in combination with the storage service intelligent contract, stores the relevant storage block into the storage space corresponding to the storage side according to the signed storage service intelligent contract after the verification is passed, generates storage transaction information and submits the storage transaction information to the block chain.

The invention comprises two roles of an electronic file manager (called a demand party for short) and an electronic file storage service provider (called a storage party for short). The method comprises the steps that a demand party and a storage party sign storage service intelligent contracts, the demand party generates storage blocks (the storage blocks are described in the following description), storage information of the storage blocks is issued to the corresponding storage parties and the storage service intelligent contracts are triggered, and the storage parties store the relevant storage blocks according to the signed storage service intelligent contracts and submit storage transactions to a block chain. One demand side can sign intelligent contracts with a plurality of storage sides to realize storage of a plurality of copies of the storage block, and the more copies are stored, the more scattered storage regions are stored, and the higher the reliability is. The demand party and the storage party can sign the intelligent contract mutually to realize information mutual storage, and an information mutual storage relation can also be avoided. The distributed storage of the electronic archive is realized by signing a storage service intelligent contract and executing the storage service intelligent contract; the authenticity of the electronic file is verified by the block chain by the Hash value of the electronic file contained in the uplink storage transaction. Both the requiring party and the storing party use a combination of both the archive code and the block number to identify their respective identities.

The method of the invention designs the following data structure:

1. storage service intelligent contract demand information

Before signing the intelligent contract of the storage service, a demand side needs to make clear the demand of the storage service needed at this time so that the storage side can evaluate whether the demand can be met or not, and the demand is expressed by the demand information of the intelligent contract of the storage service. The data structure of the intelligent contract requirement information of the storage service provided by the invention is shown in figure 2.

The demander archive code: the archive code of the requesting party.

The wholesale number of the demander: the block number of the requesting party.

Storage space (bytes): the size and unit of the storage space required by the demander at this time are as follows: a byte.

Storage side archive code: and the archive codes of the storage parties selected by the demand parties and intending to provide the storage service.

Storage party full block number: the demand side selects the whole number of the storage side which is to provide the storage service.

Signing by the demander: the demander signs the data for information other than the demander signature field.

2. Storage service intelligent contract signing transaction

The storage party evaluation can meet the requirements of the demand party and signs the storage service intelligent contract if agreeing to provide the storage service for the demand party, the storage service intelligent contract is expressed by submitting the storage service intelligent contract transaction to the blockchain, the storage service intelligent contract transaction successfully chains up the corresponding storage service intelligent contract and then shows that the corresponding storage service intelligent contract becomes effective, and the storage party needs to provide the storage space meeting the contract for the corresponding demand party. The intelligent contract signing transaction structure of the storage service provided by the invention is shown in figure 3.

The demand side archive code, the demand side block number, the storage space (bytes), the storage side archive code, the storage side block number and the demand side signature are all consistent with the storage service intelligent contract demand information.

Storing the side signature: the storage side signs the signature data of the information except the storage side signature.

And determining the contractual relationship between the demand side and the storage side through the demand side signature and the storage side signature.

3. Storage service intelligent contract clearing transaction

If the storage demand of the demand party is reduced, and a certain storage party is not required to provide the corresponding storage service, the storage service intelligent contract release transaction is submitted to the block chain, after the storage service intelligent contract release transaction is linked, the storage service intelligent contract is formally released, and the storage space corresponding to the storage party can be released to other demand parties for use, so that the utilization rate of the storage space is improved. The intelligent contract-clearing transaction structure of the storage service provided by the invention is shown in figure 4.

The demander archive code: the archive code of the requesting party.

The wholesale number of the demander: the block number of the requesting party.

Contract memory space (bytes): the size of the storage space of the solution at this time, unit: a byte.

Storage side archive code: the archive code of the party is stored.

Storage party full block number: the party's block number is stored.

Signing by the demander: the demander signature data for information other than the demander signature field.

4. Memory block

When a certain archive unit needs to store electronic archive data managed by the archive unit, the electronic archive data needing to be stored is assembled and packaged according to a certain format to generate a data packet, the data packet is taken as a basic unit of data storage and delivered to a storage party to store the data, and when the data is acquired from the storage party, the data is also acquired by taking the data packet as a unit, and the data packet is called as a storage block in the invention. The memory block structure proposed by the present invention is shown in fig. 5.

The storage block is divided into a block head and a block body, as shown in the above figure.

The block head comprises: information such as an archive code, a block number, a signature and the like, and the meaning of each information is as follows:

archive code: store the archive code of the block manager (requestor).

The whole section number: the block number of the block manager (requester) is stored.

Signature: and the demander signs the data of the information except the signature field in the storage block.

The block body contains a plurality of archival data blocks, and each archival data block contains: information such as a file number, a Hash (electronic file), a secret key (ciphertext), Data (ciphertext) and the like, and the meaning of each information is as follows:

the file number is: each file can be compiled into a file number according to rules when being filed, the file number can uniquely distinguish one file in the same archive administration range, and the file numbers of different archives can be repeated. The archive code + file number can uniquely distinguish one file nationwide.

Hash (electronic archive): before the electronic file is encrypted, a certain Hash algorithm is selected to obtain an abstract.

Key (ciphertext): the key is randomly generated, each electronic file is different, the data security of the electronic files can be better protected, and the public key of a demand party is used for encrypting the key to obtain encrypted data, namely the key (ciphertext).

Data (ciphertext): and encrypting the electronic file by using a certain symmetric encryption algorithm and the key to obtain encrypted Data, namely Data (ciphertext). The electronic archive is stored in an encrypted manner, so that the stored electronic archive data can be ensured to be safe and the electronic archive data can be effectively prevented from being leaked.

The storage block file name naming rule is as follows:

archive code-block number-yyyyMMddHHmmss-8-bit random number, Dat.

Where yyymmddhhmmss is the time at which the memory block was generated.

The size of each storage block is suggested to be about 100M in order to improve the data processing and maintenance efficiency, and of course, the size can be adjusted according to actual needs.

There are two ways to generate a memory block: 1) automatically generating by the system according to rules (for example, automatically packaging electronic archives of the same filing year and the same storage period according to the filing mechanism (or problem) and the filing sequence to generate storage blocks); 2) and manually selecting the electronic files to be stored, and then packaging to generate a storage block. The specific way to use is determined according to actual needs.

5. Storing demand information

When a certain demander needs to store the electronic archive data, the stored demand information is issued to the corresponding storage party by taking the storage block as a unit, and the structure of the storage demand information provided by the invention is shown in fig. 6.

And the requiring party archive code and the requiring party full block number are corresponding contents in the storage block header.

The storage block size: size of memory block, unit: a byte.

Storage block Hash: and selecting a certain Hash algorithm for the storage block to obtain the summary information.

A storage block acquisition mode: the storage party has the following two ways to obtain the storage block:

1) and acquiring the storage block from the demand side through the network on line.

2) Offline acquisition, the demander stores the storage blocks in a removable storage medium such as: magnetic disks, removable hard disks, optical disks, etc. are handed over to the storage side, which retrieves the storage blocks from the associated storage medium.

The current archive management method requires that archives of each archive unit are archived and handed over in units of years to archives, that is, archives of the previous year are collectively archived (handed over) in a certain period of the second year, so that a large amount of electronic archive data needs to be stored in a centralized manner. If the storage block is obtained online, a large amount of network bandwidth is occupied when the data is stored, and other services are affected. Therefore, the invention especially designs an off-line acquisition mode of the storage block, and the acquisition of the storage block from the mobile storage medium can effectively reduce the occupation of network resources and improve the transmission reliability of the storage data. Meanwhile, the data in the mobile storage medium can be stored as another copy, so that the reliability of electronic archive data storage is further improved.

Storage side archive code: the archive code of the party is stored.

Storage party full block number: the party's block number is stored.

6. Storage transactions

The storage party submits a storage transaction to the blockchain after storing a storage block, and the storage transaction is formally effective after the storage transaction is linked up, and the storage transaction structure provided by the invention is shown in fig. 7.

The storage demand information is corresponding content in the storage demand information issued by the demand party.

The stored electronic archive information is a list of the file numbers and Hash values of all electronic archives in the storage block, and the file numbers and the hashes (electronic archives) in the file data block in the storage block correspond to one another. The specific electronic archive data is not stored in the storage transaction, the storage burden of the block chain block can be effectively reduced, the corresponding storage block can be found through the file number in the storage transaction to extract the corresponding electronic archive data, and the authenticity of the electronic archive can be verified through the Hash value of the electronic archive in the storage transaction.

Storing the side signature: the storage party signs the data for the information in the storage transaction except for the storage party signature field.

7. Storage demand processing query

The demanding party needs to actively track the completion of the storage demand of the storing party, and when the storage demand corresponding to the set time (for example, 10 minutes, which can be configured in the system as required) is reached and no storage transaction uplink is available, the demanding party inquires the storage demand processing situation by sending a storage demand processing inquiry message to the storing party, and the storage demand processing inquiry message structure provided by the invention is shown in fig. 8.

Storage block Hash: and storing the storage block Hash in the demand information.

8. Storage demand handling query responses

After receiving the storage demand processing query message of the demand party, the storage party returns a storage demand processing query response message to the demand party according to the storage demand processing condition, and the structure of the storage demand processing query response message provided by the invention is shown in fig. 9.

Storage block Hash: and processing the storage block Hash in the query message by using the storage requirement.

And (4) result code: code identifying the current storage demand handling condition, a three-bit code, initially defined as:

000 indicates that the process is complete.

1 indicates that processing is ongoing, such as: 100 denotes pending, 101 denotes processing, 102 denotes waiting for a memory block (used in an off-line manner), and others may be extended according to actual needs.

2 beginning to indicate processing errors, such as: 200 represents that the storage demand information is not received, 201 represents that the storage demand information is abnormal, 202 represents that the storage space is insufficient, 203 represents that the storage block acquisition is failed, 204 represents that the storage block is incorrect, 205 represents that the storage transaction uplink is failed, and the others can be expanded according to actual needs.

9 beginning with undefined errors, such as: 901 denotes unknown errors, others can be extended according to actual needs.

The results describe: this information is null for known errors for which an error code has been defined. Specific error information is returned for undefined errors at the beginning of 9.

Except for the processing state of 000 processing completion and 1 beginning, the storage party directly sends a storage demand processing query response message to the demand party after other processing errors occur, and the demand party does not need to actively query, so that the system processing efficiency is improved.

9. Memory block delete transaction

According to the requirement of file management, some files are not worth storing after being identified, and related files can be destroyed, so that the corresponding stored electronic files also need to be deleted to save storage space. The requesting party initiates a storage block deletion transaction for deleting the electronic archive data stored by each storing party, and the storage block deletion transaction structure proposed by the present invention is shown in fig. 10.

The demander archive code: the archive code of the requesting party.

The wholesale number of the demander: the block number of the requesting party.

Storage side archive code: the archive code of the party is stored.

Storage party full block number: the party's block number is stored.

Storage block Hash: the digest of the memory block that needs to be deleted corresponds to the memory block Hash in the memory transaction.

Signing by the demander: the demander deletes the signature data of the information except the demander signature field in the transaction from the storage block.

The following processing is carried out on the scene needing to be deleted in part of the electronic files in the storage block: the electronic files which do not need to be deleted are extracted to form a new storage block for storage, and the old storage block is deleted after the new storage block is successfully stored.

10. Memory block acquisition request

When a storage block of a storage party has a problem and needs to be maintained, a storage block acquisition request is sent to other related parties having the storage block to acquire the storage block, and the structure of the storage block acquisition request provided by the invention is shown in fig. 11.

Storing the transaction Hash: the digest of the stored transaction is computed using a selected hash algorithm.

11. Memory block get request reply

The demand side or the storage side receives the storage block acquisition request, processes the request and then provides a storage block acquisition request response message, and the structure of the storage block acquisition request response message provided by the invention is shown in fig. 12.

And (4) result code: code identifying a current memory block acquisition request handling condition, the three-bit code, initially defined as:

000 indicates success and the memory block is returned.

1 indicates processing errors, such as: 100 denotes that the memory block acquisition request is illegal, 101 denotes that the memory block does not exist, and the others can be expanded according to actual needs.

Storing block data: and corresponding storage block data is returned only when the storage block data is successful, and other situations are null.

The storage block provided by the invention is only provided on a demand side and a storage side, other nodes of the block chain are not provided, and the transaction information belonging to the block chain, such as the storage service intelligent contract signing transaction, the storage service intelligent contract contracting transaction, the storage block deleting transaction and the like, is submitted to the block chain according to a block chain consensus mechanism and then is stored in the block chain. The storage transaction and the storage block association are realized through the storage block Hash, and the storage block and the block chain association are indirectly realized. The storage blocks are not stored in the block chain, the storage and processing burden of the block chain nodes can be effectively reduced, the demand side signs the storage service intelligent contract to store the electronic archive data through a plurality of storage sides, the distributed storage of the electronic archive data can be realized, and the storage safety of the electronic archive data is ensured. The Hash value of the electronic file cannot be tampered after being used as information in the storage transaction, and the authenticity of the electronic file can be verified by verifying whether the Hash value of the electronic file has the corresponding storage transaction. The intelligent contract-clearing mechanism for the storage block deletion and storage service can use the storage space according to actual needs, and improves the utilization rate of the storage space. The storage block maintenance mechanism provided by the invention ensures that the data stored by each storage party is consistent, and the storage block can be timely discovered and repaired if being tampered.

The invention relates to an electronic archive storage method based on a block chain technology, which mainly comprises the following functions and processes:

demand side storage space planning

The demand side plans the required storage space and the number of storage copies according to the growth condition of the existing electronic archive data and the subsequent electronic archive data, and combines the current signed storage service intelligent contract condition to judge: if a new storage party needs to be added or the storage space of the existing storage party needs to be added, the intelligent contract operation of signing the storage service is initiated for the related storage party; and if the storage space needs to be reduced, the intelligent contract operation for relieving the storage service is initiated for the related storage parties. The main flow of the demand side storage space planning proposed by the present invention is shown in fig. 13.

And the demand side determines the size of the currently required vacant storage space according to the business requirement, and predicts the required vacant storage space according to the existing electronic file data required to be stored and the growth scale of the electronic file data.

The algorithm for calculating the size of the existing free storage space by the storage party is as follows:

(1) computing a signed storage service intelligence contract requires the total storage space provided.

The total storage space is the sum of the storage space sizes in all uplink storage service intelligent contract contracted transactions-the sum of the reduction storage space sizes in all uplink storage service intelligent contract reduction transactions.

(2) Calculating storage space consumed by storage transactions

The consumed storage space is the sum of the sizes of the storage blocks of all uplink storage transactions-the sum of the sizes of the storage blocks of all uplink storage block deletion transactions.

Wherein: and deleting the storage block Hash in the transaction according to the storage block to obtain the corresponding storage transaction, and further obtain the size of the deleted storage block.

(3) Calculating existing free memory space

The existing free storage space is the total storage space-the consumed storage space.

The storage space planning can be triggered manually or automatically when the system reaches a certain condition (for example, when the storage space of a storage block is insufficient during storage or a timed task is set for triggering).

Second, signing storage service intelligent contract

The demand side needs to sign the intelligent contract of the storage service with the storage side when the demand side has the demand for storing the electronic file data, the storage side can provide the storage service for the demand side after the contract is signed, a new storage side can be added to the contract signed with the new storage side, and the storage space of the original storage side can be expanded. The intelligent contract flow of the storage service signing proposed by the invention is shown in figure 14.

Third, release the intelligent contract of storage service

When the demand of the storage space of the demand party is reduced, the demand party can initiate storage service intelligent contract release transaction, and after the storage service intelligent contract release transaction is linked, the storage space of the related storage party can be released and provided for other demand parties to use, so that the utilization rate of the storage space is improved. The intelligent contract flow for the storage release service proposed by the invention is shown in fig. 15.

The operation of releasing the intelligent contract of the storage service is triggered by a demand side when the storage space is planned, and the demand side needs to ensure that the storage side has corresponding free space to release when the operation is triggered.

Fourthly, storing data

When the demander needs to store the electronic archive data, a storage block is generated firstly, then storage demand information is issued for the storage party, and the storage party stores the data according to the storage demand of the demander and submits storage transactions to a block chain. The main flow of storing data in the present invention is shown in fig. 16. The flow of processing storage demand by the storage side is shown in fig. 17. The storage demand information processing flow of the storage-side pending cache pool is shown in fig. 18. Unknown errors occur in the processing process, the unknown errors of the error codes 901 and the captured error information are recorded, a storage demand processing inquiry response message is sent to a demand side, and the processing flow is ended. The flow of the processing and storing result of the demander is shown in fig. 19. The flow of processing storage demand by the storage side to process the query message is shown in fig. 20.

Fifthly, deleting the stored data

And when the demand party needs to delete the storage blocks stored by the storage party, initiating a storage block deletion transaction. The memory block deletion transaction processing flow proposed by the present invention is shown in fig. 21.

Sixthly, maintenance of storage blocks

The invention provides a storage block data maintenance function: if any information in the storage block is tampered, the Hash value of the storage block changes, the Hash value cannot correspond to the storage transaction of the block chain at the moment, and the real storage block is obtained from other storage parties according to the storage transaction information to repair the storage block corresponding to the storage transaction. If there is a memory block corresponding to no memory transaction (no memory transaction or a delete memory block transaction), the memory block is deleted. The maintenance of the memory block can be triggered manually or periodically by the system (which can be configured according to actual needs by various strategies such as weekly, monthly, yearly and the like) or triggered by a certain condition (such as abnormal triggering of the memory block during the extraction of the electronic archive). The maintenance of the memory blocks proposed by the present invention is divided into two ways, namely, memory block-by-memory block and memory transaction-by-memory transaction, and the processes are respectively shown in fig. 22 and 23. The process of obtaining memory blocks from other storage parties is shown in FIG. 24. The flow of the memory block fetch request response processing is shown in fig. 25. Unknown errors occur in the processing process, the unknown errors of the error codes 901 and the captured error information are recorded, a storage block acquisition request response is sent to a requesting party, and the processing flow is ended.

Seven, electronic file extraction

When the electronic file data is required to be extracted from the storage block, the requesting party performs an electronic file data extraction operation to extract the data according to the file number in the storage transaction in the block chain, and the electronic file extraction flow proposed by the present invention is shown in fig. 26.

Eighthly, verifying authenticity of electronic file

The file number and the Hash value (the Hash value of the electronic file before encryption) of the electronic file stored this time are recorded in the storage transaction, and the storage transaction information is stored on the blockchain and cannot be tampered. The verification of the authenticity of the electronic file can be completed by comparing whether the file number and the Hash value of the electronic file recorded in the storage transaction are consistent with the file number and the Hash value of the electronic file to be verified. The flow of the authenticity verification of the electronic file proposed by the present invention is shown in fig. 27. The authenticity of the electronic file itself stored on the uplink is guaranteed by the party requiring the storage. Deletion of a memory block does not affect authenticity verification as long as a block chain has a corresponding memory transaction.

The above is only a preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above-mentioned embodiments, and all technical solutions belonging to the idea of the present invention belong to the protection scope of the present invention. It should be noted that modifications and embellishments within the scope of the invention may be made by those skilled in the art without departing from the principle of the invention.

Claims

1. An electronic archive storage method based on a block chain technology is characterized by comprising the following steps:

2. The method for storing electronic archives based on the block chain technology as claimed in claim 1, wherein in step S1, the content of the storage service intelligent contract to be signed sent by the demand side includes a demand side archive code, a demand side block number, a size of storage space required to be signed, a storage side archive code, a storage side block number and a demand side signature;

3. The method of claim 1, comprising the steps of:

4. The method of claim 1, wherein the memory block comprises a block header and a block body;

5. The method of claim 1, wherein the file name naming convention of the storage block is as follows: requiring party archive code-requiring party wholesale number-yyyyMMddHHmmss-8 bit random number, Dat; where yyymmddhhmmss is the time at which the memory block was generated.

6. The method of claim 1, wherein the storage transaction information includes storage requirement information, corresponding storage electronic profile information, and a storage party signature;

7. The method for storing the electronic archive according to claim 1 or 6, wherein the storage requirement information includes a requiring party archive code, a requiring party block number, a storage block size, a storage block hash value, a storage block acquisition mode, a storing party archive code, a storage party block number and a requiring party signature;

8. The method for storing electronic files according to claim 1, wherein in step S2, after sending the storage demand information for a preset duration, the requesting party queries the uplink information of the storage transaction corresponding to the storage block, and if no relevant information is found, sends a storage demand processing query message to the storing party to query the result of the storage transaction, where the storage demand processing query message at least includes a hash value of the storage block, and the storing party returns a storage demand processing query response to the requesting party, where the storage demand processing query response includes the hash value of the storage block, the first result code, and the first result description;

9. The method for storing electronic files according to claim 1, wherein in step S3, the requesting party performs all deletion processing on the relevant files by initiating a storage block deletion transaction;

10. The method for storing an electronic archive according to claim 1, wherein in step S3, the requesting party makes the storing party respond to the storage block obtaining request containing the data of the storage block by initiating the storage block obtaining request to obtain the storage block;