TSW-BFT--A BFT Protocol Based on Trusted Switches for Hybrid Scenarios

Control computer systems in critical security domains such as aerospace require extremely high real-time performance and reliability. While existing Byzantine fault tolerance consensus protocols provide fault-tolerant mechanisms, they face challenges in hybrid application scenarios such as high communication complexity, complex endpoint replicas, and expensive trusted hardware deployment costs. We proposes TSW-BFT, a consensus protocol based on trusted switches. By introducing trusted switch components at the data path layer combined with threshold cryptography, it reduces the total number of replicas required to tolerate f Byzantine replicas to 2f+1. The proposed algorithm provides general consensus services for numerous regular replicas using limited trusted hardware, and implements high-safety modes and membership management mechanisms to support dynamic mode switching in hybrid scenarios. Results indicate that the TSW-BFT algorithm reduces consensus latency by 23% compared to PBFT and by 42.3% compared to MinBFT.

Authors

Publication Details

Published
2025-01-10
DOI
https://doi.org/10.1145/3727353.3727473
Primary Topic
Distributed systems and fault tolerance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

TSW-BFT--A BFT Protocol Based on Trusted Switches for Hybrid Scenarios

Hongbiao Liu, Huawei Wang, Bo Liu, Guoqiang Xie et al.
Distributed systems and fault tolerance
article

TSW-BFT--A BFT Protocol Based on Trusted Switches for Hybrid Scenarios

Hongbiao Liu, Huawei Wang, Bo Liu, Guoqiang Xie, Xintao Di
article en

Abstract

Control computer systems in critical security domains such as aerospace require extremely high real-time performance and reliability. While existing Byzantine fault tolerance consensus protocols provide fault-tolerant mechanisms, they face challenges in hybrid application scenarios such as high communication complexity, complex endpoint replicas, and expensive trusted hardware deployment costs. We proposes TSW-BFT, a consensus protocol based on trusted switches. By introducing trusted switch components at the data path layer combined with threshold cryptography, it reduces the total number of replicas required to tolerate f Byzantine replicas to 2f+1. The proposed algorithm provides general consensus services for numerous regular replicas using limited trusted hardware, and implements high-safety modes and membership management mechanisms to support dynamic mode switching in hybrid scenarios. Results indicate that the TSW-BFT algorithm reduces consensus latency by 23% compared to PBFT and by 42.3% compared to MinBFT.

Openalex Percentile: Top 88%
Distributed systems and fault tolerance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

TSW-BFT--A BFT Protocol Based on Trusted Switches for Hybrid Scenarios — Hongbiao Liu, Huawei Wang, et al. · (2025) | TGRS Research Map | TGRS