Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/117912
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorBu, Y-
dc.creatorZhu, Y-
dc.creatorGeng, L-
dc.creatorZhou, K-
dc.date.accessioned2026-03-05T07:57:38Z-
dc.date.available2026-03-05T07:57:38Z-
dc.identifier.issn0219-1377-
dc.identifier.urihttp://hdl.handle.net/10397/117912-
dc.language.isoenen_US
dc.publisherSpringer UKen_US
dc.rights© The Author(s) 2025en_US
dc.rightsOpen 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.rightsThe 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.subjectAdversarial attacken_US
dc.subjectDiscrete optimizationen_US
dc.subjectNetwork securityen_US
dc.subjectSigned social networken_US
dc.subjectTrust systemen_US
dc.titleUnleashing the power of indirect attacks against trust prediction via preferential pathen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage4459-
dc.identifier.epage4486-
dc.identifier.volume67-
dc.identifier.issue5-
dc.identifier.doi10.1007/s10115-024-02327-9-
dcterms.abstractAdversarial 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.accessRightsopen accessen_US
dcterms.bibliographicCitationKnowledge and information systems, Mar. 2025, v. 67, no. 5, p. 4459-4486-
dcterms.isPartOfKnowledge and information systems-
dcterms.issued2025-03-
dc.identifier.scopus2-s2.0-105003275591-
dc.identifier.eissn0219-3116-
dc.description.validate202603 bcch-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_Scopus/WOSen_US
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThis 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.pubStatusPublisheden_US
dc.description.oaCategoryCCen_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
s10115-024-02327-9.pdf2.59 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.