Xu An Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Xu An Wang has a total of 377 co-authors. Here are the top co-authors by number of shared publications:
Xiaoyuan Yang
32 shared publicationsJindan Zhang
Xianyang Vocational Technical College
21 shared publicationsJianfeng Ma
School of Cyber Engineering, Xidian University, Xi’an, China
11 shared publicationsMinqing Zhang
Key Laboratory of Cryptography and Information Security Engineering University of Chinese Armed Police Force Xi'an China
9 shared publications- Weiwei Jiang
Beijing University of Posts and Telecommunications
8 shared publications - Arun Kumar Sangaiah
National Yunlin University of Science and Technology
7 shared publications
Latest Publications
- 8 October 2026
- Published by Elsevier in Internet of Things
- Vol. 40
Cloud-edge collaborative recommendation in cross-regional federated learning
- 8 October 2026
- Published by Elsevier in Internet of Things
- Vol. 40
Cloud-edge collaborative recommendation in cross-regional federated learning
- 1 October 2026
- Published by Elsevier in Internet of Things
- Vol. 40
Edge-adaptive dynamic spatiotemporal graph learning for efficient mobile traffic prediction in AIoT cellular networks
- 1 October 2026
- Published by Elsevier in Internet of Things
- Vol. 40
Edge-adaptive dynamic spatiotemporal graph learning for efficient mobile traffic prediction in AIoT cellular networks
- Open Access
SM2-PRE+: A Lightweight Pairing-Free Proxy Re-Encryption Scheme for Secure IoMT Healthcare Data Sharing
With the rapid development of the Internet of Medical Things (IoMT), wearable sensors and intelligent medical terminals continue to generate a large amount of sensitive medical data, which needs to be uploaded to the cloud platform for storage and sharing. However, IoMT devices usually have the characteristics of limited computing resources and limited energy, and it is difficult for traditional high-complexity encryption schemes to meet the requirements of security and efficiency. In addition, the existing Proxy Re-Encryption (PRE) scheme has the risk of authorization transfer, and it is difficult to achieve fine-grained and secure sharing of medical data. In response to the above problems, this paper proposes a lightweight non-pairing proxy re-encryption enhancement scheme SM2-PRE+ based on the SM2 algorithm, which is used for the secure sharing of IoMT medical sensing data. The scheme combines the SM2 elliptic curve cipher algorithm and the SM4 symmetric encryption algorithm to achieve data protection through a double-layer key structure, and it uses the re-encryption mechanism of message binding to enhance the authorization control ability. Compared with the traditional PRE scheme, the proposed scheme avoids bilinear pairing operations, reduces the computing overhead of resource-limited equipment, and supports collusion-resistant and authorization non-transferability. Security analysis shows that the scheme meets the security requirements of IND-CCA under the Random Oracle Model (ROM). Performance analysis results show that SM2-PRE+ has low computing overhead and storage burden, which is suitable for wearable medical devices, intelligent sensing terminals, and cloud-assisted IoMT data sharing scenarios.
Open AccessSM2-PRE+: A Lightweight Pairing-Free Proxy Re-Encryption Scheme for Secure IoMT Healthcare Data Sharing
With the rapid development of the Internet of Medical Things (IoMT), wearable sensors and intelligent medical terminals continue to generate a large amount of sensitive medical data, which needs to be uploaded to the cloud platform for storage and sharing. However, IoMT devices usually have the characteristics of limited computing resources and limited energy, and it is difficult for traditional high-complexity encryption schemes to meet the requirements of security and efficiency. In addition, the existing Proxy Re-Encryption (PRE) scheme has the risk of authorization transfer, and it is difficult to achieve fine-grained and secure sharing of medical data. In response to the above problems, this paper proposes a lightweight non-pairing proxy re-encryption enhancement scheme SM2-PRE+ based on the SM2 algorithm, which is used for the secure sharing of IoMT medical sensing data. The scheme combines the SM2 elliptic curve cipher algorithm and the SM4 symmetric encryption algorithm to achieve data protection through a double-layer key structure, and it uses the re-encryption mechanism of message binding to enhance the authorization control ability. Compared with the traditional PRE scheme, the proposed scheme avoids bilinear pairing operations, reduces the computing overhead of resource-limited equipment, and supports collusion-resistant and authorization non-transferability. Security analysis shows that the scheme meets the security requirements of IND-CCA under the Random Oracle Model (ROM). Performance analysis results show that SM2-PRE+ has low computing overhead and storage burden, which is suitable for wearable medical devices, intelligent sensing terminals, and cloud-assisted IoMT data sharing scenarios.
- 9 September 2026
- Published by Elsevier in Internet of Things
- Vol. 40
TT+: A traitor tracing scheme against malicious encryptors for secure sharing of healthcare electronic health records and cloud TV
- 9 September 2026
- Published by Elsevier in Internet of Things
- Vol. 40
TT+: A traitor tracing scheme against malicious encryptors for secure sharing of healthcare electronic health records and cloud TV
- Open Access
- 26 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 791
DMSA-FL: secure and robust federated learning via double-masked secure aggregation with multiparty homomorphic encryption
- 26 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 791
Open AccessDMSA-FL: secure and robust federated learning via double-masked secure aggregation with multiparty homomorphic encryption
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (13) , 28428-28444
Privacy-Preserving Revocable Certificateless Cloud Data Auditing Scheme Based on IoT Data Collection for Secure Medical Data Sharing
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (13) , 28428-28444
Privacy-Preserving Revocable Certificateless Cloud Data Auditing Scheme Based on IoT Data Collection for Secure Medical Data Sharing
- 11 March 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 195
uMK-HEFL: Unconstrained multi-key homomorphic encryption for privacy-preserving federated learning
- 11 March 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 195
uMK-HEFL: Unconstrained multi-key homomorphic encryption for privacy-preserving federated learning
- 2 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. PP (00983063) , 1
Secure CNN Inference with Adaptive Activation Functions Based on Mutual Information Optimization
As an increasing number of neural network models are deployed in the cloud, privacy concerns have surged, primarily due to the exposure of plaintext user data. To address the core challenge in ciphertext inference where polynomial activation functions struggle to balance model expressive capability and encrypted computation efficiency, this paper proposes a cipher-text CNN inference scheme with mutual information-optimized adaptive polynomial activation functions. Based on the CKKS homomorphic encryption algorithm, the scheme quantifies the correlation between features of each neural network layer and labels via mutual information, dynamically matching the degree and coefficients of polynomial activation functions. First, in the plaintext training phase, mutual information statistics are utilized to classify the functional importance levels of each network layer. Second, polynomial coefficients are optimized through end-to-end training, and combined with threshold filtering and numerical scaling in the ciphertext domain, ensuring the coefficients comply with the constraints of encrypted computation. Finally, a lightweight CNN architecture is integrated with the TenSEAL encryption framework to achieve end-to-end ciphertext inference. Experiments on the MNIST dataset and Fashion-MNIST dataset demonstrate that the proposed scheme achieves a plaintext model accuracy of 98.34%, 95.62% respectively and a ciphertext inference accuracy of 98.13%, 95.31% respectively. It significantly outperforms fixed-degree polynomial activation schemes, realizing the synergistic optimization of privacy protection, inference accuracy, and computational efficiency under a 128-bit security level.
- 2 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. PP (00983063) , 1
Secure CNN Inference with Adaptive Activation Functions Based on Mutual Information Optimization
As an increasing number of neural network models are deployed in the cloud, privacy concerns have surged, primarily due to the exposure of plaintext user data. To address the core challenge in ciphertext inference where polynomial activation functions struggle to balance model expressive capability and encrypted computation efficiency, this paper proposes a cipher-text CNN inference scheme with mutual information-optimized adaptive polynomial activation functions. Based on the CKKS homomorphic encryption algorithm, the scheme quantifies the correlation between features of each neural network layer and labels via mutual information, dynamically matching the degree and coefficients of polynomial activation functions. First, in the plaintext training phase, mutual information statistics are utilized to classify the functional importance levels of each network layer. Second, polynomial coefficients are optimized through end-to-end training, and combined with threshold filtering and numerical scaling in the ciphertext domain, ensuring the coefficients comply with the constraints of encrypted computation. Finally, a lightweight CNN architecture is integrated with the TenSEAL encryption framework to achieve end-to-end ciphertext inference. Experiments on the MNIST dataset and Fashion-MNIST dataset demonstrate that the proposed scheme achieves a plaintext model accuracy of 98.34%, 95.62% respectively and a ciphertext inference accuracy of 98.13%, 95.31% respectively. It significantly outperforms fixed-degree polynomial activation schemes, realizing the synergistic optimization of privacy protection, inference accuracy, and computational efficiency under a 128-bit security level.
- 12 February 2026
- Published by Elsevier in Information Fusion
- Vol. 132
A unified optimization framework for backdoor attacks in large language models
- 12 February 2026
- Published by Elsevier in Information Fusion
- Vol. 132
A unified optimization framework for backdoor attacks in large language models
- Open Access
Post-Quantum Revocable Linkable Ring Signature Scheme Based on SPHINCS+ for V2G Scenarios
As a core support for the integration of new energy and smart grids, Vehicle-to-Grid (V2G) networks face a core contradiction between user privacy protection and transaction security traceability—a dilemma that is further exacerbated by issues such as the quantum computing vulnerability of traditional cryptography, cumbersome key management in stateful ring signatures, and conflicts between revocation mechanisms and privacy protection. To address these problems, this paper proposes a post-quantum revocable linkable ring signature scheme based on SPHINCS+, with the following core innovations: First, the scheme seamlessly integrates the pure hash-based architecture of SPHINCS+ with a stateless design, incorporating WOTS+, FORS, and XMSS technologies, which inherently resists quantum attacks and eliminates the need to track signature states, thus completely resolving the state management dilemma of traditional stateful schemes; second, the scheme introduces an innovative “real signature + pseudo-signature polynomially indistinguishable” mechanism, and by calibrating the authentication path structure and hash distribution of pseudo-signatures (satisfying the Kolmogorov–Smirnov test with ), it ensures signer anonymity and mitigates the potential risk of distinguishable pseudo-signatures; third, the scheme designs a KEK (Key Encryption Key)-sharded collaborative revocation mechanism, encrypting and storing the mapping table in fragmented form, with KEK split into (held by the Trusted Authority, TA) and (held by the regulatory node), with collaborative decryption by both parties required to locate malicious users, thereby resolving the core conflict of privacy leakage in traditional revocation mechanisms; fourth, the scheme generates forward-secure linkable tags based on one-way private key updates and one-time random factors, ensuring that past transactions cannot be traced even if the current private key is compromised; and fifth, the scheme adopts hash commitments instead of complex cryptographic commitments, simplifying computations while efficiently binding transaction amounts to signers—an approach consistent with the pure hash-based design philosophy of SPHINCS+. Security analysis demonstrates that the scheme satisfies the following six core properties: post-quantum security, unforgeability, anonymity, linkability, unframeability, and forward secrecy, thereby providing technical support for secure and anonymous payments in V2G networks in the quantum era.Open AccessPost-Quantum Revocable Linkable Ring Signature Scheme Based on SPHINCS+ for V2G Scenarios
As a core support for the integration of new energy and smart grids, Vehicle-to-Grid (V2G) networks face a core contradiction between user privacy protection and transaction security traceability—a dilemma that is further exacerbated by issues such as the quantum computing vulnerability of traditional cryptography, cumbersome key management in stateful ring signatures, and conflicts between revocation mechanisms and privacy protection. To address these problems, this paper proposes a post-quantum revocable linkable ring signature scheme based on SPHINCS+, with the following core innovations: First, the scheme seamlessly integrates the pure hash-based architecture of SPHINCS+ with a stateless design, incorporating WOTS+, FORS, and XMSS technologies, which inherently resists quantum attacks and eliminates the need to track signature states, thus completely resolving the state management dilemma of traditional stateful schemes; second, the scheme introduces an innovative “real signature + pseudo-signature polynomially indistinguishable” mechanism, and by calibrating the authentication path structure and hash distribution of pseudo-signatures (satisfying the Kolmogorov–Smirnov test with ), it ensures signer anonymity and mitigates the potential risk of distinguishable pseudo-signatures; third, the scheme designs a KEK (Key Encryption Key)-sharded collaborative revocation mechanism, encrypting and storing the mapping table in fragmented form, with KEK split into (held by the Trusted Authority, TA) and (held by the regulatory node), with collaborative decryption by both parties required to locate malicious users, thereby resolving the core conflict of privacy leakage in traditional revocation mechanisms; fourth, the scheme generates forward-secure linkable tags based on one-way private key updates and one-time random factors, ensuring that past transactions cannot be traced even if the current private key is compromised; and fifth, the scheme adopts hash commitments instead of complex cryptographic commitments, simplifying computations while efficiently binding transaction amounts to signers—an approach consistent with the pure hash-based design philosophy of SPHINCS+. Security analysis demonstrates that the scheme satisfies the following six core properties: post-quantum security, unforgeability, anonymity, linkability, unframeability, and forward secrecy, thereby providing technical support for secure and anonymous payments in V2G networks in the quantum era.