Article

Practical Byzantine fault tolerance

Authors:

Miguel Castro and

Barbara LiskovAuthors Info & Claims

OSDI '99: Proceedings of the third symposium on Operating systems design and implementation

February 1999

Pages 173 - 186

Published: 22 February 1999 Publication History

Abstract

No abstract available.

References

[1]

M. Bellare and D. Micciancio. A New Paradigm for Collisionfree Hashing: Incremental@ at Reduced Cost. In Advances in Cryprology - Eurocrypr 97,1997.]]

Google Scholar

[2]

G. Bracha and S. Toueg. Asynchronous Consensus and Broadcast Protocols. Journal oft/w ACM, 32(4), 1995.]]

Digital Library

Google Scholar

[3]

R. Canneti and T. Rabin. Optimal Asynchronous Byzantine Agreement. Technical Report #92-15, Computer Science Department, Hebrew University, 1992.]]

Google Scholar

[4]

M. Castro and B. Liskov. A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm. Technical Memo MIT/LCSmM-590, MIT Laboratory for Computer Science, 1999.]]

Digital Library

Google Scholar

[5]

M. Castro and B. Liskov. Authenticated Byzantine Fault Tolerance Without Public-Key Cryptography. Technical Memo MIT/LCS/TM-589, MIT Laboratory for Computer Science, 1999.]]

Digital Library

Google Scholar

[6]

E Cristian. H. Aghili, H. Strong, and D. Dolev. Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement. In Inrernarional Conference on Fault Tolerant Computing, 1985.]]

Google Scholar

[7]

S. Deering and D. Cheriton. Multicast Routing in Datagram Intemetworks and Extended LANs. ACM Transacrions on Computer Systems, 8(2), 1990.]]

Digital Library

Google Scholar

[8]

H. Dobbertin. The Status of MD5 After a Recent Attack. RSA Laboratories CryproByres, 2(2), 1996.]]

Google Scholar

[9]

M. Fischer, N. Lynch, and M. Paterson. Impossibility of Distributed Consensus With One Faulty Process. Journal of the ACM, 32(2), 1985.]]

Digital Library

Google Scholar

[10]

J. Gamy and Y. Moses. Fully Polynomial Byzantine Agreement for n >3t Processors in t+l Rounds. SIAM Journal of Computing, 27(l), 1998.]]

Digital Library

Google Scholar

[11]

D. Gawlick and D. Kinkade. Varieties of Concurrency Control in IMSNS Fast Path. Da&base Engineering, 8(2), 1985.]]

Google Scholar

[12]

D. Gifford. Weighted Voting for Replicated Data. in Symposium on Operating Systems Principles, 1979.]]

Digital Library

Google Scholar

[13]

M. Herlihy and J. Spar. How to make replicated data secure. Advances in Cryprology (UVCS 293). 1988.]]

Google Scholar

[14]

M. Herhhy and J. Wing. Axioms for Concurrent Objects. In ACM Symposium on Principles of Programming Languages, 1987.]]

Digital Library

Google Scholar

[15]

J. Howard et al. Scale and performance in a distributed file system. ACM Transactions on Cornpurer Systems, 6(l), 1988.]]

Digital Library

Google Scholar

[16]

K. KihIstrom, L. Moser, and P. MeUiar-Smith. The SecureRing Protocols for Securing Group Communication. In Hawaii International Conference on System Sciences, 1998.]]

Digital Library

Google Scholar

[17]

L. Lamport. Tie, Clocks, and the Ordering of Events in a Distributed System. Commun. ACM, 21(7), 1978.]]

Digital Library

Google Scholar

[18]

L. Lamport. The Part-Time Parliament. Technical Repolt 49, DEC Systems Research Center, 1989.]]

Google Scholar

[19]

L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Sysrems, 4(3), 1982.]]

Digital Library

Google Scholar

[20]

B. Liskov et al. Replication in the Harp File System. In ACM Symposium on Operating System Principles, 1991.]]

Digital Library

Google Scholar

[21]

N. Lynch. Distributed Algorihms. Morgan Kaufmann Publishers, 1996.]]

Digital Library

Google Scholar

[22]

D. Malkhi and M. Reiter. A High-Throughput Secure Reliable Multicast Protocol. In Computer Security Fouruiations Workshop, 1996.]]

Digital Library

Google Scholar

[23]

D. MaIkhi and M. Reiter. Byzantine Quorum Systems. In ACM Symposium on Theory of Computing, 1997.]]

Digital Library

Google Scholar

[24]

D. Malkhi and M. Reiter. Unreliable Intrusion Detection in Distributed Computations. In Cornpurer Securiry Fourufations Workshop, 1997.]]

Digital Library

Google Scholar

[25]

D. Malkhi and M. Reiter. Secure and Scalable Replication in Phalanx. In IEEE Symposium on Reliable Distributed Sysrems, 1998.]]

Digital Library

Google Scholar

[26]

B. Oki and B. Liskov. Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems. In ACM Symposium on Principles of Distributed Computing, 1988.]]

Digital Library

Google Scholar

[27]

B. Preneel and P. Oorschot. MDx-MAC and Building Fast MACs from Hash Functions. In Crypro 95,1995.]]

Digital Library

Google Scholar

[28]

C. Pu, A. Black, C. Cowan, and J. Walpole. A Specialization TooIkit to Increase the Diversity of Operating Systems. In ICMAS Workshop on Immunity-Based Sysrems, 1996.]]

Google Scholar

[29]

M. Reiter. Secure Agreement Protocols. In ACM Conference on Computer and Communication Securiky, 1994.]]

