Recipe: Hardware-Accelerated Replication Protocols

• URL: http://arxiv.org/abs/2502.09251v1
• Date: Thu, 13 Feb 2025 12:04:53 GMT
• Title: Recipe: Hardware-Accelerated Replication Protocols
• Authors: Dimitra Giantsidi, Emmanouil Giortamis, Julian Pritzi, Maurice Bailleu, Manos Kapritsos, Pramod Bhatotia,
• Abstract summary: 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.
• Score: 0.4900774081652471
• License:
• Abstract: Replication protocols are essential for distributed systems, ensuring consistency, reliability, and fault tolerance. Traditional Crash Fault Tolerant (CFT) protocols, which assume a fail-stop model, are inadequate for untrusted cloud environments where adversaries or software bugs can cause Byzantine behavior. Byzantine Fault Tolerant (BFT) protocols address these threats but face significant performance, resource overheads, and scalability challenges. This paper introduces Recipe, a novel approach to transforming CFT protocols to operate securely in Byzantine settings without altering their core logic. Recipe rethinks CFT protocols in the context of modern cloud hardware, including many-core servers, RDMA-capable networks, and Trusted Execution Environments (TEEs). The approach leverages these advancements to enhance the security and performance of replication protocols in untrusted cloud environments. Recipe implements two practical security mechanisms, i.e., transferable authentication and non-equivocation, using TEEs and high-performance networking stacks (e.g., RDMA, DPDK). These mechanisms ensure that any CFT protocol can be transformed into a BFT protocol, guaranteeing authenticity and non-equivocation. The Recipe protocol consists of five key components: transferable authentication, initialization, normal operation, view change, and recovery phases. The protocol's correctness is formally verified using Tamarin, a symbolic model checker. Recipe is implemented as a library and applied to transform four widely used CFT protocols-Raft, Chain Replication, ABD, and AllConcur-into Byzantine settings. The results demonstrate up to 24x higher throughput compared to PBFT and 5.9x better performance than state-of-the-art BFT protocols. Additionally, Recipe requires fewer replicas and offers confidentiality, a feature absent in traditional BFT protocols.

Related papers

• Securing Legacy Communication Networks via Authenticated Cyclic Redundancy Integrity Check [98.34702864029796]
  We propose Authenticated Cyclic Redundancy Integrity Check (ACRIC) ACRIC preserves backward compatibility without requiring additional hardware and is protocol agnostic. We show that ACRIC offers robust security with minimal transmission overhead ( 1 ms)
  arXiv  Detail & Related papers  (2024-11-21T18:26:05Z)
• 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)
• A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
  The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure. This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus. We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
  arXiv  Detail & Related papers  (2024-01-19T14:52:04Z)
• Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss [0.889974344676093]
  In quantum position verification (QPV) protocols, even relatively small loss rates can compromise security. We modify the usual structure of QPV protocols and prove that this modification makes the potentially high transmission loss between the verifiers security-irrelevant. We show possible implementations of the required photon presence detection, making c-$mathrmQPV_mathrmBB84f$ a protocol that solves all major practical issues in QPV.
  arXiv  Detail & Related papers  (2023-12-19T21:38:10Z)
• 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)
• Vivisecting the Dissection: On the Role of Trusted Components in BFT Protocols [6.458811841777819]
  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.
  arXiv  Detail & Related papers  (2023-12-10T00:39:22Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Towards Semantic Communication Protocols: A Probabilistic Logic Perspective [69.68769942563812]
  We propose a semantic protocol model (SPM) constructed by transforming an NPM into an interpretable symbolic graph written in the probabilistic logic programming language (ProbLog) By leveraging its interpretability and memory-efficiency, we demonstrate several applications such as SPM reconfiguration for collision-avoidance.
  arXiv  Detail & Related papers  (2022-07-08T14:19:36Z)
• Unbalanced-basis-misalignment tolerant measurement-device-independent quantum key distribution [22.419105320267523]
  Measurement-device-independent quantum key distribution (MDIQKD) is a revolutionary protocol since it is physically immune to all attacks on the detection side. Some protocols release part of the assumptions in the encoding system to keep the practical security, but the performance would be dramatically reduced. We present a MDIQKD protocol that requires less knowledge of encoding system to combat the troublesome modulation errors and fluctuations.
  arXiv  Detail & Related papers  (2021-08-27T02:16:20Z)
• You Only Compress Once: Towards Effective and Elastic BERT Compression via Exploit-Explore Stochastic Nature Gradient [88.58536093633167]
  Existing model compression approaches require re-compression or fine-tuning across diverse constraints to accommodate various hardware deployments. We propose a novel approach, YOCO-BERT, to achieve compress once and deploy everywhere. Compared with state-of-the-art algorithms, YOCO-BERT provides more compact models, yet achieving 2.1%-4.5% average accuracy improvement on the GLUE benchmark.
  arXiv  Detail & Related papers  (2021-06-04T12:17:44Z)
• 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)

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.