EESMR: Energy Efficient BFT-SMR for the masses
Preprint
Abstract
Modern Byzantine Fault-Tolerant State Machine Replication (BFT-SMR) solutions focus on reducing communication complexity, improving throughput, or lowering latency. This work explores the energy efficiency of BFT-SMR protocols. First, we propose a novel SMR protocol that optimizes for the steady state, i.e., when the leader is correct. This is done by reducing the number of required signatures per consensus unit and the communication complexity by order of the number of nodes n compared to the state-of-the-art BFT-SMR solutions. Concretely, we employ the idea that a quorum (collection) of signatures on a proposed value is avoidable during the failure-free runs. Second, we model and analyze the energy efficiency of protocols and argue why the steady-state needs to be optimized. Third, we present an application in the cyber-physical system (CPS) setting, where we consider a partially connected system by optionally leveraging wireless multicasts among neighbors. We analytically determine the parameter ranges for when our proposed protocol offers better energy efficiency than communicating with a baseline protocol utilizing an external trusted node. We present a hypergraph-based network model and generalize previous fault tolerance results to the model. Finally, we demonstrate our approach's practicality by analyzing our protocol's energy efficiency through experiments on a CPS test bed. In particular, we observe as high as 64% energy savings when compared to the state-of-the-art SMR solution for n=10 settings using BLE.Keywords
All Related Versions
This publication has 64 references indexed in Scilit:
- Network-Agnostic Security Comes (Almost) for Free in DKG and MPC2023
- Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $O(n^2)$ Communication, and Optimal Resilience2019
- Principles of Spread-Spectrum Communication Systems2018
- The Bitcoin Backbone Protocol: Analysis and Applications2015
- SPHINCS: Practical Stateless Hash-Based Signatures2015
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions2011
- Efficient Byzantine Agreement with Faulty Minority2007
- Byzantine Agreement Given Partial BroadcastJournal of Cryptology, 2005
- Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying2002
- A Certified Digital Signature2001