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

• URL: http://arxiv.org/abs/2312.05714v1
• Date: Sun, 10 Dec 2023 00:39:22 GMT
• Title: Vivisecting the Dissection: On the Role of Trusted Components in BFT Protocols
• Authors: Alysson Bessani, Miguel Correia, Tobias Distler, Rüdiger Kapitza, Paulo Esteves-Verissimo, Jiangshan Yu,
• Abstract summary: We argue that the most worthwhile use of trusted component (TC) based Byzantine fault-tolerant (BFT) protocols is indeed to make them as resilient as crash fault-tolerant (CFT) protocols.
• Score: 6.458811841777819
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A recent 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.

Related papers

• Recipe: Hardware-Accelerated Replication Protocols [0.4900774081652471]
  This paper introduces Recipe, a novel approach to transforming CFT protocols to operate securely in Byzantine settings. Recipe rethinks CFT protocols in the context of modern cloud hardware, including many-core servers, RDMA-capable networks, and Trusted Execution Environments (TEEs) The results demonstrate up to 24x higher throughput compared to PBFT and 5.9x better performance than state-of-the-art BFT protocols.
  arXiv  Detail & Related papers  (2025-02-13T12:04:53Z)
• BICompFL: Stochastic Federated Learning with Bi-Directional Compression [70.37629026426104]
  We address the prominent communication bottleneck in federated learning (FL) We show that bi-directional compression for FL has inherent challenges, which we address by BICompFL. Our BICompFL is experimentally shown to reduce the communication cost by an order of magnitude compared to multiple benchmarks, while maintaining state-of-the-art accuracies.
  arXiv  Detail & Related papers  (2025-01-31T22:48:43Z)
• Unraveling Responsiveness of Chained BFT Consensus with Network Delay [22.287511037444265]
  Chained Byzantine Fault Tolerant (BFT) protocols have been increasingly adopted in practical systems. We introduce a unified framework utilizing Markov Decision Processes (MDP) to model and assess the performance of three prominent chained BFT protocols.
  arXiv  Detail & Related papers  (2025-01-07T10:50:15Z)
• TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus [1.6364535330823093]
  TetraBFT is a Byzantine fault tolerant protocol for solving consensus in partial synchrony. We validate the correctness of TetraBFT through rigorous security analysis and formal verification. We extend TetraBFT into a multi-shot, chained consensus protocol.
  arXiv  Detail & Related papers  (2024-05-04T08:54:42Z)
• From PEFT to DEFT: Parameter Efficient Finetuning for Reducing Activation Density in Transformers [52.199303258423306]
  We propose a novel density loss that encourages higher activation sparsity in pre-trained models. Our proposed method, textbfDEFT, can consistently reduce activation density by up to textbf44.94% on RoBERTa$_mathrmLarge$ and by textbf53.19% (encoder density) and textbf90.60% (decoder density) on Flan-T5$_mathrmXXL$.
  arXiv  Detail & Related papers  (2024-02-02T21:25:46Z)
• Banyan: Fast Rotating Leader BFT [20.52947785138998]
  Banyan is the first rotating leader state machine replication protocol that allows transactions to be confirmed in just a single round-trip time. We introduce a novel dual mode mechanism that enables optimal block finalization latency in the fast path. Our evaluation reveals that Banyan reduces latency by up to 30% compared to state-of-the-art protocols.
  arXiv  Detail & Related papers  (2023-12-10T12:32:58Z)
• CFT-Forensics: High-Performance Byzantine Accountability for Crash Fault Tolerant Protocols [14.503216369017762]
  Crash fault tolerant (CFT) consensus algorithms are commonly used in scenarios where system components are trusted. We propose CFT-Forensics, an accountability framework for CFT protocols.
  arXiv  Detail & Related papers  (2023-05-16T03:09:26Z)
• Exploring Extreme Parameter Compression for Pre-trained Language Models [45.80044281531393]
  This work explores larger compression ratios for pre-trained language models (PLMs) Two decomposition and reconstruction protocols are proposed to improve the effectiveness and efficiency during compression. A tiny version achieves $96.7%$ performance of BERT-base with $ 1/48 $ encoder parameters and $2.7 times$ faster on inference.
  arXiv  Detail & Related papers  (2022-05-20T09:16:55Z)
• CTC Variations Through New WFST Topologies [79.94035631317395]
  This paper presents novel Weighted Finite-State Transducer (WFST) topologies to implement Connectionist Temporal Classification (CTC)-like algorithms for automatic speech recognition. Three new CTC variants are proposed: (1) the "compact-CTC", in which direct transitions between units are replaced with epsilon> back-off transitions; (2) the "minimal-CTC", that only adds blank> self-loops when used in WFST-composition; and (3) "selfless-CTC", that disallows self-loop for non-blank units.
  arXiv  Detail & Related papers  (2021-10-06T23:00:15Z)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)
• Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Verification [151.62491805851107]
  We develop $beta$-CROWN, a bound propagation based verifier that can fully encode per-neuron splits. $beta$-CROWN is close to three orders of magnitude faster than LP-based BaB methods for robustness verification. By terminating BaB early, our method can also be used for incomplete verification.
  arXiv  Detail & Related papers  (2021-03-11T11:56:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.