Jinchun He

Jinchun He

Auto-generated profile, based on publicly available information

Jinchun He

Institute of Artificial Intelligence, Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing, Beihang University, Beijing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
15 April 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JCJiale Chen
Jiale Chen
Shengda ZhuoShengda Zhuo
Shengda Zhuo
JHJinchun He
Jinchun He
WQWangjie Qiu
Wangjie Qiu
QZQinnan Zhang
Qinnan Zhang
SHShuqiang Huang
Shuqiang Huang
The Internet of Things (IoT) collects large volumes of diverse data, with graph data as a critical component, and extensively utilizes Federated Graph Learning (FGL) to process this data while preserving data security. However, the graph data collected by different IoT institutions are relatively independent due to various factors (e.g., data collection methods, geographical locations), and data access is restricted to local environments due to privacy constraints, IoT institutions typically possess heterogeneous feature spaces. Aggregating under these conditions could potentially contaminate local graph representations. Unfortunately, most existing FGL methods tend to overlook this issue. To address this challenge, we propose FGL via Constructing and Sharing Features (FedCSF), a novel FGL framework designed to build a globally consistent feature space and share it among IoT institutions. To construct and extract the feature space, we employ an uniform feature initialization across IoT institutions and design an encoder to extract both global and local feature relationships, thereby facilitating effective collaboration across data from different IoT institutions. Furthermore, we introduce an independent adaptive aggregation strategy to eliminate the integration of harmful knowledge, ensuring that the contributions of each IoT institution are effectively integrated into the local model. We theoretically analyze the convergence of FedCSF. To validate the effectiveness of FedCSF, we conducted extensive experiments under various settings (i.e., cross-datasets, and cross-domains), demonstrating its significant advantages of FedCSF in terms of performance, convergence speed, and practical adaptability.

1 July 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JHJinchun He
Jinchun He
WQWangjie Qiu
Wangjie Qiu
Shengda ZhuoShengda Zhuo
Shengda Zhuo
MXMinghui Xu
Minghui Xu
QZQinnan Zhang
Qinnan Zhang
ZZZhiming Zheng
Zhiming Zheng
The blockchain can offer a dependable and secure platform for Internet of Things (IoT) transactions with its distributed and secure network architecture. Unfortunately, it faces challenges, such as limited throughput, excessive computational costs, and high-transaction fees. Off-chain scaling protocols are used to address the scalability of blockchain for their outstanding performance and efficiency. To mitigate the high-cost interactions with blockchain, previous studies only considered moving transactions of payment hubs (PHs) off-chain, utilizing off-chain operators to aggregate multiple transactions. However, existing PHs overly rely on central operators for system maintenance, greatly increasing the risk of central operator failure (COF). Previous solutions allowed operators to submit unsettled state commitments (USCs) to the blockchain and overlooked the pessimistic scenario that could lead to state rollbacks. To address these issues, this article proposes an efficient multiparty payment protocol (HyperPay), aimed at utilizing the off-chain scaling technique to enhance transaction throughput and reduce on-chain cost. Specifically, we first propose a novel off-chain committee and collateral-based verifiable random leader election (C-VRE) to elect leaders fairly, thus mitigating the COF problem. Additionally, we design a new state validation mechanism and one-step fraud challenge (OSFC), enabling verifiers to directly construct fraud proofs and challenges on-chain, thereby preventing leaders from submitting USC. Our evaluation indicates that HyperPay reduces on-chain costs of challenge by 80% and boosts peak throughput by a factor of 10X-283X. A comprehensive theoretical analysis and experimental results substantiate the security and effectiveness of our proposed approach.

