Open Access iconOpen Access



A Novel High-Efficiency Transaction Verification Scheme for Blockchain Systems

Jingyu Zhang1,2, Pian Zhou1, Jin Wang1, Osama Alfarraj3, Saurabh Singh4, Min Zhu5,*

1 School of Computer & Communication Engineering, Changsha University of Science & Technology, Changsha, 410015, China
2 Science and Technology on Information Systems Engineering Laboratory, School of Systems Engineering, National University of Defense Technology, Changsha, 410073, China
3 Computer Science Department, King Saud University, Riyadh, 11437, Saudi Arabia
4 Department of Artificial Intelligence and Big Data, Woosong University, Daejeon, 34606, South Korea
5 College of Information Science and Technology, Zhejiang Shuren University, Hangzhou, 310015, China

* Corresponding Author: Min Zhu. Email: email

(This article belongs to this Special Issue: Information Security and Trust Issues in the Digital World)

Computer Modeling in Engineering & Sciences 2024, 139(2), 1613-1633.


Blockchain can realize the reliable storage of a large amount of data that is chronologically related and verifiable within the system. This technology has been widely used and has developed rapidly in big data systems across various fields. An increasing number of users are participating in application systems that use blockchain as their underlying architecture. As the number of transactions and the capital involved in blockchain grow, ensuring information security becomes imperative. Addressing the verification of transactional information security and privacy has emerged as a critical challenge. Blockchain-based verification methods can effectively eliminate the need for centralized third-party organizations. However, the efficiency of nodes in storing and verifying blockchain data faces unprecedented challenges. To address this issue, this paper introduces an efficient verification scheme for transaction security. Initially, it presents a node evaluation module to estimate the activity level of user nodes participating in transactions, accompanied by a probabilistic analysis for all transactions. Subsequently, this paper optimizes the conventional transaction organization form, introduces a heterogeneous Merkle tree storage structure, and designs algorithms for constructing these heterogeneous trees. Theoretical analyses and simulation experiments conclusively demonstrate the superior performance of this scheme. When verifying the same number of transactions, the heterogeneous Merkle tree transmits less data and is more efficient than traditional methods. The findings indicate that the heterogeneous Merkle tree structure is suitable for various blockchain applications, including the Internet of Things. This scheme can markedly enhance the efficiency of information verification and bolster the security of distributed systems.


Cite This Article

Zhang, J., Zhou, P., Wang, J., Alfarraj, O., Singh, S. et al. (2024). A Novel High-Efficiency Transaction Verification Scheme for Blockchain Systems. CMES-Computer Modeling in Engineering & Sciences, 139(2), 1613–1633.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 134


  • 64


  • 0


Share Link