ZYZhihai Yang

Zhihai Yang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Zhihai Yang has a total of 31 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Is There a Bottom Line for Poisoning? Detecting High-Concealed Injection Attacks for Recommendation

    by Yan Feng, Zhihai Yang, Kexin Li, Jianhua He, Jianxin Li, Pinghui Wang, Zhiquan Liu

    Recommender systems (RSs) are widely adopted due to their effectiveness in modeling user preferences and generating personalized recommendations. However, data poisoning attacks (PAs) manipulate recommendation results by injecting fake user profiles, thereby affecting the quality and accuracy of RSs. Moreover, emerging high-concealed PAs (HCPAs) achieve greater evasion of detection by controlling the cost of the attack, simulating the behavior patterns of benign users, and carrying out the attack with less prior knowledge. The HCPAs bring challenges: (1) the very low cost of attacks not only leads to an imbalance in data distribution but also introduces a large amount of accidental co-occurrence noise; (2) the behavioral patterns similar to benign users make it difficult to describe the characteristics of HCPAs; and (3) the prior knowledge for detecting HCPAs in real scenarios is very limited. To address these challenges, we propose STOP, an orthogonal projection bi-hypersphere detection method built on multi-view relational disentanglement and information-consistent fusion. First, we model the distributional preferences of user ratings to eliminate rating and popularity bias, and construct a co-occurrence association graph to suppress accidental overlaps. To address data imbalance caused by HCPAs, second, we introduce a distributional-consensus importance screening method that filters out benign users weakly associated with potential attackers. To address the issues of noise and the difficulty in feature characterization, third, we propose a multi-view relational disentanglement and information-consistent fusion method, which can eliminate redundant relationships, separate key relations into sequence-varying and sequence-stable components over rating sequences, and retain task-related relationships. Finally, inspired by the “convergence theorem”, we design an orthogonal projection bi-hypersphere boundary learning detection method to reduce the high false alarm rate (FAR). We extensively evaluate STOP under various HCPA scenarios, demonstrating its superiority over existing methods with an average 12.34% improvement in detection rate and an average 2.75% reduction in FAR. Furthermore, forensic analysis on real-world unlabeled data reveals distinct attacker “fingerprints”, such as extreme ratings, contradictory review styles, and analysis of target items, validating STOP's reliability in practical applications.

  • Can Vibration Patterns Identify Users? Authentication for Smartphone-Watch Collaboration

    by Zicheng Cui, Zhihai Yang, Zhiquan He, Chenxu Kong, Jianhua He, Jianxin Li, Pinghui Wang, Zhiquan Liu

  • Open Access

    Attacks and Detections in Recommender Systems: A Comprehensive Analysis for Models, Progresses, and Trends

    by Yan Feng, Zhihai Yang, Kexin Li, Jianxin Li, Pinghui Wang, Zhiquan Liu

    Recommender systems (RSs), as crucial components of online services, can help users efficiently obtain information they may like. In reality, RSs face long-term threats. Attackers manipulate recommendation results by injecting malicious data in order to obtain benefits. At present, research on the security of RSs lacks a comprehensive understanding of attack capabilities. Moreover, existing defense strategies have not yet been systematically associated with attack characteristics. More importantly, existing defense methods rarely focus on real unlabeled data in practical application scenarios for anomaly detection and forensics. Therefore, this survey systematically analyzes the security of RSs and provides new insights. Specifically, we first categorize attack models from an attack perspective into: attack strategies based on targets, attack strategies against security and privacy, attack strategies based on prior knowledge, and attack strategies against other RSs. From a perspective of defense, existing detection models, second, can be divided into: behavioral representation based on statistics, detection based on hidden features, detection against privacy attacks, anomaly discovery based on association mining, and abnormality forensics for real-world data. Finally, we propose several potential research directions aimed at providing guidance for the security research of RSs.


  • Open Access

    Cross-Model Watermarking via Discriminative Samples for Secure Authentication

    by Juan Zhao, Yudao Sun, Zhihai Yang, Cai Xu, Hongji Chen, Fan Zhang, Jianxin Li

  • Meet Trick With Trick: Revealing Collusion Intentions in Highly Concealed Poisoning Behavior

    by Zhihai Yang, Yan Feng, Jianxin Li, Pinghui Wang, Zhiquan Liu

    Recommender systems (RSs), as a high data-driven application, have been extensively developed and widely deployed in various web services, in order to help users locate products or services that they may be interested in. Meanwhile, the openness and vulnerability of RSs have given rise to the development of data poisoning attacks. However, defending these evolving threats presents potential challenges: (a) faced with highly concealed or small-scale data poisoning, the attack behavior is very difficult to characterize; (b) the identification area of attack target is difficult to be determined for highly concealed injection attacks; and (c) the prior knowledge for detecting fake injection attacks in real scenarios is very limited. Complementary to existing works, this paper proposes METT, a divide-and-conquer detection method that addresses these fundamental yet underexplored issues. We first propose to exploit causality inference based on both group-level and individual-level unfairness sequences to enhance the reliability of user-item symbiotic associations. We then develop a novel method for early detection of attack target, named ideaT. Finally, we further discriminate fake injections using a disturbance tolerance mechanism in ambiguous boundaries of behavior. Extensive experiments based on synthetic and real data demonstrate that METT outperforms competing baselines in different cases. Specifically, METT can reduce the false alarm rate (FAR) by an average of 21% for detecting $\mathcal {S}$-attacks, an average of 18% for detecting profile injection attacks, an average of 26% for detecting reverse attacks, and an average of 17% for detecting optimal-injection attacks compared with competing benchmarks. Moreover, METT also has an average advantage of 10% and 20% in FARs for spotting hybrid promotion and demotion attacks, respectively. According to prior knowledge learned from synthetic data, additionally, we discover interesting findings on real data, such as suspicious duplicate behavior, benign users with duplicate behavior, and identified shilling behavior. Importantly, we reveal that the specificities of data poisoning attacks or fake injections in real-world scenarios entail important implications from a defense perspective.


  • Open Access

    SEDAT: A Stacked Ensemble Learning-Based Detection Model for Multiscale Network Attacks

    by Yan Feng, Zhihai Yang, Qindong Sun, Yanxiao Liu

    Anomaly detection for network traffic aims to analyze the characteristics of network traffic in order to discover unknown attacks. Currently, existing detection methods have achieved promising results against high-intensity attacks that aim to interrupt the operation of the target system. In reality, attack behaviors that are commonly exhibited are highly concealed and disruptive. In addition, the attack scales are flexible and variable. In this paper, we construct a multiscale network intrusion behavior dataset, which includes three attack scales and two multiscale attack patterns based on probability distribution. Specifically, we propose a stacked ensemble learning-based detection model for anomalous traffic (or SEDAT for short) to defend against highly concealed multiscale attacks. The model employs a random forest (RF)-based method to select features and introduces multiple base learning autoencoders (AEs) to enhance the representation of multiscale attack behaviors. In addressing the challenge of a single model’s inability to capture the regularities of multiscale attack behaviors, SEDAT is capable of adapting to the complex multiscale characteristics in network traffic, enabling the prediction of network access behavior. Comparative experiments demonstrate that SEDAT exhibits superior detection capabilities in multiscale network attacks. In particular, SEDAT achieves an improvement of at least 5% accuracy over baseline methods for detecting multiscale attacks.


  • Open Access

    Progressive Reconstruction on Region-Based Secret Image Sharing

    by Yanxiao Liu, Qindong Sun, Zhihai Yang, Yongluan Zhou, Weihua Zhao, Dantong Shi

    (k,n) threshold progressive secret image sharing (PSIS) has become an important issue in recent years. In (k,n) PSIS, a secret image is encrypted into n shadows such that k to n shadows can gradually reconstruct the secret image. Since an image can usually be divided into different regions in such a way that each region includes information with different importance levels, region-based PSIS has also been proposed where the reconstruction of different regions requires different thresholds on the shadow numbers. In this work, we propose new region-based (k,n) PSIS that achieves a novel reconstruction model, where all regions possess the property of (k,n) threshold progressive reconstruction, but the same number of shadows recovers a lower proportion of information in regions with a higher importance level. This new reconstruction model can further complete the application of region-based PSIS, where each region has an equal minimum threshold for reconstruction, and the difference in importance levels between regions can be reflected in the proportion of the recovered image using the same number of shadows. A theoretical analysis proves the correctness of the proposed scheme, and the experimental results from four secret images also show the practicality and effectiveness of the proposed scheme.


  • Three Birds With One Stone: User Intention Understanding and Influential Neighbor Disclosure for Injection Attack Detection

    by Zhihai Yang, Qindong Sun, Zhaoli Liu

    Recommender system, as a data-driven way to help customers locate products that match their interests, is increasingly critical for providing competitive customer suggestions in many web services. However, recommender systems are highly vulnerable to malicious injection attacks due to their fundamental vulnerabilities and openness. With the endless emergence of new attacks, how to provide a feasible way for defending different malicious threats against online recommendations is still an under-explored issue. In this paper, we explore a new way to defend malicious injection attacks through user intention understanding and influential neighbour disclosure. Specifically, we propose a detection approach, termed TBOS ( T hree B irds with O ne S tone), to deal with different malicious threats. In TBOS , we first develop the discrimination of attack target by combining global influence evaluation and risk attitude estimation of users. In order to make TBOS controllable, second, we propose to incorporate an optimal denoising mechanism to remove disturbed information before detection. To enhance the representativeness and predictability of detection model, finally, we propose to leverage a behavioral label propagation mechanism based on constructed label space for the determination of malicious injection behaviors. Extensive experiments on both synthetic and real data demonstrate that TBOS outperforms all baselines in different cases. Particularly, the detection performance of TBOS can achieve an improvement of 6.08% FAR (false alarm rate) for optimal-injection attacks, an improvement of 3.83% FAR in average for co-visitation injection attacks, as well as an improvement of 2.3% for profile injection attacks over benchmarks in terms of FAR while keeping the highest DR (detection rate). Additional experiments on real-world data show that TBOS brings an improvement with the advantage of 6.5% FAR in average compared with baselines.