Hao Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Hao Yang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Jing Chen
Wuhan University
3 shared publications - Kun He
Wuhan University
3 shared publications - Meng Jia
Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China
3 shared publications - Ruiying Du
Wuhan University
3 shared publications Chen Zhang
Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China
1 shared publicationJunjie Shi
Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China
1 shared publication
Latest Publications
- 9 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 3886-3901
POWER: High-Throughput Blockchain Based on Computing Power Utilization
Proof-of-Work (PoW) based blockchain reaches consensus by solving computational puzzles, with only the winners generating blocks. In other words, most nodes waste their computing power, resulting in a mismatch between transaction throughput and system scale (i.e., the number of nodes). In this paper, we propose POWER, a high transaction throughput blockchain architecture that utilizes node computing power. Specifically, by introducing hook block and transaction block, we design a parallel structure to increase the utilization of the computing power of nodes that package and add transactions to the blockchain. In the parallel structure, the hook block hangs the transaction block and solves the problem of transaction redundancy. We also present a round interval confirmation mechanism to increase the utilization of the computing power of nodes that confirm transactions. We conduct experiments on POWER and the experiment results show that POWER has a 63% higher transaction throughput and a 51% lower transaction confirmation latency compared to other schemes. In particular, the transaction confirmation accuracy of POWER is 5.9 times better than that of OHIE.
- 9 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 3886-3901
POWER: High-Throughput Blockchain Based on Computing Power Utilization
Proof-of-Work (PoW) based blockchain reaches consensus by solving computational puzzles, with only the winners generating blocks. In other words, most nodes waste their computing power, resulting in a mismatch between transaction throughput and system scale (i.e., the number of nodes). In this paper, we propose POWER, a high transaction throughput blockchain architecture that utilizes node computing power. Specifically, by introducing hook block and transaction block, we design a parallel structure to increase the utilization of the computing power of nodes that package and add transactions to the blockchain. In the parallel structure, the hook block hangs the transaction block and solves the problem of transaction redundancy. We also present a round interval confirmation mechanism to increase the utilization of the computing power of nodes that confirm transactions. We conduct experiments on POWER and the experiment results show that POWER has a 63% higher transaction throughput and a 51% lower transaction confirmation latency compared to other schemes. In particular, the transaction confirmation accuracy of POWER is 5.9 times better than that of OHIE.
- 28 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 2549-2563
Realhybrid: A Hybrid Blockchain Consensus With Node-Level Switching
Blockchain consensus can be divided into synchronous consensus and asynchronous consensus according to the network status. In a real network environment, the network status of each node is constantly fluctuating. Hybrid consensus schemes adapt to network fluctuations through switching consensus protocol between asynchronous and synchronous. However, existing schemes are system-level switching, resulting in low efficiency. In this paper, we present Realhybrid, a hybrid consensus scheme with node-level switching, which enables every node to select appropriate consensus protocols based on their network status. We design corresponding protocols for each node to achieve efficient consensus under network fluctuations. Moreover, we establish a Realhybrid network model and quantify the relationship between its performance and system parameters. We conduct experiments on Realhybrid and the results show that it has 29% lower transaction waiting volume and 17% lower transaction confirmation latency compared to other hybrid consensus schemes.
- 28 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 2549-2563
Realhybrid: A Hybrid Blockchain Consensus With Node-Level Switching
Blockchain consensus can be divided into synchronous consensus and asynchronous consensus according to the network status. In a real network environment, the network status of each node is constantly fluctuating. Hybrid consensus schemes adapt to network fluctuations through switching consensus protocol between asynchronous and synchronous. However, existing schemes are system-level switching, resulting in low efficiency. In this paper, we present Realhybrid, a hybrid consensus scheme with node-level switching, which enables every node to select appropriate consensus protocols based on their network status. We design corresponding protocols for each node to achieve efficient consensus under network fluctuations. Moreover, we establish a Realhybrid network model and quantify the relationship between its performance and system parameters. We conduct experiments on Realhybrid and the results show that it has 29% lower transaction waiting volume and 17% lower transaction confirmation latency compared to other hybrid consensus schemes.
- 18 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 6706-6718
Volia: An Efficient and Light Asynchronous BFT Protocol
Byzantine Fault Tolerance (BFT) protocols can be divided into synchronous BFT protocols, partially synchronous BFT protocols, and asynchronous BFT protocols according to communication delay. Asynchronous BFT protocols are widely used because they can tolerate uncertain communication delays in the real world. However, asynchronous BFT protocols need to perform many rounds of broadcasts to reach agreement on a transaction subset, which consumes a lot of communication, computing, and storage resources. In this paper, we present Volia, an asynchronous BFT protocol which resolves above problem.We design new broadcast protocol to reduce the number of broadcast rounds needed for agreement. It reduces the communication overhead. Voting broadcast is used to maintain the order of transaction subsets rather than threshold signature to reduce computation cost. Above mechanisms speeds up the agreement phase, reduces the accumulated transaction subsets waiting for agreement and thus saves storage resources. We conduct experiment on Volia and the results show that Volia exhibits about 2~65× throughput, 2~25% latency, and 30% storage cost compared to other asynchronous BFT protocols.
- 18 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 6706-6718
Volia: An Efficient and Light Asynchronous BFT Protocol
Byzantine Fault Tolerance (BFT) protocols can be divided into synchronous BFT protocols, partially synchronous BFT protocols, and asynchronous BFT protocols according to communication delay. Asynchronous BFT protocols are widely used because they can tolerate uncertain communication delays in the real world. However, asynchronous BFT protocols need to perform many rounds of broadcasts to reach agreement on a transaction subset, which consumes a lot of communication, computing, and storage resources. In this paper, we present Volia, an asynchronous BFT protocol which resolves above problem.We design new broadcast protocol to reduce the number of broadcast rounds needed for agreement. It reduces the communication overhead. Voting broadcast is used to maintain the order of transaction subsets rather than threshold signature to reduce computation cost. Above mechanisms speeds up the agreement phase, reduces the accumulated transaction subsets waiting for agreement and thus saves storage resources. We conduct experiment on Volia and the results show that Volia exhibits about 2~65× throughput, 2~25% latency, and 30% storage cost compared to other asynchronous BFT protocols.