CN116881533B - Digital file management method and system based on blockchain - Google Patents
Digital file management method and system based on blockchain Download PDFInfo
- Publication number
- CN116881533B CN116881533B CN202311139135.1A CN202311139135A CN116881533B CN 116881533 B CN116881533 B CN 116881533B CN 202311139135 A CN202311139135 A CN 202311139135A CN 116881533 B CN116881533 B CN 116881533B
- Authority
- CN
- China
- Prior art keywords
- node
- transaction
- nodes
- archive
- blockchain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000007726 management method Methods 0.000 title claims abstract description 26
- 238000012986 modification Methods 0.000 claims description 30
- 230000004048 modification Effects 0.000 claims description 30
- 238000000034 method Methods 0.000 claims description 27
- 238000012216 screening Methods 0.000 claims description 24
- 230000006870 function Effects 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 10
- 230000009191 jumping Effects 0.000 claims description 9
- 239000013598 vector Substances 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000011835 investigation Methods 0.000 claims description 6
- 230000008439 repair process Effects 0.000 claims description 3
- 238000012545 processing Methods 0.000 abstract description 7
- 230000005540 biological transmission Effects 0.000 abstract description 2
- 239000000463 material Substances 0.000 abstract description 2
- 230000009286 beneficial effect Effects 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 4
- 239000010865 sewage Substances 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000004065 wastewater treatment Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/93—Document management systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
- G06F21/57—Certifying or maintaining trusted computer platforms, e.g. secure boots or power-downs, version controls, system software checks, secure updates or assessing vulnerabilities
- G06F21/577—Assessing vulnerabilities and evaluating computer system security
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention relates to the technical field of data processing, in particular to a digitalized file management method and system based on a blockchain, which realize file information blockchain storage by digitizing the existing file management, realize authority management and operation backtracking of file management personnel, thereby overcoming the complexity of file information management flow, reducing the consumption of manpower and material resources for repeated file storage, effectively preventing file data from being tampered by storing and managing the digitalized file through the blockchain, preventing the phenomenon of losing the file data in the transmission process, and ensuring the storage of the digitalized file to be safer by judging whether the trade in the blockchain achieves consensus and whether the trade is in safety.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a digital archive management method and system based on a blockchain.
Background
The file informatization and digitalization processes develop rapidly, the traditional paper file is converted into the digital file which is more convenient to store, and the digital file has flexibility compared with the traditional paper file, so that the modification and replacement in the file can be kept and archived, and the rigor and the authenticity of the file are ensured. In actual work, the semi-automatic processing of each flow of file digitization is basically realized based on the support of various business software, but the digitization splitting link is still in the original state of manual identification processing, and particularly under the conditions of large digitization quantity and large number of pieces, copying, pasting, checking and checking are needed to be repeated manually, so that a great deal of manpower and time are required to be consumed, and errors are extremely easy to occur. In the prior art, there is a high risk at the operation end during modification and operation of a file manager, and due to the traceable property of the digital file after modification, data redundancy is caused, and there is a great inconvenience in checking or retrieving the file, in the chinese patent application No. 2022115016280 (a digital file management system), it is proposed to classify the digital file by using high-dimensional semantic features, and intelligent and accurate file archiving processing can be performed based on text semantic understanding of the electronic scanned document, so as to implement digital file management, but there is a need for a digital file management method and system based on a block chain to solve the above-mentioned problems.
Disclosure of Invention
In view of the limitations of the prior art, the present invention is directed to an integrated sewage treatment method and system based on dynamic monitoring, so as to solve one or more technical problems in the prior art, and at least provide a beneficial choice or creation condition.
A blockchain-based digitized archive management method, the method comprising the steps of:
s100: digitizing the file and storing the file in a memory;
s200: storing the digitized file in a distributed manner through a block chain;
s300: defining each time of modifying the digital file in the node as a blockchain transaction, and determining that the transaction is valid;
s400: and judging the storage of the digitized file and the security of the transaction, and adding encryption information at the node position.
Further, in step S100, the data in the archive is digitized by electronic archive scanning, and stored according to the archive as a whole, the creation time, the modification time, and the digitizing time in the archive are recorded by semantic recognition, the recorded time is defined as a time stamp of the storing time, and the time stamp is bound to the digitized archive and stored in the memory.
Further, in step S200, the digitized archive is stored in a planned manner according to the blockchain, the digitized archive is stored in a node of the blockchain, the node is divided into a main node and a sub-node, the initial version of the digitized archive is stored according to the order of the creation time of the archive, the stored initial version of the digitized archive is stored in the main node, the main node is provided with a main node number according to the stored digitized archive ID, the node number and the digitized archive ID are bound, the digitized archive confirmed after modification of the archive in the main node is stored in the sub-node, and the sub-node number is set according to the main node number and the modification time, and each node is connected with each other and communicates through any one of a wired network and a wireless network.
Further, in step S300, the digital archive numbers stored in the digital archive in the main node are extracted, the digital archive is constructed into a sequence arch according to the number sequence, the number sequence of the corresponding sub-node is constructed into a sequence arch, the node where the blockchain transaction occurs is defined with a signal track, the signal track is added into the node corresponding to the number in the sequence, the time when the signal track exists is recorded, the recording time is t, the time when the signal track exists during the modification in the main node where the corresponding modification end exists and the recording format of the modified digital archive are (archei, ti), the archei is the modified digital archive stored in the sub-node, ti is the time when the signal track exists in the digital archive archei, and the digital archive archei is calculated and recorded as the transaction in the blockchain;
judging whether the modified transaction is effective or not after the transaction is achieved, wherein the judging method comprises the following steps: and acquiring code editing times and code editing time length of a developer in each node according to the workload proof data, recording the node where the transaction occurs as a node Q, recording the code editing times of the node Q as a TQ, taking the node with the code editing times greater than or equal to TQ as an effective voting node, setting the node with the code editing time length less than or equal to TK as a locking state, setting the node with the code editing time length greater than or equal to TK as an unlocking state, counting the number of the effective voting nodes in all the unlocking states, and when the number of the effective voting nodes in all the unlocking states is greater than half of the total number of the effective voting nodes, modifying the transaction to achieve consensus, and confirming that the modified transaction is effective.
Further, each node in the blockchain network performs security judgment on the modified nodes in the digitized file through calculation, and the method comprises the following steps:
s301, each node acquires code editing times and code editing time length of a developer in each node according to workload proving data, wherein the code editing times are defined as transaction times, and the code editing times are defined as transaction time length at all times;
s302, calculating average transaction duration of all nodes in the blockchain as mean (ti), initializing integer variables k1=1, k1 epsilon [1, L1], traversing source code files corresponding to the occurrence of transactions in the nodes from k1=1, acquiring total data access amount of the nodes when the transactions are performed by traversing the source code files, calculating standard transaction duration TRDU (total data access) by L1 as the total number of all nodes,
；
where mean () is a function of obtaining an average number, max () is a function of obtaining a maximum value, min is a function of obtaining a minimum value,for the data access coefficients ln () is a logarithmic function, ++>Total data access for the ith node,/-bit>The transaction number of the ith node is C, which is the node transaction number;
the method has the beneficial effects of calculating the standard transaction duration TRDU: the method has the advantages that when the transaction occurs in the blockchain, whether the time length corresponding to the modified code quantity is reasonable or not can be judged more accurately by calculating the standard transaction time length, the average value is taken through a plurality of data, the obtained standard time length is more accurate, and the subsequent judgment is more accurate.
S303, constructing a set W, W= (C, ti) by using the transaction times and the transaction time length in the nodes where transaction trade occurs, wherein C is the node transaction times, ti is the transaction time length when the ith transaction is performed, the transaction times of the node D is DK, the node D is the node with the transaction times being closest to the average transaction times in the blockchain, the node with the transaction times greater than or equal to DK is defined as an active node, the step S304 is skipped, the node with the transaction times less than DK is defined as an inactive node, and the step S306 is skipped;
s304, initializing integer variables k2=1 and k2 epsilon [1, L2] in any active node, traversing source code files corresponding to transaction occurrence in the node from k2=1, acquiring data access amount accessl when single transaction is performed by traversing the source code files, wherein L2 is the number of active nodes, comparing transaction duration in the traversed nodes with transaction duration of node D according to the transaction duration of the traversed nodes, jumping to S305 when the node transaction duration is longer than the standard duration TRDU, and jumping to S306 when the node transaction duration is smaller than or equal to the standard duration TRDU;
s305: the method for judging whether the transaction time is longer than the standard time TRDU is in the secure network comprises the following steps: the method comprises the steps of taking a set formed by encryption vectors obtained by all nodes with transaction time length longer than standard time length TRDU through encryption modules as an encryption vector set, marking the encryption vector of any node (archei, ti) as Vec (i), marking the sequence number of the dimension in Vec (i) as archei consistent with the sequence number of the node, marking the sequence number as Vec (i, archei), calculating the arithmetic average of the values of the dimensions in Vec (i) as a screening value, marking the screening value as eta (i), comparing the value of the dimension of each sequence number in Vec (i) with the screening value eta (i), screening the sequence number of the dimension with the value smaller than the screening value eta (i) in Vec (i) as a screening sequence number set, calculating the screening proportion value as S (i) according to Vec (i), wherein the calculation formula of S (i) is as follows:
；
wherein exp () is an exponential function based on a natural number e, and whether the node meets a constraint condition is judged by combining a screening proportion S (i) with a data access amount accessl in the node, a node transaction number C and a transaction duration ti, wherein the constraint condition is as follows:
F（（archei，ti））=；
；
wherein in the formulaFor node->Is a single data access amount of +.>For node->The maximum value of the data access amount in the memory,for node->The minimum data access amount in the node C (archei, ti)Is>For node->Is used to determine the average transaction duration of (a),for node->Ti is the duration of a single transaction, and when the constraint condition is satisfied, the node is +.>Outputting and storing the data in the step S306, and jumping the node data to the step S when the constraint condition is not met;
s306: and when the investigation data find the loopholes, backing up the data, and carrying out investigation and repair on the loopholes, and then encrypting the stored data.
Further, in S400, the method for transporting the digitized file by node and adding the encrypted information at the node position includes:
marking nodes of which the transaction is not checked and the loopholes are not checked as safe nodes, defining the nodes of which the loopholes are checked in the transaction as secondary nodes, marking the risk level of the current blockchain storage data as high when the number of the safe nodes is less than or equal to three times of the number of the secondary nodes, marking the risk level of the current blockchain storage data as low when the number of the safe nodes is greater than three times of the number of the secondary nodes, and performing secondary encryption on the digitized archive data in the nodes when the current risk level of the nodes is high.
A blockchain-based digitized archive management system, the system comprising: the system comprises a processor and a memory, wherein the processor and the memory in the system can run a computer program in the processor, and the processor can realize the steps in the block chain-based digital archive management method when executing the computer program.
The processor executes the computer program to run in the units of the following system:
a workload certification generation unit for generating workload certification in the form of hash value in real time by the nodes when each node of the blockchain network generates an operation of editing the local code;
a modification transaction broadcasting unit, configured to take each modification of the local code by a node as a modification transaction of a blockchain network, and when there is a node where the modification transaction occurs, broadcast the modification transaction in the entire blockchain network by the node;
the modified transaction validity judging unit is used for confirming whether the modified transaction is valid or not after each node in the blockchain network agrees with the modified transaction through an consensus algorithm;
and the local code file synchronization unit is used for synchronizing the file of the modified local code in the nodes of the effective modification transaction to each node.
The beneficial effects of the invention are as follows: the method has the advantages that the existing file management is digitalized, file information blockchain storage is realized, authority management and operation backtracking of file management staff are realized, so that the problem that the file information management flow is complex, the consumption of manpower and material resources for file repeated storage is reduced, the digitalized file is stored and managed through the blockchain, the phenomenon that file data are tampered is effectively prevented, the phenomenon that the file data are lost in the transmission process can be prevented, and the storage of the digitalized file is safer by judging whether the trade in the blockchain achieves consensus and whether the trade is in safety or not.
Drawings
The above and other features of the present invention will become more apparent from the detailed description of the embodiments thereof given in conjunction with the accompanying drawings, in which like reference characters designate like or similar elements, and it is apparent that the drawings in the following description are merely some examples of the present invention, and other drawings may be obtained from these drawings without inventive effort to those of ordinary skill in the art, in which:
FIG. 1 is a flow chart of a method for managing digitized files based on blockchain;
FIG. 2 is a block chain based digitized archive management system.
Detailed Description
The conception, specific structure, and technical effects produced by the present invention will be clearly and completely described below with reference to the embodiments and the drawings to fully understand the objects, aspects, and effects of the present invention. It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other.
As shown in fig. 1, a method for managing digitized archives based on blockchain includes the following steps:
s100: digitizing the file and storing the file in a memory;
s200: storing the digitized file in a distributed manner through a block chain;
s300: defining each time of modifying the digital file in the node as a blockchain transaction, and determining that the transaction is valid;
s400: and judging the storage of the digitized file and the security of the transaction, and adding encryption information at the node position.
Further, in step S100, the data in the archive is digitized by electronic archive scanning, and stored according to the archive as a whole, the creation time, the modification time, and the digitizing time in the archive are recorded by semantic recognition, the recorded time is defined as a time stamp of the storing time, and the time stamp is bound to the digitized archive and stored in the memory.
Further, in step S200, the digitized archive is stored in a planned manner according to the blockchain, the digitized archive is stored in a node of the blockchain, the node is divided into a main node and a sub-node, the initial version of the digitized archive is stored according to the order of the creation time of the archive, the stored initial version of the digitized archive is stored in the main node, the main node is provided with a main node number according to the stored digitized archive ID, the node number and the digitized archive ID are bound, the digitized archive confirmed after modification of the archive in the main node is stored in the sub-node, and the sub-node number is set according to the main node number and the modification time, and each node is connected with each other and communicates through any one of a wired network and a wireless network.
Further, in step S300, the digital archive numbers stored in the digital archive in the main node are extracted, the digital archive is constructed into a sequence arch according to the number sequence, the number sequence of the corresponding sub-node is constructed into a sequence arch, the node where the blockchain transaction occurs is defined with a signal track, the signal track is added into the node corresponding to the number in the sequence, the time when the signal track exists is recorded, the recording time is t, the time when the signal track exists during the modification in the main node where the corresponding modification end exists and the recording format of the modified digital archive are (archei, ti), the archei is the modified digital archive stored in the sub-node, ti is the time when the signal track exists in the digital archive archei, and the digital archive archei is calculated and recorded as the transaction in the blockchain;
judging whether the modified transaction is effective or not after the transaction is achieved, wherein the judging method comprises the following steps: and acquiring code editing times and code editing time length of a developer in each node according to the workload proof data, recording the node where the transaction occurs as a node Q, recording the code editing times of the node Q as a TQ, taking the node with the code editing times greater than or equal to TQ as an effective voting node, setting the node with the code editing time length less than or equal to TK as a locking state, setting the node with the code editing time length greater than or equal to TK as an unlocking state, counting the number of the effective voting nodes in all the unlocking states, and when the number of the effective voting nodes in all the unlocking states is greater than half of the total number of the effective voting nodes, modifying the transaction to achieve consensus, and confirming that the modified transaction is effective.
Further, each node in the blockchain network performs security judgment on the modified nodes in the digitized file through calculation, and the method comprises the following steps:
s301, each node acquires code editing times and code editing time length of a developer in each node according to workload proving data, wherein the code editing times are defined as transaction times, and the code editing times are defined as transaction time length at all times;
s302, calculating average transaction duration of all nodes in the blockchain as mean (ti), initializing integer variables k1=1, k1 epsilon [1, L1], traversing source code files corresponding to the occurrence of transactions in the nodes from k1=1, acquiring total data access amount of the nodes when the transactions are performed by traversing the source code files, calculating standard transaction duration TRDU (total data access) by L1 as the total number of all nodes,
；
where mean () is a function of obtaining an average number, max () is a function of obtaining a maximum value, min is a function of obtaining a minimum value,for the data access coefficients ln () is a logarithmic function, ++>Total data access for the ith node,/-bit>The transaction number of the ith node is C, which is the node transaction number;
the method has the beneficial effects of calculating the standard transaction duration TRDU: the method has the advantages that when the transaction occurs in the blockchain, whether the time length corresponding to the modified code quantity is reasonable or not can be judged more accurately by calculating the standard transaction time length, the average value is taken through a plurality of data, the obtained standard time length is more accurate, and the subsequent judgment is more accurate.
S303, constructing a set W, W= (C, ti) by using the transaction times and the transaction time length in the nodes where transaction trade occurs, wherein C is the node transaction times, ti is the transaction time length when the ith transaction is performed, the transaction times of the node D is DK, the node D is the node with the transaction times being closest to the average transaction times in the blockchain, the node with the transaction times greater than or equal to DK is defined as an active node, the step S304 is skipped, the node with the transaction times less than DK is defined as an inactive node, and the step S306 is skipped;
s304, initializing integer variables k2=1 and k2 epsilon [1, L2] in any active node, traversing source code files corresponding to transaction occurrence in the node from k2=1, acquiring data access amount accessl when single transaction is performed by traversing the source code files, wherein L2 is the number of active nodes, comparing transaction duration in the traversed nodes with transaction duration of node D according to the transaction duration of the traversed nodes, jumping to S305 when the node transaction duration is longer than the standard duration TRDU, and jumping to S306 when the node transaction duration is smaller than or equal to the standard duration TRDU;
s305: the method for judging whether the transaction time is longer than the standard time TRDU is in the secure network comprises the following steps: the method comprises the steps of taking a set formed by encryption vectors obtained by all nodes with transaction time length longer than standard time length TRDU through encryption modules as an encryption vector set, marking the encryption vector of any node (archei, ti) as Vec (i), marking the sequence number of the dimension in Vec (i) as archei consistent with the sequence number of the node, marking the sequence number as Vec (i, archei), calculating the arithmetic average of the values of the dimensions in Vec (i) as a screening value, marking the screening value as eta (i), comparing the value of the dimension of each sequence number in Vec (i) with the screening value eta (i), screening the sequence number of the dimension with the value smaller than the screening value eta (i) in Vec (i) as a screening sequence number set, calculating the screening proportion value as S (i) according to Vec (i), wherein the calculation formula of S (i) is as follows:
；
wherein exp () is an exponential function based on a natural number e, and whether the node meets a constraint condition is judged by combining a screening proportion S (i) with a data access amount accessl in the node, a node transaction number C and a transaction duration ti, wherein the constraint condition is as follows:
F（（archei，ti））=；
；
wherein in the formulaFor node->Is a single data access amount of +.>For node->The maximum value of the data access amount in the memory,for node->The minimum data access amount in the node C (archei, ti)Is>For node->Is used to determine the average transaction duration of (a),for node->Ti is the duration of a single transaction, and when the constraint condition is satisfied, the node is +.>Outputting and storing the data in the step S306, and jumping the node data to the step S when the constraint condition is not met;
s306: and when the investigation data find the loopholes, backing up the data, and carrying out investigation and repair on the loopholes, and then encrypting the stored data.
Further, in S400, the method for transporting the digitized file by node and adding the encrypted information at the node position includes:
marking nodes of which the transaction is not checked and the loopholes are not checked as safe nodes, defining the nodes of which the loopholes are checked in the transaction as secondary nodes, marking the risk level of the current blockchain storage data as high when the number of the safe nodes is less than or equal to three times of the number of the secondary nodes, marking the risk level of the current blockchain storage data as low when the number of the safe nodes is greater than three times of the number of the secondary nodes, and performing secondary encryption on the digitized archive data in the nodes when the current risk level of the nodes is high.
As shown in fig. 2, a digital archive management system based on a blockchain includes: the system comprises a processor and a memory, wherein the processor and the memory in the system can run a computer program in the processor, and the processor can realize the steps in the block chain-based digital archive management method when executing the computer program.
The processor executes the computer program to run in the units of the following system:
a workload certification generation unit for generating workload certification in the form of hash value in real time by the nodes when each node of the blockchain network generates an operation of editing the local code;
a modification transaction broadcasting unit, configured to take each modification of the local code by a node as a modification transaction of a blockchain network, and when there is a node where the modification transaction occurs, broadcast the modification transaction in the entire blockchain network by the node;
the modified transaction validity judging unit is used for confirming whether the modified transaction is valid or not after each node in the blockchain network agrees with the modified transaction through an consensus algorithm;
and the local code file synchronization unit is used for synchronizing the file of the modified local code in the nodes of the effective modification transaction to each node.
The processor may be a central processing unit (Central Processing Unit, CPU), other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete component gate or transistor logic devices, discrete hardware components, or the like. The general processor can be a microprocessor or any conventional processor, and the processor is a control center of the integrated sewage treatment system based on dynamic monitoring, and various interfaces and lines are utilized to connect various subareas of the whole integrated sewage treatment system based on dynamic monitoring.
The memory may be used to store the computer program and/or module, and the processor may implement various functions of the integrated wastewater treatment system based on dynamic monitoring by running or executing the computer program and/or module stored in the memory and invoking data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program (such as a sound playing function, an image playing function, etc.) required for at least one function, and the like; the storage data area may store data (such as audio data, phonebook, etc.) created according to the use of the handset, etc. In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as a hard disk, memory, plug-in hard disk, smart Media Card (SMC), secure Digital (SD) Card, flash Card (Flash Card), at least one disk storage device, flash memory device, or other volatile solid-state storage device.
Although the present invention has been described in considerable detail and with particularity with respect to several described embodiments, it is not intended to be limited to any such detail or embodiment or any particular embodiment so as to effectively cover the intended scope of the invention. Furthermore, the foregoing description of the invention has been presented in its embodiments contemplated by the inventors for the purpose of providing a useful description, and for the purposes of providing a non-essential modification of the invention that may not be presently contemplated, may represent an equivalent modification of the invention.
Claims (5)
1. A method for managing digitized archives based on a blockchain, the method comprising the steps of:
s100: digitizing the file and storing the file in a memory;
s200: storing the digitized file in a distributed manner through a block chain;
s300: defining each time of modifying the digital file in the node as a blockchain transaction, and determining that the transaction is valid;
s400: judging the storage of the digitized file and the safety of the transaction, and adding encryption information at the node position;
in step S300, the digital archive numbers stored in the digital archive in the master node are extracted, the digital archive is constructed into a sequence arch according to the number sequence, the number sequence of the corresponding child node is constructed into a sequence arch, the node where the blockchain transaction occurs is defined with a signal track, the signal track is added into the node corresponding to the number in the sequence, the time when the signal track exists is recorded, the recording time is t, the time when the signal track exists when the corresponding modification end exists in the master node and the recording format of the modified digital archive are (archei, ti), the archei is the modified digital archive stored in the child node, ti is the time when the signal track exists in the digital archive archei, and the digital archive archei is calculated and recorded for the transaction in the blockchain;
judging whether the modified transaction is effective or not after the transaction is achieved, wherein the judging method comprises the following steps: acquiring code editing times and code editing time length of a developer in each node according to workload proof data, recording the node where transaction occurs as a node Q, the code editing times of the node Q as a TQ, setting the node with the code editing times being greater than or equal to TQ as an effective voting node, setting the node with the code editing time length being less than or equal to TK as a locking state, setting the node with the code editing time length being greater than or equal to TK as an unlocking state, counting the number of the effective voting nodes in all the unlocking states, and when the number of the effective voting nodes in all the unlocking states is greater than half of the total number of the effective voting nodes, modifying the transaction to achieve consensus, and confirming that the modified transaction is effective;
each node in the blockchain network performs security judgment on the modified nodes in the digitized file through calculation, and the method comprises the following steps:
s301, each node acquires code editing times and code editing time length of a developer in each node according to workload proving data, wherein the code editing times are defined as transaction times, and the code editing times are defined as transaction time length at all times;
s302, calculating average transaction duration of all nodes in the blockchain as mean (ti), initializing integer variables k1=1, k1 epsilon [1, L1], traversing source code files corresponding to the occurrence of transactions in the nodes from k1=1, acquiring total data access amount of the nodes when the transactions are performed by traversing the source code files, calculating standard transaction duration TRDU (total data access) by L1 as the total number of all nodes,
；
where mean () is a function of obtaining an average number, max () is a function of obtaining a maximum value, min is a function of obtaining a minimum value,for the data access coefficients ln () is a logarithmic function, ++>Total data access for the ith node,/-bit>The transaction number of the ith node is C, which is the node transaction number;
s303, constructing a set W, W= (C, ti) by using the transaction times and the transaction time length in the nodes where transaction trade occurs, wherein C is the node transaction times, ti is the transaction time length when the ith transaction is performed, the transaction times of the node D is DK, the node D is the node with the transaction times being closest to the average transaction times in the blockchain, the node with the transaction times greater than or equal to DK is defined as an active node, the step S304 is skipped, the node with the transaction times less than DK is defined as an inactive node, and the step S306 is skipped;
s304, initializing integer variables k2=1 and k2 epsilon [1, L2] in any active node, traversing source code files corresponding to transaction occurrence in the node from k2=1, acquiring data access amount accessl when single transaction is performed by traversing the source code files, wherein L2 is the number of active nodes, comparing transaction duration in the traversed nodes with transaction duration of node D according to the transaction duration of the traversed nodes, jumping to S305 when the node transaction duration is longer than the standard duration TRDU, and jumping to S306 when the node transaction duration is smaller than or equal to the standard duration TRDU;
s305: the method for judging whether the transaction time is longer than the standard time TRDU is in the secure network comprises the following steps: the method comprises the steps of taking a set formed by encryption vectors obtained by all nodes with transaction time length longer than standard time length TRDU through encryption modules as an encryption vector set, marking the encryption vector of any node (archei, ti) as Vec (i), marking the sequence number of the dimension in Vec (i) as archei consistent with the sequence number of the node, marking the sequence number as Vec (i, archei), calculating the arithmetic average of the values of the dimensions in Vec (i) as a screening value, marking the screening value as eta (i), comparing the value of the dimension of each sequence number in Vec (i) with the screening value eta (i), screening the sequence number of the dimension with the value smaller than the screening value eta (i) in Vec (i) as a screening sequence number set, calculating the screening proportion value as S (i) according to Vec (i), wherein the calculation formula of S (i) is as follows:
；
wherein exp () is an exponential function based on a natural number e, and whether the node meets a constraint condition is judged by combining a screening proportion S (i) with a data access amount accessl in the node, a node transaction number C and a transaction duration ti, wherein the constraint condition is as follows:
F（（archei，ti））=；
；
wherein in the formulaFor node->Is a single data access amount of +.>For node->The maximum value of the data access amount in the memory,for node->The minimum data access amount in the node C (archei, ti)Is>For node->Is used to determine the average transaction duration of (a),for node->Ti is the duration of a single transaction, and when the constraint condition is satisfied, the node is +.>Outputting and storing the data in the step S306, and jumping the node data to the step S when the constraint condition is not met;
s306: and when the investigation data find the loopholes, backing up the data, and carrying out investigation and repair on the loopholes, and then encrypting the stored data.
2. A blockchain-based digitized archive management method according to claim 1, wherein in step S100, the archive is digitized by electronic archive scanning and the data in the archive is stored according to the archive as a whole, the creation time, modification time, and the digitized time in the archive are recorded by semantic recognition, the recorded time is defined as a time stamp of the storage time, and the time stamp is bound to the digitized archive and stored in the memory.
3. A blockchain-based digitized archive management method as in claim 1, wherein in step S200, the digitized archive is programmatically stored according to a blockchain, the digitized archive is stored in nodes of the blockchain, the nodes are divided into a main node and a sub-node, an initial version of the digitized archive is stored according to the order of creation time of the archive, the stored initial version of the digitized archive is stored in the main node, the main node is set with a main node number according to the stored digitized archive ID, the node number is bound with the digitized archive ID, the digitally-confirmed digitized archive of the archive in the main node is stored in the sub-node, and the sub-node numbers are set according to the main node number and the modification time, and each node is connected to each other and communicates through any one of a wired network and a wireless network.
4. A blockchain-based digitized archive management method as in claim 1, wherein in S400, the method of transporting the digitized archive by node and adding encrypted information at the node location is:
marking nodes of which the transaction is not checked and the loopholes are not checked as safe nodes, defining the nodes of which the loopholes are checked in the transaction as secondary nodes, marking the risk level of the current blockchain storage data as high when the number of the safe nodes is less than or equal to three times of the number of the secondary nodes, marking the risk level of the current blockchain storage data as low when the number of the safe nodes is greater than three times of the number of the secondary nodes, and performing secondary encryption on the digitized archive data in the nodes when the current risk level of the nodes is high.
5. A blockchain-based digitized archive management system, the system comprising: a processor and a memory, both in the system being capable of running a computer program in the processor, the processor implementing the steps in a blockchain-based digitized archive management method of any of claims 1-4 when the computer program is executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311139135.1A CN116881533B (en) | 2023-09-06 | 2023-09-06 | Digital file management method and system based on blockchain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311139135.1A CN116881533B (en) | 2023-09-06 | 2023-09-06 | Digital file management method and system based on blockchain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116881533A CN116881533A (en) | 2023-10-13 |
| CN116881533B true CN116881533B (en) | 2024-01-16 |
Family
ID=88271835
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311139135.1A Active CN116881533B (en) | 2023-09-06 | 2023-09-06 | Digital file management method and system based on blockchain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116881533B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114610777A (en) * | 2022-03-06 | 2022-06-10 | 浙江数秦科技有限公司 | Intelligent management system for civil archives based on block chain |
| CN116257892A (en) * | 2023-05-09 | 2023-06-13 | 广东电网有限责任公司佛山供电局 | Data privacy security verification method for digital archives |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10255108B2 (en) * | 2016-01-26 | 2019-04-09 | International Business Machines Corporation | Parallel execution of blockchain transactions |
| US11544708B2 (en) * | 2017-12-29 | 2023-01-03 | Ebay Inc. | User controlled storage and sharing of personal user information on a blockchain |
-
2023
- 2023-09-06 CN CN202311139135.1A patent/CN116881533B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114610777A (en) * | 2022-03-06 | 2022-06-10 | 浙江数秦科技有限公司 | Intelligent management system for civil archives based on block chain |
| CN116257892A (en) * | 2023-05-09 | 2023-06-13 | 广东电网有限责任公司佛山供电局 | Data privacy security verification method for digital archives |
Non-Patent Citations (1)
| Title |
|---|
| 区块链技术在电子档案管理中的应用分析;余子丹;范智新;;兰台世界(第04期);第79-82页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116881533A (en) | 2023-10-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114372296B (en) | Block chain-based user behavior data auditing method and system | |
| CN112134883B (en) | Method, device and related product for carrying out rapid authentication on trust relationship between nodes based on trusted computing | |
| CN110826091B (en) | File signature method and device, electronic equipment and readable storage medium | |
| US20200226267A1 (en) | Distributed ledger-based digital content tracing | |
| CN112163412A (en) | Data verification method and device, electronic equipment and storage medium | |
| WO2023051308A1 (en) | Data verification method and apparatus, device and storage medium | |
| US8131761B2 (en) | File management system and apparatus, and computer readable recording medium storing program | |
| US20100223469A1 (en) | Method, System and Computer Program Product for Certifying Software Origination | |
| CN111324517B (en) | Application service supervision method, supervision server and storage medium | |
| CN114781007A (en) | Tree-based document batch signature and signature verification method and system | |
| Martínez et al. | Robust hashing for models | |
| CN116881533B (en) | Digital file management method and system based on blockchain | |
| Martínez et al. | On watermarking for collaborative model-driven engineering | |
| CN112685795A (en) | Digital deposit certificate creating method, digital deposit certificate verifying method and digital deposit certificate system | |
| US11469901B2 (en) | Data structures | |
| CN116010360A (en) | Similarity-based electric power text data storage method and device | |
| CN111539028B (en) | File storage method and device, storage medium and electronic equipment | |
| CN111191271B (en) | Computer-implemented method, system and storage medium | |
| CN109509095B (en) | Video active identification method combined with block chain | |
| JP5511270B2 (en) | Information processing apparatus and information processing method | |
| CN114756837B (en) | Block chain-based digital content tracing method and system | |
| CN115439118B (en) | Digital certificate storage management method based on blockchain | |
| US20240056465A1 (en) | System and method of managing and auditing training data based on distributed ledger technology | |
| CN114880320B (en) | Method for generating block state certification | |
| CN112667659B (en) | Feature processing method and related equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |