nach oben

Erschienen in:

2021 | OriginalPaper | Buchkapitel

A Group-Based Optimized Practical Byzantine Fault Tolerance Consensus Algorithm

verfasst von : Zhenshan Bao, Yue Liu, Wenbo Zhang

Erschienen in: Blockchain Technology and Application

Verlag: Springer Singapore

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Focusing on the problems of high energy consumption, low efficiency and poor scalability of Practical Byzantine Fault Tolerance (PBFT) consensus algorithm existed in consortium blockchain, this paper presents a group-based optimized Practical Byzantine Fault Tolerance (GPBFT) consensus algorithm, which is a multi-stage algorithm. First, we propose a comprehensive reputation evaluation model to judge the credibility of a node from two aspects of transaction behavior and consensus performance. Then, the nodes with higher reputation value will be selected to enter the consensus group, and the other nodes with block packaging ability are selected as candidate nodes. Finally, we optimize the PBFT based on the application scenario of blockchain, change the three stages to two, which reduces the number of messages delivered by 50% at least. The experimental results demonstrate that GPBFT gains better performance. While ensuring the security and reliability of the system, it shows good scalability, thus it can be used in large-scale consortium blockchain system.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel A Case Study for Blockchain in OTC: “BATN”: A Prototype for Bid and Ask Trading Network

Nächstes Kapitel Storage Optimization for Certificates in Blockchain Based PKI System

Nakamoto, S.: Bitcoin: A Peer-to-Peer Electronic Cash System. Manubot (2019)

Dinh, T.T.A., Liu, R., Zhang, M., et al.: Untangling blockchain: a data processing view of blockchain systems. IEEE Trans. Knowl. Data Eng. 30(7), 1366–1385 (2018)CrossRef

Khan, M.A., Salah, K.: IoT security: review, blockchain solutions, and open challenges. Future Gener. Comput. Syst. 82, 395–411 (2018)CrossRef

Yu, G., Zha, X., Wang, X., et al.: A unified analytical model for proof-of-x schemes. Comput. Secur. 96, 101934 (2020)CrossRef

King, S., Nadal, S.: PPCoin:peer-to-peer crypto-currency with proof-of-stake[J/OL]. (2017)https://peercoin.net/assets/paper/peercoin-paper.pdf

Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. In: Concurrency: The Works of Leslie Lamport, pp. 203–226 (2019)

Castro, M., Liskov, B.: Practical byzantine fault tolerance. OSDI. 1999(99), 173–186 (1999)

Kotla, R., Alvisi, L., Dahlin, M., et al.: Zyzzyva: speculative byzantine fault tolerance. ACM Trans. Comput. Syst. (TOCS) 27(4), 1–39 (2010)CrossRef

Kwon, J.: Tendermint: consensus without mining. Draft v. 0.6, fall, 1(11) (2014)

10.

Zheng, Z., Xie, S., Dai, H., et al.: An overview of blockchain technology: architecture, consensus, and future trends. In: 2017 IEEE International Congress on Big Data (BigData congress), pp. 557–564. IEEE (2017)

11.

Lamport, L.: Paxos made simple. ACM SIGACT News 32(4), 18–25 (2001)

12.

Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: 2014 USENIX Annual Technical Conference ({USENIX}{ATC} 14), 305–319 (2014)

13.

Cowling, J., Myers, D., Liskov, B., et al.: HQ replication: a hybrid quorum protocol for Byzantine fault tolerance. In: Proceedings of the 7th Symposium on Operating Systems Design and Implementation, 177–190 (2006)

14.

Hendricks, J., Sinnamohideen, S., Ganger, G.R., Reiter, M.K.: Zzyzx: scalable fault tolerance through Byzantine locking. In: 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN). IEEE, pp. 363–372 (2010)

15.

Veronese, G.S., Correia, M., Bessani, A.N., Lung, L.C.: Spin one’s wheels? Byzantine fault tolerance with a spinning primary. In: 28th IEEE International Symposium on Reliable Distributed Systems, pp. 135–144. IEEE (2009 )

16.

Castro, M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst.(TOCS) 20(4), 398–461 (2002)CrossRef

17.

Chun, B.G., Maniatis, P., Shenker, S., Kubiatowicz, J.: Attested append-only memory: making adversaries stick to their word. ACM SIGOPS Oper. Syst. Rev. 41(6), 189–204 (2007)CrossRef

18.

Veronese, G.S., Correia, M., Bessani, A.N., Lung, L.C., Verissimo, P.: Efficient byzantine fault-tolerance. IEEE Trans. Comput. 62(1), 16–30 (2011)MathSciNetCrossRef

19.

Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles, pp. 51–68 (2017)

20.

Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 31–42 (2016)

21.

Heo, H.S., Seo, D.Y.: A study on scalable PBFT consensus algorithm based on blockchain cluster. J. Inst. Internet, Broadcast. Commun. 20(2), 45–53 (2020)

22.

Jalalzai, M.M., Busch, C., Richard, G.G.: Proteus: a scalable BFT consensus protocol for blockchains. In; 2019 IEEE International Conference on Blockchain (Blockchain), pp. 308–313. IEEE (2019)

23.

Meng, Y., Cao, Z., Qu, D.A.: Committee-based byzantine consensus protocol for blockchain. In: IEEE 9th International Conference on Software Engineering and Service Science (ICSESS), pp. 1–6. IEEE (2018)

24.

Lei, K., Zhang, Q., Xu, L., et al.: Reputation-based byzantine fault-tolerance for consortium blockchain. 2018 In: IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS), pp. 604–611. IEEE (2018)

25.

Gueta, G.G., Abraham, I., Grossman, S., et al.: SBFT: a scalable decentralized trust infrastructure for blockchains. arXiv preprint arXiv:1804.01626 (2018)

26.

Wang, Y., Cai, S., Lin, C., Chen, Z., Wang, T., Gao, Z., Zhou, C.: Study of blockchains’s consensus mechanism based on credit. IEEE Access 7, 10224–10231 (2019)CrossRef

27.

Kiayias, A., Russell, A.: Ouroboros-BFT: a simple byzantine fault tolerant consensus protocol. IACR Cryptol. ePrint Arch. 2018, 1049 (2018)

Titel: A Group-Based Optimized Practical Byzantine Fault Tolerance Consensus Algorithm
verfasst von: Zhenshan Bao
Yue Liu
Wenbo Zhang
Verlag: Springer Singapore
Buch: Blockchain Technology and Application
Print ISBN: 978-981-336-477-6

Electronic ISBN: 978-981-336-478-3

Copyright-Jahr: 2021
DOI: https://doi.org/10.1007/978-981-33-6478-3_7

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner