Hao Tang

Hao Tang

Auto-generated profile, based on publicly available information

Hao Tang

School of Economics and Management, Tongji University, Shanghai, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
30 April 2024 in Security and Safety
Verified
Journal Article
Open access
PDF file
CWCheng Wang
Cheng Wang
HTHao Tang
Hao Tang
HZHangyu Zhu
Hangyu Zhu
JZJunhan Zheng
Junhan Zheng
CJChangjun Jiang
Changjun Jiang
The issues of both system security and safety can be dissected integrally from the perspective of behavioralappropriateness. That is, a system that is secure or safe can be judged by whether the behavior of certain agent(s) isappropriateor not. Specifically, a so-calledappropriate behaviorinvolves the right agent performing the right actions at the right time under certain conditions. Then, according to different levels of appropriateness and degrees of custodies, behavioral authentication can be graded into three levels,i.e., the authentication of behavioralIdentity,Conformity, andBenignity. In a broad sense, for the security and safety issue, behavioral authentication is not only an innovative and promising method due to its inherent advantages but also a critical and fundamental problem due to the ubiquity of behavior generation and the necessity of behavior regulation in any system. By this classification, this review provides a comprehensive examination of the background and preliminaries of behavioral authentication. It further summarizes existing research based on their respective focus areas and characteristics. The challenges confronted by current behavioral authentication methods are analyzed, and potential research directions are discussed to promote the diversified and integrated development of behavioral authentication.

16 January 2024 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
HTHao Tang
Hao Tang
CWCheng Wang
Cheng Wang
JZJianguo Zheng
Jianguo Zheng
CJChangjun Jiang
Changjun Jiang
Graph neural networks (GNNs) are playing exciting roles in the application scenarios where features are hidden in information associations. Fraud prediction of online credit loan services (OCLSs) is such a typical scenario. But it has another rather critical challenge, i.e., the scarcity of data labels. Fortunately, GNNs can also cope with this problem due to their good ability of semi-supervised learning by mining structure and feature information within graphs. Nevertheless, the gain of internal information is often too limited to help GNNs handle the extreme deficiency of labels with high performance beyond the basic requirement of fraud prediction in OCLSs. Therefore, adding labels from the experts, such as manually adding labels through rules, has become a logical practice. However, the existing rule engines for OCLSs have the confliction problem among continuously accumulated rules. To address this issue, we propose a Snorkel-based Semi-Supervised GNN (S3GNN). Under S3GNN, we specially design an upgraded version of the rule engines, called Graph-Oriented Snorkel (GOS), a graph-specific extension of Snorkel, a widely used weakly supervised learning framework, to design rules by subject matter experts (SMEs) and resolve confliction. In particular, in the graph of an anti-fraud scenario, each node pair may have multiple different types of edges, so we propose the Multiple Edge-Types Based Attention mechanism. In general, for the heterogeneous information and multiple relations in the graph, we first obtain the embedding of applicant nodes by aggregating the representation of attribute nodes, and then use the attention mechanism to aggregate neighbor nodes on multiple meta-paths to get ultimate applicant node embedding. We conduct experiments over the real-life data of a large financial platform. The results demonstrate that S3GNN can outperform the state-of-the-art methods, including the method of pilot platform.

20 November 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
CWCheng Wang
Cheng Wang
HTHao Tang
Hao Tang
HZHangyu Zhu
Hangyu Zhu
CJChangjun Jiang
Changjun Jiang
Anti-fraud engineering for online credit loan (OCL) platforms is getting more challenging due to the developing specialization of gang fraud. Associations are critical features referring to assessing the credibility of loan applications for OCL fraud prediction. State-of-the-art solutions employ graph-based methods to mine hidden associations among loan applications effectively. They perform well based on the information asymmetry which is guaranteed by the huge advantage of platforms over fraudsters in terms of data quantity and quality at their disposal. The inherent difficulty that can be foreseen is the data isolation caused by mistrust between multiple platforms and data control legislations for privacy preservation. To maintain the advantage owned by the platforms, we design a privacy-preserving distributed graph learning framework that ensures critical association repairs by merging parameter sharing and data sharing. Specially, we propose the association reconstruction mechanism (ARM) that consists of the devised exploration, processing, transmission and utilization schemes to realize data sharing. For parameter sharing, we design a hybrid encryption technique to protect privacy during collaboratively learning graph neural network (GNN) models among different financial client platforms. We conduct the experiments over real-life data from large financial platforms. The results demonstrate the effectiveness and efficiency of our proposed methods.

