skip to main content
10.1145/1146381.1146407acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article

Optimally efficient multi-valued byzantine agreement

Published: 23 July 2006 Publication History

Abstract

All known protocols for Byzantine agreement (BA) among n players require the message to be communicated at least Ω(n2) times, which results in an overall communication complexity of at least Ω(ln2) bits for an l-bit message. We present the first BA protocol in which the message is communicated only O(n) times (the hidden factor is less than 2). More concretely, for a given synchronous broadcast protocol which communicates B(b) bits for reaching agreement on a b-bit message with security parameter κ, our construction yields a synchronous BA protocol with communication complexity O(ln+nB(n+κ)) bits. Our reduction is information theoretically secure and tolerates up to t<n/2 corrupted players, which is optimal for the consensus variant of BA. Although this resilience is not optimal for the broadcast (Byzantine generals) variant, it is sufficient for most distributed applications that involve BA protocols since they typically require t<n/2.

References

[1]
P. Berman, J. A. Garay, and K. J. Perry. Bit optimal distributed consensus. Computer Science Research, pp. 313--322, 1992. Preliminary version appeared in STOC '89.
[2]
D. Chaum and S. Roijakkers. Unconditionally secure digital signatures. In CRYPTO '90, LNCS 537, pp. 206--214. Springer, 1990.
[3]
L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences (JCSS), 18(4):143--154, 1979. Preliminary version appeared in STOC '77.
[4]
B. A. Coan and J. L. Welch. Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Information and Computation, 97(1):61--85, Mar. 1992. Preliminary version appeared in PODC '89.
[5]
D. Dolev and R. Reischuk. Bounds on information exchange for Byzantine agreement. Journal of the ACM, 32(1):191--204, Jan. 1985.
[6]
D. Dolev and H. R. Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656--666, Nov. 1983. Preliminary version appeared in STOC '82.
[7]
P. Feldman and S. Micali. An optimal probabilistic algorithm for synchronous Byzantine agreement. Automata, languages and programming, 372:341--378, 1989. Preliminary version appeared in STOC '88.
[8]
M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228--234, Apr. 1980.
[9]
B. Pfitzmann and M. Waidner. Information-theoretic pseudosignatures and byzantine agreement for t&gt;=n/3. Technical report, IBM Research, 1996.
[10]
R. Turpin and B. A. Coan. Extending binary Byzantine agreement to multivalued Byzantine agreement. Information Processing Letters, 18(2):73--76, Feb. 1984.

Cited By

View all
  • (2025)Byzantine Fault Tolerance With Non-Determinism, RevisitedIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.351654120(309-322)Online publication date: 2025
  • (2024)Synchronous Distributed Key Generation without BroadcastsIACR Communications in Cryptology10.62056/ayfhsgvtwOnline publication date: 8-Jul-2024
  • (2024)Brief Announcement: Communication-Optimal Convex AgreementProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662782(492-495)Online publication date: 17-Jun-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
July 2006
230 pages
ISBN:1595933840
DOI:10.1145/1146381
Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 July 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. byzantine agreement
  2. communication complexity
  3. cryptographic security
  4. information-theoretic security

Qualifiers

  • Article

Conference

PODC06

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)14
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Byzantine Fault Tolerance With Non-Determinism, RevisitedIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.351654120(309-322)Online publication date: 2025
  • (2024)Synchronous Distributed Key Generation without BroadcastsIACR Communications in Cryptology10.62056/ayfhsgvtwOnline publication date: 8-Jul-2024
  • (2024)Brief Announcement: Communication-Optimal Convex AgreementProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662782(492-495)Online publication date: 17-Jun-2024
  • (2024)Mithril: Stake-Based Threshold MultisignaturesCryptology and Network Security10.1007/978-981-97-8013-6_11(239-263)Online publication date: 2-Oct-2024
  • (2024)A Scalable State Channel for IoT Using Interactive Consistency ProtocolsAdvances on P2P, Parallel, Grid, Cloud and Internet Computing10.1007/978-3-031-76462-2_21(233-244)Online publication date: 17-Nov-2024
  • (2024)Byzantine Protocols with Asymptotically Optimal Communication ComplexitySecurity and Privacy in Communication Networks10.1007/978-3-031-64948-6_13(247-264)Online publication date: 13-Oct-2024
  • (2024)Closing the Efficiency Gap Between Synchronous and Network-Agnostic ConsensusAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58740-5_15(432-461)Online publication date: 26-May-2024
  • (2024)Asymptotically Optimal Message Dissemination with Applications to BlockchainsAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58734-4_3(64-95)Online publication date: 1-May-2024
  • (2023)Efficient Adaptively-Secure Byzantine Agreement for Long MessagesAdvances in Cryptology – ASIACRYPT 202210.1007/978-3-031-22963-3_17(504-525)Online publication date: 25-Jan-2023
  • (2022)Reliable Broadcast in Critical Applications: Asset Transfer and Smart HomeICC 2022 - IEEE International Conference on Communications10.1109/ICC45855.2022.9838701(5286-5291)Online publication date: 16-May-2022
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media