23 September 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZLZeyan Li
Zeyan Li
Shengda ZhuoShengda Zhuo
Shengda Zhuo
YSYichen Shi
Yichen Shi
JHJiadong Huang
Jiadong Huang
JHJinchun He
Jinchun He
YTYin Tang
Yin Tang
Blockchain technology has evolved from its initial use in decentralized payments to encompass smart contracts and applications across multiple domains, propelling the digital transformation of various industries. However, the decentralized and anonymous nature of blockchain presents challenges for anomaly detection (AD), increasing the complexity of security management. The core issue lies in how to efficiently process massive amounts of data and accurately identify anomalous transactions. To address these challenges, this article proposes an innovative method called behavioral AD based on contrastive learning and relational mechanisms (BAD-CLRM), which aims to leverage a large amount of unlabeled data in the blockchain and the relationships between the features of various transaction nodes. We explore the feature distribution of temporal transaction nodes and infer the label attributes of node clusters through contrastive learning, thereby maximizing model learning efficiency and reducing manual labeling costs. Consequently, we leverage the relational mechanism to construct behavioral and structural feature information of nodes during transactions, providing a comprehensive understanding and support for node AD. Experimental results demonstrate that our model exhibits flexibility, superiority, and efficiency in AD tasks, outperforming existing models, especially in handling dynamic transaction data and unlabeled data.

25 August 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
ZLZeyan Li
Zeyan Li
Shengda ZhuoShengda Zhuo
Shengda Zhuo
JHJinchun He
Jinchun He
WQWangjie Qiu
Wangjie Qiu
ZZZhiming Zheng
Zhiming Zheng
YTYin Tang
Yin Tang
The Uniform Resource Locator (URL) is a primary vector for numerous security threats, including phishing, malware propagation, and spam attacks, making URL-based analysis a critical task in security systems. However, existing research often focuses on static lexical features of individual URLs, overlooking deeper semantic, structural, and behavioral signals that can indicate malicious intent or evasive patterns. In this paper, we propose Behavior-Enhanced Semantic URL Embedding, a novel framework that integrates semantic, structural, and contextual information to improve the detection of security threats embedded in URLs. Our model is composed of three core modules: a semantic understanding module to extract token-level and contextual semantics, a topology structure learning module to capture hierarchical and sequential patterns of URL components, and a downstream multi-task adaptation module that fine-tunes embeddings with supervised contrastive learning for various security detection tasks. We evaluate our method across five public datasets covering key security applications such as malicious URL detection, phishing website identification, and spam filtering, consistently achieving superior performance over existing baselines. Additionally, we demonstrate the extensibility of our approach to related security tasks, showcasing its potential integration into real-world threat detection and security monitoring systems.

5 June 2025 in Neural Networks
Verified
Journal Article
Open access
LLLin Li
Lin Li
Shengda ZhuoShengda Zhuo
Shengda Zhuo
LLLin Li
Lin Li
JHJinchun He
Jinchun He
WQWangjie Qiu
Wangjie Qiu
SHShuqiang Huang
Shuqiang Huang
With the growing privacy and data contamination concerns in recommendation systems, recommendation unlearning, i.e., unlearning the impact of specific learned data, has garnered more attention. Unfortunately, existing research primarily focuses on the complete unlearning of target data, neglecting the balance between unlearning integrity, practicality, and efficiency. Two major restrictions hinder the widespread application of this unlearning paradigm in practice. First, while prior studies often assume consistent similarity among samples, they overly emphasize the local collaborative relationships between samples and central nodes, leading to an imbalance between local and global collaborative information. Second, while data partition appears to be a default setup, this evidently exacerbates the sparsity of recommendation data, which can have a potentially negative impact on recommendation quality. To fill these gaps, this paper proposes a data partitioning and submodel training strategy, named Partition Distinction with Contrastive Recommendation Unlearning (PDCRU), which aims to balance data partitioning and feature sparsity. The key idea is to extract structural features as global collaborative information for samples and introduce structural feature constraints based on sample similarity during the partitioning process. For submodel training, we leverage contrastive learning to introduce additional high-quality training signals to enhance model embeddings. Extensive experiments validate the feasibility and consistent superiority of our method over existing recommendation unlearning models in learning and unlearning. Specifically, our model achieves a 4.83% improvement in performance and a 4.64x enhancement in unlearning efficiency compared to baseline methods. The code is released at https://github.com/linli0818/PDCRU.

1 January 2026 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
Shengda ZhuoShengda Zhuo
Shengda Zhuo
HLHongguang Lin
Hongguang Lin
JHJinchun He
Jinchun He
ZLZhiying Li
Zhiying Li
BLBin Li
Bin Li
SHShuqiang Huang
Shuqiang Huang