CN114143104B - DPoS (distributed denial of service) consensus mechanism node reputation value measurement method based on dynamic trust model - Google Patents
DPoS (distributed denial of service) consensus mechanism node reputation value measurement method based on dynamic trust model Download PDFInfo
- Publication number
- CN114143104B CN114143104B CN202111478227.3A CN202111478227A CN114143104B CN 114143104 B CN114143104 B CN 114143104B CN 202111478227 A CN202111478227 A CN 202111478227A CN 114143104 B CN114143104 B CN 114143104B
- Authority
- CN
- China
- Prior art keywords
- node
- value
- consensus
- nodes
- round
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
- H04L63/105—Multiple levels of security
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/56—Financial cryptography, e.g. electronic payment or e-cash
Abstract
The invention relates to a DPoS consensus mechanism node reputation value measurement method based on a dynamic trust model, and belongs to the technical field of block chains. The invention is based on node a in the block chain system i Historical behavior, interactive node evaluation value and reward and punishment value obtained by node, measurement node a i Reputation value R in this round of consensus i (ii) a Then, carrying out credit grading on the nodes through credit values, and dividing the nodes into trusted nodes, common nodes and untrusted nodes; and finally, selecting the credible node as a candidate node of the current round, participating in the consensus process of the current round, and enabling the common node and the non-credible node not to participate in the block output of the current round. The invention provides a new theoretical basis and technical basis for improving the security of the DPoS consensus mechanism by dynamically measuring the credit value of the node in each round of consensus process in the DPoS consensus mechanism, classifying the credit of the node according to the credit value and eliminating the node with malicious behavior in the system in time.
Description
Technical Field
The invention relates to a DPoS consensus mechanism node reputation value measurement method based on a dynamic trust model, and belongs to the technical field of block chains.
Background
The block chain is essentially a decentralized distributed account book database, and a decentralized credit transaction system based on a P2P network is realized by applying technologies such as a timestamp, a Merkle tree structure, an asymmetric key encryption algorithm, a consensus mechanism and the like. The blockchain technology has the advantages of complete disclosure, tamper resistance, multiple payment prevention, independence of a third party and the like, and provides a solution for solving the problems of high cost, low efficiency, unsafe data storage and the like commonly existing in a centralized system. In recent years, the block chain technology is widely applied to the fields of medical treatment, finance, internet of things, traffic and the like. The consensus mechanism is used as a core technology of the bottom layer of the block chain, the hierarchical structure of the block chain is determined, the reliability of a block chain system is guaranteed, the safety of a block chain network is improved, and the consistency of distributed storage is guaranteed. A good consensus mechanism can improve the performance of the blockchain system and promote the application of blockchain technology.
Common consensus mechanisms in public blockchains currently include Proof of workload (Proof of Work, poW), proof of rights (Proof of stamp, poS), and Proof of delegation rights (Delegate Proof of stamp, DPoS). The PoW competes for the accounting right through the strength of the computing power of different nodes, and the safety of the block chain system is ensured. But the competitive results in excessive resource consumption of the blockchain system. Compared with PoW, poS improves the efficiency of block generation, but because nodes in PoS compete for block right without paying cost, the nodes can generate a plurality of branches to obtain benefits, and the consistency of a PoS consensus mechanism is influenced. In addition, in the PoS consensus mechanism, rights and interests are held in a few nodes, resulting in a centralized rights and interests. A common recognition mechanism is provided by DPoS on a PoS base layer, and the core of DPoS is to select few Witness nodes (Witness nodes) to go out blocks by node voting. The nodes holding the virtual currency in the DPoS consensus mechanism have voting rights, the voting nodes vote to trusted nodes, and then n nodes with the largest number of votes are counted to serve as witness nodes. After each round of voting election is finished, the blocks are generated by the n witness nodes in turn. Compared with PoW and PoS, the DPoS reduces the number of nodes participating in consensus, and the average block-out time is about 3 s. Although the DPoS improves defects existing in PoW and PoS, a DPoS consensus mechanism does not provide a method for effectively processing malicious nodes, so that the nodes with malicious behaviors can still participate in competition accounting rights, and the security and reliability of the DPoS consensus mechanism are seriously affected. Tan C et al (DPoSB: deleted Processof Stake with nodes's behavior and Borda Count [ C ]//2020IEEE 5 Information Technology and mechanics Engineering Conference (ITOEC): IEEE, 2020-1434.), huQ et al (An Improved deleted Processof Stake Consensus Algorithm [ J ]. Procedia Computer Science, reputation 1, 187-341 ] and Sun Y et al (DT-DPoS: A deleted Processof Stabsenses Algorithm with dynamics Trust [ J ]. Procedia Computer Science, reputation 1, 202187-371.) all propose reputation for the common metric model but the reliability of the above mentioned model is not guaranteed, and the reliability of the model is not guaranteed
Disclosure of Invention
The invention aims to provide a DPoS consensus mechanism node reputation value measuring method based on a dynamic trust model, which is used for solving the problem that malicious nodes in a DPoS consensus mechanism are not removed timely and improving the security of the DPoS consensus mechanism.
The technical scheme of the invention is as follows: a DPoS consensus mechanism node reputation value measurement method based on a dynamic trust model includes the steps that firstly, according to a node a in a block chain system i Historical behavior, interactive node evaluation value and reward and punishment value obtained by node, measurement node a i Reputation value R in this round of consensus i . And then, carrying out credit grading on the nodes through a credibility threshold, and dividing the nodes into credible nodes, common nodes and non-credible nodes. And finally, selecting the credible node as a candidate node of the current round, participating in the consensus process of the current round, and enabling the common node and the non-credible node not to participate in the block output of the current round.
The method comprises the following specific steps:
step1: in order to measure the influence of different consensus rounds on the current reputation value measurement, the transaction pair in the k-th consensus round is first defined to calculate the node a in the blockchain system i A time decay function t (k) of the reputation degree in the current consensus round n. Wherein, the larger the value of t (k), the closer k is to n, and the node a is i The greater the degree of influence of the reputation value measure of (a).
Step2: according to node a in the block chain system i The credit obtained by the historical behavior calculation is a direct credit value D i Calculating the index by the behavior factor of the node i And the entitlement factor coinarrate i And (4) forming. Wherein, the blocking rate i From a to a i Determination of the number of valid outgoing blocks in the system, coinarrate i From a to a i The amount of money held in the system is determined.
Step3: by accumulating n rounds of consensus process node a i Obtaining the average value of the obtained interactive evaluation to obtain a node a i Indirect reputation value S of i 。
Step4: for the purpose of performing incentive evaluation on the behavior of the node, according to the node a in the block chain system i In the process of consensus, successful block-out behavior or malicious behavior is introduced with reward and penalty factor RP i . Wherein, according to the node a i The number of successive successful block outs or the number of successive bakes is given its corresponding reward or penalty value.
Step5: according to node a in the block chain system i Direct reputation D i Indirect reputation S i And reward punishment value RP i To measure a i Reputation value R at nth round i . Wherein R is i ＝αD i +βS i +δRP i And α, β, δ are in the measurement R respectively i Time D i 、S i 、RP i The weight occupied.
When D is i ＝0、S i ＝0、RP i (ii) when =0, a is described i And setting the credit degree of the node newly added into the system to be 0.5 for the node newly added into the block chain system.
In the invention, the highest reputation value is 1.0, and the reputation value is set to be 0.5, so as to prevent the initial reputation value of the node from being too low and influence the enthusiasm of a newly added node for participating in block chain consensus. And secondly, the node which is newly added into the system is prevented from easily obtaining a high reputation value.
The DPoS consensus mechanism node credit value is calculated by combining various evaluation indexes, and the credit value is evaluated and updated according to the behavior of the node, the interactive node score and the reward punishment value, so that the accuracy and reliability of credit measurement are ensured.
Step6: after measuring the credit degree of the node, the node a is measured according to the credit degree i And grading, namely dividing the nodes into credible nodes, general nodes and non-credible nodes according to the credibility threshold.
When the reputation value R i Greater than t c Node a i Is a trusted node.
When the reputation value R i Less than t c And is greater than t m Node a i Is a general node.
When the reputation value R i Less than t m Node a i Is an untrusted node.
Step7: the credible nodes are used as candidate nodes in the current round and participate in the consensus process in the current round, and the general nodes and the credible nodes cannot participate in the block output in the current round.
The calculation yields a direct reputation value D i The method comprises the following specific steps:
in order to ensure timeliness and accuracy of the node reputation, the method needs to distinguish influences of behaviors in different consensus rounds on a current reputation value, a system is set to perform n consensus processes within a period of time, a k-th round is defined, k is less than n, and a time decay function t (k) of a transaction in the consensus process on the node reputation calculated in the current consensus round n is as follows:
the larger the t (k) value is, the closer the k-th consensus is to the current consensus n, and the larger the influence of the node performance of the k-th round on the node reputation value measurement is. the smaller t (k) is, the longer the distance between the k-th round consensus and the current consensus round n is, the smaller the influence of the node performance of the k-th round on the node reputation value measurement is.
Wherein, the blocking rate i Is node a i Behavior factor in a blockchain system, the blockrate i As a reference index, the activity level of a node in a blockchain system can be measured. Rights and interests are important characteristics of DPoS consensus mechanism, so the method takes the rights and interests asMeasuring a portion of the direct reputation of a node, node a i The entitlement factor in a blockchain system is denoted as coinarrate i 。
Node a i Behavior factor of (1) i Expressed as:
wherein the content of the first and second substances,
is node a i The number of valid blocks, a, generated during the k-th round of consensus i The more the number of effective blocks generated in the k-th round of consensus process is, and the closer the round k is to the current round n, the more the number of effective blocks is
The larger the value, the blockrate i The larger the value is, the node a i The higher the activity of (c).
Node a i Interest factor coinarrate of i Expressed as:
the number of held virtual currencies of different nodes in the DPoS common identification mechanism is different, and the invention takes the currency holding amount of the nodes in a block chain system as a rights factor, coin i Is node a i The coin holding amount is the ratio of the whole virtual currency amount of the system. coinarate i The larger the node a is illustrated i The greater the equity ratio.
The direct reputation value is based on node a i Objective behavior in a blockchain system i Represents:
D i ＝γblockrate i +ηcoinrate i
wherein, gamma and eta are respectively a blocking rate i 、coinrate i At D i The weight occupied in the calculation.
The invention is at the computing node a i When the direct credit value is obtained, the relevant characteristics of a DPoS consensus mechanism are fully considered, the behavior factors and the rights and interests factors are introduced to serve as indexes for calculating the direct credit value, and when the node a i The better the performance in the blockchain system, the direct reputation value D i The larger, the overall node reputation value R i The larger the size.
The reward and penalty factor RP i The method specifically comprises the following steps:
let s (i) be a i Number of consecutive successful block outs, node a i Obtaining a prize value based on the number of successful block deliveries, f (i) being a i Number of consecutive offences, node a i A penalty value is obtained based on the number of successive attacks.
Wherein, RP i The method embodies that the reward punishment mechanism slowly increases the reward for the nodes, and the punishment degree on the malignant behavior of the nodes is very large. According to the invention, by setting a reward and punishment mechanism, the enthusiasm of the nodes participating in consensus in the block chain system is improved, and meanwhile, the nodes with malicious behaviors can be punished in time, so that the safety of the consensus process is ensured.
The invention designs a method for dynamically measuring the node credit value in a DPoS consensus mechanism by combining various evaluation indexes based on a distributed dynamic trust model and combining the characteristics of a block chain. The trust model is a process for formalizing trust through a mathematical model, and measures trust by combining relevant attributes such as trust content and the like. The method comprises the steps of firstly, calculating a credit value of a node in the common recognition of the current round by considering historical behavior expression of the DPoS common recognition mechanism node in a system, evaluation values of interaction nodes and reward and punishment values obtained according to node block appearance; then, classifying the nodes through credit values, and dividing the nodes into credible nodes, general nodes and non-credible nodes; and finally, setting the credible node as a candidate node, wherein the candidate node has a chance to participate in the current round of consensus process, and the common node and the non-credible node cannot participate in the current round of block generation. By dynamically measuring the credit degree of the nodes in the DPoS consensus mechanism in each round of consensus process, the fault-tolerant capability of the DPoS consensus mechanism is improved, the nodes with malicious behaviors can be removed in time by the method, and a new theoretical basis and a new technical basis are provided for improving the safety of the DPoS consensus mechanism.
The beneficial effects of the invention are:
1. because the DPoS consensus mechanism does not provide a method for effectively processing the malicious nodes, the malicious nodes can still participate in competition accounting rights, and the security and the reliability of the DPoS consensus mechanism are seriously influenced. The invention provides a DPoS consensus mechanism node reputation value measurement method based on a dynamic trust model by combining the relevant characteristics of a block chain based on the dynamic trust model. The method can eliminate the nodes with malicious behaviors in time by dynamically measuring the node credit values and grading the nodes according to the credit degrees, thereby improving the safety degree of the consensus process and ensuring the reliability of the DPoS consensus mechanism.
2. The prior art has the problems that the index of measuring the credit value is single, and the method is lack of a reliable reward and punishment mechanism. The invention introduces a dynamic trust model mechanism, takes the historical behavior, the interactive evaluation value and the time loss function of the node in the system as the index for measuring the reputation value of the node, and improves the accuracy of reputation value measurement. Meanwhile, a reward punishment mechanism is introduced, a corresponding reward value and punishment value are given to the nodes according to the performance of the nodes, and the reliability of the method is ensured.
Drawings
FIG. 1 is a flow chart of the steps of the present invention;
Detailed Description
The invention is further described with reference to the following drawings and detailed description.
Example 1: as shown in fig. 1, a DPoS consensus mechanism node reputation value measurement method based on a dynamic trust model measures a reputation value of a node in a current round of consensus by considering historical behavior expression of the DPoS consensus mechanism node in a system, evaluation values of interaction nodes, and reward and punishment values obtained according to node behaviors; then, the nodes are classified according to the credit values, and the nodes are divided into credible nodes, general nodes and non-credible nodes; and finally, setting the credible node as a candidate node, wherein the candidate node has a chance to participate in the current round of consensus process, and the common node and the non-credible node cannot participate in the current round of block generation.
The method comprises the following specific steps:
first of all, when a user wants to use the apparatus, common in blockchain systems the set of nodes is a = { a = 1 ,a 2 ,…,a m And m is the number of common nodes. Common node a i Creditworthiness in the k-th consensus process
Is represented by i Represents node a i Direct reputation of, S i Represents node a i Indirect reputation of, RP i Represents node a i A reward value or penalty value obtained.
Step1: in order to ensure timeliness and accuracy of node reputation in a block chain system, influences of behaviors in different consensus rounds on a current reputation value need to be distinguished, n consensus processes are set to be carried out in a period of time, and a time decay function t (k) of a transaction in a k-th consensus process on calculation of the node reputation in the current consensus round n is defined as follows:
the larger the t (k) value is, the closer the k-th consensus distance is to the current consensus turn n, and the larger the influence of the node performance of the k-th turn on the node reputation value measurement is; the smaller t (k) is, the longer the distance between the k-th round consensus and the current consensus round n is, the smaller the influence of the node performance of the k-th round on the node reputation value measurement is.
Step2: the direct reputation value being based on node a i Objective behavioral performance calculated reputation in blockchain system, using D i And (4) showing.
Wherein, the blocking rate i Is node a i Historical behavior in a blockchain system willblockrate i As a reference index, the activity level of a node in the blockchain system can be measured; the rights and interests are important characteristics of the DPoS consensus mechanism, so that the rights and interests are taken as a part of measuring the direct credibility of the nodes, namely the node a i The interest factor in the blockchain system is denoted as coinarate i . Node a i The better the performance in the blockchain system, the direct reputation value D i The larger, the overall node reputation value R i The larger the size.
Step2.1: node a i Historical behavior factor of (1) i Can be expressed as:
wherein, the first and the second end of the pipe are connected with each other,
is node a i The number of valid blocks, a, generated during the k-th round of consensus i The more the number of effective blocks generated in the k-th round of consensus process is, and the closer the round k is to the current round n, the more the number of effective blocks is
The larger the value, the blockrate i The larger the value is, the node a i The higher the activity of (c).
Step2.2: node a i Interest factor coinarrate of i Can be expressed as:
the number of held virtual currencies of different nodes in the DPoS common identification mechanism is different, and the currency holding amount of the nodes in the block chain system is used as a rights and interests factor, namely coinrate i Is node a i The coin holding amount is the ratio of the whole virtual currency amount of the system. coinarate i The larger the node a is illustrated i The greater the equity proportion.
The direct reputation value isAccording to node a i Objective behavioral performance calculated reputation in blockchain system, using D i Represents:
D i ＝γblockrate i +ηcoinrate i (4)
wherein gamma and eta are respectively a barrier rate i 、coinrate i At D i The occupied weight in the calculation. At the computing node a i When the direct credit value is obtained, the relevant characteristics of a DPoS consensus mechanism are fully considered, the behavior factors and the rights and interests factors are introduced to serve as indexes for calculating the direct credit value, and when the node a i The better the performance in the blockchain system, the direct reputation value D i The larger, the overall node reputation value R i The larger the size.
Step3: according to the node a in the block chain system i Calculating the evaluation information provided by the interactive nodes to obtain an indirect credit value, and using S i And (4) showing.
Step3.1：
For the node a in the k-th consensus process j To a i The evaluation information of (1). An evaluation value of 1, a j Full trust a i (ii) a An evaluation value of 0, representing a j Totally untrusted a i (ii) a In other cases the evaluation value is
Step3.2：s i,j Is node a j To node a in n rounds of consensus i The average interactive rating of (2), as shown in equation (6):
in order to accurately calculate nNode a in wheel j To a i Using the time loss function t (k) of formula (1) to distinguish a among different consensus rounds j 、a i Cross-rating pair S ij The influence of (c).
Step3.3: by accumulating n rounds of consensus process node a i After the obtained interactive evaluation values are obtained, averaging is carried out to obtain a i Indirect reputation value S of i ：
Node pair a when participating in an interaction i The higher the evaluation value of (A), the node a i Indirect reputation value S of i The larger the value of (A), the node a i Reputation value of R i The larger.
Step4: in order to perform incentive evaluation on the behaviors of nodes in the blockchain system, reward and penalty factors are introduced according to the successful block-out behavior or malicious behavior of the nodes in the consensus process, and RP (remote procedure protocol) is used i Represents:
let s (i) be a i Number of consecutive successful block outs, node a i Obtaining a reward value according to the number of successful block outing; f (i) is a i Number of consecutive offences, node a i Penalty values are obtained as a function of the number of successive acts. The formula (8) shows that the reward and punishment mechanism slowly increases for the reward of the node, and the punishment degree for the malicious behavior of the node is very large. Through setting up the reward punishment mechanism, improved the enthusiasm that node participated in the consensus in block chain system, to the node that has malicious action simultaneously, also can punishment to it in time, guaranteed the security of consensus process.
Step5: the node reputation value measurement method is constructed according to the historical behaviors, the interactive evaluation values and the reward and punishment values of the nodes and is represented as follows:
wherein, alpha, beta and delta are respectively measured
Time D i 、S i 、RP i The weight occupied; when D is present i ＝0、S i ＝0、RP i (ii) when =0, a is described i And setting the credit degree of the node newly added into the system to be 0.5 for the node newly added into the block chain system.
By considering the historical behavior of the DPoS common recognition mechanism node in the system, the interactive node evaluation value and the reward and punishment value obtained by the node, the evaluation index considered by the node credit value obtained by measurement is more comprehensive, and the credit value is more accurately calculated.
Step6: and after measuring the credit degree of the nodes, grading the nodes according to the credit degree.
Step6.1 sets a grade threshold value to divide the nodes into credible nodes, general nodes and non-credible nodes, and the indexes of the threshold value are shown in Table 1
| Threshold value | Node type |
| (t c ,1) | Trusted node |
| (t m ,t c ) | Generic node |
| (0,t m ) | Untrusted node |
Table 1: node trust rating classification table
Let t c A threshold criterion for a trusted node; t is t m Is a threshold criterion for untrusted nodes. When t is c ＜R i When the ratio is less than or equal to 1, a i Is a trusted node; when t is m ＜R i ≤t c When a is turned on i Is a common node; when 0 < R i ≤t m When a is i Is an untrusted node. And the credible node has a chance to participate in the current round of consensus process and participate in block generation. The general nodes and the non-trusted nodes cannot participate in the consensus process.
The credit value of the node can be evaluated and updated according to the historical behavior of the node in the system, the interactive node evaluation value and the reward and punishment value. When the trusted node is selected, the node reputation value changes dynamically, so that the selected node is ensured to be safer and more reliable.
Example 2: as shown in fig. 1, a DPoS consensus mechanism node reputation value measurement method based on a dynamic trust model includes that the model calculates a reputation value in node natural consensus through historical behavior expression of DPoS consensus mechanism nodes in a system, evaluation values of interaction nodes, and reward and punishment values obtained according to node behaviors; then, classifying the nodes through credit values, and dividing the nodes into credible nodes, general nodes and non-credible nodes; and finally setting the trusted node as a candidate node.
A node reputation value is calculated based on the dynamic trust model.
Let A = { a) common node set 1 ,a 2 ,a 3 ,a 4 ,a 5 N =6 for the current consensus round. Wherein the method involves setting parameters, e.g.
Shown in table 2.
Table 2: method parameter setting table
The degree t (k) of influence of the behavior in the k-th round (k < 6) of consensus on the node reputation in the current consensus round n =6 is calculated from formula (1), and is shown in table 3.
Table 3: t (k) value table of k-th round consensus
Wherein k is 1 The value of t (k) is the minimum when the distance from the current round is the farthest; k is a radical of 5 The value of t (k) is the largest closest to the current round.
Calculating direct reputation value D of node according to historical behavior of node i 。
And effectively outputting the block condition according to the node history i Computing node a i At the activity level in the system, the nodes in set A make 5 first round block out cases, as shown in Table 4.
| k 1 | k 2 | k 3 | k 4 | k 5 | |
| a 1 | 1 | 0 | 1 | 1 | 1 |
| a 2 | 1 | 0 | 0 | 0 | 0 |
| a 3 | 0 | 1 | 0 | 0 | 1 |
| a 4 | 0 | 1 | 0 | 1 | 0 |
| a 5 | 1 | 0 | 0 | 1 | 0 |
Table 4: node block-out condition table in different consensus rounds
According to the formula (2), when the node a i In a block chain systemThe larger the number of valid blocks generated, the larger the blocking rate i The larger the value of (c). When a is i The fewer the number of valid blocks generated in the blockchain system, and the further the round k is from n, the greater the blocking rate i The smaller the value of (c). In case n =6, node a i Activity block rate of i Comprises the following steps:
blockrate 1 ＝0.36111111111111116；
blockrate 2 ＝0.027777777777777773；
blockrate 3 ＝0.19444444444444445；
blockrate 4 ＝0.16666666666666666；
blockrate 5 ＝0.1388888888888889
according to node a i Virtual currency quantity calculation a held in the system i Interest factor coinarrate of i The node in set A holds the currency amount in the first 5 rounds, as shown in Table 5.
| k 1 | k 2 | k 3 | k 4 | k 5 | |
| a 1 | 3 | 3 | 0 | 3 | 3 |
| a 2 | 2 | 3 | 2 | 4 | 5 |
| a 3 | 4 | 3 | 2 | 3 | 3 |
| a 4 | 3 | 1 | 5 | 3 | 2 |
| a 5 | 4 | 0 | 2 | 1 | 0 |
Table 5: coin-holding measuring meter for node in different consensus rounds
According to the formula (3), when the node a i Coinrate increases as the amount of virtual currency held in the blockchain system increases i The larger the value of (c). In case n =6, node a i The interest factor of is coinrate i Comprises the following steps:
coinrate 1 ＝0.23076923076923078；
coinrate 2 ＝0.38461538461538464；
coinrate 3 ＝0.23076923076923078；
coinrate 4 ＝0.15384615384615385；
coinrate 5 ＝0.0。
as shown in the formula (4), the node a i Direct degree of credit D i By blocking rate i With coinarate i And (4) adding to obtain. If gamma and eta are 0.5, the node a i Direct reputation value of D i Comprises the following steps:
D 1 ＝0.29594017094017；
D 2 ＝0.2061965811965812；
D 3 ＝0.21260683760683763；
D 4 ＝0.16025641025641024；
D 5 ＝0.06944444444444445。
calculating the node a according to the interactive average value i Indirect reputation value S of i 。
The node a is obtained by calculation of formula (5) and formula (6) i And node a j The interactive evaluation value in the system is s i,j It is shown that the evaluation of the interaction between the nodes in the set A is expressed as the matrix S = [ S ] i,j ] 5×5 I, j =1,2,3,4,5, k =1,2,3,4,5. The evaluation matrix is interacted between nodes, as shown in table 6.
| s i,j | k 1 | k 2 | k 3 | k 4 | k 5 |
| a 1 | 0 | 0.3 | 0.6 | 0.4 | 0.8 |
| a 2 | 0.3 | 0 | 0.3 | 0.5 | 0.5 |
| a 3 | 0.9 | 0.4 | 0 | 0.8 | 0.5 |
| a 4 | 0.8 | 0.2 | 0.5 | 0 | 0.5 |
| a 5 | 0.8 | 0.3 | 0.5 | 0.9 | 0 |
Table 6: inter-node interaction evaluation table
Calculated according to equation (7) to obtain S 1 ＝0.7；S 2 ＝0.3；S 3 ＝0.475；S 4 ＝0.65；S 5 =0.575, according to S i The calculation result shows that the node pairs a are interacted i The higher the overall evaluation of the node, the higher S i The larger.
Calculating a reward and punishment value according to the node behavior when the node a i If valid blocks are generated continuously or bad continuously, then corresponding reward or penalty value RP is given i . The performance of the nodes in set a in the blockchain system is shown in table 7. Wherein, -1 represents oxa; 0 means no participation in the out-block; 1 indicates a successful block.
Table 7: node expression table in block output process
As shown in Table 7, in the first 5 rounds of consensus, a 1 Successfully discharging blocks for 3 times continuously; a is 2 Continuously treating for 4 times; a is 3 The node successfully outputs the block for 1 time continuously; a is a 4 、a 5 The node does not participate in the egress block. The expression from the node is calculated by equation (8):
RP 1 ＝0.43111040368030434；
RP 2 ＝-3.366397440279515；
RP 3 ＝0.1689173560735206；
RP 4 ＝0；
RP 5 ＝0。
as shown in Table 2, the weights α, β, δ are 0.6, 0.3, 0.1, respectively, and the reputation value R of the node in the set A is calculated according to the formula (9) i Respectively as follows:
R 1 ＝0.930675142932132；
R 2 ＝0.3770782046899972；
R 3 ＝0.7869558381714546；
R 4 ＝0.7911538461538461；
R 5 ＝0.7141666666666666。
the node reputation value R obtained according to the calculation i And the thresholds in table 2, the nodes are ranked for confidence.
According to t m 、t c The value is known when t c ＜R i When the ratio is less than or equal to 1, a i Is a trusted node; when t is m ＜R i ≤t c When a is turned on i Is a common node; when 0 < R i ≤t m When a is i Is an untrusted node.
From t m ＝0.5、t c =0.8 and a is known 1 Being a trusted node, a 2 As an untrusted node, a 3 、a 4 、a 5 Is a general node.
According to the result of the embodiment 2, the invention can select the nodes with better historical behavior performance and higher interactive evaluation value in the block chain system as trust nodes according to the DPoS node reputation value measurement method based on the dynamic trust model, and can effectively remove the nodes with malicious behaviors. The safety and the reliability of the DPoS consensus mechanism are improved.
While the present invention has been described in detail with reference to the embodiments shown in the drawings, the present invention is not limited to the embodiments, and various changes can be made without departing from the spirit and scope of the present invention.
Claims (1)
1. Based on developments trust mouldThe DPoS consensus mechanism node reputation value measurement method is characterized by comprising the following steps of: first, according to node a in the block chain system i Historical behavior, interactive node evaluation value and reward and punishment value obtained by node, measurement node a i Reputation value R in this round of consensus i (ii) a Then, the nodes are subjected to credit classification through a credibility threshold, and the nodes are divided into credible nodes, general nodes and non-credible nodes; finally, selecting a credible node as a candidate node of the current round, participating in the consensus process of the current round, and enabling a common node and an incredible node not to participate in the block output of the current round;
the method comprises the following specific steps:
step1: first, define the node a in the k-th round of consensus for the transaction pair computation blockchain system i A time decay function t (k) of the reputation degree in the current consensus round n; wherein, the larger the value of t (k), the closer k is to n, and the node a is i The greater the degree of influence of the reputation value measure of;
step2: according to node a in the blockchain system i The credit obtained by the historical behavior calculation is a direct credit value D i Calculating the index by the behavior factor of the node i And the entitlement factor coinarrate i Forming; wherein, the blocking rate i From a to a i Determination of the number of valid blocks in the system, coinrate i From a to a i Determining the amount of held coins in the system;
step3: by accumulating n rounds of consensus process node a i Obtaining the average value of the obtained interactive evaluation to obtain a node a i Indirect reputation value S of i ；
Step3.1：
For the node a in the k-th consensus process j To a i Evaluation information of (1) indicates that a j Full trust a i (ii) a An evaluation value of 0, representing a j Totally untrusted a i (ii) a In other cases the evaluation value is
Step3.2：s i,j Is node a j To node a in n rounds of consensus i The average interaction rating of (2):
for accurately calculating the node a in n rounds j To a is to i Using the time loss function t (k) of formula (1) to distinguish a among different consensus rounds j 、a i Cross-rating pair S ij The influence of (a);
step3.3: by accumulating node a in n rounds of consensus process i After the obtained interactive evaluation values are obtained, averaging is carried out to obtain a i Indirect reputation value S of i ：
Step4: according to node a in the blockchain system i In the process of consensus, successful block-out behavior or malicious behavior is introduced with reward and penalty factor RP i (ii) a Wherein, according to the node a i The corresponding reward value or penalty value is given to the times of continuous successful block output or continuous malignant times;
step5: according to node a in the block chain system i Direct reputation D i Indirect reputation S i And reward punishment value RP i To measure a i Reputation value R at nth round i (ii) a Wherein R is i ＝αD i +βS i +δRP i And α, β, δ are in the measurement R respectively i Time of flight D i 、S i 、RP i The weight occupied;
when D is present i ＝0、S i ＝0、RP i (ii) when =0, a is described i Setting the credit degree of the node newly added into the system to be 0.5 for the node newly added into the block chain system;
step6: after measuring the credit degree of the node, the node a is measured according to the credit degree i Grading is carried out, and the nodes are divided into credible nodes, general nodes and non-credible nodes according to the credibility threshold;
when the reputation value R i Greater than t c Node a i Is a trusted node;
when the reputation value R i Less than t c And is greater than t m Node a i Is a common node;
when the reputation value R i Less than t m Node a i Is an untrusted node;
step7: the credible node is used as a candidate node of the current round and participates in the consensus process of the current round, and a common node and an incredible node cannot participate in the block output of the current round;
the calculation yields a direct reputation value D i The method comprises the following specific steps:
setting n times of consensus process of a system in a period of time, defining a k-th round, wherein k is less than n, and a time decay function t (k) of the credit degree of a calculation node in the current consensus round n of the transaction in the consensus process is as follows:
the larger the t (k) value is, the closer the k-th consensus distance is to the current consensus turn n, and the larger the influence of the node performance of the k-th turn on the node reputation value measurement is; the smaller t (k) is, the longer the distance between the k-th round of consensus and the current consensus round n is, the smaller the influence of the node performance of the k-th round on the node reputation value measurement is;
node a i Behavior factor of (1) i Expressed as:
wherein the content of the first and second substances,
is node a i The number of valid blocks, a, generated during the k-th round of consensus i The more the number of the effective blocks generated in the k-th round consensus process is, and the closer the round k is to the current round n, the
The larger the value, the larger the blockrate i The larger the value, the node a i The higher the activity of (A);
node a i Interest factor coinarrate of i Expressed as:
coinrate i is node a i Coinrate, the ratio of the amount of money held to the total number of virtual currencies in the system i The larger the node a is i The greater the equity proportion;
the direct reputation value being based on node a i Objective behavioral performance calculated reputation in blockchain system, using D i Represents:
D i ＝γblockrate i +ηcoinrate i
wherein, gamma and eta are respectively a blocking rate i 、coinrate i At D i Calculating the weight occupied in the calculation;
the reward and penalty factor RP i The method specifically comprises the following steps:
let s (i) be a i Number of consecutive successful block outs, node a i Obtaining a reward value according to the number of successful block outings, f (i) is a i Number of consecutive offences, node a i A penalty value is obtained based on the number of successive attacks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111478227.3A CN114143104B (en) | 2021-12-06 | 2021-12-06 | DPoS (distributed denial of service) consensus mechanism node reputation value measurement method based on dynamic trust model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111478227.3A CN114143104B (en) | 2021-12-06 | 2021-12-06 | DPoS (distributed denial of service) consensus mechanism node reputation value measurement method based on dynamic trust model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114143104A CN114143104A (en) | 2022-03-04 |
| CN114143104B true CN114143104B (en) | 2022-10-14 |
Family
ID=80384262
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111478227.3A Active CN114143104B (en) | 2021-12-06 | 2021-12-06 | DPoS (distributed denial of service) consensus mechanism node reputation value measurement method based on dynamic trust model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114143104B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114338053B (en) * | 2022-03-16 | 2022-05-13 | 成都信息工程大学 | Dynamic reputation-based block chain consensus method and system |
| CN114786152B (en) * | 2022-04-28 | 2023-02-03 | 北京交通大学 | Credible collaborative computing system for intelligent rail transit |
| CN116633629A (en) * | 2023-05-25 | 2023-08-22 | 重庆邮电大学空间通信研究院 | Trusted traceable collaboration method based on zero trust architecture |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105722149A (en) * | 2016-01-19 | 2016-06-29 | 南京邮电大学 | Topology construction excitation method based on reputation value |
| CN107579839A (en) * | 2017-06-30 | 2018-01-12 | 昆明理工大学 | A kind of online service measures of reputation method based on various dimensions evaluation information |
| CN110324362A (en) * | 2019-06-12 | 2019-10-11 | 南京优慧信安科技有限公司 | A kind of block chain User reliability evaluation method based on interbehavior |
| CN112039964A (en) * | 2020-08-24 | 2020-12-04 | 大连理工大学 | Node reputation consensus method based on block chain |
| CN113141600A (en) * | 2021-04-23 | 2021-07-20 | 国网河南省电力公司信息通信公司 | Block chain distributed data sharing method based on Internet of vehicles |
| CN113256149A (en) * | 2021-06-11 | 2021-08-13 | 武汉龙津科技有限公司 | Block chain node reputation adjusting method and device, electronic equipment and storage medium |
| CN113313378A (en) * | 2021-05-27 | 2021-08-27 | 北京航空航天大学 | Credibility model-based block chain consensus mechanism |
| CN113676541A (en) * | 2021-08-23 | 2021-11-19 | 南昌航空大学 | Improved PBFT consensus method |
-
2021
- 2021-12-06 CN CN202111478227.3A patent/CN114143104B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105722149A (en) * | 2016-01-19 | 2016-06-29 | 南京邮电大学 | Topology construction excitation method based on reputation value |
| CN107579839A (en) * | 2017-06-30 | 2018-01-12 | 昆明理工大学 | A kind of online service measures of reputation method based on various dimensions evaluation information |
| CN110324362A (en) * | 2019-06-12 | 2019-10-11 | 南京优慧信安科技有限公司 | A kind of block chain User reliability evaluation method based on interbehavior |
| CN112039964A (en) * | 2020-08-24 | 2020-12-04 | 大连理工大学 | Node reputation consensus method based on block chain |
| CN113141600A (en) * | 2021-04-23 | 2021-07-20 | 国网河南省电力公司信息通信公司 | Block chain distributed data sharing method based on Internet of vehicles |
| CN113313378A (en) * | 2021-05-27 | 2021-08-27 | 北京航空航天大学 | Credibility model-based block chain consensus mechanism |
| CN113256149A (en) * | 2021-06-11 | 2021-08-13 | 武汉龙津科技有限公司 | Block chain node reputation adjusting method and device, electronic equipment and storage medium |
| CN113676541A (en) * | 2021-08-23 | 2021-11-19 | 南昌航空大学 | Improved PBFT consensus method |
Non-Patent Citations (2)
| Title |
|---|
| AnImprovedDelegatedProofofStakeConsensusAlgorithm;Qian Hu et al.;《www.sciencedirect.com》;20210612;全文 * |
| 授权股份证明共识机制的改进方案;付瑶瑶等;《计算机工程与应用》;20201015(第19期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114143104A (en) | 2022-03-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114143104B (en) | DPoS (distributed denial of service) consensus mechanism node reputation value measurement method based on dynamic trust model | |
| Bouraga | A taxonomy of blockchain consensus protocols: A survey and classification framework | |
| CN109639837B (en) | Block chain DPoS (distributed denial of service) consensus method based on trust mechanism | |
| CN110580653B (en) | Block chain consensus mechanism based on transaction | |
| CN111090892A (en) | Block chain consensus method and device based on VRF and threshold signature | |
| CN109934710A (en) | The intelligent common recognition mechanism suitable for intellectual property alliance chain based on bilateral card | |
| CN113553377B (en) | Data sharing method and device based on block chain and federal learning | |
| CN111078787A (en) | Block chain consensus method based on random number mapping | |
| CN114817946A (en) | Credible execution environment-based federated learning gradient boosting decision tree training method | |
| CN114741721A (en) | Consensus device and consensus method based on contribution value certification for file block chain | |
| CN114048515B (en) | Medical big data sharing method based on federal learning and block chain | |
| CN108171578A (en) | A kind of address ranking system and its construction method based on block chain trade network | |
| CN113298668B (en) | Mobile crowd-sourcing aware user large-scale rapid recruitment method considering social network | |
| CN110930158A (en) | Block chain DPoS common recognition method based on reward and punishment mechanism | |
| Ali et al. | Incentive-driven federated learning and associated security challenges: A systematic review | |
| Perols et al. | Information market-based decision fusion | |
| Li et al. | Cross-consensus measurement of individual-level decentralization in blockchains | |
| Kagel et al. | Indicative bidding: An experimental analysis | |
| CN112700266B (en) | Data judging method and system based on blockchain predictor | |
| Qi et al. | A hybrid incentive mechanism for decentralized federated learning | |
| Sahin et al. | Optimal Incentive Mechanisms for Fair and Equitable Rewards in PoS Blockchains | |
| WANG et al. | Research on Credit Decision Issues of the Small and Medium-Sized Enterprises Based on TOPSIS and Hierarchical Cluster Analysis [C] | |
| CN113438283B (en) | Improved method of block chain DPOS (distributed data processing System) consensus mechanism based on HK (K-k) clustering | |
| CN113645564B (en) | Hybrid excitation method for crowd funding of indoor position information | |
| Chao et al. | Bidding model incorporating bid position for determining overhead-cum-markup rate |
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 |