基于信誉投票的PBFT改进方案

doi:10.3969/j.issn.0255-8297.2021.01.007

应用科学学报 ›› 2021, Vol. 39 ›› Issue (1): 79-89.doi: 10.3969/j.issn.0255-8297.2021.01.007

• 区块链 • 上一篇

基于信誉投票的PBFT改进方案

涂园超^1,2, 陈玉玲^1,2, 李涛^1,2, 任晓军³, 卿欣艺^1,2

1. 贵州大学计算机科学与技术学院, 贵州贵阳 550025;
2. 贵州大学公共大数据国家重点实验室, 贵州贵阳 550025;
3. 潍坊科技学院农蔬区块链实验室, 山东寿光 262700

收稿日期:2020-11-12 发布日期:2021-02-04
通信作者: 陈玉玲,副教授,研究方向为大数据安全与隐私保护、区块链等。E-mail:ylchen3@gzu.edu.cn E-mail:ylchen3@gzu.edu.cn
基金资助:
国家自然科学基金（No.61962009）；贵州省科技重大专项计划基金（No.20183001）；贵州省公共大数据重点实验室开放课题基金（No.2018BDKFJJ003，No.2019BDKFJJ011）资助

Improved PBFT Scheme Based on Reputation Voting

TU Yuanchao^1,2, CHEN Yuling^1,2, LI Tao^1,2, REN Xiaojun³, QING Xinyi^1,2

1. College of Computer Science and Technology, Guizhou University, Guiyang 550025, Guizhou, China;
2. State Key Laboratory of Public Big Data, Guizhou University, Guiyang 550025, Guizhou, China;
3. Blockchain Laboratory of Agricultural Vegetables, Weifang University of Science and Technology, Shouguang 262700, Shandong, China

Received:2020-11-12 Published:2021-02-04

摘要/Abstract

摘要： 区块链作为一种去中心化、防篡改的分布式账本，其性能从根本上受共识机制效率的影响。实用拜占庭容错算法以视图切换随机选取主节点的方式会导致安全问题，且在节点较多时共识效率变低。针对这两个问题，提出了基于信誉投票的PBFT改进方案。根据节点划分机制评估节点的可靠性，动态地选取高信誉值节点来参与共识，降低恶意节点成为共识节点的概率，增加系统的安全性；根据节点状态转移机制转换节点的角色，维持系统的正确运行，提高系统的稳定性。将所提方案与PBFT方案进行对比实验的结果表明：在系统长期运行中，所提方案能减少共识过程中的拜占庭节点和通信开销，提高容错率和吞吐量。

关键词: 区块链, 实用拜占庭容错, 共识机制, 信誉积分, 投票选举

Abstract: As a decentralized, tamper-proof distributed ledger, the performance of blockchain is fundamentally affected by the efficiency of consensus mechanisms. Practical Byzantine fault tolerance (PBFT) algorithm randomly selects master nodes through view-switching, leading to problems of security vulnerabilities and low consensus efficiency in the case of large number of nodes. In response to the two problems, a PBFT improvement scheme based on reputation voting is proposed. The reliability of nodes is evaluated according to node division mechanism, where high reputation nodes are dynamically selected to participate in the consensus, and a malicious node is assigned with lower probability of becoming a consensus node, accordingly increasing the security of the system. By switching the role of nodes according to node state transfer mechanism, the scheme can maintain the correct operation of the system and improve the stability of the system. Experiments on the proposed and the traditional PBFT schemes show that the proposed one can reduce Byzantine nodes and communication overhead in long-term consensus processes, and improve the fault tolerance rate and the data throughput of transaction.

Key words: blockchain, practical Byzantine fault tolerance (PBFT), consensus mechanism, credit score, vote by ballot

中图分类号:

TP309.2

涂园超, 陈玉玲, 李涛, 任晓军, 卿欣艺. 基于信誉投票的PBFT改进方案[J]. 应用科学学报, 2021, 39(1): 79-89.

TU Yuanchao, CHEN Yuling, LI Tao, REN Xiaojun, QING Xinyi. Improved PBFT Scheme Based on Reputation Voting[J]. Journal of Applied Sciences, 2021, 39(1): 79-89.

参考文献

