Yongfei Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yongfei Huang has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Guangxia Xu
Guangzhou University
7 shared publications - Xiaoling Song
School of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, China
6 shared publications Xiaoling Song
2 shared publications- Yong Liu
Chongqing University of Posts and Telecommunications
2 shared publications - Ge Jiao
Hengyang Normal University
1 shared publication Guangxia Xu
1 shared publication
Latest Publications
- 6 November 2026
- Published by IOP Publishing in Biomedical Physics & Engineering Express
- Vol. 12 (6) , 065007
NCEL: convolution-enhanced lightweight neural architecture for robust EEG signal decoding in noninvasive brain–computer interfaces
Electroencephalography (EEG) is a cornerstone of brain-computer interfaces and clinical neuro-diagnostics due to its non-invasiveness and high temporal resolution. However, robust EEG decoding remains challenging, particularly for resource-constrained deployments. While lightweight architectures like EEGNet offer favorable parameter efficiency, their reliance on fixed convolution kernels and restricted temporal receptive fields inherently limits their performance in complex, highly variable scenarios. To address these limitations, we propose a Neural Convolution-Enhanced Lightweight network (NCEL) that augments spatiotemporal EEG representations while preserving structural compactness. Specifically, a dynamic neural convolution module (NCM) is designed to learn input-dependent temporal filtering strategies for trial-to-trial variability and session-related distribution shifts.Furthermore, parallel multiscale temporal convolution branches are integrated to concurrently capture short-term local waveform transients and long-interval rhythmic dependencies. Finally, a lightweight channel-attention gating mechanism adaptively recalibrates intermediate representations, amplifying task-relevant neural responses while suppressing noise-dominated channels. Extensive evaluations on five benchmark datasets (BCIC IV-2a, BCIC IV-2b, ERN, SMR, and P300) demonstrate that NCEL achieves a mean classification accuracy of 82.75% on BCIC IV-2b. Notably, NCEL achieves higher mean performance than the EEGNet reference values, with performance gains of 12.53 percentage points on the P300 dataset and 9.54 percentage points on BCIC IV-2b, while maintaining only ∼ 0.008 M parameters. Additional subject-specific session-disjoint evaluations show comparable cross-session performance to EEGNet on BCIC IV-2a and a 1.80-percentage-point mean improvement on BCIC IV-2b. Overall, NCEL provides a parameter-efficient framework for resource-constrained EEG decoding, while broader cross-session generalization requires further validation.
- 6 November 2026
- Published by IOP Publishing in Biomedical Physics & Engineering Express
- Vol. 12 (6) , 065007
NCEL: convolution-enhanced lightweight neural architecture for robust EEG signal decoding in noninvasive brain–computer interfaces
Electroencephalography (EEG) is a cornerstone of brain-computer interfaces and clinical neuro-diagnostics due to its non-invasiveness and high temporal resolution. However, robust EEG decoding remains challenging, particularly for resource-constrained deployments. While lightweight architectures like EEGNet offer favorable parameter efficiency, their reliance on fixed convolution kernels and restricted temporal receptive fields inherently limits their performance in complex, highly variable scenarios. To address these limitations, we propose a Neural Convolution-Enhanced Lightweight network (NCEL) that augments spatiotemporal EEG representations while preserving structural compactness. Specifically, a dynamic neural convolution module (NCM) is designed to learn input-dependent temporal filtering strategies for trial-to-trial variability and session-related distribution shifts.Furthermore, parallel multiscale temporal convolution branches are integrated to concurrently capture short-term local waveform transients and long-interval rhythmic dependencies. Finally, a lightweight channel-attention gating mechanism adaptively recalibrates intermediate representations, amplifying task-relevant neural responses while suppressing noise-dominated channels. Extensive evaluations on five benchmark datasets (BCIC IV-2a, BCIC IV-2b, ERN, SMR, and P300) demonstrate that NCEL achieves a mean classification accuracy of 82.75% on BCIC IV-2b. Notably, NCEL achieves higher mean performance than the EEGNet reference values, with performance gains of 12.53 percentage points on the P300 dataset and 9.54 percentage points on BCIC IV-2b, while maintaining only ∼ 0.008 M parameters. Additional subject-specific session-disjoint evaluations show comparable cross-session performance to EEGNet on BCIC IV-2a and a 1.80-percentage-point mean improvement on BCIC IV-2b. Overall, NCEL provides a parameter-efficient framework for resource-constrained EEG decoding, while broader cross-session generalization requires further validation.
- 15 March 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 174
A Fuzzy AHP-based trust management mechanism for self-sovereign identity in the metaverse
- 15 March 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 174
A Fuzzy AHP-based trust management mechanism for self-sovereign identity in the metaverse
- 15 February 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 168
Research on transaction allocation strategy in blockchain state sharding
- 15 February 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 168
Research on transaction allocation strategy in blockchain state sharding
- 3 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (10) , 14526-14537
Decentralized Authentication Scheme Incorporating Reputation and Attribute Signature for Cross-Web3 Applications
Driven by Web 3.0, the number of decentralized applications (DAPPs) continues to increase, and the need for decentralized authentication across applications becomes more and more significant. In addition, multidimensional reputation assessment becomes especially critical in a decentralized environment. However, there is still a lack of trusted and flexible self-sovereign identity (SSI) authentication mechanisms in Web 3.0 decentralized zero-trust cross-applications access scenarios. In response to these challenges, we propose a decentralized authentication scheme that fuses reputation assessment and attribute signature for the open and self-organized Web3 application. First, we design an attribute signature method based on the attributes in a user’s verifiable credentials (VCs). The signature can be used for authentication across Web3 applications, and the authenticator can flexibly adjust the attributes to be verified and their number according to specific needs. Meanwhile, in the attribute signature, we construct a multidimensional reputation assessment mechanism to comprehensively assess the user’s reputation from multiple aspects to determine his/her security risk level, so as to reduce the possibility of identity fraud. Ultimately, through comparative analysis, we verify the advantages of the scheme in terms of privacy, scalability and attack resistance. Moreover, we analyze the performance of the key algorithms in the scheme through simulation experiments, and the experimental results show that our scheme is feasible.
- 3 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (10) , 14526-14537
Decentralized Authentication Scheme Incorporating Reputation and Attribute Signature for Cross-Web3 Applications
Driven by Web 3.0, the number of decentralized applications (DAPPs) continues to increase, and the need for decentralized authentication across applications becomes more and more significant. In addition, multidimensional reputation assessment becomes especially critical in a decentralized environment. However, there is still a lack of trusted and flexible self-sovereign identity (SSI) authentication mechanisms in Web 3.0 decentralized zero-trust cross-applications access scenarios. In response to these challenges, we propose a decentralized authentication scheme that fuses reputation assessment and attribute signature for the open and self-organized Web3 application. First, we design an attribute signature method based on the attributes in a user’s verifiable credentials (VCs). The signature can be used for authentication across Web3 applications, and the authenticator can flexibly adjust the attributes to be verified and their number according to specific needs. Meanwhile, in the attribute signature, we construct a multidimensional reputation assessment mechanism to comprehensively assess the user’s reputation from multiple aspects to determine his/her security risk level, so as to reduce the possibility of identity fraud. Ultimately, through comparative analysis, we verify the advantages of the scheme in terms of privacy, scalability and attack resistance. Moreover, we analyze the performance of the key algorithms in the scheme through simulation experiments, and the experimental results show that our scheme is feasible.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (9) , 11652-11663
Efficient and Privacy-Preserving Authentication for Federated Learning in Industrial Internet of Things Data Sharing Application
Federated learning (FL) has emerged as a promising approach for collaborative machine learning while respecting data privacy. However, directly aggregating local models during FL training can expose sensitive information, as adversaries may analyze model parameters to infer the underlying raw data. To address this concern, implementing a robust identity authentication mechanism can verify the integrity of local models and confirm their sources. However, many existing authentication schemes are computationally intensive, which can hinder performance. In this article, we present a lightweight authentication scheme for FL called EPPAFL. This innovative approach is compatible with all machine learning algorithms, maintains data utility, and ensures strong privacy protection. Additionally, it can be integrated with detection mechanisms to defend against data poisoning and free-rider attacks. Specifically, we first design a certificateless signature scheme based on the elliptic curve cryptography (ECC) and then propose an anonymous and efficient authentication protocol based on the Chinese remainder theorem (CRT), which supports batch verification, dynamic updates, and revocations of group keys. Moreover, participants interact anonymously to achieve secure communication, and trusted authority (TA) can track and recover the real identities of participants in case of malicious activities. We provide formal security proofs and analyses to demonstrate the achieved security properties. Performance evaluations demonstrate that our proposed protocol significantly reduces the costs associated with signature generation and verification, outperforming the existing schemes in both communication and computational efficiency.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (9) , 11652-11663
Efficient and Privacy-Preserving Authentication for Federated Learning in Industrial Internet of Things Data Sharing Application
Federated learning (FL) has emerged as a promising approach for collaborative machine learning while respecting data privacy. However, directly aggregating local models during FL training can expose sensitive information, as adversaries may analyze model parameters to infer the underlying raw data. To address this concern, implementing a robust identity authentication mechanism can verify the integrity of local models and confirm their sources. However, many existing authentication schemes are computationally intensive, which can hinder performance. In this article, we present a lightweight authentication scheme for FL called EPPAFL. This innovative approach is compatible with all machine learning algorithms, maintains data utility, and ensures strong privacy protection. Additionally, it can be integrated with detection mechanisms to defend against data poisoning and free-rider attacks. Specifically, we first design a certificateless signature scheme based on the elliptic curve cryptography (ECC) and then propose an anonymous and efficient authentication protocol based on the Chinese remainder theorem (CRT), which supports batch verification, dynamic updates, and revocations of group keys. Moreover, participants interact anonymously to achieve secure communication, and trusted authority (TA) can track and recover the real identities of participants in case of malicious activities. We provide formal security proofs and analyses to demonstrate the achieved security properties. Performance evaluations demonstrate that our proposed protocol significantly reduces the costs associated with signature generation and verification, outperforming the existing schemes in both communication and computational efficiency.
- 25 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (5) , 2012-2026
An Efficient RLWE-Based Privacy-Preserving Authentication Scheme Based on Edge Computing in Industrial Internet of Things
An industrial network connects devices, sensors, and other physical devices through wireless networks to collect, share, and analyze data to increase productivity, reduce costs, and improve product quality. Due to the accessibility of wireless channels to everyone, the number of malicious exploits of these services is increasing. Thus, confirming the validity of smart devices and servers and guaranteeing communication security are essential. Mutual authentication has become an essential security concern in wireless communication to meet this tendency. However, available techniques rely on prime factorization and discrete logarithm problems that cannot effectively resist quantum attacks. This study presents an anonymous authentication system based on edge computing for the Industrial Internet of Things (IIoT). Specifically, we devised an RLWE-based authentication method to withstand diverse attacks while improving operating efficiency. The proposed scheme achieves mutual authentication in a single-message exchange round, while ensuring user anonymity and perfect forward security. Security analysis and verification with ProVerif demonstrate that our scheme enhances privacy and reliability. Furthermore, experimental results show that our scheme outperforming existing schemes in terms of communication and computing costs
- 25 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (5) , 2012-2026
An Efficient RLWE-Based Privacy-Preserving Authentication Scheme Based on Edge Computing in Industrial Internet of Things
An industrial network connects devices, sensors, and other physical devices through wireless networks to collect, share, and analyze data to increase productivity, reduce costs, and improve product quality. Due to the accessibility of wireless channels to everyone, the number of malicious exploits of these services is increasing. Thus, confirming the validity of smart devices and servers and guaranteeing communication security are essential. Mutual authentication has become an essential security concern in wireless communication to meet this tendency. However, available techniques rely on prime factorization and discrete logarithm problems that cannot effectively resist quantum attacks. This study presents an anonymous authentication system based on edge computing for the Industrial Internet of Things (IIoT). Specifically, we devised an RLWE-based authentication method to withstand diverse attacks while improving operating efficiency. The proposed scheme achieves mutual authentication in a single-message exchange round, while ensuring user anonymity and perfect forward security. Security analysis and verification with ProVerif demonstrate that our scheme enhances privacy and reliability. Furthermore, experimental results show that our scheme outperforming existing schemes in terms of communication and computing costs
- 15 April 2024
- Published by Elsevier in Vehicular Communications
- Vol. 47
A quantum-secure certificateless aggregate signature protocol for vehicular ad hoc networks
- 15 April 2024
- Published by Elsevier in Vehicular Communications
- Vol. 47
A quantum-secure certificateless aggregate signature protocol for vehicular ad hoc networks
- 15 April 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 158, 267-276
DID-HVC-based Web3 healthcare data security and privacy protection scheme
- 15 April 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 158, 267-276
DID-HVC-based Web3 healthcare data security and privacy protection scheme
- 23 December 2022
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (1) , 1-11
An improved efficient identity-based quantum signature scheme
- 23 December 2022
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (1) , 1-11
An improved efficient identity-based quantum signature scheme