7 August 2024 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
HTHao Tang
Hao Tang
CWCheng Wang
Cheng Wang
SCShengbo Chang
Shengbo Chang
JZJunqi Zhang
Junqi Zhang
Centralized training and decentralized execution (CTDE) paradigm is widely employed to address the nonstationary and partial observability in multiagent reinforcement learning (MARL). One of the main challenges that restricts the performance of the CTDE paradigm is credit assignment. Existing methods cannot sufficiently energize each agent for exploring a broader solution space without compromising performance or factorization complexity. In this article, we propose a self-incentive credit assignment scheme to prioritize individual agent actions based on a novel factorization method called multi-head residual value factorization (MRVF) rather than being constrained by the quantity of collective policies. It learns an extra representation of value gradients from the cooperative behaviors and factorizes the residual global joint action value as a monotonic function, which can effectively improve the representability of the value function. Theoretical analysis indicates that our method has stronger representational ability and satisfies the individual-global-max (IGM) condition. Extensive experiments validate that our method achieves significant performance improvement in terms of both the learning speed and stability; particularly, it gains the best performance on two super hard maps of the widely used benchmark StarCraft multiagent challenge (SMAC) while the performances on other scenarios of SMAC are better or as well as the state-of-the-art baseline.

19 August 2025 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
HTHao Tang
Hao Tang
CWCheng Wang
Cheng Wang
ZHZhu Hongzi
Zhu Hongzi
Obtaining dedicated fraud detection models is important for financial risk management. Online transaction platforms traditionally rely on local data to accumulate domain knowledge and establish fraud detection models to detect fraud. This naturally makes those online trading platforms with limited data and hardware resources more susceptible to fraudulent transactions. In this article, we propose GMDK, which elegantly integrates credible knowledge generation and collaborative model training on weak transaction platforms. Specifically, we decouple the local model parameters into base and specialized layers to learn different levels of knowledge. Local platforms milk different source models with delicately designed two-factor cues to acquire both cross-domain and credible domain-specific knowledge. To this end, source models first aggregate local base layer parameters of each local model to obtain cross-domain base layers for all local models. Then, distinct semantic distribution prototypes generated by heterogeneous source models on desensitized and sampled local business data are aligned to update local models. We conduct extensive experiments on various real-world online transaction platforms, and the results demonstrate that local models trained with GMDK can achieve state-of-the-art fraud detection accuracy in each target transaction area.

3 November 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HTHao Tang
Hao Tang
CWCheng Wang
Cheng Wang
KCKunfeng Chen
Kunfeng Chen
CJChangjun Jiang
Changjun Jiang
Advanced persistent threat groups are launching extensive attacks on national critical institutions and key infrastructures. Learning contextual information among entities using graph neural network models based on provenance graphs has demonstrated excellent performance in threat detection. However, due to constraints of transmission costs and privacy concerns, existing threat detection methods typically rely solely on audit logs within their own domains, which contain only part of the attacker’s behavior. Attackers have also recognized this, so they brazenly carry out attack attempts and expand their impact. The information asymmetry across multiple domains indeed significantly impacts the efficiency and timeliness of APT detection. This paper introduces a novel cross-domain threat detection (CDTD) scheme based on collaborative graph learning for effective and early APT detection. The core idea of CDTD is to foster mutual benefits by utilizing potential cross-domain general knowledge from heterogeneous data and collaborating on precious threat intelligence, which could mitigate information asymmetry. Experimental results demonstrate that the proposed method achieves state-of-the-art detection capabilities and reduces the workload of security analysts. Additionally, the distributed detection scheme significantly decreases system overheads in terms of network bandwidth, memory usage, and execution time, which shows promising potential for broad applications of the proposed scheme.