Akhil Bandarupalli
Research Subjects
Akhil Bandarupalli has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Aniket Kate
Purdue University, West Lafayette, Indiana, USA
3 shared publications - Adithya Bhat
Purdue University
2 shared publications - Michael K. Reiter
Duke University
2 shared publications - Saurabh Bagchi
Purdue University, West Lafayette, USA
2 shared publications - Chen-Da Liu-Zhang
Lucerne University of Applied Sciences and Arts
1 shared publication - Manish Nagaraj
Department of Electrical and Computer Engineering Purdue University
1 shared publication
Latest Publications
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 261-294
Computationally Efficient Asynchronous MPC with Linear Communication and Low Additive Overhead
- 17 August 2025
- Published by Springer Nature
- p. 261-294
Open AccessComputationally Efficient Asynchronous MPC with Linear Communication and Low Additive Overhead
- Open Access
EESMR: Energy Efficient BFT-SMR for the masses
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.
Open AccessEESMR: Energy Efficient BFT-SMR for the masses
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.