Adaptive byzantine agreement in O(t) phases

被引:0
|
作者
Baum-Waidner, B.
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [41] Tight bound on mobile Byzantine Agreement
    Bonnet, Francois
    Delfago, Xavier
    Nguyen, Thanh Dang
    Potop-Butucaru, Maria
    THEORETICAL COMPUTER SCIENCE, 2016, 609 : 361 - 373
  • [42] Multidimensional Byzantine agreement in a synchronous setting
    Andrea Flamini
    Riccardo Longo
    Alessio Meneghetti
    Applicable Algebra in Engineering, Communication and Computing, 2024, 35 : 233 - 251
  • [43] Efficient Algorithms for Anonymous Byzantine Agreement
    Michael Okun
    Amnon Barak
    Theory of Computing Systems, 2008, 42 : 222 - 238
  • [44] An Efficient Byzantine Fault Tolerant Agreement
    Saini, Poonam
    Singh, Awadhesh Kumar
    INTERNATIONAL CONFERENCE ON METHODS AND MODELS IN SCIENCE AND TECHNOLOGY (ICM2ST-10), 2010, 1324 : 162 - 165
  • [45] EVALUATING THE EFFICIENCY OF BYZANTINE AGREEMENT ALGORITHMS
    DIGIANDOMENICO, F
    GUIDOTTI, ML
    GRANDONI, F
    SIMONCINI, L
    COMPUTING SYSTEMS, 1989, 4 (01): : 3 - 11
  • [46] Hybrid Byzantine Agreement on a MultiCasting network
    Wang, SC
    Yan, KQ
    Yang, CY
    Cheng, CF
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCI I, 2002, : 259 - 264
  • [47] Fast agreement in networks with byzantine nodes
    Chlebus, Bogdan S.
    Kowalski, Dariusz R.
    Olkowski, Jan
    Leibniz International Proceedings in Informatics, LIPIcs, 2020, 179
  • [48] Round-Optimal Byzantine Agreement
    Ghinea, Diana
    Goyal, Vipul
    Chen-Da Liu-Zhang
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2022, PT I, 2022, 13275 : 96 - 119
  • [49] Byzantine agreement with homonyms in synchronous systems
    Delporte-Gallet, Carole
    Fauconnier, Hugues
    Hung Tran-The
    THEORETICAL COMPUTER SCIENCE, 2013, 496 : 34 - 49
  • [50] Asynchronous Byzantine Agreement with optimal resilience
    Patra, Arpita
    Choudhury, Ashish
    Rangan, C. Pandu
    DISTRIBUTED COMPUTING, 2014, 27 (02) : 111 - 146