DYDong Yang

Dong Yang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Dong Yang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Optimized Encryption Storage Scheme for Blockchain Data Based on Cold and Hot Blocks and Threshold Secret Sharing

    by Dong Yang, Wei-Tek Tsai

    In recent years, with the rapid development of blockchain technology, the issues of storage load and data security have attracted increasing attention. Due to the immutable nature of data on the blockchain, where data can only be added and not deleted, there is a significant increase in storage pressure on blockchain nodes. In order to alleviate this burden, this paper proposes a blockchain data storage strategy based on a hot and cold block mechanism. It employs a block heat evaluation algorithm to assess the historical and correlation-based heat indicators of blocks, enabling the identification of frequently accessed block data for storage within the blockchain nodes. Conversely, less frequently accessed or “cold” block data are offloaded to cloud storage systems. This approach effectively reduces the overall storage pressure on blockchain nodes. Furthermore, in applications such as healthcare and government services that utilize blockchain technology, it is essential to encrypt stored data to safeguard personal privacy and enforce access control measures. To address this need, we introduce a blockchain data encryption storage mechanism based on threshold secret sharing. Leveraging threshold secret sharing technology, the encryption key for blockchain data is fragmented into multiple segments and distributed across network nodes. These encrypted key segments are further secured through additional encryption using public keys before being stored. This method serves to significantly increase attackers’ costs associated with accessing blockchain data. Additionally, our proposed encryption scheme ensures that each block has an associated encryption key that is stored alongside its corresponding block data. This design effectively mitigates vulnerabilities such as weak password attacks. Experimental results demonstrate that our approach achieves efficient encrypted storage of data while concurrently reducing the storage pressure experienced by blockchain nodes.


  • Open Access

    Linear Consensus Protocol Based on Vague Sets and Multi-Attribute Decision-Making Methods

    by Dong Yang, Wei-Tek Tsai

    This paper proposes a linear consensus protocol QuickBFT based on Vague sets and multi-attribute decision-making methods. QuickBFT simplifies the communication process based on the HotStuff protocol, reduces the four-stage communication to three-stage communication, and reduces the consensus delay. Furthermore, we introduce the Vague set and multi-attribute decision-making theory into the consensus protocol and propose a new leader node selection algorithm, which can prevent Byzantine nodes from becoming leader nodes, thereby improving the protocol performance when the leader node is attacked. Experimental results show that the throughput of QuickBFT is slightly higher than that of the HotStuff protocol without Byzantine nodes, and the consensus delay is reduced by 20%. In the presence of Byzantine nodes, the throughput of QuickBFT is increased by 80% compared with the HotStuff protocol, and the consensus delay is reduced by 60%.


  • Open Access

    SDN-Based Congestion Control and Bandwidth Allocation Scheme in 5G Networks

    by Dong Yang, Wei-Tek Tsai

    5G cellular networks are already more than six times faster than 4G networks, and their packet loss rate, especially in the Internet of Vehicles (IoV), can reach 0.5% in many cases, such as when there is high-speed movement or obstacles nearby. In such high bandwidth and high packet loss network environments, traditional congestion control algorithms, such as CUBIC and bottleneck bandwidth and round-trip propagation time (BBR), have been unable to balance flow fairness and high performance, and their flow rate often takes a long time to converge. We propose a congestion control algorithm based on bottleneck routing feedback using an in-network control mode called bottleneck routing feedback (BRF). We use SDN technology (OpenFlow protocol) to collect network bandwidth information, and BRF controls the data transmission rate of the sender. By adding the bandwidth information of the bottleneck in the option field in the ACK packet, considering the flow fairness and the flow convergence rate, a bandwidth allocation scheme compatible with multiple congestion control algorithms is proposed to ensure the fairness of all flows and make them converge faster. The performance of BRF is evaluated via Mininet. The experimental results show that BRF provides higher bandwidth utilization, faster convergence rate, and fairer bandwidth allocation than existing congestion control algorithms in 5G cellular networks.


  • Blockchains with Five Merkle Trees to Support Financial Transactions

    by Wei-Tek Tsai, Dong Yang, Feng Zhang, Le Yu, Hongyang Zhang, Yaowei Zhang


  • A Multi-level Corporate Wallet with Governance

    by Wei-Tek Tsai, Dong Yang, Zizheng Fan, Feng Zhang, Le Yu, Hongyang Zhang, Yaowei Zhang

  • STRISA: A New Regulation Architecture to Enforce Travel Rule

    by Wei-Tek Tsai, Dong Yang, Rong Wang, Kangmin Wang, Weijing Xiang, Enyan Deng