Papers
Topics
Authors
Recent
Search
2000 character limit reached

Vivisecting the Dissection: On the Role of Trusted Components in BFT Protocols

Published 10 Dec 2023 in cs.DC and cs.CR | (2312.05714v1)

Abstract: A paper by Gupta et al. (EuroSys'23) challenged the usefulness of trusted component (TC) based Byzantine fault-tolerant (BFT) protocols to lower the replica group size from $3f+1$ to $2f+1$, identifying three limitations of such protocols and proposing that TCs should be used instead to improve the performance of BFT protocols. Here, we point out flaws in both arguments and advocate that the most worthwhile use of TCs in BFT protocols is indeed to make them as resilient as crash fault-tolerant (CFT) protocols, which can tolerate up to $f$ faulty replicas using $2f+1$ replicas.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (44)
  1. Algirdas Avizienis. The N-version approach to fault-tolerant software. IEEE Transactions on Software Engineering, 11(12):1491–1501, 1985.
  2. From Byzantine replication to blockchain: Consensus is only the beginning. In Proceedings of the 50th IEEE/IFIP Int. Conference on Dependable Systems and Networks (DSN ’20), 2020.
  3. Making Byzantine consensus live. Distributed Computing, 35(6):503–532, 2022.
  4. Rollback and forking detection for trusted execution environments using lightweight collective memory. In Proceedings of the 47th International Conference on Dependable Systems and Networks (DSN ’17), pages 157–168, 2017.
  5. Consensus-oriented parallelization: How to earn your first million. In Proceedings of the 16th Middleware Conference (Middleware ’15), pages 173–184, 2015.
  6. Hybrids on steroids: SGX-based high performance BFT. In Proceedings of the 12th European Conference on Computer Systems (EuroSys ’17), pages 222–237, 2017.
  7. Consensus in Byzantine asynchronous systems. Journal of Discrete Algorithms, 1(2):185–210, 2003.
  8. Making reads in BFT state machine replication fast, linearizable, and live. In Proceedings of the 40th International Symposium on Reliable Distributed Systems (SRDS ’21), pages 1–12, 2021.
  9. State machine replication for the masses with BFT-SMaRt. In Proceedings of the 44th International Conference on Dependable Systems and Networks (DSN ’14), pages 355–362, 2014.
  10. On the efficiency of durable state machine replication. In Proceedins of the 2013 USENIX Annual Technical Conference (USENIX ATC ’13), pages 169–180, 2013.
  11. Random oracles in Constantipole: Practical asynchronous Byzantine agreement using cryptography (extended abstract). In Proceedings of the 19th Symposium on Principles of Distributed Computing (PODC ’00), pages 123–132, 2000.
  12. Practical Byzantine fault tolerance. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation (OSDI ’99), pages 173–186, 1999.
  13. Practical Byzantine fault-tolerance and proactive recovery. ACM Tras. on Computer Systems, 20(4):398–461, 2002.
  14. Attested append-only memory: Making adversaries stick to their word. In Proceedings of the 21st Symposium on Operating Systems Principles (SOSP ’07), pages 189–204, 2007.
  15. How to tolerate half less one Byzantine nodes in practical distributed systems. In Proceedings of the 23rd Symposium on Reliable Distributed Systems (SRDS ’04), pages 174–183, 2004.
  16. Resource-efficient Byzantine fault tolerance. IEEE Transactions on Computers, 65(9):2807–2819, 2016.
  17. Micro replication. In Proceedings of the 53rd International Conference on Dependable Systems and Networks (DSN ’23), pages 123–137, 2023.
  18. Tobias Distler. Byzantine fault-tolerant state-machine replication from a systems perspective. ACM Computing Surveys, 54(1), 2021.
  19. Increasing performance in Byzantine fault-tolerant systems with on-demand replica consistency. In Proceedings of the 6th European Conference on Computer Systems (EuroSys ’11), pages 91–105, 2011.
  20. DAMYSUS: Streamlined BFT consensus leveraging trusted components. In Proceedings of the 17th European Conference on Computer Systems (EuroSys ’22), pages 1–16, 2022.
  21. Foundations of dynamic BFT. In Proceedings of the 2022 Symposium on Security and Privacy (SP ’22), pages 1317–1334, 2022.
  22. SBFT: A scalable and decentralized trust infrastructure. In Proceedings of the 49th International Conference on Dependable Systems and Networks (DSN ’19), pages 568–580, 2019.
  23. Lazarus: Automatic management of diversity in BFT systems. In Proceedings of the ACM/IFIP 20th International Middleware Conference (Middleware ’19), pages 241–254, 2019.
  24. Dissecting BFT consensus: In trusted components we trust! In Proceedings of the 18th European Conference on Computer Systems (EuroSys ’23), pages 521–539, 2023.
  25. A modular approach to fault-tolerant broadcasts and related problems. Technical report, USA, 1994.
  26. Zab: High-performance broadcast for primary-backup systems. In Proceedings of the 41st International Conference on Dependable Systems and Networks (DSN ’11), pages 245–256, 2011.
  27. CheapBFT: Resource-efficient Byzantine fault tolerance. In Proceedings of the 7th European Conference on Computer Systems (EuroSys ’12), pages 295–308, 2012.
  28. Leslie Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2):133–169, 1998.
  29. TrInc: Small trusted hardware for large distributed systems. In Proceedings of the 6th Symposium on Networked Systems Design and Implementation (NSDI ’09), pages 1–14, 2009.
  30. Scalable Byzantine consensus via hardware-assisted secret sharing. IEEE Transactions on Computers, 68(1):139–151, 2019.
  31. ROTE: Rollback protection for trusted execution. In Proceedings of the 26th USENIX Security Symposium (USENIX Security ’17), pages 1289–1306, 2017.
  32. Signature-free asynchronous binary Byzantine consensus with t<n/3𝑡𝑛3t<n/3italic_t < italic_n / 3, O⁢(n2)𝑂superscript𝑛2O(n^{2})italic_O ( italic_n start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT ) messages, and O⁢(1)𝑂1O(1)italic_O ( 1 ) expected time. Journal of the ACM, 62(4):1–21, 2015.
  33. Narrator: Secure and practical state continuity for trusted execution in the cloud. In Proceedings of the 2022 Conference on Computer and Communications Security (CCS’22), page 2385–2399, 2022.
  34. In search of an understandable consensus algorithm. In Proceedings of the 2014 USENIX Annual Technical Conference (USENIX ATC ’14), pages 305–319, 2014.
  35. Highly available intrusion-tolerant services with proactive-reactive recovery. IEEE Transactions on Parallel and Distributed Systems, 21(4):452–465, 2010.
  36. Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299–319, 1990.
  37. Victor Shoup. Practical threshold signatures. In Proceedings of the 19th International Conference on Theory and Application of Cryptographic Techniques (EUROCRYPT ’00), pages 207–220, 2000.
  38. How resilient are distributed f𝑓fitalic_f fault/intrusion-tolerant systems? In Proceedings of the 35th International Conference on Dependable Systems and Networks (DSN ’05), pages 98–107, 2005.
  39. The timely computing base model and architecture. IEEE Transactions on Computers, 51(8):916–930, 2002.
  40. Efficient Byzantine fault-tolerance. IEEE Transactions on Computers, 62(1):16–30, 2013.
  41. EBAWA: Efficient Byzantine agreement for wide-area networks. In Proceedings of the 12th International Symposium on High-Assurance Systems Engineering (HASE ’10), pages 10–19, 2010.
  42. Paulo Veríssimo. Travelling through Wormholes: Meeting the grand challenge of distributed systems. In Proceedings of the International Workshop on Future Directions in Distributed Computing (FuDiCo ’02), pages 144–151, 2002.
  43. Asphalion: Trustworthy shielding against Byzantine faults. Proceedings of the ACM on Programming Languages, 3(OOPSLA), 2019.
  44. Jiangshan Yu. Fault independence in blockchain. In Proceedings of the 53rd International Conference on Dependable Systems and Networks – Supplemental Volume (DSN-S ’23), pages 117–121, 2023.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up