Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/117912
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | - |
| dc.creator | Bu, Y | - |
| dc.creator | Zhu, Y | - |
| dc.creator | Geng, L | - |
| dc.creator | Zhou, K | - |
| dc.date.accessioned | 2026-03-05T07:57:38Z | - |
| dc.date.available | 2026-03-05T07:57:38Z | - |
| dc.identifier.issn | 0219-1377 | - |
| dc.identifier.uri | http://hdl.handle.net/10397/117912 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Springer UK | en_US |
| dc.rights | © The Author(s) 2025 | en_US |
| dc.rights | Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/. | en_US |
| dc.rights | The following publication Bu, Y., Zhu, Y., Geng, L. et al. Unleashing the power of indirect attacks against trust prediction via preferential path. Knowl Inf Syst 67, 4459–4486 (2025) is available at https://doi.org/10.1007/s10115-024-02327-9. | en_US |
| dc.subject | Adversarial attack | en_US |
| dc.subject | Discrete optimization | en_US |
| dc.subject | Network security | en_US |
| dc.subject | Signed social network | en_US |
| dc.subject | Trust system | en_US |
| dc.title | Unleashing the power of indirect attacks against trust prediction via preferential path | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.spage | 4459 | - |
| dc.identifier.epage | 4486 | - |
| dc.identifier.volume | 67 | - |
| dc.identifier.issue | 5 | - |
| dc.identifier.doi | 10.1007/s10115-024-02327-9 | - |
| dcterms.abstract | Adversarial attacks in network security are a growing concern, prompting the need for innovative strategies to enhance both attack and defense mechanisms. This paper explores ways to improve adversarial attacks on the fairness and goodness algorithm (FGA) and review to reviewer (REV2), focusing on predicting trust within signed graphs. Unlike traditional time-based models, FGA and REV2 rely on iterative processes for trust propagation. By analyzing network structures, we identify strong ties and weak ties within FGA and discover preferential paths in REV2 that significantly impact information spread during algorithm iterations. Based on these insights, we propose a new approach called the vicinage attack, which enhances adversarial attacks by strategically targeting edges along these critical pathways. Our work highlights adversarial perturbation patterns that affect trust prediction on signed graphs and emphasizes their wide-reaching impact. These findings not only advance adversarial attack techniques but also deepen our understanding of trust propagation patterns. By clarifying the propagation bias in FGA and REV2, this research provides valuable insights for improving network security and developing better adversarial mitigation techniques in trust prediction. | - |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | Knowledge and information systems, Mar. 2025, v. 67, no. 5, p. 4459-4486 | - |
| dcterms.isPartOf | Knowledge and information systems | - |
| dcterms.issued | 2025-03 | - |
| dc.identifier.scopus | 2-s2.0-105003275591 | - |
| dc.identifier.eissn | 0219-3116 | - |
| dc.description.validate | 202603 bcch | - |
| dc.description.oa | Version of Record | en_US |
| dc.identifier.FolderNumber | OA_Scopus/WOS | en_US |
| dc.description.fundingSource | RGC | en_US |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | This research was partly supported by the National Science Foundation of China (No. 62106210) and the Hong Kong Research Grant Council (No. PolyU25210821). | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.description.oaCategory | CC | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| s10115-024-02327-9.pdf | 2.59 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



