Fair Reward Distribution in Federated Byzantine Agreement Systems

被引:0
|
作者
Ndolo, Charmaine [1 ]
Florian, Martin [2 ]
Tschorsch, Florian [2 ]
机构
[1] Humboldt Univ, Berlin, Germany
[2] Weizenbaum Inst, Berlin, Germany
关键词
D O I
10.1109/BRAINS59668.2023.10316929
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Federated Byzantine Agreement Systems (FBASs) offer a solution to consensus in permissionless systems by adapting the well-studied Byzantine agreement model to permissionless consensus. Unlike its counterparts in the context of permissionless consensus, the FBAS system model does not offer validating nodes protocol-level incentives although they are entrusted with safeguarding and ensuring the functionality of the system. Multiple studies have reported on the small number of active validators in these systems leading to some concerns about their resilience. To this end, this paper studies how rewards can be distributed in FBASs and presents a fair reward distribution function for FBASs. The challenge is that, on the one hand, consensus in an FBAS is found jointly between all nodes and, on the other hand, nodes do not all contribute equally to this process. We draw on game-theoretic methods to quantify these contributions bearing the overall health of the FBAS in mind and present a fair reward distribution function which we evaluate based on a set of identified properties.
引用
收藏
页数:8
相关论文
共 50 条
  • [31] Efficient Task Scheduling and Fair Load Distribution Among Federated Clouds
    Rajeshwari, B. S.
    Dakshayini, M.
    Guruprasad, H. S.
    JOURNAL OF ICT RESEARCH AND APPLICATIONS, 2021, 15 (03) : 216 - 237
  • [32] Fair Byzantine Agreements for Blockchains
    Kuo, Po-Chun
    Chung, Hao
    Chao, Tzu-Wei
    Cheng, Chen-Mou
    IEEE ACCESS, 2020, 8 : 70746 - 70761
  • [33] Mutual Information Agreement in Multicomputer Systems with the Detection and Identification of Byzantine Faults
    V. Yu. Grishin
    A. V. Lobanov
    V. G. Sirenko
    Automation and Remote Control, 2003, 64 (4) : 626 - 634
  • [34] Mutual information agreement in multicomputer systems with the detection and identification of Byzantine faults
    Yu, V
    Lobanov, GAV
    Sirenko, VG
    AUTOMATION AND REMOTE CONTROL, 2003, 64 (04) : 626 - 634
  • [35] Byzantine Agreement with Interval Validity
    Melnyk, Darya
    Wattenhofer, Roger
    2018 IEEE 37TH INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS), 2018, : 251 - 260
  • [36] On the composition of authenticated Byzantine Agreement
    Lindell, Yehuda
    Lysyanskaya, Anna
    Rabin, Tal
    JOURNAL OF THE ACM, 2006, 53 (06) : 881 - 917
  • [37] Accurate Byzantine Agreement with Feedback
    Garg, Vijay K.
    Bridgman, John
    Balasubramanian, Bharath
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2011, 7109 : 465 - 480
  • [38] A new approach for Byzantine Agreement
    Wang, SC
    Kao, SH
    15TH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING, PROCEEDINGS, 2001, : 518 - 524
  • [39] Byzantine Agreement with a Rational Adversary
    Groce, Adam
    Katz, Jonathan
    Thiruvengadam, Aishwarya
    Zikas, Vassilis
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012, PT II, 2012, 7392 : 561 - 572
  • [40] AUTHENTICATED ALGORITHMS FOR BYZANTINE AGREEMENT
    DOLEV, D
    STRONG, HR
    SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 656 - 666