一种攻击社交网络一致性的有效节点注入方法

IF 8 1区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Shuyu Jiang;Yunxiang Qiu;Xian Mo;Rui Tang;Wei Wang
{"title":"一种攻击社交网络一致性的有效节点注入方法","authors":"Shuyu Jiang;Yunxiang Qiu;Xian Mo;Rui Tang;Wei Wang","doi":"10.1109/TIFS.2024.3515842","DOIUrl":null,"url":null,"abstract":"The importance of social network alignment (SNA) for various downstream applications, such as social network information fusion and e-commerce recommendation, has prompted numerous professionals to develop and share SNA tools. However, malicious actors can exploit these tools to integrate sensitive user information, thereby posing cybersecurity risks. Although many researchers have explored attacking SNA (ASNA) through network modification attacks to protect users, practical feasibility remains challenging. In this study, we propose an effective node injection attack via a dynamic programming framework (DPNIA) to address the problem of modeling and solving ASNA within a limited time and balancing the costs and benefits. DPNIA models ASNA as a problem of maximizing the number of confirmed incorrect correspondent node pairs with greater similarity scores than the pairs between existing nodes, thereby making ASNA solvable. A cross-network evaluation method is employed directly to identify node vulnerabilities, facilitating progressive attacking from easy to difficult. In addition, an optimal injection strategy searching method based on dynamic programming is used to determine which links should be added between the injected and existing nodes, thereby enhancing the effectiveness of the attack at a low cost. Experiments on four real-world datasets demonstrated that DPNIA consistently and significantly surpasses various baselines when attacking both multiple networks simultaneously and a single network.","PeriodicalId":13492,"journal":{"name":"IEEE Transactions on Information Forensics and Security","volume":"20 ","pages":"589-604"},"PeriodicalIF":8.0000,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Effective Node Injection Approach for Attacking Social Network Alignment\",\"authors\":\"Shuyu Jiang;Yunxiang Qiu;Xian Mo;Rui Tang;Wei Wang\",\"doi\":\"10.1109/TIFS.2024.3515842\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The importance of social network alignment (SNA) for various downstream applications, such as social network information fusion and e-commerce recommendation, has prompted numerous professionals to develop and share SNA tools. However, malicious actors can exploit these tools to integrate sensitive user information, thereby posing cybersecurity risks. Although many researchers have explored attacking SNA (ASNA) through network modification attacks to protect users, practical feasibility remains challenging. In this study, we propose an effective node injection attack via a dynamic programming framework (DPNIA) to address the problem of modeling and solving ASNA within a limited time and balancing the costs and benefits. DPNIA models ASNA as a problem of maximizing the number of confirmed incorrect correspondent node pairs with greater similarity scores than the pairs between existing nodes, thereby making ASNA solvable. A cross-network evaluation method is employed directly to identify node vulnerabilities, facilitating progressive attacking from easy to difficult. In addition, an optimal injection strategy searching method based on dynamic programming is used to determine which links should be added between the injected and existing nodes, thereby enhancing the effectiveness of the attack at a low cost. Experiments on four real-world datasets demonstrated that DPNIA consistently and significantly surpasses various baselines when attacking both multiple networks simultaneously and a single network.\",\"PeriodicalId\":13492,\"journal\":{\"name\":\"IEEE Transactions on Information Forensics and Security\",\"volume\":\"20 \",\"pages\":\"589-604\"},\"PeriodicalIF\":8.0000,\"publicationDate\":\"2024-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Forensics and Security\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10793446/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Forensics and Security","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10793446/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

社交网络对齐(SNA)对于各种下游应用程序(如社交网络信息融合和电子商务推荐)的重要性促使许多专业人员开发和共享SNA工具。然而,恶意行为者可以利用这些工具来集成敏感的用户信息,从而带来网络安全风险。虽然许多研究人员已经探索了通过网络修改攻击攻击SNA (ASNA)来保护用户,但实际可行性仍然具有挑战性。在本研究中,我们提出了一种有效的节点注入攻击,通过动态规划框架(DPNIA)来解决有限时间内建模和求解ASNA以及平衡成本和收益的问题。DPNIA将ASNA建模为一个问题,即使已确认的不正确对应节点对的数量最大化,且相似性分数大于现有节点对,从而使ASNA可解。直接采用跨网络评估方法识别节点漏洞,便于由易到难的递进攻击。此外,采用基于动态规划的最优注入策略搜索方法,确定注入节点与现有节点之间应添加哪些链路,从而以较低的代价提高了攻击的有效性。在四个真实数据集上的实验表明,在同时攻击多个网络和单个网络时,DPNIA一致且显著地超越了各种基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Effective Node Injection Approach for Attacking Social Network Alignment
The importance of social network alignment (SNA) for various downstream applications, such as social network information fusion and e-commerce recommendation, has prompted numerous professionals to develop and share SNA tools. However, malicious actors can exploit these tools to integrate sensitive user information, thereby posing cybersecurity risks. Although many researchers have explored attacking SNA (ASNA) through network modification attacks to protect users, practical feasibility remains challenging. In this study, we propose an effective node injection attack via a dynamic programming framework (DPNIA) to address the problem of modeling and solving ASNA within a limited time and balancing the costs and benefits. DPNIA models ASNA as a problem of maximizing the number of confirmed incorrect correspondent node pairs with greater similarity scores than the pairs between existing nodes, thereby making ASNA solvable. A cross-network evaluation method is employed directly to identify node vulnerabilities, facilitating progressive attacking from easy to difficult. In addition, an optimal injection strategy searching method based on dynamic programming is used to determine which links should be added between the injected and existing nodes, thereby enhancing the effectiveness of the attack at a low cost. Experiments on four real-world datasets demonstrated that DPNIA consistently and significantly surpasses various baselines when attacking both multiple networks simultaneously and a single network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security 工程技术-工程:电子与电气
CiteScore
14.40
自引率
7.40%
发文量
234
审稿时长
6.5 months
期刊介绍: The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信