O(log n) EXPECTED ROUNDS RANDOMIZED BYZANTINE GENERALS PROTOCOL.

被引：0
|
作者：
Bracha, Gabriel [1 ]
机构：
[1] Cornell Univ, Ithaca, NY, USA, Cornell Univ, Ithaca, NY, USA
来源：
Journal of the ACM | 1987年 / 34卷 / 04期
关键词：
COMPUTER NETWORKS - Protocols - COMPUTER PROGRAMMING - Algorithms - CRYPTOGRAPHY;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：910 / 920
相关论文
共 35 条
  • [1] AN O(LOG-N) EXPECTED ROUNDS RANDOMIZED BYZANTINE GENERALS PROTOCOL
    BRACHA, G
    JOURNAL OF THE ACM, 1987, 34 (04) : 910 - 920
  • [2] Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience
    Abraham, Ittai
    Devadas, Srinivas
    Dolev, Danny
    Nayak, Kartik
    Ren, Ling
    FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2019, 2019, 11598 : 320 - 334
  • [3] Randomized Consensus in Expected O(n log n) Individual Work
    Aspnes, James
    Attiya, Hagit
    Censor, Keren
    PODC'08: PROCEEDINGS OF THE 27TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2008, : 325 - +
  • [4] Synchronous Byzantine Lattice Agreement in O(log(f)) Rounds
    Di Luna, Giuseppe Antonio
    Anceaume, Emmanuelle
    Bonomi, Silvia
    Querzoni, Leonardo
    2020 IEEE 40TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2020, : 146 - 156
  • [5] Collaborative Broadcast in O(log log n) Rounds
    Schindelhauer, Christian
    Oak, Aditya
    Janson, Thomas
    ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2019, 2019, 11931 : 119 - 136
  • [6] Nearly optimal distributed edge coloring in O(log log n) rounds
    Grable, DA
    Panconesi, A
    RANDOM STRUCTURES & ALGORITHMS, 1997, 10 (03) : 385 - 405
  • [7] Nearly optimal distributed edge colouring in O(log log n) rounds
    Grable, DA
    Panconesi, A
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 278 - 285
  • [8] Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time
    Huang, Shang-En
    Huang, Dawei
    Kopelowitz, Tsvi
    Pettie, Seth
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 510 - 520
  • [9] Randomized Mutual Exclusion in O(log N/log log N) RMRs
    Hendler, Danny
    Woelfel, Philipp
    PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2009, : 26 - 35
  • [10] Synchronous Byzantine Agreement With O(n) Messages and O(1) Expected Time
    Wang, Haochen
    You, Qidi
    Duan, Sisi
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2025, 20 : 338 - 349
1234