CN113242131A - Block chain cross-chain method and device, electronic equipment and storage medium - Google Patents
Block chain cross-chain method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN113242131A CN113242131A CN202110438195.8A CN202110438195A CN113242131A CN 113242131 A CN113242131 A CN 113242131A CN 202110438195 A CN202110438195 A CN 202110438195A CN 113242131 A CN113242131 A CN 113242131A
- Authority
- CN
- China
- Prior art keywords
- node
- evaluation
- nodes
- score
- determining
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 238000011156 evaluation Methods 0.000 claims abstract description 151
- 238000012545 processing Methods 0.000 claims description 18
- 230000004044 response Effects 0.000 claims description 18
- 238000004590 computer program Methods 0.000 claims description 11
- 239000000126 substance Substances 0.000 claims description 6
- 230000003993 interaction Effects 0.000 description 10
- 238000005516 engineering process Methods 0.000 description 9
- 230000008569 process Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 230000001360 synchronised effect Effects 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000012163 sequencing technique Methods 0.000 description 3
- 230000004888 barrier function Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000009792 diffusion process Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000004132 cross linking Methods 0.000 description 1
- 238000013524 data verification Methods 0.000 description 1
- 238000013210 evaluation model Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
- H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Abstract
The application discloses a block chain cross-chain method, a block chain cross-chain device, electronic equipment and a storage medium, wherein the block chain cross-chain method comprises the following steps: determining a first score for each first node in the blockchain system; the first score represents the trust level of the corresponding first node; based on the determined first score of each first node, performing notary node recommendation in all the first nodes; wherein, in the determining the first score for each first node in the blockchain system, the method comprises: obtaining an evaluation set A corresponding to a first node ii(ii) a The evaluation set AiRepresenting the evaluation information of all second nodes corresponding to the first node i; the second node is any node except the first node i in the block chain system; determining a degree of trust T between a first node i and each second nodeij(ii) a According to the evaluation set AiConfidence T corresponding to each second nodeijA first score for the first node i is determined.
Description
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a method and an apparatus for crossing a blockchain, an electronic device, and a storage medium.
Background
Cross-chain Technology (Cross-chain Technology) is a Technology for value circulation across chains and barriers between chains. Due to the difference of the bottom-layer platforms of the block chain, cross-chain information interaction can be divided into bottom-layer isomorphism and bottom-layer isomorphism, and the common recognition algorithm, the safety mechanism and the like of the bottom-layer isomorphism are different, so that technical challenges such as performance, safety and the like are brought to a cross-chain technology.
In the related art, information interaction between heterogeneous block chains is performed through a Notary mechanism (notify schemes), and a third party serves as a Notary node, but the security and reliability of the Notary node are difficult to guarantee.
Disclosure of Invention
In view of this, embodiments of the present disclosure provide a block chain cross-chain method, an apparatus, an electronic device, and a storage medium, so as to solve at least the problem that it is difficult to ensure the security and reliability of a notary node in the related art.
The technical scheme of the embodiment of the application is realized as follows:
the embodiment of the application provides a block chain cross-linking method, which comprises the following steps:
determining a first score for each first node in the blockchain system; the first score represents the trust level of the corresponding first node;
based on the determined first score of each first node, performing notary node recommendation in all the first nodes; wherein the content of the first and second substances,
in the determining the first score for each first node in the blockchain system, the method comprises:
obtaining an evaluation set A corresponding to a first node ii(ii) a The evaluation set AiRepresenting the evaluation information of all second nodes corresponding to the first node i; the second node is any node except the first node i in the block chain system;
determining a degree of trust T between a first node i and each second nodeij；
According to the evaluation set AiConfidence T corresponding to each second nodeijA first score for the first node i is determined.
In the above scheme, the obtaining of the evaluation set a corresponding to the first node i is describediWhen, atThe method comprises the following steps:
broadcasting an evaluation signal with respect to the first node i; the evaluation signal carries a first public key;
receiving an evaluation response returned by each second node corresponding to the first node i; the evaluation response carries evaluation information encrypted based on the first public key;
and decrypting the received evaluation response based on the first private key corresponding to the first public key to obtain the evaluation information of each second node to the first node i.
In the above solution, the determining the trust level T between the first node i and each second nodeijThe method comprises the following steps:
determining the similarity of a first node i and a second node j; the similarity represents the similarity of the first node i and the second node j on the node attribute;
determining the adjacency degree of a first node i and a second node j; the adjacency degree represents the degree proportion of the first node i and the second node j in the network topology of the blockchain system;
and obtaining the trust degree between the first node i and the second node j based on the determined similarity and the determined adjacency.
In the foregoing solution, the recommending notary nodes in all the first nodes based on the determined first score of each first node includes:
and determining at least two first nodes as notary nodes in all the first nodes based on the determined first scores of each first node.
In the foregoing solution, after determining that at least two first nodes are notary nodes among all the first nodes, the method further includes:
splitting the first ciphertext into at least two parts, and sending the first ciphertext of each part to the determined notary node; the first ciphertext represents a ciphertext obtained by encrypting the second private key;
under the condition of receiving a first request sent by at least one node, acquiring corresponding parts of the first ciphertext from the at least two notary nodes, and restoring the second private key; the first request characterizes a corresponding node request cross-chain.
In the above scheme, evaluation set AiCharacterizing at least one of the following evaluations of the first node i by the second node j:
processing efficiency evaluation, user feedback evaluation and negative information evaluation.
In the above scheme, the evaluation set a corresponding to the first node i is obtainediPreviously, the method further comprises:
receiving a second request sent by a first node i; the second request characterizes the first node i request to be confirmed as a notary node.
The embodiment of the present application further provides a block chain inter-chain device, including:
the scoring unit is used for determining a first score of each first node in the block chain system; the first score represents the trust level of the corresponding first node;
the recommending unit is used for recommending the notary nodes in all the first nodes based on the determined first scores of all the first nodes; wherein the content of the first and second substances,
in the determining the first score of each first node in the blockchain system, the scoring unit is configured to:
obtaining an evaluation set A corresponding to a first node ii(ii) a The evaluation set AiRepresenting the evaluation information of all second nodes corresponding to the first node i; the second node is any node except the first node i in the block chain system;
determining a degree of trust T between a first node i and each second nodeij；
According to the evaluation set AiConfidence T corresponding to each second nodeijA first score for the first node i is determined.
An embodiment of the present application further provides an electronic device, including: a processor and a memory for storing a computer program capable of running on the processor,
wherein the processor is configured to execute the steps of the block chain crossing method when running the computer program.
The embodiment of the present application further provides a storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the above block chain cross-chain method.
In the embodiment of the application, an evaluation set representing evaluation information of all other nodes to a first node in a block chain system is obtained, the trust between the first node and each other node is determined, a first score of the first node is determined according to the evaluation set and the trust corresponding to each other node, and node recommendation is performed based on the determined first score of each first node. Therefore, each node is scored by using the evaluation set and the trust degree among different nodes, and the notary node recommendation is performed based on the scores, so that the safety and the reliability of the notary node recommendation are improved.
Drawings
Fig. 1 is a schematic flowchart of a block chain crossing method according to an embodiment of the present disclosure;
fig. 2 is a schematic flowchart of a block chain crossing method according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a blockchain inter-chain apparatus according to an embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The cross-chain technology is a technology for performing value distribution across chains and barriers between chains. Due to the difference of the bottom-layer platforms of the block chain, cross-chain information interaction can be divided into bottom-layer isomorphism and bottom-layer isomorphism, the common recognition algorithm, the safety mechanism and the like of the bottom-layer isomorphism are different, information interaction cannot be directly carried out among heterogeneous chains, and technical challenges such as performance and safety are brought to a cross-chain technology.
In the related technology, information interaction between heterogeneous block chains is carried out through a notary mechanism, a third party serves as a notary, information interaction between various heterogeneous chains can be supported, and the safety and reliability of the notary are difficult to guarantee.
Based on this, in various embodiments of the application, an evaluation set characterizing evaluation information of the first node by all other nodes in the blockchain system is obtained, the trust level between the first node and each other node is determined, a first score of the first node is determined according to the evaluation set and the trust level corresponding to each other node, and node recommendation is performed based on the determined first score of each first node. Therefore, each node is scored by using the evaluation set and the trust degree among different nodes, and the notary node recommendation is performed based on the scores, so that the safety and the reliability of the notary node recommendation are improved.
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
Fig. 1 is a schematic flow chart of an implementation process of a block chain crossing method provided in an embodiment of the present application, and as shown in fig. 1, the block chain crossing method includes:
step 101: determining a first score for each first node in the blockchain system; the first score characterizes a trust level of the corresponding first node.
Step 102: based on the determined first score of each first node, performing notary node recommendation in all the first nodes; wherein the content of the first and second substances,
in the determining the first score for each first node in the blockchain system, the method comprises:
obtaining an evaluation set A corresponding to a first node ii(ii) a The evaluation set AiRepresenting the evaluation information of all second nodes corresponding to the first node i; the second node is any node except the first node i in the block chain system;
determining a degree of trust T between a first node i and each second nodeij；
According to the evaluation set AiCorresponding to each second nodeDegree of trust TijA first score for the first node i is determined.
In this embodiment, the evaluation information of all the second nodes except the first node i in the block chain system to the first node i is obtained, and the evaluation set a corresponding to the first node i is determinediAnd determining the trust level T between the first node i and each second nodeijAccording to the determined evaluation set A corresponding to the first node iiAnd a confidence level T corresponding to each second nodeijDetermining a first score of the first node i, and recommending at least one notary node in all the first nodes based on the determined first score of each first node. Here, the second node is any node other than the first node i in the blockchain system.
The safety of the notary node determination is ensured by constructing a dynamic notary node evaluation model. The method comprises the steps of providing a score ordering by collecting relevant information of various nodes, determining nodes in all first nodes for recommendation, scoring each node by utilizing an evaluation set and trust degrees among different nodes to obtain a first score corresponding to each node, recommending the nodes based on the first score ordering, recommending the nodes with high trust degrees to be notary nodes, improving safety and reliability of notary node recommendation, and further ensuring safety and stability of a block chain system.
In an embodiment, the obtaining of the evaluation set a corresponding to the first node i is describediThe method comprises the following steps:
broadcasting an evaluation signal with respect to the first node i; the evaluation signal carries a first public key;
receiving an evaluation response returned by each second node corresponding to the first node i; the evaluation response carries evaluation information encrypted based on the first public key;
and decrypting the received evaluation response based on the first private key corresponding to the first public key to obtain the evaluation information of each second node to the first node i.
When notary node recommendation is needed, the block chain system sends the block chain to all nodesThe evaluation signal of the first node i carries a first public key and an address of the first node to be evaluated, after all second nodes except the first node in the block chain system receive the evaluation signal, evaluation information encryption is carried out on the basis of the first public key carried in the evaluation signal, an evaluation response carrying the evaluation information encrypted on the basis of the first public key is returned, the block chain system decrypts the received evaluation response returned by each second node on the basis of the first private key corresponding to the first public key to obtain the evaluation information of each second node to the first node i, and an evaluation set A corresponding to the first node i is determined on the basis of the obtained evaluation information of all the second nodesi。
Here, it may be because the nodes need notary node requirements generated across the chain; or when the node actively applies for becoming a notary node, whether the node can be used as the notary node is determined by grading.
Therefore, the evaluation information of each second node to the first node i in the block chain system is obtained by broadcasting the evaluation signal, the first score of each first node can be effectively determined, the notary node recommendation is carried out based on the scores, and the reliability of the notary node recommendation is improved.
The evaluation response returned by each second node may carry a digital signature of the second node, the digital signature is obtained by encrypting the hash value of the evaluation information by the corresponding private key of the second node, and the block chain system decrypts the digital signature by using the corresponding public key after receiving the digital signature, so that the identity of the second node returning the evaluation response can be determined.
In one embodiment, set A of evaluationsiCharacterizing at least one of the following evaluations of the first node i by the second node j:
processing efficiency evaluation, user feedback evaluation and negative information evaluation.
Here, the evaluation set a corresponding to the first node i is determined based on the acquired evaluation information of all the second nodesiAt least representing the processing efficiency evaluation P of the second node j to the first node i1User feedback evaluation P2And negative side effectsInformation evaluation P3。
Representing the obtained processing efficiency evaluation P of the first node i by all the second nodes according to the following formula 11：
Wherein p represents the processing efficiency evaluation weight of all the second nodes to the first node i; t isjIndicating transaction processing time for each second node.
Representing and acquiring user feedback evaluation P of all second nodes to the first node i through the following formula 22：
Wherein q represents the user feedback evaluation weight of all the second nodes to the first node i; cjAnd representing the historical evaluation value of each second node user.
The negative information evaluation P of the first node i by all the second nodes is represented and obtained through the following formula 33：
Wherein r represents the negative information evaluation weight of all the second nodes to the first node i; n is a radical ofjIndicating the number of negative message evaluations per second node.
Thus, the evaluation set a corresponding to the first node i can be characterized by the following formula 4iEvaluation set AiAt least representing the processing efficiency evaluation P of the second node j to the first node i1User feedback evaluation P2And negative information evaluation P3：
Ai＝{P1，P2，P3} (4)
In one embodiment, the determining the first sectionConfidence T between point i and each second nodeijThe method comprises the following steps:
determining the similarity of a first node i and a second node j; the similarity represents the similarity of the first node i and the second node j on the node attribute;
determining the adjacency degree of a first node i and a second node j; the adjacency degree represents the degree proportion of the first node i and the second node j in the network topology of the blockchain system;
obtaining the trust degree between the first node i and the second node j based on the determined similarity and the determined adjacency
Determining a degree of trust T between a first node i and each second nodeijAnd then, for each second node, respectively determining the similarity of the first node i and the second node j and the adjacency of the first node i and the second node j, and obtaining the trust between the first node i and the second node j based on the determined similarity and the determined adjacency.
Here, the similarity represents the degree of similarity between the first node i and the second node j in the node attributes, and the similarity R between the first node i and the second node j is calculated by the following formula 5S(i，j)：
Wherein S (i, j) represents the similarity between the first node i and the second node j,
representing the sum of the similarity of the second node j to all nodes.
In a blockchain system, a degree of a node characterizes the extent to which this node is in contact with surrounding nodes. If one node needs to carry out information propagation, the neighboring nodes with larger information propagation degree values are more beneficial to the diffusion of information flow in the network. Calculating the adjacency degree of the first node i and the second node j by the following formula 6 by determining the proportion of the degree of the adjacency degree characterizing the first node i to the sum of the degrees of all the adjacent nodes of the second node jRd(i，j)：
Wherein d isiRepresents the degree, sigma of the first node ik∈N(j)dkThe sum of the degrees of the second node j and all neighboring nodes is characterized.
For example, if there are 5 nodes adjacent to the second node j in addition to the first node i, the degrees of the 5 nodes are 2, 3, 4, 3, and 3, respectively, and the degree of the first node i is 5, then the adjacency of the first node i and the second node j is determined
Based on the determined similarity RS(i, j) and adjacency Rd(i, j), the degree of trust T between the first node i and the second node j is calculated by the following equation 7ij：
Tij＝(1-α)*RS(i，j)+α*Rd(i，j) (7)
Wherein α represents the adjacency Rd(ii) a weight parameter of (i, j).
According to evaluation set AiConfidence T corresponding to each second nodeijThe first Score of the first node i is calculated by the following equation 8i：
Where N denotes the total number of nodes in the blockchain system, α denotes the probability of hopping, N(j)Set of neighboring nodes representing node j, AiAn evaluation set, Score, representing evaluation information of all second nodes j to the first node ijRepresenting a first score for a second node j. Here, α is generally 0.85.
In an embodiment, the making of notary node recommendations among all first nodes based on the determined first score of each first node includes:
and determining at least two first nodes as notary nodes in all the first nodes based on the determined first scores of each first node.
Score based on the determined first Score of each first nodeiAnd sequencing, namely determining at least two first nodes as notary nodes from all the first nodes according to the sequencing of the first scores. Therefore, the notary node recommendation is performed by using the scores among different nodes, and the safety and reliability of the notary node recommendation are improved.
Here, the blockchain system broadcasts the ranking results and calculation process of the first score for each first node. If the objection information sent by the nodes is not received within the set time, determining a set number of first nodes with top ranking as notary nodes from all the first nodes; and if the objection information sent by any node is received within the set time, re-determining the first score of each first node in the block chain system.
In one embodiment, after said determining at least two first nodes among all first nodes to be notary nodes, the method further comprises:
splitting the first ciphertext into at least two parts, and sending the first ciphertext of each part to the determined notary node; the first ciphertext represents a ciphertext obtained by encrypting the second private key;
under the condition of receiving a first request sent by at least one node, acquiring corresponding parts of the first ciphertext from the at least two notary nodes, and restoring the second private key; the first request characterizes a corresponding node request cross-chain.
Encrypting the second private key by using the key to obtain a first ciphertext corresponding to the second private key, splitting the first ciphertext into at least two parts, and sending the first ciphertext of each part to the determined notary node; and under the condition of receiving a first request of requesting a cross-chain sent by at least one node, acquiring a corresponding part of the first ciphertext from the notary node, and restoring a second private key. Here, when the first ciphertext is split into multiple parts, the number of the split parts may be set according to the number of notary nodes, so that each notary node receives at least one part of the first ciphertext; each portion may be distributed to at least one notary node.
Therefore, the node performs cross-chain information interaction based on the acquired second private key, and a decentralized data verification process is achieved.
When the corresponding portion of the first ciphertext is obtained from the notary node, the identity of the node may be determined to be the notary node by verifying the digital signature of the node that sent the information in response to the first request, and the second private key is recovered based on the portion of the first ciphertext sent by the node determined to be the notary node.
In an embodiment, the evaluation set a corresponding to the first node i is obtainediPreviously, the method further comprises:
receiving a second request sent by a first node i; the second request characterizes the first node i request to be confirmed as a notary node.
And receiving a second request sent by the first node i, wherein the second request confirms that the first node i is a notary node, and acquiring evaluation information of all second nodes except the first node i in the block chain system to the first node i based on the second request. In this way, when the first node applies to become the notary node, the evaluation information of all the nodes in the block chain system to the first node is obtained, so as to determine whether to recommend the first node as the notary node.
In one embodiment, after obtaining the evaluation information of all the second nodes to each first node i, a trust relationship graph representing the trust relationships among all the nodes may be generated.
The present application will be described in further detail with reference to the following application examples.
With reference to fig. 2, the corresponding block chain inter-chain method includes the following steps:
step 201: when the first node applies to become a notary node, information such as processing efficiency evaluation, user feedback evaluation and negative information evaluation of the first node is collected, relevant information of the first node is evaluated, and whether the first node is the notary node or not is determined according to an evaluation result.
The blockchain system sends an evaluation signal related to the first node i to all nodes, and broadcasts a public key of the blockchain system and an address of the first node to be evaluated; after each node receives the signal, the received public key of the block chain system is used for encrypting information, and the private key of the node is used for encrypting a signature; the blockchain system collects the encrypted information of each node and uses a private key corresponding to the public key of the system to decrypt the encrypted information.
And the block chain system collects the information of the first nodes i, such as processing efficiency evaluation, user feedback evaluation, negative information evaluation and the like, carries out credit degree sorting, and broadcasts a sorting result and a calculation process of the first scores of each first node.
The first score is calculated as follows:
first, the weight W of each evaluation of the first node i by all the second nodes is determined by the following formula 91：
Representing and obtaining the processing efficiency evaluation P of the first node i by all the second nodes according to formula 11。
Representing and obtaining user feedback evaluation P of all second nodes to the first node i through formula 22。
Negative information evaluation P of all second nodes to the first node i, which is obtained through representation of formula 33。
Representing the evaluation set A corresponding to the first node i through formula 4iEvaluation set AiAt least representing the processing efficiency evaluation P of the second node j to the first node i1User feedback evaluation P2And negative information evaluation P3。
Calculating the similarity R of the first node i and the second node j by formula 5S(i, j) characterizing how similar the first node i and the second node j are in the node attribute.
There will also be a higher frequency of interaction between two nodes with a certain similarity in node properties. The similarity S (i, j) of the first node i and the second node j is defined by the following equation 10:
S(i，j)＝|H(i)∩H(j)| (10)
where H (i) represents the set of node attributes for the first node i, and H (j) represents the set of node attributes for the second node j.
In a blockchain system, a degree of a node characterizes the extent to which this node is in contact with surrounding nodes. If one node needs to carry out information propagation, the neighboring nodes with larger information propagation degree values are more beneficial to the diffusion of information flow in the network. Calculating the adjacency degree R of the first node i and the second node j by formula 6 by determining the proportion of the degree of the adjacency degree characterizing the first node i to the sum of the degrees of all the adjacent nodes of the second node jd(i，j)。
Based on the determined similarity RS(i, j) and adjacency Rd(i, j), calculating the trust level T between the first node i and the second node j by formula 7ij。
According to evaluation set AiConfidence T corresponding to each second nodeijCalculating a first Score of the first node i by equation 8i。
Score according to first ScoreiCarry out sequencing
The blockchain system broadcasts the ranking results and calculation process of the first scores of each first node. If the objection information sent by any node is not received within the set time, determining the first nodes with the set number and the top rank as notary nodes from all the first nodes, and removing the nodes with the top rank.
Step 202: splitting the first ciphertext into at least two parts, and sending the first ciphertext of each part to the determined notary node; the first ciphertext represents a ciphertext obtained by encrypting the second private key.
Encrypting the second private key by using the key to obtain a first ciphertext corresponding to the second private key, splitting the first ciphertext into at least two parts, and sending the first ciphertext of each part to the determined notary node; and under the condition of receiving a first request of requesting a cross-chain sent by at least one node, acquiring a corresponding part of the first ciphertext from the notary node, and restoring a second private key. Here, when the first ciphertext is split into multiple parts, the number of the split parts may be set according to the number of notary nodes, so that each notary node receives at least one part of the first ciphertext; each portion may be distributed to at least one notary node.
When the corresponding portion of the first ciphertext is obtained from the notary node, the identity of the node may be determined to be the notary node by verifying the digital signature of the node that sent the information in response to the first request, and the second private key is recovered based on the portion of the first ciphertext sent by the node determined to be the notary node. Therefore, each notary node cannot possess a complete key, and the obtained ciphertexts are combined together, so that the complete key cannot be deduced.
In order to implement the method according to the embodiment of the present application, an embodiment of the present application further provides a block chain inter-chain device, as shown in fig. 3, where the block chain inter-chain device includes:
a scoring unit 301, configured to determine a first score of each first node in the blockchain system; the first score represents the trust level of the corresponding first node;
a recommending unit 302, configured to perform notary node recommendation in all first nodes based on the determined first score of each first node; wherein the content of the first and second substances,
when determining the first score of each first node in the blockchain system, the scoring unit 301 is configured to:
obtaining an evaluation set A corresponding to a first node ii(ii) a The evaluation set AiRepresenting the evaluation information of all second nodes corresponding to the first node i; the second node is any node except the first node i in the block chain system;
determiningTrust T between first node i and each second nodeij；
According to the evaluation set AiConfidence T corresponding to each second nodeijA first score for the first node i is determined.
Wherein, in one embodiment, the scoring unit 301 is configured to:
broadcasting an evaluation signal with respect to the first node i; the evaluation signal carries a first public key;
receiving an evaluation response returned by each second node corresponding to the first node i; the evaluation response carries evaluation information encrypted based on the first public key;
and decrypting the received evaluation response based on the first private key corresponding to the first public key to obtain the evaluation information of each second node to the first node i.
In one embodiment, the scoring unit 301 is configured to:
determining the similarity of a first node i and a second node j; the similarity represents the similarity of the first node i and the second node j on the node attribute;
determining the adjacency degree of a first node i and a second node j; the adjacency degree represents the degree proportion of the first node i and the second node j in the network topology of the blockchain system;
and obtaining the trust degree between the first node i and the second node j based on the determined similarity and the determined adjacency.
In an embodiment, the recommending unit 302 is configured to:
and determining at least two first nodes as notary nodes in all the first nodes based on the determined first scores of each first node.
In one embodiment, the apparatus further comprises:
the splitting unit is used for splitting the first ciphertext into at least two parts and sending the first ciphertext of each part to the determined notary node; the first ciphertext represents a ciphertext obtained by encrypting the second private key;
the restoring unit is used for acquiring corresponding parts of the first ciphertext from the at least two notary nodes and restoring the second private key under the condition of receiving a first request sent by at least one node; the first request characterizes a corresponding node request cross-chain.
In one embodiment, the evaluation set AiCharacterizing at least one of the following evaluations of the first node i by the second node j:
processing efficiency evaluation, user feedback evaluation and negative information evaluation.
In one embodiment, the apparatus further comprises:
a receiving unit, configured to receive a second request sent by a first node i; the second request characterizes the first node i request to be confirmed as a notary node.
In practical applications, the scoring Unit 301, the recommending Unit 302, the splitting Unit, the restoring Unit, and the receiving Unit may be implemented by processors in a block chain based cross-chain, such as a Central Processing Unit (CPU), a Digital Signal Processor (DSP), a Micro Control Unit (MCU), or a Programmable Gate Array (FPGA).
It should be noted that: in the block chain crossing device provided in the above embodiment, when the block chain crossing is performed, only the division of each program module is illustrated, and in practical applications, the processing distribution may be completed by different program modules according to needs, that is, the internal structure of the device is divided into different program modules to complete all or part of the processing described above. In addition, the block chain crossing device provided in the above embodiments and the block chain crossing method embodiment belong to the same concept, and specific implementation processes thereof are detailed in the method embodiment and are not described herein again.
Based on the hardware implementation of the program module, and in order to implement the block chain cross-chain method in the embodiment of the present application, an embodiment of the present application further provides an electronic device, as shown in fig. 4, where the electronic device 400 includes:
a communication interface 410 capable of information interaction with other devices such as network devices and the like;
and the processor 420 is connected with the communication interface 410 to realize information interaction with other equipment, and is used for executing the method provided by one or more technical solutions when the computer program runs. And the computer program is stored on the memory 430.
Of course, in practice, the various components in the electronic device 400 are coupled together by a bus system 440. It is understood that the bus system 440 is used to enable communications among the components. The bus system 440 includes a power bus, a control bus, and a status signal bus in addition to a data bus. For clarity of illustration, however, the various buses are labeled as bus system 440 in fig. 4.
The memory 430 in the embodiments of the present application is used to store various types of data to support the operation of the electronic device 400. Examples of such data include: any computer program for operating on the electronic device 400.
It will be appreciated that the memory 430 can be either volatile memory or nonvolatile memory, and can include both volatile and nonvolatile memory. Among them, the nonvolatile Memory may be a Read Only Memory (ROM), a Programmable Read Only Memory (PROM), an Erasable Programmable Read-Only Memory (EPROM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), a magnetic random access Memory (FRAM), a Flash Memory (Flash Memory), a magnetic surface Memory, an optical disk, or a Compact Disc Read-Only Memory (CD-ROM); the magnetic surface storage may be disk storage or tape storage. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of illustration and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM), Enhanced Synchronous Dynamic Random Access Memory (Enhanced DRAM), Synchronous Dynamic Random Access Memory (SLDRAM), Direct Memory (DRmb Access), and Random Access Memory (DRAM). The memory 430 described in the embodiments herein is intended to comprise, without being limited to, these and any other suitable types of memory.
The method disclosed in the embodiments of the present application may be applied to the processor 420, or implemented by the processor 420. Processor 420 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 420. The processor 420 described above may be a general purpose processor, a DSP, or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like. Processor 420 may implement or perform the methods, steps, and logic blocks disclosed in the embodiments of the present application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software modules may be located in a storage medium located in the memory 430, and the processor 420 reads the program in the memory 430 and performs the steps of the aforementioned methods in conjunction with its hardware.
Optionally, when the processor 420 executes the program, the corresponding process implemented by the electronic device in each method of the embodiment of the present application is implemented, and for brevity, no further description is given here.
In an exemplary embodiment, the present application further provides a storage medium, specifically a computer-readable storage medium, for example, a memory 430 storing a computer program, which can be executed by a processor 420 of an electronic device to perform the steps of the foregoing method. The computer readable storage medium may be Memory such as FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface Memory, optical disk, or CD-ROM.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus, electronic device and method may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, all functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may be separately regarded as one unit, or two or more units may be integrated into one unit; the integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
Those of ordinary skill in the art will understand that: all or part of the steps for implementing the method embodiments may be implemented by hardware related to program instructions, and the program may be stored in a computer readable storage medium, and when executed, the program performs the steps including the method embodiments; and the aforementioned storage medium includes: a removable storage device, a ROM, a RAM, a magnetic or optical disk, or various other media that can store program code.
Alternatively, the integrated units described above in the present application may be stored in a computer-readable storage medium if they are implemented in the form of software functional modules and sold or used as independent products. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially implemented or portions thereof contributing to the prior art may be embodied in the form of a software product stored in a storage medium, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a removable storage device, a ROM, a RAM, a magnetic or optical disk, or various other media that can store program code.
The technical means described in the embodiments of the present application may be arbitrarily combined without conflict. Unless otherwise specified and limited, the term "coupled" is to be construed broadly, e.g., as meaning electrical connections, or as meaning communications between two elements, either directly or indirectly through intervening media, as well as the specific meanings of such terms as understood by those skilled in the art.
In addition, in the examples of the present application, "first", "second", and the like are used for distinguishing similar objects, and are not necessarily used for describing a specific order or a sequential order. It should be understood that "first \ second \ third" distinct objects may be interchanged under appropriate circumstances such that the embodiments of the application described herein may be implemented in an order other than those illustrated or described herein.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Various combinations of the specific features in the embodiments described in the detailed description may be made without contradiction, for example, different embodiments may be formed by different combinations of the specific features, and in order to avoid unnecessary repetition, various possible combinations of the specific features in the present application will not be described separately.
Claims (10)
1. A method for block chain chaining, the method comprising:
determining a first score for each first node in the blockchain system; the first score represents the trust level of the corresponding first node;
based on the determined first score of each first node, performing notary node recommendation in all the first nodes; wherein the content of the first and second substances,
in the determining the first score for each first node in the blockchain system, the method comprises:
obtaining an evaluation set A corresponding to a first node ii(ii) a The evaluation set AiRepresenting the evaluation information of all second nodes corresponding to the first node i; the second node is any node except the first node i in the block chain system;
determining a degree of trust T between a first node i and each second nodeij；
According to the evaluation set AiConfidence T corresponding to each second nodeijA first score for the first node i is determined.
2. The method according to claim 1, wherein the obtaining of the evaluation set a corresponding to the first node i is performediThe method comprises the following steps:
broadcasting an evaluation signal with respect to the first node i; the evaluation signal carries a first public key;
receiving an evaluation response returned by each second node corresponding to the first node i; the evaluation response carries evaluation information encrypted based on the first public key;
and decrypting the received evaluation response based on the first private key corresponding to the first public key to obtain the evaluation information of each second node to the first node i.
3. The method of claim 1, wherein determining a degree of trust T between the first node i and each second nodeijThe method comprises the following steps:
determining the similarity of a first node i and a second node j; the similarity represents the similarity of the first node i and the second node j on the node attribute;
determining the adjacency degree of a first node i and a second node j; the adjacency degree represents the degree proportion of the first node i and the second node j in the network topology of the blockchain system;
and obtaining the trust degree between the first node i and the second node j based on the determined similarity and the determined adjacency.
4. The method of claim 1, wherein performing notary node recommendations among all first nodes based on the determined first score for each first node comprises:
and determining at least two first nodes as notary nodes in all the first nodes based on the determined first scores of each first node.
5. The method of claim 4, wherein after the determining at least two first nodes among all first nodes are notary nodes, the method further comprises:
splitting the first ciphertext into at least two parts, and sending the first ciphertext of each part to the determined notary node; the first ciphertext represents a ciphertext obtained by encrypting the second private key;
under the condition of receiving a first request sent by at least one node, acquiring corresponding parts of the first ciphertext from the at least two notary nodes, and restoring the second private key; the first request characterizes a corresponding node request cross-chain.
6. The method according to any one of claims 1 to 5, wherein evaluation set AiCharacterizing at least one of the following evaluations of the first node i by the second node j:
processing efficiency evaluation, user feedback evaluation and negative information evaluation.
7. The method according to any one of claims 1 to 5, wherein the evaluation set A corresponding to the first node i is obtainediPreviously, the method further comprises:
receiving a second request sent by a first node i; the second request characterizes the first node i request to be confirmed as a notary node.
8. A blockchain inter-chain apparatus, comprising:
the scoring unit is used for determining a first score of each first node in the block chain system; the first score represents the trust level of the corresponding first node;
the recommending unit is used for recommending the notary nodes in all the first nodes based on the determined first scores of all the first nodes; wherein the content of the first and second substances,
in the determining the first score of each first node in the blockchain system, the scoring unit is configured to:
obtaining an evaluation set A corresponding to a first node ii(ii) a The evaluation set AiRepresenting the evaluation information of all second nodes corresponding to the first node i; the second node is any node except the first node i in the block chain system;
determining a degree of trust T between a first node i and each second nodeij；
According to the evaluation set AiConfidence T corresponding to each second nodeijDetermining a first score for a first node i。
9. An electronic device, comprising: a processor and a memory for storing a computer program capable of running on the processor,
wherein the processor is configured to execute the steps of the blockchain cross-chain method of any one of claims 1 to 7 when running the computer program.
10. A storage medium having stored thereon a computer program for implementing the steps of the blockchain cross-chain method according to any one of claims 1 to 7 when executed by a processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110438195.8A CN113242131B (en) | 2021-04-22 | 2021-04-22 | Block chain crossing method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110438195.8A CN113242131B (en) | 2021-04-22 | 2021-04-22 | Block chain crossing method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113242131A true CN113242131A (en) | 2021-08-10 |
| CN113242131B CN113242131B (en) | 2023-10-24 |
Family
ID=77128926
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110438195.8A Active CN113242131B (en) | 2021-04-22 | 2021-04-22 | Block chain crossing method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113242131B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113688317A (en) * | 2021-08-24 | 2021-11-23 | 江苏中润普达信息技术有限公司 | Information recommendation method and system based on block chain |
| CN113890739A (en) * | 2021-08-17 | 2022-01-04 | 北京邮电大学 | Cross-block-chain authentication method and device, electronic equipment and medium |
| CN114363050A (en) * | 2021-12-31 | 2022-04-15 | 北京交通大学 | Decentralized cross-link protocol communication method based on notarization and Hash locking |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190066119A1 (en) * | 2017-08-22 | 2019-02-28 | Mastercard International Incorporated | Method and system for review verification and trustworthiness scoring via blockchain |
| CN109472596A (en) * | 2018-10-16 | 2019-03-15 | 中国传媒大学 | Alliance's chain common recognition method and system based on transaction assessment |
| CN110249350A (en) * | 2016-09-20 | 2019-09-17 | 河谷控股Ip有限责任公司 | Sample tracking, system and method are carried out via sample tracking chain |
| US20190370813A1 (en) * | 2018-06-04 | 2019-12-05 | Coral Protocol | Decentralized safeguard against fraud |
| CN110598010A (en) * | 2018-07-24 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Grading processing method, system and storage medium of media content |
| US20200126116A1 (en) * | 2018-10-18 | 2020-04-23 | Adobe Inc. | System for providing proof and attestation services for claim verification |
| CN111552853A (en) * | 2020-04-20 | 2020-08-18 | 卓尔智联(武汉)研究院有限公司 | Data capture method and device, electronic equipment and storage medium |
| CN111598681A (en) * | 2020-04-30 | 2020-08-28 | 深圳前海星际同辉科技有限公司 | Credit evaluation method, credit evaluation system and readable storage medium |
| CN112116473A (en) * | 2020-09-18 | 2020-12-22 | 上海计算机软件技术开发中心 | Cross-chain notary mechanism evaluation system and platform |
| CN112508704A (en) * | 2020-12-17 | 2021-03-16 | 杭州趣链科技有限公司 | Block chain cross-chain transaction method and device, computer equipment and storage medium |
| CN112637127A (en) * | 2020-11-23 | 2021-04-09 | 北京邮电大学 | Cross-block-chain communication method and device |
| CN112637189A (en) * | 2020-12-18 | 2021-04-09 | 重庆大学 | Multi-layer block chain cross-domain authentication method in application scene of Internet of things |
-
2021
- 2021-04-22 CN CN202110438195.8A patent/CN113242131B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110249350A (en) * | 2016-09-20 | 2019-09-17 | 河谷控股Ip有限责任公司 | Sample tracking, system and method are carried out via sample tracking chain |
| US20190066119A1 (en) * | 2017-08-22 | 2019-02-28 | Mastercard International Incorporated | Method and system for review verification and trustworthiness scoring via blockchain |
| US20190370813A1 (en) * | 2018-06-04 | 2019-12-05 | Coral Protocol | Decentralized safeguard against fraud |
| CN110598010A (en) * | 2018-07-24 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Grading processing method, system and storage medium of media content |
| CN109472596A (en) * | 2018-10-16 | 2019-03-15 | 中国传媒大学 | Alliance's chain common recognition method and system based on transaction assessment |
| US20200126116A1 (en) * | 2018-10-18 | 2020-04-23 | Adobe Inc. | System for providing proof and attestation services for claim verification |
| CN111552853A (en) * | 2020-04-20 | 2020-08-18 | 卓尔智联(武汉)研究院有限公司 | Data capture method and device, electronic equipment and storage medium |
| CN111598681A (en) * | 2020-04-30 | 2020-08-28 | 深圳前海星际同辉科技有限公司 | Credit evaluation method, credit evaluation system and readable storage medium |
| CN112116473A (en) * | 2020-09-18 | 2020-12-22 | 上海计算机软件技术开发中心 | Cross-chain notary mechanism evaluation system and platform |
| CN112637127A (en) * | 2020-11-23 | 2021-04-09 | 北京邮电大学 | Cross-block-chain communication method and device |
| CN112508704A (en) * | 2020-12-17 | 2021-03-16 | 杭州趣链科技有限公司 | Block chain cross-chain transaction method and device, computer equipment and storage medium |
| CN112637189A (en) * | 2020-12-18 | 2021-04-09 | 重庆大学 | Multi-layer block chain cross-domain authentication method in application scene of Internet of things |
Non-Patent Citations (6)
| Title |
|---|
| MINGLI WU ECT.: "A Comprehensive Survey of Blockchain: From Theory to IoT Applications and Beyond", 《IEEE INTERNET OF THINGS JOURNAL》 * |
| YING LAN ECT.: "TrustCross: Enabling Confidential Interoperability across Blockchains Using Trusted Hardware", Retrieved from the Internet <URL:https://arxiv.org/pdf/2103.13809> * |
| 张亮;刘百祥;张如意;江斌鑫;刘一江;: "区块链技术综述", 计算机工程, no. 05 * |
| 戴炳荣，姜胜明，李顿伟，李超: "基于改进PageRank算法的跨链公证人机制评价模型", 《计算机工程》 * |
| 朱志强;: "基于区块链的档案数据共享可信度机制构建", 黑龙江档案, no. 04 * |
| 赵莉;任杰;: "基于多层次结构模型的云服务信任评估算法优化", 南京理工大学学报, no. 01 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113890739A (en) * | 2021-08-17 | 2022-01-04 | 北京邮电大学 | Cross-block-chain authentication method and device, electronic equipment and medium |
| CN113688317A (en) * | 2021-08-24 | 2021-11-23 | 江苏中润普达信息技术有限公司 | Information recommendation method and system based on block chain |
| CN114363050A (en) * | 2021-12-31 | 2022-04-15 | 北京交通大学 | Decentralized cross-link protocol communication method based on notarization and Hash locking |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113242131B (en) | 2023-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113242131A (en) | Block chain cross-chain method and device, electronic equipment and storage medium | |
| US20220368545A1 (en) | Searchable encrypted data sharing method and system based on blockchain and homomorphic encryption | |
| CN111914027B (en) | Block chain transaction keyword searchable encryption method and system | |
| WO2020134942A1 (en) | Identity verification method and system therefor | |
| WO2020061923A1 (en) | Blockchain-based account management system and management method, and storage medium | |
| CN111245597B (en) | Key management method, system and equipment | |
| CN113487042B (en) | Federal learning method, device and federal learning system | |
| JP6069852B2 (en) | Information processing apparatus, information processing method, and program | |
| Znaidi et al. | Hierarchical node replication attacks detection in wireless sensor networks | |
| CN113162768B (en) | Intelligent Internet of things equipment authentication method and system based on block chain | |
| Wang et al. | Efficient public verification on the integrity of multi-owner data in the cloud | |
| CN111428269B (en) | Data access method, device and terminal equipment | |
| CN107359998A (en) | A kind of foundation of portable intelligent password management system and operating method | |
| US11394544B2 (en) | Validation of blockchain activities based on proof of hardware | |
| CN110177124A (en) | Identity identifying method and relevant device based on block chain | |
| US11477184B2 (en) | Conducting secure interactions utilizing reliability information | |
| Lu et al. | Secure collaborative outsourced data mining with multi-owner in cloud computing | |
| CN115499249B (en) | File storage method and system based on block chain distributed encryption | |
| Chen et al. | Verifiable dynamic ranked search with forward privacy over encrypted cloud data | |
| CN113569263A (en) | Secure processing method and device for cross-private-domain data and electronic equipment | |
| CN111080296B (en) | Verification method and device based on blockchain system | |
| Wu et al. | Secure public data auditing scheme for cloud storage in smart city | |
| CN113434906B (en) | Data query method, device, computer equipment and storage medium | |
| Duan et al. | Design of anonymous authentication scheme for vehicle fog services using blockchain | |
| Rani et al. | Design of blockchain-based authentication and key agreement protocol for health data sharing in cooperative hospital network |
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 |