[CITATION][C] Fast asynchronous Byzantine agreement
M Ben-Or - Proceedings of the fourth annual ACM symposium on …, 1985 - dl.acm.org
Proceedings of the fourth annual ACM symposium on Principles of distributed …, 1985•dl.acm.org
Fast asynchronous Byzantine agreement (extended abstract) | Proceedings of the fourth
annual ACM symposium on Principles of distributed computing skip to main content ACM
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign
in Register Advanced Search Journals Magazines Proceedings Books SIGs Conferences
People More Search ACM Digital Library SearchSearch Advanced Search podc Conference
Proceedings Upcoming Events Authors Affiliations Award Winners More Home Conferences …
annual ACM symposium on Principles of distributed computing skip to main content ACM
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign
in Register Advanced Search Journals Magazines Proceedings Books SIGs Conferences
People More Search ACM Digital Library SearchSearch Advanced Search podc Conference
Proceedings Upcoming Events Authors Affiliations Award Winners More Home Conferences …
We present a fast quantum Byzantine Agreement protocol that can reach agreement in O (1) expected communication rounds against a strong full information, dynamic adversary, tolerating up to the optimal t‹ n3 faulty players in the synchronous setting, and...
ACM Digital Library