[1] Nakamoto S. Bitcoin:a peer-to-peer electronic cash system[EB/OL].[2020-11-08]. https://bitcoin.org/bitcoin.pdf.
[2] 袁勇, 王飞跃. 区块链技术发展现状与展望[J]. 自动化学报, 2016, 42(4):481-494. Yuan Y, Wang F Y. Development status and prospects of block chain technology[J]. Acta Automatica Sinica, 2016, 42(4):481-494. (in Chinese)
[3] Zheng Z, Xie S, Dai H, et al. An overview of blockchain technology:architecture, consensus, and future trends[C]//International Congress on Big Data, 2017:557-564.
[4] 刘懿中, 刘建伟, 张宗洋, 等. 区块链共识机制研究综述[J]. 密码学报, 2019, 6(4):395-432. Liu Y Z, Liu J W, Zhang Z Y, et al. Overview on blockchain consensus mechanisms[J]. Journal of Cryptologic Research, 2019, 6(4):395-432. (in Chinese)
[5] Jakobsson M, Juels A. Proofs of work and bread pudding protocols[C]//Communications and Multimedia Security, 1999:258-272.
[6] Castro M, Liskov B. Practical Byzantine fault tolerance[C]//Proceedings of the Third Symposium on Operating Systems Design and Implementation, 1999:173-186.
[7] Larimer D. Delegated proof-of-stake consensus[EB/OL].[2020-11-10]. https://bitshares.org/technology/delegated-proof-of-stake-consensus.
[8] Ongaro D, Ousterhout J. In search of an understandable consensus algorithm[C]//Usenix Annual Technical Conference, 2014:305-320.
[9] 张伯阳, 张晓, 李阿妮, 等. 云存储系统可扩展性评测研究[J]. 计算机应用研究, 2017, 34(7):19571961. Zhang B Y, Zhang X, Li A N, et al. Research on scalability evaluation in cloud storage system[J]. Application Research of Computers, 2017, 34(7):1957-1961. (in Chinese)
[10] Bazzi R A. Synchronous Byzantine quorum systems[J]. Distributed Computing, 2000, 13(1):45-52.
[11] Miller A, Xia Y, Croman K, et al. The honey badger of BFT protocols[C]//ACM SIGSAC on Computer and Communications Security, 2016:31-42.
[12] Liu S, Viotti P, Cachin C, et al. XFT:practical fault tolerance beyond crashes[M]//Operating Systems Design and Implementation, 2016:485-500.
[13] Abraham I, Malkhi D, Spiegelman A, et al. Validated asynchronous Byzantine agreement with optimal resilience and asymptotically optimal time and word communication[EB/OL].[2020-11-10]. http://arxiv.org/abs/1811.01332.pdf.
[14] Zheng H, Guo W, Xiong N, et al. A kernel-based compressive sensing approach for mobile data gathering in wireless sensor network systems[J]. Systems Man and Cybernetics, 2018, 48(12):2315-2327.
[15] Liu Y, Ma M, Liu X, et al. Design and analysis of probing route to defense sink-hole attacks for Internet of things security[J]. IEEE Transactions on Network Science and Engineering, 2020, 7(1):356-372.
[16] Brewer E A. Towards robust distributed systems (abstract)[C]//Proceedings of the nineteenth annual ACM symposium on Principles of Distributed Computing. New York:Association for Computing Machinery, 2000.
[17] Gilbert S, Lynch N. Brewer's conjecture and the feasibility of consistent, available, partitiontolerant Web services[J]. ACM SIGACT News, 2002, 33(2):51-59.
[18] Reiter M K. A secure group membership protocol[C]//Proceedings of the IEEE Symposium on Research in Security and Privacy, 1994:176-189.
[19] 甘俊, 李强, 陈子豪, 等. 区块链实用拜占庭容错共识算法的改进[J]. 计算机应用, 2019, 39(7):2148-2155. Gan J, Li Q, Chen Z H, et al. Improvement of blockchain practical Byzantine fault tolerance consensus algorithm[J]. Journal of Computer Applications, 2019, 39(7):2148-2155. (in Chinese)
[20] 刘肖飞. 基于动态授权的拜占庭容错共识算法的区块链性能改进研究[D]. 杭州:浙江大学, 2017.

基于信誉投票的PBFT改进方案

Improved PBFT Scheme Based on Reputation Voting

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

[1]	赵颖琪, 朱雪阳, 李广元, 高雅, 包玉龙. 带时间约束的智能合约验证[J]. 应用科学学报, 2021, 39(1): 1-16.
[2]	范俊松, 陈建海, 沈睿, 刘振广, 何钦铭, 黄步添. 基于SGX的区块链交易隐私安全保护方法[J]. 应用科学学报, 2021, 39(1): 17-28.
[3]	赵晓琦, 李勇. 可审计且可追踪的区块链匿名交易方案[J]. 应用科学学报, 2021, 39(1): 29-41.
[4]	张学旺, 冯家琦, 殷梓杰, 林金朝. 基于区块链的数据溯源可信查询方法[J]. 应用科学学报, 2021, 39(1): 42-54.
[5]	王思源, 邹仕洪. 多域物联网中基于区块链和权能的访问控制机制[J]. 应用科学学报, 2021, 39(1): 55-69.
[6]	周琦, 沈韬, 朱艳, 刘英莉. 基于区块链的综合能源管理系统身份验证方法[J]. 应用科学学报, 2021, 39(1): 70-78.
[7]	方俊杰, 雷凯. 面向边缘人工智能计算的区块链技术综述[J]. 应用科学学报, 2020, 38(1): 1-21.
[8]	何正源, 段田田, 张颖, 张瀚文, 孙毅. 物联网中区块链技术的应用与挑战[J]. 应用科学学报, 2020, 38(1): 22-33.
[9]	包振山, 王凯旋, 张文博. 基于树形拓扑网络的实用拜占庭容错共识算法[J]. 应用科学学报, 2020, 38(1): 34-50.
[10]	李忠诚, 黄建华, 唐瑞琮, 胡庆春, 夏旭. 一种基于权益代表的可扩展共识协议[J]. 应用科学学报, 2020, 38(1): 51-64.
[11]	邹秀清, 罗得寸, 林平, 沈世平, 谢振平, 王玉珏, 丁勇. 基于区块链的河长制水质信息存证系统[J]. 应用科学学报, 2020, 38(1): 65-80.
[12]	苑陈娟, 孙国梓, 李华康, 王纪涛. 牌类游戏可信存证链系统[J]. 应用科学学报, 2020, 38(1): 81-92.
[13]	江云超, 何小卫, 崔一举. 区块链节点存储优化方案[J]. 应用科学学报, 2020, 38(1): 119-126.
[14]	潘恒, 潘磊, 姚中原, 斯雪明. 一种病人可控的电子病历安全访问方案[J]. 应用科学学报, 2020, 38(1): 127-138.
[15]	佘维, 陈建森, 顾志豪, 田钊, 徐力, 刘炜. 基于区块链的物联网节点位置隐私保护模型[J]. 应用科学学报, 2020, 38(1): 139-151.