Digital Library

Google Scholar

[30]

M. Reiter. The Rampart Toolkit for Building High-Integrity Services. Theory and Practice in Distributed System (LNCS 938), 1995.]]

Digital Library

Google Scholar

[31]

M. Reiter. A Secure Group Membership Protocol. IEEE Transactions on Sojiware Engineering, 22(l), 1996.]]

Digital Library

Google Scholar

[32]

R. Rivest. The MD5 Message-Digest Algorithm. Internet RFC- 1321.1992.]]

Digital Library

Google Scholar

[33]

R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of he ACM, 21(2), 1978.]]

Digital Library

Google Scholar

[34]

F. Schneider. Implementing Fault-Tolerant Services Using The State Machine Approach: A Tutorial. ACM Computing Surveys, 22(4), 1990.]]

Digital Library

Google Scholar

[35]

A. Shamir. How to share a secret. Communications of the ACM, 22(11), 1979.]]

Digital Library

Google Scholar

[36]

G. Tsudii. Message Authentication with One-Way Hash Functions. ACM Computer Communications Review, 22(5), 1992.]]

Digital Library

Google Scholar

[37]

M. Wiener. Performance Comparison of Public-Key Cryptosystems. RSA Laboratories' CryptoBytes, 4(l), 1998.]]

Google Scholar

Cited By

View all

Reynouard MGorelkina OLaraki RDastani MSichman JAlechina NDignum V(2024)BAR Nash Equilibrium and Application to Blockchain DesignProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663185(2435-2437)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663185
Tonkikh AFreitas LKuznetsov PGelles ROlivetti D(2024)Swiper: a new paradigm for efficient weighted distributed protocolsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662799(283-294)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662799
Lewis-Pye AMalkhi DNaor ONayak KKuznetsov PGelles ROlivetti D(2024)Lumiere: Making Optimal BFT for Partial Synchrony PracticalProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662787(135-144)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662787
Show More Cited By

Index Terms

Practical Byzantine fault tolerance
1. General and reference
  1. Cross-computing tools and techniques
    1. Evaluation
    2. Metrics
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Garbage collection
    2. Extra-functional properties
      1. Software fault tolerance

Recommendations

Application-Aware Byzantine Fault Tolerance
DASC '14: Proceedings of the 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing

Byzantine fault tolerance has been intensively studied over the past decade as a way to enhance the intrusion resilience of computer systems. However, state-machine-based Byzantine fault tolerance algorithms require deterministic application processing ...
Read More
Multi-Threshold Byzantine Fault Tolerance
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security

Classic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model, most often one of the following: synchronous, asynchronous or partially synchronous. It is well known that the timing model and fault tolerance threshold present ...
Read More
Optimistic Byzantine fault tolerance

The primary concern of traditional Byzantine fault tolerance is to ensure strong replica consistency by executing incoming requests sequentially according to a total order. Speculative execution at both clients and server replicas has been proposed as a ...
Read More

Comments

Information & Contributors

Information

Published In

OSDI '99: Proceedings of the third symposium on Operating systems design and implementation

February 1999

278 pages

ISBN:1880446391

Chairmen:
Margo Seltzer
Harvard Univ., Cambridge, MA
,
Paul Leach
Microsoft Corp.

Publisher

USENIX Association

United States

Publication History

Published: 22 February 1999

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

494
Total Citations
View Citations
7
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

View all

Reynouard MGorelkina OLaraki RDastani MSichman JAlechina NDignum V(2024)BAR Nash Equilibrium and Application to Blockchain DesignProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663185(2435-2437)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663185
Tonkikh AFreitas LKuznetsov PGelles ROlivetti D(2024)Swiper: a new paradigm for efficient weighted distributed protocolsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662799(283-294)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662799
Lewis-Pye AMalkhi DNaor ONayak KKuznetsov PGelles ROlivetti D(2024)Lumiere: Making Optimal BFT for Partial Synchrony PracticalProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662787(135-144)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662787
Yu QLosa GWang XKuznetsov PGelles ROlivetti D(2024)TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT ConsensusProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662783(257-267)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662783
Castello JRedmond PKuper L(2024)Inductive Diagrams for Causal ReasoningProceedings of the ACM on Programming Languages10.1145/36498308:OOPSLA1(529-554)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649830
Chu DLiu CCrooks NHellerstein JHoward H(2024)Bigger, not Badder: Safely Scaling BFT ProtocolsProceedings of the 11th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3642976.3653033(30-36)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3642976.3653033
Guo QAlizadeh MFalahati ABindschaedler LDing AAral AHilt V(2024)AlterEgoProceedings of the 7th International Workshop on Edge Systems, Analytics and Networking10.1145/3642968.3654814(7-12)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3642968.3654814
Shi SXiao YDu CShi YWang CGazda RHou YBurger EDasilva LLou WQuek TGao DZhou JCardenas A(2024)TriSAS: Toward Dependable Inter-SAS Coordination with AuditabilityProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3645005(399-411)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3634737.3645005
Duan SZhang HSui XHuang BMu CDi GWang X(2024)Dashing and Star: Byzantine Fault Tolerance with Weak CertificatesProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650073(250-264)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650073
Adhikari RBusch CKowalski DAgrawal KPetrank E(2024)Stable Blockchain Sharding under Adversarial Transaction GenerationProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659970(451-461)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659970
Show More Cited By

View Options

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.

Cited By

Index Terms

Recommendations

Application-Aware Byzantine Fault Tolerance

Multi-Threshold Byzantine Fault Tolerance

Optimistic Byzantine fault tolerance