Fault-Tolerant Distributed Logging for Byzantine Behavior Detection
Explore the background of Byzantine-fault-tolerant distributed logging in preparation for detecting Byzantine behavior in distributed systems. Learn about peer review goals, attested append-only memory, and insights on making PBFT safe with minimal node count. Discover small trusted hardware solutions for large distributed systems.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Byzantine-fault-tolerant distributed logging CSE 552 preparation for reading
Background: PeerReview Goal: Detect Byzantine behavior in a distributed system
Background: PeerReview 4 A B 1 2 3 5 D C
Background: Attested append-only memory A B 1 1 1 C 2 3 Jacob R. Lorch TrInc: Small Trusted Hardware for Large Distributed Systems June 6, 2025
Background: Attested append-only memory Just the fact that there s only one is good enough for me. 3 B A A2M can make PBFT safe and live with only 2f+1 nodes Assigning semantic meaning to message counters obviates full log transmission. When correctness of a prefix has been established, one can do log truncation. 1 C 2 3 3 Jacob R. Lorch TrInc: Small Trusted Hardware for Large Distributed Systems June 6, 2025
