Hui Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hui Wang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Yong Xie
School of Computer and Information Science, Qinghai Institute of Technology, Xining, China
4 shared publications Xing Su
Department of Information Technology, Qinghai University, Xining, China
2 shared publications- Yining Liu
Wenzhou University of Technology
2 shared publications Chenyang Bu
Hefei University of Technology
1 shared publicationDong Guo
Hefei University of Technology
1 shared publicationDonghui Hu
Hefei University of Technology
1 shared publication
Latest Publications
- 6 November 2026
- Published by Springer Nature
- p. 335-342
HierarchyChunk: A Method for Python Code Chunking Based on Hierarchical Trees
- 6 November 2026
- Published by Springer Nature
- p. 335-342
HierarchyChunk: A Method for Python Code Chunking Based on Hierarchical Trees
- 18 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (14) , 26844-26854
EAPDS: Efficient Auditable and Privacy-Preservation Data-Sharing Scheme Based on Attribute-Based Encryption for IoMT
Data-sharing schemes based on the Internet of Medical Things (IoMT) have emerged as a more convenient way to monitor and manage individuals’ health. However, this scenario faces challenges, such as privacy preservation, effectiveness, and practicality, which hinder its further development. To the best of our knowledge, there is no agreed-upon data-sharing method that addresses all of these problems. In this article, we make a step ahead by designing an efficient and auditable privacy-preservation data-sharing scheme (EAPDS) based on multiauthority attribute-based encryption (ABE). EAPDS designs an auditable anonymous authentication mechanism to realize identity privacy protection, as well as an efficient multiauthority ABE mechanism to achieve the efficiency and practicability of data sharing. Formal security analysis demonstrates EAPDS can resist replayable chosen-ciphertext attack. Many performance evaluation experiments and functional analyses show that EAPDS not only performs better than existing medical data-sharing schemes in terms of efficiency but also in terms of privacy protection and feasibility. Consequently, our EAPDS scheme holds promising application prospects.
- 18 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (14) , 26844-26854
EAPDS: Efficient Auditable and Privacy-Preservation Data-Sharing Scheme Based on Attribute-Based Encryption for IoMT
Data-sharing schemes based on the Internet of Medical Things (IoMT) have emerged as a more convenient way to monitor and manage individuals’ health. However, this scenario faces challenges, such as privacy preservation, effectiveness, and practicality, which hinder its further development. To the best of our knowledge, there is no agreed-upon data-sharing method that addresses all of these problems. In this article, we make a step ahead by designing an efficient and auditable privacy-preservation data-sharing scheme (EAPDS) based on multiauthority attribute-based encryption (ABE). EAPDS designs an auditable anonymous authentication mechanism to realize identity privacy protection, as well as an efficient multiauthority ABE mechanism to achieve the efficiency and practicability of data sharing. Formal security analysis demonstrates EAPDS can resist replayable chosen-ciphertext attack. Many performance evaluation experiments and functional analyses show that EAPDS not only performs better than existing medical data-sharing schemes in terms of efficiency but also in terms of privacy protection and feasibility. Consequently, our EAPDS scheme holds promising application prospects.
- 22 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 70 (1) , 584-596
dAPRE:Efficient and Reliable Attribute-Based Proxy Re-Encryption Using DAG for Data Sharing in IoT
The explosive growth of the Internet of Things (IoT) data and its analytical applications can bring convenience to better intelligent life, efficient work and other aspects. However, the secure sharing of IoT data is the biggest obstacle to this convenience. Numerous schemes have been developed to address the security challenges associated with IoT data sharing recently, but the existing schemes still face the challenge of how to achieve effective fine-grained access control and low overhead in IoT data security sharing. To tackle this challenge, we propose an efficient and reliable attribute-based proxy re-encryption scheme using Directed Acyclic Graph (DAG), namely dAPRE. In the phase of encryption, re-encryption and delegator decryption, dAPRE remains constant computation overhead with the increasing number of attributes. At the same time, dAPRE’s attribute-based verifiable ciphertext access mechanism and DAG-based key recovery algorithm realize ciphertext integrity check and ensure key security. Furthermore, dAPRE has been evaluated through both theoretical analysis and practical experiments, demonstrating its efficiency and practicality.
- 22 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 70 (1) , 584-596
dAPRE:Efficient and Reliable Attribute-Based Proxy Re-Encryption Using DAG for Data Sharing in IoT
The explosive growth of the Internet of Things (IoT) data and its analytical applications can bring convenience to better intelligent life, efficient work and other aspects. However, the secure sharing of IoT data is the biggest obstacle to this convenience. Numerous schemes have been developed to address the security challenges associated with IoT data sharing recently, but the existing schemes still face the challenge of how to achieve effective fine-grained access control and low overhead in IoT data security sharing. To tackle this challenge, we propose an efficient and reliable attribute-based proxy re-encryption scheme using Directed Acyclic Graph (DAG), namely dAPRE. In the phase of encryption, re-encryption and delegator decryption, dAPRE remains constant computation overhead with the increasing number of attributes. At the same time, dAPRE’s attribute-based verifiable ciphertext access mechanism and DAG-based key recovery algorithm realize ciphertext integrity check and ensure key security. Furthermore, dAPRE has been evaluated through both theoretical analysis and practical experiments, demonstrating its efficiency and practicality.
- 23 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (4) , 5696-5707
Data Verifiable Personalized Access Control Electronic Healthcare Record Sharing Based on Blockchain in IoT Environment
Electronic Health Records (EHRs) based on the Internet of Things (IoT) can provide real-time health data for quick intelligent medical services and give convenience to many data-sharing scenarios. However, EHRs also face various security threats since they are highly private. To the best of our knowledge, no recognized data-sharing work can satisfy the stringent privacy requirements of EHRs. Motivated by this, we propose a blockchain-based personalized access control EHR sharing scheme with data verifiability, which can safeguard the interests of data owners and users simultaneously. Firstly, we take ciphertext-policy attribute-based encryption to achieve personalized access control for data owners. Secondly, we design an interactive zero-knowledge proof protocol between data owners and users, which can provide authenticity verification of EHR for users and prevent EHR away from forgery. In addition, smart contracts and the interplanetary file system are used to reduce the computation and storage costs of patients. Finally, the security analysis shows that the proposed scheme meets the pre-defined security goals. The performance analysis demonstrates that the proposed scheme is efficient, and can be applied to practical electronic medical record sharing scenarios.
- 23 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (4) , 5696-5707
Data Verifiable Personalized Access Control Electronic Healthcare Record Sharing Based on Blockchain in IoT Environment
Electronic Health Records (EHRs) based on the Internet of Things (IoT) can provide real-time health data for quick intelligent medical services and give convenience to many data-sharing scenarios. However, EHRs also face various security threats since they are highly private. To the best of our knowledge, no recognized data-sharing work can satisfy the stringent privacy requirements of EHRs. Motivated by this, we propose a blockchain-based personalized access control EHR sharing scheme with data verifiability, which can safeguard the interests of data owners and users simultaneously. Firstly, we take ciphertext-policy attribute-based encryption to achieve personalized access control for data owners. Secondly, we design an interactive zero-knowledge proof protocol between data owners and users, which can provide authenticity verification of EHR for users and prevent EHR away from forgery. In addition, smart contracts and the interplanetary file system are used to reduce the computation and storage costs of patients. Finally, the security analysis shows that the proposed scheme meets the pre-defined security goals. The performance analysis demonstrates that the proposed scheme is efficient, and can be applied to practical electronic medical record sharing scenarios.
- Open Access
- 22 June 2023
- Published by Springer Nature in Research Square
DMKT: Dynamic Mining for Proof of Working Based on KNN Trust Model
Blockchain as a technological foundation for achieving secure data transmission between peers is a very promising platform in various fields. PoW is a widely used consensus algorithm in blockchain systems, but it still faces issues such as low throughput and resource waste. In order to address these issues, we have proposed a new consensus protocol called DMKT, which aims to improve the system's throughput and reduce resource waste. The DMKT model dynamically adjusts the mining difficulty of nodes based on their trust values. In this paper, we use machine learning to classify transactions generated by nodes and calculate the classification results, which are used as parameters to calculate node trust values. We also incorporate the inherent properties of nodes in the blockchain system and the evaluation attributes of neighbors into the system calculation of trust values. Additionally, in this model, the trust values of the nodes are recalculated after each cycle, thus avoiding the problem of power concentration caused by always selecting a single node to maintain the accounting.Through this dynamic adjustment of node mining difficulty, the trust value increases, the mining difficulty decreases, and the trust value decreases, the mining difficulty increases, thus improving system performance.
- 22 June 2023
- Published by Springer Nature in Research Square
Open AccessDMKT: Dynamic Mining for Proof of Working Based on KNN Trust Model
Blockchain as a technological foundation for achieving secure data transmission between peers is a very promising platform in various fields. PoW is a widely used consensus algorithm in blockchain systems, but it still faces issues such as low throughput and resource waste. In order to address these issues, we have proposed a new consensus protocol called DMKT, which aims to improve the system's throughput and reduce resource waste. The DMKT model dynamically adjusts the mining difficulty of nodes based on their trust values. In this paper, we use machine learning to classify transactions generated by nodes and calculate the classification results, which are used as parameters to calculate node trust values. We also incorporate the inherent properties of nodes in the blockchain system and the evaluation attributes of neighbors into the system calculation of trust values. Additionally, in this model, the trust values of the nodes are recalculated after each cycle, thus avoiding the problem of power concentration caused by always selecting a single node to maintain the accounting.Through this dynamic adjustment of node mining difficulty, the trust value increases, the mining difficulty decreases, and the trust value decreases, the mining difficulty increases, thus improving system performance.
- 1 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 234-241
Blockchain-based Privacy-preserving Authentication Key Agreement Protocol for Industrial Wireless Sensor Networks
Industrial wireless sensor networks (IWSNs) are indispensable for Industry 4.0. However, limited to the resource of sensor nodes, designing an effective and secure authentication protocol for real-time data access in IWSNs is full of challenges. In addition, existing protocols fail to balance security and performance for real-time access to IWSNs simultaneously. Thus, we design an efficient authentication key agreement protocol using the physical unclonable function (PUF), elliptic curve cryptography (ECC), and smart contract. We perform formal security analysis under the random oracle model and demonstrate that our protocol meets the basic requirements. Rinkeby, an online Ethereum test network, is used to test the smart contract. Finally, we evaluate computation, communication and storage costs with several similar protocols. The results show that our protocol can provide a higher level of security and the lowest storage cost.
- 1 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 234-241
Blockchain-based Privacy-preserving Authentication Key Agreement Protocol for Industrial Wireless Sensor Networks
Industrial wireless sensor networks (IWSNs) are indispensable for Industry 4.0. However, limited to the resource of sensor nodes, designing an effective and secure authentication protocol for real-time data access in IWSNs is full of challenges. In addition, existing protocols fail to balance security and performance for real-time access to IWSNs simultaneously. Thus, we design an efficient authentication key agreement protocol using the physical unclonable function (PUF), elliptic curve cryptography (ECC), and smart contract. We perform formal security analysis under the random oracle model and demonstrate that our protocol meets the basic requirements. Rinkeby, an online Ethereum test network, is used to test the smart contract. Finally, we evaluate computation, communication and storage costs with several similar protocols. The results show that our protocol can provide a higher level of security and the lowest storage cost.