CN113722285B - Multi-chain-based cross-chain distributed file storage and verification system - Google Patents
Multi-chain-based cross-chain distributed file storage and verification system Download PDFInfo
- Publication number
- CN113722285B CN113722285B CN202111292883.4A CN202111292883A CN113722285B CN 113722285 B CN113722285 B CN 113722285B CN 202111292883 A CN202111292883 A CN 202111292883A CN 113722285 B CN113722285 B CN 113722285B
- Authority
- CN
- China
- Prior art keywords
- value
- access
- block chain
- matching
- chain
- 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
Images
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/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file 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/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/172—Caching, prefetching or hoarding of files
-
- 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/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/2141—Access rights, e.g. capability lists, access control lists, access tables, access matrices
Abstract
The invention relates to the technical field of cross-chain certificate storage, which is used for solving the problem of data security in a centralized distributed data storage mode, in particular to a multi-chain-based cross-chain distributed file certificate storage system, which comprises a certificate storage platform, wherein the certificate storage platform is in communication connection with an exchange request module, a value analysis module, a value matching module, an authority verification module and a storage sorting module; when the block chain needs to carry out data exchange, the block chain needing to carry out data exchange is marked as a request block chain, a request instruction is sent to the evidence storage platform through the exchange request module, and the exchange request module sends the request instruction to the evidence storage platform; the method comprises the steps of establishing connection between the block chains and the block chains through value analysis and value matching, carrying out value analysis on the request block chains during cross-chain data exchange to obtain a value interval, and then selecting the preselected block chains with corresponding matching quantity as the matching block chains.
Description
Technical Field
The invention relates to the technical field of cross-chain storage of certificates, in particular to a multi-chain-based cross-chain distributed file certificate storage system.
Background
The physical storage resources managed by the file system are not necessarily directly connected to the local node, but are connected to the node (which may be simply understood as a computer) through a computer network; or a complete hierarchical file system formed by combining several different logical disk partitions or volume labels.
The centralized distributed storage is to perform real-time hot backup on data in a mode of adding servers, namely, the same data is written into a plurality of hard disks, so that data loss caused by damage of a single server is prevented. The data storage in the mode can prevent the damage of a hard disk, the fire of a machine room and other local single-point faults from threatening the data security. However, since the data is deployed in a centralized mode, the data is changed at the will of centralized high-level personnel, that is, the data cannot be prevented from being tampered by internal personnel.
In view of the above technical problem, the present application proposes a solution.
Disclosure of Invention
The invention aims to provide a multi-chain-based cross-chain distributed file storage and verification system in order to solve the problem of data security in a centralized distributed data storage mode.
The purpose of the invention can be realized by the following technical scheme:
a multi-chain-based cross-chain distributed file evidence storing system comprises an evidence storing platform, wherein the evidence storing platform is in communication connection with an exchange request module, a value analysis module, a value matching module, a permission verification module and a storage and arrangement module;
when the block chain needs to carry out data exchange, the block chain needing to carry out data exchange is marked as a request block chain, a request instruction is sent to the evidence storage platform through the exchange request module, and the exchange request module sends the request instruction to the evidence storage platform;
the value analysis module analyzes the data value of the request block chain after receiving the request instruction to obtain a value coefficient of the request block chain, calculates a threshold value of the value coefficient to obtain a value interval P and sends the value interval P to the evidence storage platform;
after receiving the value interval P, the evidence storage platform screens the value interval P to obtain a preselected block chain, and sends the preselected block chain to the value matching module;
and the value matching module is used for analyzing the value of the preselected blockchain after receiving the preselected blockchain and screening out a matched blockchain according to the analysis result.
As a preferred embodiment of the present invention, a specific process of the value analysis module performing value analysis on the request block chain includes:
acquiring upload time SJ of a data upload stage, acquiring uplink speed SX and downlink speed XX of information in a channel in the upload time, and marking the ratio of the sum of the uplink speed SX and the downlink speed XX to the upload time SJ as upload speed SS;
acquiring a memory value NC before data uploading and a compressed memory value YS in the data uploading process, and marking the ratio of the memory value NC before data uploading to the compressed memory value YS as a memory ratio NB of data;
and analyzing and calculating the uploading speed SS and the memory ratio NB to obtain a value coefficient JZ of the request block chain.
As a preferred embodiment of the present invention, the process of the value matching module performing the value analysis on the preselected blockchain comprises: marking a preselected block chain as i, i =1, 2, …, n, n is a positive integer, performing value analysis on the preselected block chain i to obtain a value coefficient JZi of the preselected block chain i, calculating JZi and JZ to obtain a matching coefficient PP of the preselected block chain i, comparing the matching coefficient PP with a matching threshold value PPmin and PPmax, and judging the matching grade of the preselected block chain according to the comparison result;
and (3) marking the absolute value of the difference value of the value coefficient JZi of the preselected blockchain i and the value coefficient JZ of the request blockchain as a matching value, selecting the PS preselected blockchains with the minimum matching values in the preselected blockchain i as matching blockchains, and sending the matching blockchains to the evidence storage platform by the value matching module.
As a preferred embodiment of the present invention, the process of comparing the matching coefficient PP with the matching threshold values PPmin and PPmax includes:
if the PP is less than or equal to PPmin, judging the matching level of the preselected block chain to be a level;
if PPmin is more than PP and less than PPmax, the matching grade of the preselected block chain is judged to be two grades;
and if the PP is more than or equal to PPmax, judging the matching level of the preselected block chain to be three levels.
As a preferred embodiment of the present invention, a calculation formula of the matching number PS is PS = t × n, where t is a scaling coefficient, and a value determination process of t includes:
if the matching level of the preselected blockchain is a first level, t = 0.45;
if the matching level of the preselected blockchain is second level, t = 0.32;
if the matching level of the preselected blockchain is three, t = 0.27.
As a preferred embodiment of the present invention, the access right verification module is configured to perform access right verification on the access terminal according to historical access data of an access person, where the historical access data of the access person includes a total historical access duration, a total historical access frequency of the access person, and a total data loss or transfer frequency of the access person during access, and a specific access right verification process includes:
marking the access records of the visitors as u, u =1, 2, …, m and m as positive integers, obtaining the access duration of the access records u and marking the access duration as SCu, comparing the access duration SCu with a duration threshold value SCmin, marking the access records with the access duration SCu not less than the duration threshold value SCmin as effective records, marking the sum of the access durations of the effective records as access total duration ZC, marking the number of the effective records as y, and marking the times of data loss or transfer in the effective records as DS;
calculating and analyzing the access total frequent ZC, the number y of the effective records and the number DS of data loss or reprinting in the effective records to obtain an access coefficient FW of the visitor, comparing the access coefficient FW with access thresholds FWmin and FWmax, judging the access level of the visitor according to the comparison result, and sending the access level of the visitor to a evidence storage platform.
As a preferred embodiment of the present invention, the comparison process of the access coefficient FW with the access thresholds FWmin, FWmax includes:
if FW is less than or equal to FWmin, judging that the access security of the visitors is unqualified, and judging that the access level of the visitors is low;
if FWmin is greater than FW and less than FWmax, judging that the access security of the visitor is qualified, and judging that the access level of the visitor is a medium level;
and if the FW is larger than or equal to the FWmax, judging that the access security of the visitor is qualified, and setting the access level of the visitor to be a high level.
As a preferred embodiment of the present invention, the storage sorting module is configured to analyze and determine a storage value of a file fragment in a block node through call data, where the call data includes a call frequency, an exchange frequency, and an exchange success rate of the file fragment, calculate the call frequency, the exchange frequency, and the exchange success rate of the file fragment to obtain a storage value of the fragment file, and mark a file fragment whose storage value CZ is smaller than a storage threshold CZmin as a low-quality file.
As a preferred implementation mode of the invention, the working method of the multi-chain-based cross-chain distributed file storage system comprises the following steps:
the method comprises the following steps: marking a block chain needing data exchange as a request block chain, sending a request instruction to a certificate storage platform through an exchange request module, and sending the request instruction to a value analysis module after the certificate storage platform receives the request instruction;
step two: the value analysis module analyzes the data value of the request block chain after receiving the request instruction to obtain a value coefficient and a value interval P of the request block chain, and sends the value interval P to the evidence storage platform;
step three: after receiving the value interval P, the evidence storing platform screens the value interval P to obtain a preselected block chain, and the value matching module performs value analysis on the preselected block chain to obtain a value coefficient and judges the matching level of the preselected block chain;
step four: and screening the value coefficient of the preselected block chain and the value coefficient of the request block chain to obtain a matching block chain, and sending the matching block chain to a evidence storage platform.
Compared with the prior art, the invention has the beneficial effects that:
1. establishing connection between a block chain and a block chain by value analysis and value matching, performing value analysis on a request block chain during cross-chain data exchange to obtain a value interval, screening out a preselected block chain through the value interval, determining the matching number according to the matching grade of the preselected block chain, selecting a preselected block chain with the closest value coefficient to the value coefficient of the request block chain in the preselected block chain corresponding to the matching number as the matching block chain, wherein the different matching grades have different weight influences on the matching number, and the matching grade represents the closeness degree of the overall value coefficient of a preselected block chain set and the value coefficient of the request block chain.
2. The access authority verification module is used for verifying the access authority of the access terminal through the historical access data of the access personnel, conducting authority analysis on the access personnel of each terminal to obtain the access coefficient of the access personnel, conducting access authority division on the access personnel through the comparison result of the access coefficient and the access threshold value, and accordingly setting different access authorities for different access personnel, and the access authorities are used for conducting grading limitation on the access speed, uploading speed and the like of the access personnel.
Drawings
In order to facilitate understanding for those skilled in the art, the present invention will be further described with reference to the accompanying drawings.
FIG. 1 is a schematic block diagram of a first embodiment of the present invention;
FIG. 2 is a flowchart of a method according to a second embodiment of the present invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the following embodiments, and it should be understood that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The evidence storage file is divided into file fragments by using a DFS technology, the file fragments are deployed on each block chain link point according to an algorithm, a part of the file stored in each block chain is guaranteed, and enough fragment redundancy exists in the whole network. Distributed File System (DFS) means that physical storage resources managed by a File System are not necessarily directly connected to a local node, but are connected to a node (which may be simply understood as a computer) through a computer network; or a complete hierarchical file system formed by combining several different logical disk partitions or volume labels. DFS provides a logical tree file system structure for resources distributed anywhere on the network, making it easier for users to access shared files distributed on the network, with individual DFS shared folders acting as access points relative to other shared folders on the network.
Example one
Referring to fig. 1, a multi-chain based cross-chain distributed file certificate storing system includes a certificate storing platform, wherein the certificate storing platform is in communication connection with an exchange request module, a value analysis module, a value matching module, an authority verification module and a storage and sorting module;
when the block chain needs to exchange data, the block chain needing to exchange data is marked as a request block chain, a request instruction is sent to a certificate storage platform through an exchange request module, the exchange request module sends the request instruction to the certificate storage platform, the certificate storage platform sends the request instruction to a value analysis module after receiving the request instruction, the value analysis module analyzes the data value of the request block chain after receiving the request instruction to obtain the value coefficient of the request block chain, and the specific process of the value analysis comprises the following steps:
acquiring uploading information of data uploading, wherein the uploading information of the data comprises: the uploading speed SS of data uploading and the memory ratio NB of the data;
acquiring upload time SJ of a data upload stage, acquiring uplink speed SX and downlink speed XX of information in a channel in the upload time, and marking the ratio of the sum of the uplink speed SX and the downlink speed XX to the upload time SJ as upload speed SS;
acquiring a memory value NC before data uploading and a compressed memory value YS in the data uploading process, and marking the ratio of the memory value NC before data uploading to the compressed memory value YS as a memory ratio NB of data;
obtaining a value coefficient JZ of data through a formula JZ = alpha 1 × SS + alpha 2 × NB, wherein the value coefficient JZ is a characteristic numerical value of a request block chain, and a value interval is obtained through calculation of the value coefficient JZ, so that a preselected block chain which accords with the characteristics of the request block chain is screened out through the value interval as characteristic limitation, wherein alpha 1 and alpha 2 are proportionality coefficients, and alpha 1 is more than alpha 2 and more than 0;
obtaining a value threshold value JZmin and JZmax through formulas JZmin = JZ × a1 and JZmax = JZ × a2, wherein a1 and a2 are proportional coefficients, a1 is more than or equal to 0.75 and less than or equal to 0.85, a2 is more than or equal to 1.15 and less than or equal to 1.25, JZmin and JZmax are value threshold values obtained by performing threshold value calculation on the value coefficient JZ, and a value interval P can be formed by the value threshold values JZmin and JZmax;
the value threshold value JZmin and JZmax form a value interval P, the value analysis module sends the value interval P to the evidence storage platform, the evidence storage platform receives the value interval P and then obtains a preselected block chain according to the value interval P through screening, the evidence storage platform sends the preselected block chain to the value matching module, the preselected block chain is marked as i, i =1, 2, …, n and n are positive integers, performing value analysis on the preselected blockchain i and obtaining a value coefficient JZi of the preselected blockchain i, obtaining a matching coefficient PP of the preselected block chain i through a formula, wherein the matching coefficient PP reflects the closeness degree of the overall value characteristic of the preselected block chain i and the value coefficient of the request block chain, the smaller the numerical value of the matching coefficient PP is, the closer the overall value characteristic of the preselected block chain is to the value coefficient of the request block chain is, wherein gamma is a proportionality coefficient, and gamma is more than 1; comparing the matching coefficient PP with the matching threshold values PPmin and PPmax:
if the PP is less than or equal to PPmin, judging the matching level of the preselected block chain to be a level;
if PPmin is more than PP and less than PPmax, the matching grade of the preselected block chain is judged to be two grades;
and if the PP is more than or equal to PPmax, judging the matching level of the preselected block chain to be three levels.
Obtaining the matching number PS through a formula PS = t × n, wherein t is a proportionality coefficient, and the value judgment process of t comprises the following steps:
if the matching level of the preselected blockchain is one level, the overall value characteristic of the preselected blockchain is very close to the value coefficient of the request blockchain, so that the screening number of i matched blockchains in the preselected blockchain is large, and t = 0.45;
if the matching level of the preselected blockchain is second level, t = 0.32;
if the matching level of the preselected blockchain is three levels, t =0.27, the value matching degree of the preselected blockchain with the matching level from one level to three levels and the request blockchain is gradually reduced, and the quantity ratio of the matched blockchain in the preselected blockchain is also gradually reduced;
and (3) marking the absolute value of the difference value of the value coefficient JZi of the preselected blockchain i and the value coefficient JZ of the request blockchain as a matching value, selecting the PS preselected blockchains with the minimum matching values in the preselected blockchain i as matching blockchains, and sending the matching blockchains to the evidence storage platform by the value matching module.
After receiving the matching block chain, the evidence storing platform performs cross-link exchange on the matching block chain and the request block chain, and the cross-link exchange is specifically explained as follows: a block chain is an independent account book, two different chains are two different independent account books, and the two account books are not related. There is essentially no way to transfer value between accounts, but for a particular user, the value stored by the user on one blockchain can be changed into the value on another chain, which is the circulation of value, and cross-chain, as the name suggests, is a technology that can make the value cross the chain and the obstacle between chains, and make direct circulation. The cross-chain is essentially the same as the currency conversion. The value total on each blockchain is not changed across chains, but only a conversion is made between different holders. One of the core elements of the cross-chain technology is: helping the user Alice on one chain to find the user Bob willing to make a redemption on the other chain.
The access authority verification module is used for verifying the access authority of the access terminal through historical access data of an access person, the historical access data of the access person comprises the total historical access duration, the total historical access times and the total data loss or transfer times of the access person during access, and the specific access authority verification process comprises the following steps:
marking the access records of the visitors as u, u =1, 2, …, m and m as positive integers, obtaining the access duration of the access records u and marking the access duration as SCu, comparing the access duration SCu with a duration threshold value SCmin, marking the access records with the access duration SCu not less than the duration threshold value SCmin as effective records, marking the sum of the access durations of the effective records as access total duration ZC, marking the number of the effective records as y, and marking the times of data loss or transfer in the effective records as DS;
by the formula
The method includes that the access coefficient FW of the visitor is obtained, and it should be noted that the access coefficient is a numerical value reflecting the security degree of the visitor at the current access, and the larger the numerical value of the access coefficient is, the higher the security degree of the visitor at the current access is, the smaller the possibility of data loss and tampering is, and the access coefficient FW is compared with the access thresholds FWmin and FWmax:
if FW is less than or equal to FWmin, judging that the access security of the visitors is unqualified, and judging that the access level of the visitors is low;
if FWmin is greater than FW and less than FWmax, judging that the access security of the visitor is qualified, and judging that the access level of the visitor is a medium level;
if FW is larger than or equal to FWmax, judging that the access security of the visitor is qualified, and setting the access level of the visitor to be a high level;
and the authority verification module sends the access level of the access personnel to the evidence storage platform.
The storage sorting module is used for analyzing and judging the storage value of the file fragments in the block nodes through calling data, the calling data comprises the calling times, the exchange times and the exchange success rate of the file fragments, and the analysis process of the storage value comprises the following steps:
acquiring the calling times of the file fragments in L1 days and marking the calling times as DC;
acquiring the frequency of the exchange requests of the file fragments in L1 days and marking the frequency as JH;
acquiring the successful exchange times of the file fragments within L1 days, marking the times as CG, and taking L1 as a time constant;
by the formula
Method for obtaining storage value of file fragmentCZ, wherein beta 1, beta 2 and beta 3 are proportionality coefficients, and beta 3 is more than beta 2 and more than beta 1 and more than 1; and comparing the storage value CZ of the file fragment with a storage threshold value CZmin, and marking the file fragment of which the storage value CZ is smaller than the storage threshold value CZmin as a low-quality file.
Example two
Referring to fig. 2, a multi-chain based cross-chain distributed file evidence storing method includes the following steps:
the method comprises the following steps: when the block chain needs to exchange data, the block chain needing to exchange data is marked as a request block chain, a request instruction is sent to the evidence storage platform through the exchange request module, the exchange request module sends the request instruction to the evidence storage platform, and the evidence storage platform sends the request instruction to the value analysis module after receiving the request instruction;
step two: the value analysis module analyzes the data value of the request block chain after receiving the request instruction to obtain a value coefficient of the request block chain, performs threshold value calculation on the value coefficient to obtain value threshold values JZmin and JZmax, the JZmin and JZmax form a value interval P, and the value analysis module sends the value interval P to the evidence storage platform;
step three: after receiving the value interval P, the evidence storing platform screens the value interval P to obtain a preselected blockchain (the blockchain with the value coefficient within the value interval is screened as the preselected blockchain), the evidence storing platform sends the preselected blockchain to the value matching module, the value matching module performs value analysis on the preselected blockchain after receiving the preselected blockchain to obtain the value coefficient and judges the matching grade of the preselected blockchain, and the matching grade is judged by the comparison result of the matching coefficient of the preselected blockchain and the matching threshold;
step four: the method comprises the steps of analyzing a value coefficient of a preselected blockchain and a value coefficient of a request blockchain to obtain a matching value of the preselected blockchain, analyzing a matching grade of the preselected blockchain to obtain a matching number, screening the preselected blockchain by combining the matching value and the matching number to obtain a matching blockchain, and sending the matching blockchain to a evidence storage platform.
The formulas are obtained by acquiring a large amount of data and performing software simulation, and the coefficients in the formulas are set by the technicians in the field according to actual conditions;
when the method is used, when the block chain needs to perform data exchange, the block chain needing to perform data exchange is marked as a request block chain, a value analysis module analyzes the data value of the request block chain to obtain the value coefficient and the value interval P of the request block chain, a preselected block chain is obtained by screening according to the value interval P, a value matching module performs value analysis on the preselected block chain to obtain the value coefficient and judges the matching grade of the preselected block chain, the value coefficient of the preselected block chain and the value coefficient of the request block chain are analyzed to obtain the matching value of the preselected block chain, the matching grade of the preselected block chain is analyzed to obtain the matching number, and the preselected block chain is screened by combining the matching value and the matching number to obtain the matching block chain.
The foregoing is merely exemplary and illustrative of the present invention and various modifications, additions and substitutions may be made by those skilled in the art to the specific embodiments described without departing from the scope of the invention as defined in the following claims.
The formulas are obtained by acquiring a large amount of data and performing software simulation, and the coefficients in the formulas are set by the technicians in the field according to actual conditions; such as: formula (II)
\ MERGEFOFORMAT; collecting multiple groups of sample data and setting corresponding storage value for each group of sample data by the technicians in the field; substituting the set storage value and the acquired sample data into formulas, forming a ternary linear equation set by any three formulas, screening the calculated coefficients and taking the mean value to obtain values of beta 1, beta 2 and beta 3 which are respectively 2.32, 4.54 and 5.27;
the size of the coefficient is a specific numerical value obtained by quantizing each parameter, so that the subsequent comparison is convenient, and the size of the coefficient depends on the number of sample data and a corresponding storage value preliminarily set by a person skilled in the art for each group of sample data; it is sufficient if the proportional relationship between the parameter and the quantized value is not affected, for example, the stored value is proportional to the value of the exchange success rate.
In the description herein, references to the description of "one embodiment," "an example," "a specific example" or the like are intended to mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The preferred embodiments of the invention disclosed above are intended to be illustrative only. The preferred embodiments are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Obviously, many modifications and variations are possible in light of the above teaching. The embodiments were chosen and described in order to best explain the principles of the invention and the practical application, to thereby enable others skilled in the art to best utilize the invention. The invention is limited only by the claims and their full scope and equivalents.
Claims (7)
1. A multi-chain-based cross-chain distributed file certificate storage system comprises a certificate storage platform, and is characterized in that the certificate storage platform is in communication connection with an exchange request module, a value analysis module, a value matching module, a permission verification module and a storage and arrangement module;
when the block chain needs to carry out data exchange, the block chain needing to carry out data exchange is marked as a request block chain, a request instruction is sent to the evidence storage platform through the exchange request module, and the exchange request module sends the request instruction to the evidence storage platform;
the value analysis module analyzes the data value of the request block chain after receiving the request instruction to obtain a value coefficient of the request block chain, calculates a threshold value of the value coefficient to obtain a value interval P and sends the value interval P to the evidence storage platform;
after receiving the value interval P, the evidence storage platform screens the value interval P to obtain a preselected block chain, and sends the preselected block chain to the value matching module;
the value matching module is used for analyzing the value of the preselected block chain after receiving the preselected block chain and screening out a matching block chain according to the analysis result;
the specific process of the value analysis module for carrying out value analysis on the request block chain comprises the following steps:
acquiring upload time SJ of a data upload stage, acquiring uplink speed SX and downlink speed XX of information in a channel in the upload time, and marking the ratio of the sum of the uplink speed SX and the downlink speed XX to the upload time SJ as upload speed SS;
acquiring a memory value NC before data uploading and a compressed memory value YS in the data uploading process, and marking the ratio of the memory value NC before data uploading to the compressed memory value YS as a memory ratio NB of data;
analyzing and calculating the uploading speed SS and the memory ratio NB to obtain a value coefficient JZ of the request block chain;
the process of the value matching module for analyzing the value of the preselected blockchain comprises the following steps: marking a preselected block chain as i, i =1, 2, …, n, n is a positive integer, performing value analysis on the preselected block chain i to obtain a value coefficient JZi of the preselected block chain i, calculating JZi and JZ to obtain a matching coefficient PP of the preselected block chain i, comparing the matching coefficient PP with a matching threshold value PPmin and PPmax, and judging the matching grade of the preselected block chain according to the comparison result;
and (3) marking the absolute value of the difference value of the value coefficient JZi of the preselected blockchain i and the value coefficient JZ of the request blockchain as a matching value, selecting the PS preselected blockchains with the minimum matching values in the preselected blockchain i as matching blockchains, and sending the matching blockchains to the evidence storage platform by the value matching module.
2. The multi-chain based cross-chain distributed file storage system according to claim 1, wherein the comparison of the matching coefficient PP with the matching threshold values PPmin and PPmax comprises:
if the PP is less than or equal to PPmin, judging the matching level of the preselected block chain to be a level;
if PPmin is more than PP and less than PPmax, the matching grade of the preselected block chain is judged to be two grades;
and if the PP is more than or equal to PPmax, judging the matching level of the preselected block chain to be three levels.
3. The multi-chain-based cross-chain distributed file storage and verification system according to claim 1, wherein a calculation formula of the matching number PS is PS = t × n, where t is a proportionality coefficient, and a value determination process of t includes:
if the matching level of the preselected blockchain is a first level, t = 0.45;
if the matching level of the preselected blockchain is second level, t = 0.32;
if the matching level of the preselected blockchain is three, t = 0.27.
4. The multi-chain-based cross-chain distributed file saving and certification system according to claim 1, wherein the authority verification module is configured to perform access authority verification on the access terminal through historical access data of an access person, the historical access data of the access person includes a total historical access duration, a total historical access frequency of the access person, and a total number of times of data loss or data transfer occurring when the access person performs access, and a specific access authority verification process includes:
marking the access records of the visitors as u, u =1, 2, …, m and m as positive integers, obtaining the access duration of the access records u and marking the access duration as SCu, comparing the access duration SCu with a duration threshold value SCmin, marking the access records with the access duration SCu not less than the duration threshold value SCmin as effective records, marking the sum of the access durations of the effective records as access total duration ZC, marking the number of the effective records as y, and marking the times of data loss or transfer in the effective records as DS;
calculating and analyzing the access total frequent ZC, the number y of the effective records and the number DS of data loss or reprinting in the effective records to obtain an access coefficient FW of the visitor, comparing the access coefficient FW with access thresholds FWmin and FWmax, judging the access level of the visitor according to the comparison result, and sending the access level of the visitor to a evidence storage platform.
5. The multi-chain based cross-chain distributed file presence system according to claim 4, wherein the comparison of the access coefficient FW with the access thresholds FWmin, FWmax comprises:
if FW is less than or equal to FWmin, judging that the access security of the visitors is unqualified, and judging that the access level of the visitors is low;
if FWmin is greater than FW and less than FWmax, judging that the access security of the visitor is qualified, and judging that the access level of the visitor is a medium level;
and if the FW is larger than or equal to the FWmax, judging that the access security of the visitor is qualified, and setting the access level of the visitor to be a high level.
6. The multi-chain-based cross-chain distributed file storage and verification system according to claim 1, wherein the storage sorting module is configured to analyze and determine the storage value of the file fragments in the block node through call data, the call data includes the call times, the exchange times and the exchange success rate of the file fragments, the stored value of the fragment file is obtained through calculation of the call times, the exchange times and the exchange success rate of the file fragments, and the file fragments whose stored value CZ is smaller than the storage threshold CZmin are marked as low-quality files.
7. The multi-chain-based cross-chain distributed file deposit certificate system as claimed in claim 3, wherein the working method of the multi-chain-based cross-chain distributed file deposit certificate system comprises the following steps:
the method comprises the following steps: marking a block chain needing data exchange as a request block chain, sending a request instruction to a certificate storage platform through an exchange request module, and sending the request instruction to a value analysis module after the certificate storage platform receives the request instruction;
step two: the value analysis module analyzes the data value of the request block chain after receiving the request instruction to obtain a value coefficient and a value interval P of the request block chain, and sends the value interval P to the evidence storage platform;
step three: after receiving the value interval P, the evidence storing platform screens the value interval P to obtain a preselected block chain, and the value matching module performs value analysis on the preselected block chain to obtain a value coefficient and judges the matching level of the preselected block chain;
step four: and screening the value coefficient of the preselected block chain and the value coefficient of the request block chain to obtain a matching block chain, and sending the matching block chain to a evidence storage platform.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111292883.4A CN113722285B (en) | 2021-11-03 | 2021-11-03 | Multi-chain-based cross-chain distributed file storage and verification system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111292883.4A CN113722285B (en) | 2021-11-03 | 2021-11-03 | Multi-chain-based cross-chain distributed file storage and verification system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113722285A CN113722285A (en) | 2021-11-30 |
| CN113722285B true CN113722285B (en) | 2022-02-11 |
Family
ID=78686664
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111292883.4A Active CN113722285B (en) | 2021-11-03 | 2021-11-03 | Multi-chain-based cross-chain distributed file storage and verification system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113722285B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114722434B (en) * | 2022-06-09 | 2022-08-16 | 江苏荣泽信息科技股份有限公司 | Block chain-based ledger data control method and device |
| CN115174693B (en) * | 2022-06-30 | 2023-04-21 | 国家信息中心 | Hierarchical blockchain cross-chain interaction method |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019024673A1 (en) * | 2017-08-02 | 2019-02-07 | 众安信息技术服务有限公司 | Blockchain block data archiving method and apparatus, and query method and apparatus |
| CN110266655A (en) * | 2019-05-30 | 2019-09-20 | 中国工商银行股份有限公司 | A kind of across chain interconnected method, equipment and system based on block chain |
| CN111552676A (en) * | 2020-04-26 | 2020-08-18 | 北京众享比特科技有限公司 | Block chain based evidence storing method, device, equipment and medium |
| WO2020207090A1 (en) * | 2019-04-12 | 2020-10-15 | 创新先进技术有限公司 | Blockchain-based data processing system and method, computing device and storage medium |
| CN111966967A (en) * | 2020-08-07 | 2020-11-20 | 北京网聚云联科技有限公司 | Copyright storage method and system based on block chain technology and CDN |
| CN112685790A (en) * | 2021-03-19 | 2021-04-20 | 中企链信(北京)科技有限公司 | Block chain data security and privacy protection method |
| CN113364735A (en) * | 2021-05-01 | 2021-09-07 | 西安电子科技大学 | Data cross-link access control method, system, equipment and terminal under multi-link scene |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109145205B (en) * | 2018-07-27 | 2020-09-01 | 阿里巴巴集团控股有限公司 | Cross-chain data operation method and device based on block chain |
| WO2020042929A1 (en) * | 2018-08-28 | 2020-03-05 | 白杰 | Block chain system |
| CN109242636A (en) * | 2018-09-26 | 2019-01-18 | 盈盈（杭州）网络技术有限公司 | A kind of data transacting system and its implementation based on block chain |
| CN109685486B (en) * | 2018-11-28 | 2020-12-11 | 杭州云象网络技术有限公司 | Block chain technology-based aggregation chain architecture |
| CN109587052B (en) * | 2019-01-30 | 2022-03-15 | 展讯通信（上海）有限公司 | Multilink data transmission method and device |
| CN112003889B (en) * | 2020-07-10 | 2022-11-08 | 南京邮电大学 | Distributed cross-link system and cross-link information interaction and system access control method |
| CN112507025A (en) * | 2020-12-11 | 2021-03-16 | 成都商通数治科技有限公司 | Multi-chain isomerization method |
| CN112994892B (en) * | 2020-12-17 | 2023-06-09 | 中国工商银行股份有限公司 | Cross-chain interaction method, device, system and electronic equipment |
| CN113129147A (en) * | 2021-04-09 | 2021-07-16 | 河南高通物联网有限公司 | Block chain cross-chain management method and system based on data analysis |
| CN113326317B (en) * | 2021-05-24 | 2024-04-09 | 中国科学院计算技术研究所 | Block chain certification method and system based on isomorphic multi-chain architecture |
| CN113590718B (en) * | 2021-09-23 | 2022-11-08 | 南京慧链和信数字信息科技研究院有限公司 | Trusted data chain crossing system based on block chain all-in-one machine |
-
2021
- 2021-11-03 CN CN202111292883.4A patent/CN113722285B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019024673A1 (en) * | 2017-08-02 | 2019-02-07 | 众安信息技术服务有限公司 | Blockchain block data archiving method and apparatus, and query method and apparatus |
| WO2020207090A1 (en) * | 2019-04-12 | 2020-10-15 | 创新先进技术有限公司 | Blockchain-based data processing system and method, computing device and storage medium |
| CN110266655A (en) * | 2019-05-30 | 2019-09-20 | 中国工商银行股份有限公司 | A kind of across chain interconnected method, equipment and system based on block chain |
| CN111552676A (en) * | 2020-04-26 | 2020-08-18 | 北京众享比特科技有限公司 | Block chain based evidence storing method, device, equipment and medium |
| CN111966967A (en) * | 2020-08-07 | 2020-11-20 | 北京网聚云联科技有限公司 | Copyright storage method and system based on block chain technology and CDN |
| CN112685790A (en) * | 2021-03-19 | 2021-04-20 | 中企链信(北京)科技有限公司 | Block chain data security and privacy protection method |
| CN113364735A (en) * | 2021-05-01 | 2021-09-07 | 西安电子科技大学 | Data cross-link access control method, system, equipment and terminal under multi-link scene |
Non-Patent Citations (2)
| Title |
|---|
| 《FSCC: Flexible Smart Contract Interaction with Access Control for Blockchain》;Ruidong Li等;《IEEE》;20210806;第1-6页 * |
| 基于联盟链的数字版权管理系统;戴珊;《科技与创新》;20201005(第19期);第110-112页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113722285A (en) | 2021-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113722285B (en) | Multi-chain-based cross-chain distributed file storage and verification system | |
| CN109872535B (en) | Intelligent traffic passage prediction method, device and server | |
| Briffa et al. | Reconstructing summer temperatures in northern Fennoscandinavia back to AD 1700 using tree-ring data from Scots pine | |
| Willumsen | Estimation of an OD Matrix from Traffic Counts–A Review. | |
| US20070226095A1 (en) | Method for generating predictive models for a business problem via supervised learning | |
| CN112711757B (en) | Data security centralized management and control method and system based on big data platform | |
| CN105471647B (en) | A kind of power communication network fault positioning method | |
| US20230214740A1 (en) | Digital construction-based intelligent construction period early warning system and method | |
| CN108881250A (en) | Powerline network security postures prediction technique, device, equipment and storage medium | |
| CN111782723A (en) | Double-layer product information tracing system architecture based on permission chain | |
| CN115577152B (en) | Online book borrowing management system based on data analysis | |
| CN109710667A (en) | A kind of shared realization method and system of the multisource data fusion based on big data platform | |
| CN115080546B (en) | Enterprise data diagnosis system based on big data | |
| CN110517154A (en) | Data model training method, system and computer equipment | |
| CN113487241A (en) | Method, device, equipment and storage medium for classifying enterprise environment-friendly credit grades | |
| CN116361759B (en) | Intelligent compliance control method based on quantitative authority guidance | |
| CN113282933B (en) | Federal learning method, device and system, electronic equipment and storage medium | |
| Yeom et al. | LSTM-based collaborative source-side DDoS attack detection | |
| CN110175113A (en) | Business scenario determines method and apparatus | |
| CN115720212A (en) | Network flow prediction and automatic optimization balancing method based on multi-source data fusion | |
| CN114611713A (en) | Method and system for constructing tree model based on longitudinal federated learning | |
| CN114070586A (en) | Cooperative working method of block chain and Internet of things | |
| CN111882415A (en) | Training method and related device of quality detection model | |
| CN112559310B (en) | Object identification method and device based on dynamic graph | |
| CN114697255B (en) | Enterprise network transmission data risk early warning system and method |
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 |