Article

Free access

Polynomial algorithms for multiple processor agreement

Authors:

Danny Dolev,

H. Raymond StrongAuthors Info & Claims

STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing

Pages 401 - 407

https://doi.org/10.1145/800070.802215

Published: 05 May 1982 Publication History

PDF eReader

Abstract

Reaching agreement in a distributed system while handling malfunctioning behavior is a central issue for reliable computer systems. All previous algorithms for reaching the agreement required an exponential number of messages to be sent, with or without authentication. We give polynomial algorithms for reaching (Byzantine) agreement, both with and without the use of authentication protocols. We also prove that no matter what kind of information is exchanged, there is no way to reach agreement with fewer than t+1 rounds of exchange, where t is the upper bound on the number of faults.

References

[1]

W. Diffie and M. Hellman, "New direction in cryptography," IEEE Trans. on Inform. IT-22,6(1976), 644-654.

Digital Library

Google Scholar

[2]

D. Dolev, "The Byzantine Generals Strike Again," Journal of Algorithms, vol. 3, no. 1, 1982.

Crossref

Google Scholar

[3]

D. Dolev, "Unanimity in an Unknown and Unreliable Environment," 22nd Annual Symposium on Foundations of Computer Science, pp. 159-168, 1981.

Google Scholar

[4]

D. Dolev and H. R. Strong, "Authenticated Algorithms for Byzantine Agreement," submitted for publication; see also "Polynomial algorithms for multiple processor agreement," IBM Research Report RJ3342 {1981).

Google Scholar

[5]

R. A. DeMillo, N. A. Lynch, and M. Merritt, "Cryptographic Protocols," in these proceedings.

Google Scholar

[6]

L. Lamport, "Using Time Instead of Timeout for Fault-Tolerant Distributed Systems," Technical Report, Computer Science Laboratory, SRI International, 1981.

Google Scholar

[7]

L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem," ACM Trans. on Programming Languages and Systems, to appear.

Digital Library

Google Scholar

[8]

N. Lynch, and M. Fischer, "A Lower Bound for the Time to Assure Interactive Consistency," submitted for publication.

Google Scholar

[9]

M. Pease, R. Shostak, and L. Lamport, "Reaching Agreement in the Presence of Faults," JACM, vol. 27, no. 2, pp. 228-234, 1980.

Digital Library

Google Scholar

[10]

R. L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Comm. ACM 21 (1978), 120-126.

Digital Library

Google Scholar

Cited By

View all

Santoro NKuznetsov PGelles ROlivetti D(2024)Keynote: Time is not a Healer: Before and AfterProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3664932(1-1)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3664932
Arapinis MKocsis ÁLamprou NMedley LZacharias TOshman RNolin AHalldorsson MBalliu A(2023)Universally Composable Simultaneous Broadcast against a Dishonest Majority and ApplicationsProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594591(200-210)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594591
Srinivasan SRamesh K(2023)Asynchronous Consensus in Synchronous Systems Using send_to_all PrimitiveSN Computer Science10.1007/s42979-023-02216-y4:6Online publication date: 12-Oct-2023
https://doi.org/10.1007/s42979-023-02216-y
Show More Cited By

Recommendations

Optimal Algorithms for Synchronous Byzantine k-Set Agreement
Stabilization, Safety, and Security of Distributed Systems
Abstract
Considering a system made up of n processes prone to Byzantine failures, k-set agreement allows each process to propose a value and decide a value such that at most k different values are decided by the correct (i.e., non-Byzantine) processes, in ... $\frac{}{}$ $\frac{}{}$
The incremental agreement

To achieve reliable distributed systems, the fault-tolerance must be studied. One of the most important problems of fault-tolerance issues lies in the Byzantine Agreement (BA) problem. The primary issue surrounding BA is that fault-free processors must ...
Enabling service-level agreement renegotiation through extending WS-Agreement specification

WS-Agreement is a language and protocol designed for creating service-level agreements (SLAs) based on initial offers, and for monitoring those offers at runtime. The definition of WS-Agreement protocol is very general and does not contemplate the ...

Comments

Information & Contributors

Information

Published In

STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing

May 1982

408 pages

ISBN:0897910702

DOI:10.1145/800070

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 May 1982

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

108
Total Citations
View Citations
176
Total Downloads

Downloads (Last 12 months)57
Downloads (Last 6 weeks)11

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Santoro NKuznetsov PGelles ROlivetti D(2024)Keynote: Time is not a Healer: Before and AfterProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3664932(1-1)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3664932
Arapinis MKocsis ÁLamprou NMedley LZacharias TOshman RNolin AHalldorsson MBalliu A(2023)Universally Composable Simultaneous Broadcast against a Dishonest Majority and ApplicationsProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594591(200-210)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594591
Srinivasan SRamesh K(2023)Asynchronous Consensus in Synchronous Systems Using send_to_all PrimitiveSN Computer Science10.1007/s42979-023-02216-y4:6Online publication date: 12-Oct-2023
https://doi.org/10.1007/s42979-023-02216-y
Avarikioti ZHeimbach LSchmid RVanbever LWattenhofer RWintermeyer P(2023)FnF-BFT: A BFT Protocol with Provable Performance Under AttackStructural Information and Communication Complexity10.1007/978-3-031-32733-9_9(165-198)Online publication date: 25-May-2023
https://doi.org/10.1007/978-3-031-32733-9_9
Baum CDavid BDowsley RKishore RNielsen JOechsner S(2023)CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From TimePublic-Key Cryptography – PKC 202310.1007/978-3-031-31368-4_16(439-470)Online publication date: 2-May-2023
https://doi.org/10.1007/978-3-031-31368-4_16
Cheng TZhou WYao SFeng LHe J(2022)Multi-pipeline HotStuff: A High Performance Consensus for Permissioned Blockchain2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)10.1109/TrustCom56396.2022.00138(1008-1019)Online publication date: Dec-2022
https://doi.org/10.1109/TrustCom56396.2022.00138
Wang Y(2021)The Adversary Capabilities in Practical Byzantine Fault ToleranceSecurity and Trust Management10.1007/978-3-030-91859-0_2(20-39)Online publication date: 4-Dec-2021
https://doi.org/10.1007/978-3-030-91859-0_2
Liao HXu HLi P(2021)The Golden Snitch: A Byzantine Fault Tolerant Protocol with ActivityInformation and Communications Security10.1007/978-3-030-86890-1_1(3-21)Online publication date: 17-Sep-2021
https://doi.org/10.1007/978-3-030-86890-1_1
(2019)ReferencesConcurrency10.1145/3335772.3335940(319-333)Online publication date: 4-Oct-2019
https://dl.acm.org/doi/10.1145/3335772.3335940
Yin MMalkhi DReiter MGueta GAbraham IRobinson PEllen F(2019)HotStuffProceedings of the 2019 ACM Symposium on Principles of Distributed Computing10.1145/3293611.3331591(347-356)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1145/3293611.3331591
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Optimal Algorithms for Synchronous Byzantine k-Set Agreement

The incremental agreement

Enabling service-level agreement renegotiation through extending WS-Agreement specification

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Recommendations

Optimal Algorithms for Synchronous Byzantine k-Set Agreement

The incremental agreement

Enabling service-level agreement renegotiation through extending WS-Agreement specification

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations