Journal of Computer Applications ›› 2020, Vol. 40 ›› Issue (4): 954-960.DOI: 10.11772/j.issn.1001-9081.2019091559

• Blockchain technology • Previous Articles     Next Articles

Blockchain electronic counting scheme based on practical Byzantine fault tolerance algorithm

LI Jing, JING Xu, YANG Huijun   

  1. College of Information Engineering, Northwest A&F University, Yangling Shaanxi 712100, China
  • Received:2019-09-11 Revised:2019-10-28 Online:2020-04-10 Published:2019-11-05
  • Supported by:
    This work is partially supported by the Key Research and Development Program of Shaanxi(2019ZDLNY07-02-01,2018NY-127).

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

李靖, 景旭, 杨会君   

  1. 西北农林科技大学 信息工程学院, 陕西 杨凌 712100
  • 通讯作者: 景旭
  • 作者简介:李靖(1994-),男,山西大同人,硕士研究生,主要研究方向:区块链安全;景旭(1971-),男,陕西礼泉人,副教授,博士,主要研究方向:区块链安全、隐私保护;杨会君(1974-),女,山西万荣人,副教授,博士,主要研究方向:电子商务物流、农产品质量溯源。
  • 基金资助:
    陕西省重点研发计划项目(2019ZDLNY07-02-01,2018NY-127)。

Abstract: 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.

Key words: electronic counting, blockchain, Practical Byzantine Fault Tolerance (PBFT), threshold signature

摘要: 针对区块链电子投票中第三方计票机构不满足区块链去中心化、去信任特性以及缺乏可信度的问题,提出一种基于实用拜占庭容错(PBFT)算法的区块链电子计票方案。首先,在分布式环境中构建无中心计票模式,以节点的信任度确定计票节点;其次,基于PBFT实现待验选票的共识;再次,将PBFT中诚实节点的最低数量作为门限签名的阈值,只有达到阈值的计票结果才能形成门限签名;最后,将满足可信状态的结果记录在区块链账本上。通过测试分析表明,只有当诚实验票节点超过2/3时,才满足PBFT,得到可信的计票结果。

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

CLC Number: