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 条
  • [31] A new solution for the Byzantine agreement problem
    Hsieh, Hui-Ching
    Chiang, Mao-Lun
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2011, 71 (10) : 1261 - 1277
  • [32] GRACEFULLY DEGRADABLE ALGORITHM FOR BYZANTINE AGREEMENT
    DIGIANDOMENICO, F
    GUIDOTTI, ML
    GRANDONI, F
    SIMONCINI, L
    COMPUTING SYSTEMS, 1988, 3 (01): : 32 - 40
  • [33] Asynchronous Byzantine Agreement with optimal resilience
    Arpita Patra
    Ashish Choudhury
    C. Pandu Rangan
    Distributed Computing, 2014, 27 : 111 - 146
  • [34] Byzantine Agreement in Polynomial Expected Time
    King, Valerie
    Saia, Jared
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 401 - 410
  • [35] Polynomial time synthesis of byzantine agreement
    Kulkarni, SS
    Arora, A
    Chippada, A
    20TH IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, 2001, : 130 - 139
  • [36] Efficient Byzantine agreement with faulty minority
    Beerliova-Trubiniova, Zuzana
    Hirt, Martin
    Riser, Micha
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2007, 2007, 4833 : 393 - 409
  • [37] Byzantine Agreement Using Partial Authentication
    Bansal, Piyush
    Gopal, Prasant
    Gupta, Anuj
    Srinathan, Kannan
    Vasishta, Pranav Kumar
    DISTRIBUTED COMPUTING, 2011, 6950 : 389 - +
  • [38] Efficient Agreement Over Byzantine Gossip
    Cohen, Ran
    Loss, Julian
    Moran, Tal
    FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2024, PT I, 2025, 14744 : 74 - 91
  • [39] Tight bound on mobile Byzantine Agreement
    Bonnet, Francois
    Delfago, Xavier
    Nguyen, Thanh Dang
    Potop-Butucaru, Maria
    THEORETICAL COMPUTER SCIENCE, 2016, 609 : 361 - 373
  • [40] Multidimensional Byzantine agreement in a synchronous setting
    Andrea Flamini
    Riccardo Longo
    Alessio Meneghetti
    Applicable Algebra in Engineering, Communication and Computing, 2024, 35 : 233 - 251