The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Delegated Proof of Stake With Downgrade: A Secure and Efficient Blockchain Consensus Algorithm With Downgrade Mechanism
Open accessAbstract
Blockchain technology has a wide range of applications in the fields of finance, credit reporting and intellectual property, etc. As the core of blockchain, consensus algorithm affects the security and performance of blockchain system directly. In the past 10 years, there have been about 30 consensus algorithms such as Proof of Work (PoW), Proof of Stake (PoS), Delegated Proof of Stake (DPoS), Ripple Protocol Consensus Algorithm (RPCA) and AlgoRand. But their security, stability and operating efficiency still lag far behind our actual needs. This paper introduces the computing power competition of PoW into DPoS to design an improved consensus algorithm named Delegated Proof of Stake with Downgrade (DDPoS). Through the further modification, the impact of both computing resources and stakes on generating blocks is reduced to achieve higher efficiency, fairness, and decentralization in consensus process. Then a downgrade mechanism is proposed to quickly replace the malicious nodes to improve the security. The simulation experiments in blockchain system show that the proposed consensus algorithm is significantly more efficient than PoW and PoS, but slightly lower than DPoS. However, its degree of centralization remains far below that of DPoS. And through the downgrade mechanism, the proposed consensus algorithm can detect and downgrade the malicious nodes timely to ensure the security and good operation of system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Blockchains and smart contracts for the internet of things
Christidis, K., & Devetsikiotis, M. (2016) · IEEE Access · doi:10.1109/access.2016.2566339 · Cited by 4,552
An Overview of Blockchain Technology: Architecture, Consensus, and Future Trends
Zheng, Z., Xie, S., Dai, H., Chen, X., & Wang, H. (2017) · 2017 IEEE International Congress on Big Data (BigData Congress) · doi:10.1109/bigdatacongress.2017.85 · Cited by 4,515
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Decentralizing Privacy: Using Blockchain to Protect Personal Data
Zyskind, G., Nathan, O., & Pentland, A. '. (2015) · 2015 IEEE Security and Privacy Workshops · doi:10.1109/spw.2015.27 · Cited by 2,617
IoT security: Review, blockchain solutions, and open challenges
Khan, M. A., & Salah, K. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2017.11.022 · Cited by 2,488
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227
In search of an understandable consensus algorithm
Ongaro, D., & Ousterhout, J. K. (2014) · Cited by 1,909
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499
Cited by
Federated learning meets blockchain in edge computing: Opportunities and challenges
Nguyen, D. C., Ding, M., Pham, Q.-V., Pathirana, P. N., Le, L. B., Seneviratne, A., Li, J., Niyato, D., & Poor, H. V. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3072611 · Cited by 661
A Comprehensive Review of Blockchain Consensus Mechanisms
Lashkari, B., & Musilek, P. (2021) · IEEE Access · doi:10.1109/access.2021.3065880 · Cited by 499
A survey on the adoption of blockchain in IoT: challenges and solutions
Uddin, M. A., Stranieri, A., Gondal, I., & Balasubramanian, V. (2021) · Blockchain: Research and Applications · doi:10.1016/j.bcra.2021.100006 · Cited by 365
Securing Critical Infrastructure with Blockchain Technology: An Approach to Cyber-Resilience
Govea, J., Gaibor-Naranjo, W., & Villegas-Ch, W. (2024) · Computers · doi:10.3390/computers13050122 · Cited by 33
Metadata
- Authors
- Yang, F., Zhou, W., Wu, Q., Long, R., Xiong, N. N., & Zhou, M.
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 118541-118555
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2967604605
- Cited by
- 341
- References
- 31
- FWCI
- 46.55
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Delegated Proof of Stake With Downgrade: A Secure and Efficient Blockchain Consensus Algorithm With Downgrade Mechanism. https://app.cochat.ai/papers/10.1109/access.2019.2935149
- The paper
- Yang, F., Zhou, W., Wu, Q., Long, R., Xiong, N. N., & Zhou, M. (2019). Delegated Proof of Stake With Downgrade: A Secure and Efficient Blockchain Consensus Algorithm With Downgrade Mechanism. IEEE Access. https://doi.org/10.1109/access.2019.2935149
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.