Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Guanxu Yuan

dblp:391/6732 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0005-8352-0187ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Network and information security
1 paper
Blockchain and cryptocurrency security · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance
byzantine fault tolerance
0.812024
Parallel Byzantine Consensus Based on Hierarchical Architecture and Trusted Hardware · IEEE Trans. Dependable Secur. Comput. 2024
Distributed systems
consensus
0.812024
Parallel Byzantine Consensus Based on Hierarchical Architecture and Trusted Hardware · IEEE Trans. Dependable Secur. Comput. 2024
Distributed systems › replication
state machine replication
0.812024
Parallel Byzantine Consensus Based on Hierarchical Architecture and Trusted Hardware · IEEE Trans. Dependable Secur. Comput. 2024
Blockchain and cryptocurrency security
consensus protocol
0.212024
Parallel Byzantine Consensus Based on Hierarchical Architecture and Trusted Hardware · IEEE Trans. Dependable Secur. Comput. 2024

Methods — techniques the papers use, named apart from their topics

trusted execution environment · 1.5hierarchical multi-committee architecture · 1.5
YearPublicationVenuePosition
2024 Parallel Byzantine Consensus Based on Hierarchical Architecture and Trusted Hardware
abstract
Byzantine fault-tolerant (BFT) state machine replication (SMR) is adopted to support blockchain consensus by tolerating arbitrarily faulty behaviours. However, the inherent complexity of BFT protocols makes existing BFT protocols hard to adapt to large-scale applications that require high scalability and performance. In this paper, we propose a BFT parallelism protocol designed to enhance its scalability by using a hierarchical multi-committee architecture. It also encompasses a cross-layer consensus operation flow to improve safety and support trusted execution environments (TEEs). Our proposed approach allows the lower bound on the number of peers to be reduced to$2f+1$. We show the value of our proposed protocol in comparison to other state-of-the-art BFT protocols through experiments and performance evaluations on a testbed built on a cloud platform. The proposed protocol demonstrates a remarkable level of scalability, capable of accommodating a growing number of peers. Additionally, it exhibits improved performance when contrasted with HotStuff and FastBFT, with approximately 100% and 200% enhancements, respectively.
Xiao Chen 0003, Tiejun Ma, Btissam Er-Rahmadi, Jane Hillston, Guanxu Yuan
IEEE Trans. Dependable Secur. Comput.5