Xu Han

Dr. Xu Han

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 January 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JGJunyan Guo
Junyan Guo
SYShuang Yao
Shuang Yao
YSYue Song
Yue Song
XHXu Han
Xu Han
ZZZhi Zheng
Zhi Zheng
LCLiyuan Chang
Liyuan Chang
Satellite-terrestrial integrated network (STIN) serves as essential infrastructure for providing seamless global coverage and wireless remote subscription services. However, the inherent heterogeneity, satellite exposure, and the openness of satellite-terrestrial links pose significant security challenges for authentication, such as privacy breaches, eavesdropping, replay attacks, and identity impersonation, as well as scalability issues like dynamic node joining and revocation. Existing authentication protocols suffer from deficiencies in unlinkability, scalability, and resistance to multiple attacks, and often rely on overly optimistic assumptions regarding satellite trustworthiness. Moreover, performance bottlenecks in handling numerous user access authentication requests within short timeframes remain unresolved. To address these challenges, we propose the N3PA-STIN protocol, a novel three-party authentication protocol for multiuser access that ensures mutual trust among users, satellites, and ground stations. The protocol minimizes computational overhead through an efficient batch verification mechanism, and enhances privacy and unlinkability by employing temporary identifiers derived from one-time pseudonyms. Furthermore, the protocol ensures conditional anonymity, enabling accountability while preserving user privacy, and achieves conditional verifiability by restricting the verification of authentication messages exclusively to registered nodes. A domain key update mechanism based on the Chinese remainder theorem (CRT) supports dynamic node management, effectively addressing the scalability challenges in heterogeneous networks. Security and performance analyses demonstrate that the N3PA-STIN protocol meets the security requirements and minimizes both computational and communication overhead, making it a practical and effective solution for STIN.

15 July 2024 in Computer Networks
Verified
Journal Article
Closed access
ZWZuodong Wu
Zuodong Wu
DZDawei Zhang
Dawei Zhang
YLYong Li
Yong Li
CLChaoyang Li
Chaoyang Li
XHXu Han
Xu Han

16 June 2024 in Internet of Things
Verified
Journal Article
Closed access
XHXu Han
Xu Han
ZWZuodong Wu
Zuodong Wu
YLYang Li
Yang Li
YDYuxuan Du
Yuxuan Du

9 January 2019 in Complexity
Verified
Journal Article
Open access
PDF file
XHXu Han
Xu Han
DCDeyun Chen
Deyun Chen
HYHailu Yang
Hailu Yang
The semantic social network is a kind of network that contains enormous nodes and complex semantic information, and the traditional community detection algorithms could not give the ideal cogent communities instead. To solve the issue of detecting semantic social network, we present a clustering community detection algorithm based on the PSO‐LDA model. As the semantic model is LDA model, we use the Gibbs sampling method that can make quantitative parameters map from semantic information to semantic space. Then, we present a PSO strategy with the semantic relation to solve the overlapping community detection. Finally, we establish semantic modularity (SimQ) for evaluating the detected semantic communities. The validity and feasibility of the PSO‐LDA model and the semantic modularity are verified by experimental analysis.

18 August 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
XHXu Han
Xu Han
DZDawei Zhang
Dawei Zhang
ZHZongmin Huang
Zongmin Huang
SYShuang Yao
Shuang Yao
ZWZuodong Wu
Zuodong Wu
Ring signature is an anonymous signature that allows a person to sign a message on behalf of a self-formed group while concealing the identification of the signer. However, due to its anonymity and unlinkability, malicious or irresponsible signers can easily attack the signature without any responsibility in some scenarios. In this paper, we propose a novel revocable one-time ring signature (roRS) scheme from bilinear pairings, which introduces linkability and mandatory revocability into ring signature. In particular, linkability can resist the double-signing attack and mandatory revocability guarantees that a revocation authority can identify the actual signer when a suspicious signer appears in any situation. The computational complexity of pairing computations is constant, and the time of the revocation phase is more efficient than previous schemes. Furthermore, our scheme is provable secure in the random oracle model, using DL, CDH, and DBDH assumptions.

12 March 2026 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
JGJunyan Guo
Junyan Guo
SYShuang Yao
Shuang Yao
YSYue Song
Yue Song
LZLe Zhang
Le Zhang
XHXu Han
Xu Han
LCLiyuan Chang
Liyuan Chang
Timely and secure emergency message delivery is critical to resilient smart-grid operation and rapid disturbance response. However, existing schemes remain inadequate, leaving smart grids vulnerable to security and privacy threats and causing verification bottlenecks, particularly when nonlinear emergency measurements cannot be homomorphically aggregated, which prevents bandwidth-efficient in-network aggregation and scalable batch verification. We propose EF-CPPA, an escrow-free, conditional privacy-preserving authentication scheme for real-time emergency messaging in smart grids. EF-CPPA enables smart meters to deliver authenticated emergency messages to the CC via power gateways verifiable as legitimate relays, while ensuring the confidentiality, integrity, and unlinkability of embedded nonlinear measurements. EF-CPPA further provides conditional anonymity with accountable tracing, as well as origin authentication, intra-domain verification, and scalable batch verification under bursty multi-meter messaging. An ECDLP-based escrow-free key-generation mechanism reduces reliance on the CC and enables efficient node joining and revocation. Security analysis shows that EF-CPPA achieves existential unforgeability under chosen-message attacks (EUF-CMA) and satisfies the stated security and privacy requirements. Performance evaluation demonstrates low computational, communication, energy, and node-management overhead, making EF-CPPA suitable for security-critical, time-sensitive smart-grid emergency messaging.