He Zhao 0011

dblp:98/3487-11 · DBLP profile ↗
← Back
13ranked-venue papers
0as first author
12since 2021 · last 2027
0000-0003-2646-7306ORCID · verified

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

Systems, architecture and hardware · 5 · 5 since 2021Computer networks · 3 · 3 since 2021Security and privacy · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
YearPublicationVenuePosition
2027 Fountain: An inclusive high-performance architecture for permissioned blockchains
Nianzu Sheng, Tong Zhou 0003, He Zhao 0011, Xiaofeng Li 0011, Jinlin Xu
Future Gener. Comput. Syst.3
2026 Banknote-Chain: Achieving User-Incentivized Parallelism in Blockchain via a Banknote-Inspired Transaction Model
Zhiyu Ma, Xiaofeng Li 0011, He Zhao 0011, Tong Zhou 0003, Nianzu Sheng, Haotian Cheng
ICDE3
2026 Harvester: A transaction-driven heterogeneous caching mechanism for blockchain
Zhiyu Ma, Xiaofeng Li 0011, He Zhao 0011, Bin Yu 0016, Tong Zhou 0003, Nianzu Sheng
Comput. Networks3
2026 MixChain: An Account-Vessel hybrid model for high-performance blockchain system
Yuanyi Ma, Cheng Qu, He Zhao 0011, Jing Li 0047
Future Gener. Comput. Syst.3
2025 Jakiro: A Cross-Modal Contrastive Learning Framework for Detecting Vulnerabilities in Smart Contracts
Zixuan Niu, Xiaofeng Li 0011, He Zhao 0011, Tong Zhou 0003, Haotian Cheng
ISC3
2025 SoRCS: A scalable blockchain model with separation of role, chain and storage
Bin Yu 0016, He Zhao 0011, Zhiyu Ma, Haotian Cheng, Tong Zhou 0003, Nianzu Sheng
J. Parallel Distributed Comput.3
2024 S-Cred: An accountable anonymous credential scheme with decentralized verification and flexible revocation
Haotian Cheng, Xiaofeng Li 0011, He Zhao 0011, Tong Zhou 0003, Bin Yu 0016, Nianzu Sheng
J. Inf. Secur. Appl.3
2023 Fractal Ledger: A New Approach towards Scalable Blockchain with Graph-Chain Structure
abstract
Scalability is often considered the "Achilles' heel" of blockchain technology. With a traditional chain-based structure, blocks cannot be generated concurrently, thus limiting the throughput and slowing transaction confirmation. Recently emerged graph-based blockchains generally excel in on-chain performance but are weaker in structural flexibility, which is essential for off-chain or cross-chain scaling. In this paper, we propose Fractal Ledger, a novel blockchain model to scale out the ledger in a fractal manner. Fractal Ledger is comprised of fractal units that synthesize both chain and graph structure. Through conversions and interactions of fractal units, Fractal Ledger can share the advantages of both types of blockchains and offer scalability in structure and storage. We introduce the deduction mechanisms for flexible structure scalability and a three-directional folding scheme of lossless on-chain data compression for storage scalability. Our experimental results reveal the effectiveness of Fractal Ledger in enhancing structure and storage scalability.
Tong Zhou 0003, He Zhao 0011, Nianzu Sheng, Bin Yu 0016, Xiaofeng Li 0011, Jinlin Xu
CF2
2023 BlockPilot: A Proposer-Validator Parallel Execution Framework for Blockchain
abstract
Traditional blockchain systems still struggle with limited throughput, particularly those compatible with EVM, which are crucial in many blockchain applications. One of the main reasons arises from serial execution, which doesn’t exploit parallelism in transaction execution. Although some recent literature introduced concurrency control mechanisms to execute transactions in parallel, they do not work efficiently in real-world blockchains where proposers and validators have different execution contexts, which means varying execution deterministic levels and execution quantities.
Jing Li 0047, He Zhao 0011, Tong Zhou 0003, Nianzu Sheng, Hengyu Pan
ICPP3
2023 OverShard: Scaling blockchain by full sharding with overlapping network and virtual accounts
Bin Yu 0016, He Zhao 0011, Tong Zhou 0003, Nianzu Sheng, Xiaofeng Li 0011, Jinlin Xu
J. Netw. Comput. Appl.2
2023 MANDALA: A scalable blockchain model with mesh-and-spoke network and H-PBFT consensus algorithm
Xiaofeng Li 0011, He Zhao 0011, Bin Yu 0016, Tong Zhou 0003, Haotian Cheng, Nianzu Sheng
Peer Peer Netw. Appl.3
2022 DCAF: Dynamic Cross-Chain Anchoring Framework using Smart Contracts
abstract
Abstract Blockchain has attracted tremendous attention from both the academia and the capital market. The insertion of data in a blockchain known as anchoring makes data verifiable and independently auditable and has many potential applications. The objective of this paper is to introduce a dynamic cross-chain anchoring framework for snapshotting users’ data into multiple public blockchains with the help of smart contracts. This paper starts by proposing the framework and depicting the components and workflow. Second, we design a target chain selection algorithm that combines the states of different blockchains. Using the algorithm, users can dynamically select a suitable public blockchain for anchoring tasks. Third, the virtual chain protocol is presented and achieves data anchoring orderly and integrally. Analyzation and evaluation show that the framework can enhance user experience, robustness and performance.
Xiaofeng Li 0011, He Zhao 0011
Comput. J.3
2020 Virtual Block Group: A Scalable Blockchain Model with Partial Node Storage and Distributed Hash Table
abstract
Abstract The inability to scale is one of the most concerning problems looming in blockchain systems, where every node has to store all contents of the ledger database locally, leading to centralization and higher operation costs. In this paper, we propose a model named virtual block group (VBG), which aims at addressing the node storage scalability problem. Adopting the VBG model, each node only needs to store part of block data and saves the VBG storage index to distributed hash table by taking block data as a resource, thus improving the query efficiency of block data. With the incentive mechanism of block data storage, and the storage verification and audit mechanism of block data, the security and reliability of block data storage can be ensured. The analysis and calculation show that this model saves hard drive storage space of the node to a greater extent with a shorter time of requesting block data, in the premise of ensuring secure and reliable block data. Compared to other technologies such as sharding, our model does not change the consensus mechanism or the network topology and retains the reliability and security of the original blockchain system.
Bin Yu 0016, Xiaofeng Li 0011, He Zhao 0011
Comput. J.3