基于实用拜占庭容错算法的区块链电子计票方案  

Blockchain electronic counting scheme based on practical Byzantine fault tolerance algorithm

作　　者：李靖 景旭[1] 杨会君[1] LI Jing;JING Xu;YANG Huijun(College of Information Engineering,Northwest A&F University,Yangling Shaanxi 712100,China)

机构地区：[1]西北农林科技大学信息工程学院,陕西杨凌712100

出　　处：《计算机应用》2020年第4期954-960,共7页journal of Computer Applications

基　　金：陕西省重点研发计划项目(2019ZDLNY07 02 01,2018NY 127)。

摘　　要：针对区块链电子投票中第三方计票机构不满足区块链去中心化、去信任特性以及缺乏可信度的问题,提出一种基于实用拜占庭容错(PBFT)算法的区块链电子计票方案。首先,在分布式环境中构建无中心计票模式,以节点的信任度确定计票节点;其次,基于PBFT实现待验选票的共识;再次,将PBFT中诚实节点的最低数量作为门限签名的阈值,只有达到阈值的计票结果才能形成门限签名;最后,将满足可信状态的结果记录在区块链账本上。通过测试分析表明,只有当诚实验票节点超过2/3时,才满足PBFT,得到可信的计票结果。For the problems that third party counting institution does not meet the decentralization and de-trusting characteristics of blockchain and is lack of credibility,a blockchain electronic counting scheme based on the Practical Byzantine Fault Tolerance(PBFT)algorithm was proposed.Firstly,the centerless counting model was built in the distributed environment,and the counting node was determined by the credibility level of the node.Secondly,the consensus of pending ballots was formed based on PBFT.Thirdly,the minimum number of honest nodes in PBFT was set as the threshold for threshold signature,and the threshold signature was only formed by results satisfying the threshold.Finally,the results satisfying the trusted state were recorded in the blockchain account book.Test and analysis results show that only when the honest nodes exceed two-thirds,the PBFT is satisfied,and the obtained counting result is credible.

关 键 词：电子计票 区块链 实用拜占庭容错算法 门限签名 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]