Brief announcement: byzantine agreement with a strong adversary in polynomial expected time
Authors: 
Valerie King, 
Jared SaiaAuthors Info & Claims
Valerie King, Jared SaiaAuthors Info & ClaimsPages 187 - 189
Abstract
In a paper appearing in STOC 2013, we considered Byzantine agreement in the classic asynchronous message-passing model. The adversary is adaptive: it can determine which processors to corrupt and what strategy these processors should use as the algorithm proceeds. Communication is asynchronous: the scheduling of the delivery of messages is set by the adversary, so that the delays are unpredictable to the algorithm. Finally, the adversary has full information: it knows the states of all processors at any time, and is assumed to be computationally unbounded. Such an adversary is also known as "strong". We presented the first known polynomial expected time algorithm to solve asynchronous Byzantine Agreement when the adversary controls a constant fraction of processors. This is the first improvement in running time for this problem since Ben-Or's exponential expected time solution in 1983.
References
[1]
J. Aspnes. Randomized protocols for asynchronous consensus. Journal of Distributed Computing, 16:165--175, 2003.
[2]
H. Attiya and K. Censor. Tight bounds for asynchronous randomized consensus. Journal of the ACM, 55(5), 2008.
[3]
H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition), page 14. John Wiley Interscience, March 2004.
[4]
M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In ACM Conference on Computer and Communications Security, pages 62--73, 1993.
[5]
M. Ben-Or. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols. In Principles of Distributed Computing (PODC), pages 27--30, 1983.
[6]
M. Ben-Or, E. Pavlov, and V. Vaikuntanathan. Byzantine agreement in the full-information model in o (log n) rounds. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 2006.
[7]
R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In ACM Symposium on Theory of Computing (STOC), 1993.
[8]
B. Chor and C. Dwork. Randomization in Byzantine agreement. Advances in Computing Research, 5:443--498, 1989.
[9]
P. Feldman and S. Micali. Byzantine agreement in constant expected time (and trusting no one). In Foundations of Computer Science (FOCS), pages 267--276, 1985.
[10]
B. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani. Scalable algorithms for byzantine agreement and leader election with full information. ACM Transactions on Algorithms(TALG), 2009.
[11]
M. Rabin. Randomized Byzantine generals. In Foundations of Computer Science (FOCS), pages 403--409, 1983.
Index Terms
- Brief announcement: byzantine agreement with a strong adversary in polynomial expected time
Recommendations
Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingIn this paper, we consider two fundamental problems in secure distributed computing, namely Asynchronous Byzantine Agreement (ABA) and Asynchronous Secure Multi-party Computation (ASMPC). Our focus is on the honest majority setting, involving a set of n ...
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingThe problem of Byzantine Agreement (BA) is of interest to both distributed computing and cryptography community. Following well-known results from the distributed computing literature, BA problem in the asynchronous network setting encounters inevitable ...
Byzantine agreement in polynomial expected time: [extended abstract]
STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingIn the classic asynchronous Byzantine agreement problem, communication is via asynchronous message-passing and the adversary is adaptive with full information. In particular, the adversary can adaptively determine which processors to corrupt and what ...
Comments
Information & Contributors
Information
Published In
July 2013
422 pages
ISBN:9781450320658
DOI:10.1145/2484239
- General Chair:
- Panagiota Fatourou,
- Program Chair:
- Gadi Taubenfeld
Copyright © 2013 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 22 July 2013
Check for updates
Author Tags
Qualifiers
- Extended-abstract
Conference
PODC '13: ACM Symposium on Principles of Distributed Computing
July 22 - 24, 2013
Québec, Montréal, Canada
Acceptance Rates
PODC '13 Paper Acceptance Rate 37 of 145 submissions, 26%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 123Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)1
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in