Cryptology ePrint Archive: Report 2018/1028

Available versions in chronological order


Synchronous Byzantine Agreement with Expected $O(1)$ Rounds, Expected $O(n^2)$ Communication, and Optimal Resilience
Ittai Abraham and Srinivas Devadas and Danny Dolev and Kartik Nayak and Ling Ren

Synchronous Byzantine Agreement with Expected $O(1)$ Rounds, Expected $O(n^2)$ Communication, and Optimal Resilience
Ittai Abraham and Srinivas Devadas and Danny Dolev and Kartik Nayak and Ling Ren

Synchronous Byzantine Agreement with Expected $O(1)$ Rounds, Expected $O(n^2)$ Communication, and Optimal Resilience
Ittai Abraham and Srinivas Devadas and Danny Dolev and Kartik Nayak and Ling Ren
Original publication (with minor differences): Financial Cryptography and Data Security 2019


[ Cryptology ePrint archive ]