An Uncertainty-and Collusion-Proof Voting Consensus Mechanism in Blockchain

被引:2
作者
Wang, Shengling [1 ]
Qu, Xidi [1 ]
Hu, Qin [2 ]
Wang, Xia [3 ]
Cheng, Xiuzhen [4 ]
机构
[1] Beijing Normal Univ, Sch Artificial Intelligence, Beijing 100875, Peoples R China
[2] Purdue Univ Indianapolis, Indiana Univ, Dept Comp & Informat Sci, Indianapolis, IN 46202 USA
[3] Beijing Univ Technol, Fac Sci, Sch Stat & Data Sci, Beijing 100124, Peoples R China
[4] Shandong Univ, Sch Comp Sci & Technol, Qingdao 266237, Peoples R China
基金
中国国家自然科学基金;
关键词
Voting; Consensus algorithm; Consensus protocol; Stakeholders; Valves; Behavioral sciences; Uncertainty; Blockchain; consensus mechanism; large deviation theory; SECURE;
D O I
10.1109/TNET.2023.3249206
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Though voting-based consensus algorithms in blockchain outperform proof-based ones in energy-and transaction-efficiency, they are prone to incur wrong elections and bribery elections. The former originates from the uncertainties of candidates' capability and availability, and the latter comes from the egoism of voters and candidates. Hence, in this paper, we propose an uncertainty-and collusion-proof voting consensus mechanism, including the selection pressure-based voting algorithm and the trustworthiness evaluation algorithm. The first algorithm can decrease the side effects of candidates' uncertainties, lowering wrong elections while trading off the balance between efficiency and fairness in voting miners. The second algorithm adopts an incentive-compatible scoring rule to evaluate the trustworthiness of voting, motivating voters to report true beliefs on candidates by making egoism consistent with altruism so as to avoid bribery elections. A salient feature of our work is theoretically analyzing the proposed voting consensus mechanism by the large deviation theory. Our analysis provides not only the voting failure rate of a candidate but also its decay speed. The voting failure rate measures the incompetence of any candidate from a personal perspective by voting, based on which the concepts of the effective selection valve and the effective expectation of merit are introduced to help the system designer determine the optimal voting standard and guide a candidate to behave in an optimal way for lowering the voting failure rate.
引用
收藏
页码:2376 / 2388
页数:13
相关论文
共 41 条
  • [1] Abraham I., 2017, arXiv
  • [2] [Anonymous], 2014, Draft
  • [3] Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability
    Badertscher, Christian
    Gazi, Peter
    Kiayias, Aggelos
    Russell, Alexander
    Zikas, Vassilis
    [J]. PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, : 913 - 930
  • [4] Bentov Iddo, 2014, ACM SIGMETRICS Performance Evaluation Review, V42, P34
  • [5] Burstcoin, 2014, BURSTCOIN
  • [6] Buterin V., 2018, GOVERNANCE 2
  • [7] Practical byzantine fault tolerance and proactive recovery
    Castro, M
    Liskov, B
    [J]. ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04): : 398 - 461
  • [8] Chaumont G., 2019, DPOPS DELEGATED PROO, P1
  • [9] Algorand: A secure and efficient distributed ledger
    Chen, Jing
    Micali, Silvio
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 777 : 155 - 183
  • [10] Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain
    David, Bernardo
    Gazi, Peter
    Kiayias, Aggelos
    Russell, Alexander
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT II, 2018, 10821 : 66 - 98