Weidong Fang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Weidong Fang has a total of 125 co-authors. Here are the top co-authors by number of shared publications:
- Wuxiong Zhang
Key Laboratory of Science and Technology on Micro-System, Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences, Shanghai 200050, China
23 shared publications - Chunsheng Zhu
Shenzhen Technology University
11 shared publications - Wei Chen
China University of Mining and Technology
11 shared publications Wei Chen
China University of Mining and Technology
6 shared publications- Zhiqi Li
Chinese Academy of Sciences
6 shared publications Wuxiong Zhang
Shanghai Institute of Micro-system and Information Technology, Chinese Academy of Sciences
5 shared publications
Latest Publications
- Open Access
A Lightweight Certificateless Identity Authentication Protocol Using SM2 Algorithm and Self-Secured PUF for IoT
The rapid proliferation of the Internet of Things (IoT) leaves terminal devices vulnerable to considerable security challenges, notably the absence of robust yet efficient identity authentication mechanisms. Traditional certificate-based approaches incur substantial management overhead and storage expenditure, whereas Identity-Based Cryptography poses inherent key escrow risks. To tackle these challenges, this paper proposes a PUF and SM2-based certificateless identity authentication mechanism that integrates SM2 Certificateless Public Key Cryptography (a Chinese national cryptographic standard) with Physical Unclonable Functions (PUFs). Initially, the proposed solution utilizes PUF technology to derive a unique hardware-generated āfingerprintā from an IoT device, which functions as a root key to generate a partial user private key. This approach essentially binds the terminalās identity to its physical hardware, thereby effectively mitigating physical cloning attacks against nodes. Moreover, through the adoption of a Certificateless Public Key Cryptography (CLPKC) framework, the complete user private key is jointly generated by a semi-trusted Key Generation Centre (KGC) and the terminal device itself. The comprehensive security analysis proves that the proposed scheme is provably secure under the random oracle model, capable of resisting various common attacks such as physical cloning, man-in-the-middle, and replay attacks. Performance evaluation confirms that the implemented PUF + SM2 certificateless mechanism significantly reduces the size of user public key identifiers to within 64 bytes, offering a substantial advantage over the 1ā2 KB certificates typically required in conventional PKI/CA systems, thereby enhancing efficiency in storage and communication.
Open AccessA Lightweight Certificateless Identity Authentication Protocol Using SM2 Algorithm and Self-Secured PUF for IoT
The rapid proliferation of the Internet of Things (IoT) leaves terminal devices vulnerable to considerable security challenges, notably the absence of robust yet efficient identity authentication mechanisms. Traditional certificate-based approaches incur substantial management overhead and storage expenditure, whereas Identity-Based Cryptography poses inherent key escrow risks. To tackle these challenges, this paper proposes a PUF and SM2-based certificateless identity authentication mechanism that integrates SM2 Certificateless Public Key Cryptography (a Chinese national cryptographic standard) with Physical Unclonable Functions (PUFs). Initially, the proposed solution utilizes PUF technology to derive a unique hardware-generated āfingerprintā from an IoT device, which functions as a root key to generate a partial user private key. This approach essentially binds the terminalās identity to its physical hardware, thereby effectively mitigating physical cloning attacks against nodes. Moreover, through the adoption of a Certificateless Public Key Cryptography (CLPKC) framework, the complete user private key is jointly generated by a semi-trusted Key Generation Centre (KGC) and the terminal device itself. The comprehensive security analysis proves that the proposed scheme is provably secure under the random oracle model, capable of resisting various common attacks such as physical cloning, man-in-the-middle, and replay attacks. Performance evaluation confirms that the implemented PUF + SM2 certificateless mechanism significantly reduces the size of user public key identifiers to within 64 bytes, offering a substantial advantage over the 1ā2 KB certificates typically required in conventional PKI/CA systems, thereby enhancing efficiency in storage and communication.
- Open Access
- 23 March 2026
- Published byĀ MDPI AGĀ inĀ Applied Sciences
- Vol.Ā 16 Ā (6) , 3086
Advances in Security, Trust and Privacy in Internet of Things
With the rapid development of information and communication technologies, the Internet of Things (IoT) has gradually become a key infrastructure supporting the development of the digital society
- 23 March 2026
- Published byĀ MDPI AGĀ inĀ Applied Sciences
- Vol.Ā 16 Ā (6) , 3086
Open AccessAdvances in Security, Trust and Privacy in Internet of Things
With the rapid development of information and communication technologies, the Internet of Things (IoT) has gradually become a key infrastructure supporting the development of the digital society
- 15 December 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)
- p. 7308-7315
Efficient Data Integrity Verification Scheme Based on Multi-Branch Authentication Tree for Electronic Health Record
The integrity of electronic health record (EHR) is susceptible to compromise by hardware failures, software errors, or human errors. To date, numerous data integrity verification schemes have been proposed, but most face challenges related to third-party auditing and communication overhead. To address this, a novel EHR integrity verification scheme based on a multi-branch authentication tree is presented in this paper. By integrating an edge-based batch processing mechanism with data identity labeling technology, a low-overhead data verification framework is constructed, effectively reducing communication load. A minimal multi-branch tree structure is innovatively designed to enable parallel authentication and batch signing of data blocks. Concurrently, a random security code generation algorithm is introduced to ensure data security. Experimental and analytical results demonstrate that the proposed scheme maintains correctness, efficiency, and security, consistently achieving 100 % precision in detecting corrupted EHR data replicas. This scheme provides an efficient and reliable data integrity guarantee mechanism for EHR within edge computing environments and contributes significantly to building a trustworthy medical service system.
- 15 December 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)
- p. 7308-7315
Efficient Data Integrity Verification Scheme Based on Multi-Branch Authentication Tree for Electronic Health Record
The integrity of electronic health record (EHR) is susceptible to compromise by hardware failures, software errors, or human errors. To date, numerous data integrity verification schemes have been proposed, but most face challenges related to third-party auditing and communication overhead. To address this, a novel EHR integrity verification scheme based on a multi-branch authentication tree is presented in this paper. By integrating an edge-based batch processing mechanism with data identity labeling technology, a low-overhead data verification framework is constructed, effectively reducing communication load. A minimal multi-branch tree structure is innovatively designed to enable parallel authentication and batch signing of data blocks. Concurrently, a random security code generation algorithm is introduced to ensure data security. Experimental and analytical results demonstrate that the proposed scheme maintains correctness, efficiency, and security, consistently achieving 100 % precision in detecting corrupted EHR data replicas. This scheme provides an efficient and reliable data integrity guarantee mechanism for EHR within edge computing environments and contributes significantly to building a trustworthy medical service system.
- 22 October 2025
- Published byĀ ElsevierĀ inĀ Information Processing & Management
- Vol.Ā 63 Ā (2)
DLGTrust: Graph neural network-based trust evaluation using dynamic line graph
- 22 October 2025
- Published byĀ ElsevierĀ inĀ Information Processing & Management
- Vol.Ā 63 Ā (2)
DLGTrust: Graph neural network-based trust evaluation using dynamic line graph
- 22 December 2024
- Published byĀ Springer Nature
- p. 354-362
VT Prompt Tuning: Improving Portrait Generation with Combined Visual Prompt and Text Prompt in Stable Diffusion Model
- 22 December 2024
- Published byĀ Springer Nature
- p. 354-362
VT Prompt Tuning: Improving Portrait Generation with Combined Visual Prompt and Text Prompt in Stable Diffusion Model
- 27 November 2024
- Published byĀ Springer Nature
- p. 166-176
Weibo-FA: A Benchmark Dataset for Fake Account Detection in Weibo Platform
- 27 November 2024
- Published byĀ Springer Nature
- p. 166-176
Weibo-FA: A Benchmark Dataset for Fake Account Detection in Weibo Platform
- 13 August 2024
- Published byĀ Springer Nature
- p. 3-12
Trust Evaluation with Deep Learning in Online Social Networks: A State-of-the-Art Review
- 13 August 2024
- Published byĀ Springer Nature
- p. 3-12
Trust Evaluation with Deep Learning in Online Social Networks: A State-of-the-Art Review
- 13 August 2024
- Published byĀ Springer Nature
- p. 13-23
Deep Neural Network-Based Intrusion Detection in Internet of Things: A State-of-the-Art Review
- 13 August 2024
- Published byĀ Springer Nature
- p. 13-23
Deep Neural Network-Based Intrusion Detection in Internet of Things: A State-of-the-Art Review
- Open Access
- 12 August 2024
- Published byĀ MDPI AGĀ inĀ Applied Sciences
- Vol.Ā 14 Ā (16) , 7067
Frequency Estimation Algorithm for FMCW Beat Signal Based on Spectral Refinement and Phase Angle Interpolation
The beat signal obtained from frequency-modulated continuous-wave (FMCW) radar is a waveform that is corrupted by noise and requires filtering out interference components for frequency calibration. Traditional FFT methods are affected by the fence effect and spectral leakage, leading to a reduction in frequency estimation accuracy. Therefore, an improved double-spectrum-line interpolation frequency estimation algorithm is proposed in this paper, utilizing spectral refinement and phase interpolation. Firstly, the post-FFT spectral signal is refined to narrow the frequency search range and enhance frequency resolution, thereby separating the noise signal. Then, a frequency deviation factor is defined based on the relationship between adjacent phase angles. Finally, the signalās phase angles are interpolated using the frequency deviation factor to estimate the frequency of the beat signal. Experimental results demonstrate that the proposed algorithm reduces the impact of quantization on the frequency distribution and increases the signalās noise resistance. The proposed algorithm has a higher accuracy and lower standard deviation compared to the recently proposed algorithm.
- 12 August 2024
- Published byĀ MDPI AGĀ inĀ Applied Sciences
- Vol.Ā 14 Ā (16) , 7067
Open AccessFrequency Estimation Algorithm for FMCW Beat Signal Based on Spectral Refinement and Phase Angle Interpolation
The beat signal obtained from frequency-modulated continuous-wave (FMCW) radar is a waveform that is corrupted by noise and requires filtering out interference components for frequency calibration. Traditional FFT methods are affected by the fence effect and spectral leakage, leading to a reduction in frequency estimation accuracy. Therefore, an improved double-spectrum-line interpolation frequency estimation algorithm is proposed in this paper, utilizing spectral refinement and phase interpolation. Firstly, the post-FFT spectral signal is refined to narrow the frequency search range and enhance frequency resolution, thereby separating the noise signal. Then, a frequency deviation factor is defined based on the relationship between adjacent phase angles. Finally, the signalās phase angles are interpolated using the frequency deviation factor to estimate the frequency of the beat signal. Experimental results demonstrate that the proposed algorithm reduces the impact of quantization on the frequency distribution and increases the signalās noise resistance. The proposed algorithm has a higher accuracy and lower standard deviation compared to the recently proposed algorithm.
- 1 August 2024
- Published byĀ Springer Nature
- p. 307-317
Intelligent Computing Making Access Control More Secure: From Cipher to Trust
- 1 August 2024
- Published byĀ Springer Nature
- p. 307-317
Intelligent Computing Making Access Control More Secure: From Cipher to Trust