Hamster: A Fast Synchronous Byzantine Fault Tolerant Protocol

被引：0

作者：

Fu, Ximing ^{[1
,2
]}

Li, Mo ^{[3
]}

Zeng, Qingming ^{[1
]}

Li, Tianyang ^{[4
]}

Yang, Shenghao ^{[3
]}

Guan, Yonghui ^{[5
]}

Liu, Chuanyi ^{[1
,2
,6
]}

机构：

[1] Harbin Inst Technol Shenzhen, Sch Comp Sci & Technol, Shenzhen 518055, Peoples R China

[2] Peng Cheng Lab, Shenzhen 518066, Peoples R China

[3] Chinese Univ Hong Kong, Sch Sci & Engn, Shenzhen 518172, Peoples R China

[4] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin 150001, Peoples R China

[5] Shenzhen Growth Ring Technol Co Ltd, Shenzhen 518000, Peoples R China

[6] Minist Emergency Management, Key Lab Cyberspace & Data Secur, Beijing 100013, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY | 2025年 / 20卷

基金：

中国国家自然科学基金;

关键词：

Byzantine fault tolerance; coding technique; synchronous; mobile sluggish; safety; liveness;

D O I：

10.1109/TIFS.2025.3544034

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper presents Hamster, a novel synchronous Byzantine Fault Tolerant protocol that achieves high throughput and weaker dependency on synchrony. Specifically, Hamster is the first to introduce coding techniques into synchronous BFT, addressing the challenges posed by higher fault tolerance requirements and significantly reducing communication complexity. Consequently, Hamster achieves linear throughput gains as the number of nodes increases, surpassing Sync HotStuff. Additionally, with minor modifications, Hamster can operate effectively in mobile sluggish environments, further reducing its dependency on strict synchrony. We implement Hamster, and experimental results highlight its performance advantages. Specifically, Hamster achieves 2.5x the throughput of Sync HotStuff in a network of 9 nodes, with this gain growing to 10x as the network scales to 65 nodes. This increasing throughput advantage makes Hamster more applicable to large-scale distributed systems.

引用

页码：2664 / 2676

页数：13

共 27 条

[21]

Miller A., 2016, P 2016 ACM SIGSAC C, P31

[22] Thunderella: Blockchains with Optimistic Instant Confirmation [J].

Pass, Rafael ;

Shi, Elaine .

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT II, 2018, 10821 :3-33

[23] POLYNOMIAL CODES OVER CERTAIN FINITE FIELDS [J].

REED, IS ;

SOLOMON, G .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (02) :300-304

[24] On the Optimality of Optimistic Responsiveness [J].

Shrestha, Nibesh ;

Abraham, Ittai ;

Ren, Ling ;

Nayak, Kartik .

CCS '20: PROCEEDINGS OF THE 2020 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2020, :839-857

[25] Marlin: Two-Phase BFT with Linearity [J].

Sui, Xiao ;

Duan, Sisi ;

Zhang, Haibin .

2022 52ND ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS (DSN 2022), 2022, :54-66

[26]

Yang L, 2022, PROCEEDINGS OF THE 19TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION (NSDI '22), P493

[27] HotStuff: BFT Consensus with Linearity and Responsiveness [J].

Yin, Maofan ;

Malkhi, Dahlia ;

Reiter, Michael K. ;

Gueta, Guy Golan ;

Abraham, Ittai .

PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, :347-356

← 1 2 3 →