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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhaoxin Yang

dblp:242/8778 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
0000-0001-5312-7580ORCID · corroborated

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

Computer networks · 2 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Security 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
Cryptographic protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › distributed randomness
randomness beacon
0.912025
Rondo: Scalable and Reconfiguration-Friendly Randomness Beacon · NDSS 2025
Distributed systems › distributed algorithms
distributed randomness
0.912025
Rondo: Scalable and Reconfiguration-Friendly Randomness Beacon · NDSS 2025
Distributed systems
fault tolerance
0.912025
Rondo: Scalable and Reconfiguration-Friendly Randomness Beacon · NDSS 2025

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

reconfiguration · 1.7
YearPublicationVenuePosition
2025 Rondo: Scalable and Reconfiguration-Friendly Randomness Beacon
Xuanji Meng, Zhaoxin Yang, Kang Rong, Wenbo Xu 0002, Shenglong Chen, Ying Yan 0002, Sisi Duan
NDSS3
2023 MFHBT: Hybrid Binary Translation System with Multi-stage Feedback Powered by LLVM
Zhaoxin Yang, Xuehai Chen, Liangpu Wang, Weiming Guo, Dongru Zhao, Fuxin Zhang
APPT1
2022 Blockchain Sharding Strategy for Collaborative Computing Internet of Things Combining Dynamic Clustering and Deep Reinforcement Learning
abstract
Immutability, decentralization, and linear promoted scalability make sharded blockchain a promising solution, which can effectively address the trust issue in the large-scale Internet of Things (IoT). However, currently, the throughput of sharded blockchains is still limited when it comes to high proportions of cross-shard transactions (CST). On the other hand, assemblage characteristics of collaborative computing in IoT have not been received attention. Therefore, in this paper, we present a clustering-based sharded blockchain strategy for collaborative computing in the IoT, where the sharding of the blockchain system is implemented in two steps: k-means clustering-based user grouping and the assignment of consensus nodes. In this framework, how to reasonably group the IoT users while simultaneously guaranteeing the system performance is the key point. Specifically, we describe the data transactions among IoT devices by data transaction flow graph (DTFG) based on a dynamic stochastic block model. Then, formed as a Markov decision process (MDP), the optimization of the cluster number (shard number) and the adjustment of consensus parameters are jointly trained by deep reinforcement learning (DRL). Simulation results show that the proposed scheme improves the scalability of the sharded blockchain in the IoT application.
Zhaoxin Yang, Meng Li 0007, Ruizhe Yang, F. Richard Yu, Yanhua Zhang
ICC1
2022 Sharded Blockchain for Collaborative Computing in the Internet of Things: Combined of Dynamic Clustering and Deep Reinforcement Learning Approach
abstract
Immutability, decentralization, and linear promoted scalability make the sharded blockchain a promising solution, which can effectively address the trust issue in the large-scale Internet of Things (IoT). However, currently, the throughput of sharded blockchains is still limited when it comes to high proportion of cross-shard transactions (CSTs). On the other hand, the assemblage characteristic of the collaborative computing in IoT has not been received attention. Therefore, in this article, we present a clustering-based sharded blockchain strategy for collaborative computing in the IoT, where the sharding of the blockchain system is implemented in two steps:K-means-clustering-based user grouping and the assignment of consensus nodes. In this framework, how to reasonably group the IoT users while simultaneously guaranteeing the system performance is the key point. Specifically, we describe the data transactions among IoT devices by data transaction flow graph (DTFG) based on a dynamic stochastic block model. Then, formed as a Markov decision process (MDP), the optimization of the cluster number (shard number) and the adjustment of consensus parameters are jointly trained by deep reinforcement learning (DRL). Simulation results show that the proposed scheme improves the scalability of the sharded blockchain in the IoT application.
Zhaoxin Yang, Ruizhe Yang, F. Richard Yu, Meng Li 0007, Yanhua Zhang, Yinglei Teng
IEEE Internet Things J.1