A characterization of eventual Byzantine agreement

被引:0
|
作者
Halpern, JY [1 ]
Moses, Y
Waarts, O
机构
[1] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
[2] IBM Almaden Res Ctr, San Jose, CA 95114 USA
[3] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel
[4] Weizmann Inst Sci, IL-76100 Rehovot, Israel
[5] Stanford Univ, Stanford, CA 94035 USA
关键词
fault-tolerance; eventual Byzantine agreement; common knowledge; continual common knowledge; optimal protocol;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We investigate eventual Byzantine agreement (EBA) in the crash and omission failure modes. The emphasis is on characterizing optimal EBA protocols in terms of the states of knowledge required by the processors in order to attain EBA. It is well known that common knowledge among the nonfaulty processors is a necessary and sufficient condition for attaining simultaneous Byzantine agreement (SBA). We define a new variant that we call continual common knowledge and use it to provide necessary and sufficient conditions for attaining EBA. Using this characterization, we provide a technique that allows us to start with any EBA protocol and convert it to an optimal EBA protocol using a two-step process.
引用
收藏
页码:838 / 865
页数:28
相关论文
共 50 条
  • [21] Polygraph: Accountable Byzantine Agreement
    Civit, Pierre
    Gilbert, Seth
    Gramoli, Vincent
    2021 IEEE 41ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2021), 2021, : 403 - 413
  • [22] P systems and the Byzantine agreement
    Dinneen, Michael J.
    Kim, Yun-Bum
    Nicolescu, Radu
    JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2010, 79 (06): : 334 - 349
  • [23] ASYNCHRONOUS BYZANTINE AGREEMENT PROTOCOLS
    BRACHA, G
    INFORMATION AND COMPUTATION, 1987, 75 (02) : 130 - 143
  • [24] EARLY STOPPING IN BYZANTINE AGREEMENT
    DOLEV, D
    REISCHUK, R
    STRONG, HR
    JOURNAL OF THE ACM, 1990, 37 (04) : 720 - 741
  • [25] Verifying randomized Byzantine agreement
    Kwiatkowska, M
    Norman, G
    FORMAL TECHNIQUE FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2002, PROCEEDINGS, 2002, 2529 : 194 - 209
  • [26] Self-stabilizing autonomic recoverer for eventual Byzantine software
    Brukman, O
    Dolev, S
    Kolodner, EK
    IEEE INTERNATIONAL CONFERENCE ON SOFTWARE - SCIENCE, TECHNOLOGY & ENGINEERING, PROCEEDINGS, 2003, : 20 - 29
  • [27] A self-stabilizing autonomic recoverer for eventual Byzantine software
    Brukman, Olga
    Dolev, Shlomi
    Kolodner, Elliot K.
    JOURNAL OF SYSTEMS AND SOFTWARE, 2008, 81 (12) : 2315 - 2327
  • [28] A characterization of eventual periodicity
    Kamae, Teturo
    Kim, Dong Han
    THEORETICAL COMPUTER SCIENCE, 2015, 581 : 1 - 8
  • [29] Multidimensional Byzantine agreement in a synchronous setting
    Flamini, Andrea
    Longo, Riccardo
    Meneghetti, Alessio
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2024, 35 (02) : 233 - 251
  • [30] Byzantine Agreement in Expected Polynomial Time
    King, Valerie
    Saia, Jared
    JOURNAL OF THE ACM, 2016, 63 (02)