Back to Search
Start Over
DT-DPoS: A Delegated Proof of Stake Consensus Algorithm with Dynamic Trust.
- Source :
- Procedia Computer Science; 2021, Vol. 187, p371-376, 6p
- Publication Year :
- 2021
-
Abstract
- Blockchain is a distributed accounting system. One of its key issues is how to ensure agreement between distrustful nodes. As an important component of blockchain, consensus algorithm can solve the consistency problem, and its efficiency directly determines the performance of blockchain. Compared with Proof of Work (PoW) and Proof of Stake (PoS), the existing Delegated Proof of Stake (DPoS) consensus algorithm improves the efficiency of consensus, but it will face some threats, such as DoS attack and collusion attack, because the mechanism that each witness node takes turns to generate blocks. Therefore, we propose a delegated proof of stake consensus algorithm with dynamic trust, that is, DT-DPoS. We improve an Eigen Trust-based trust model and construct an evaluation criterion based on the combination of stake voting and trust value, which improves the reliability of witness nodes and reduces the risk of collusion attacks. At the same time, we use a ring signature scheme, which ensures the privacy and anonymity of witness nodes. Finally, the theoretical analysis shows the effectiveness and scalability of our algorithm. [ABSTRACT FROM AUTHOR]
- Subjects :
- PROBLEM solving
EVIDENCE
DENIAL of service attacks
ALGORITHMS
BLOCKCHAINS
Subjects
Details
- Language :
- English
- ISSN :
- 18770509
- Volume :
- 187
- Database :
- Supplemental Index
- Journal :
- Procedia Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 150875705
- Full Text :
- https://doi.org/10.1016/j.procs.2021.04.113