Fully polynomial Byzantine agreement in t + 1 rounds
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Optimal early stopping uniform consensus in synchronous systems with process omission failures
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Fast fault-tolerant agreement algorithms
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Optimal time Byzantine agreement for t n/8 with linear-messages
Distributed Computing
Byzantine agreement in the full-information model in O(log n) rounds
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Eventually Dual Failure Agreement
Fundamenta Informaticae
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
From passive to covert security at low cost
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Eventually Dual Failure Agreement
Fundamenta Informaticae
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |