Combating temporal composition inference by high-order camouflaged network topology obfuscation

IF 4.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Computers & Security Pub Date : 2024-07-05 DOI:10.1016/j.cose.2024.103981
Xiaohui Li , Xiang Yang , Yizhao Huang , Yue Chen
{"title":"Combating temporal composition inference by high-order camouflaged network topology obfuscation","authors":"Xiaohui Li ,&nbsp;Xiang Yang ,&nbsp;Yizhao Huang ,&nbsp;Yue Chen","doi":"10.1016/j.cose.2024.103981","DOIUrl":null,"url":null,"abstract":"<div><p>Topology inference driven by non-collaborative or incomplete prior knowledge is widely used in pivotal target network sieving and completion. However, perceivable topology also allows attackers to identify the fragile bottlenecks and perform efficacious attacks that are difficult to defend against by injecting indistinguishable low-volume attacks. Most existing countermeasures are proposed to obfuscate network data or set up honeypots with adversarial examples. However, there are two challenges when adding perturbations to live network links or nodes. Firstly, the perturbations imposed on the network cannot be conveniently projected to the original network with poor scalability. Secondly, applying significant changes to network information is laborious and impractical. In short, making a good trade-off between concealment and complexity is challenging. To address the above issues, we propose a fraudulent proactive defending tactic, namely <em>HBB-TSP</em>, to protect live network privacy by combating attacks of temporal network inference. Specifically, to penetrate the critical network structures, <em>HBB-TSP</em> first brings in the Statistical Validation of Hypergraph (SVH) method to identify the pivotal connection information of the network and extract the deep backbone structure. Then, the Temporal Simple Decomposition Weighting (TSDW) strategy is introduced, which can predict the backbone network with evolution rules and add highly obfuscated features at a minimized overhead. Finally, a discriminator with multiple centrality models is used to evaluate the deceptiveness and, in turn, affect the TSDW prediction. The entire process ensures the consistency and robustness of network changes while ensuring effective adversarial resistance. Experimental results on two scale real-world datasets demonstrate the effectiveness and generalization of adversarial perturbations. In particular, it is encouraging that our proposed defending scheme outperforms the advanced countermeasures. It ensures the realization of a deceptive obfuscated network at minimum overhead and is suitable for widespread deployment in scenarios of different scales.</p></div>","PeriodicalId":51004,"journal":{"name":"Computers & Security","volume":null,"pages":null},"PeriodicalIF":4.8000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Security","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167404824002864","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Topology inference driven by non-collaborative or incomplete prior knowledge is widely used in pivotal target network sieving and completion. However, perceivable topology also allows attackers to identify the fragile bottlenecks and perform efficacious attacks that are difficult to defend against by injecting indistinguishable low-volume attacks. Most existing countermeasures are proposed to obfuscate network data or set up honeypots with adversarial examples. However, there are two challenges when adding perturbations to live network links or nodes. Firstly, the perturbations imposed on the network cannot be conveniently projected to the original network with poor scalability. Secondly, applying significant changes to network information is laborious and impractical. In short, making a good trade-off between concealment and complexity is challenging. To address the above issues, we propose a fraudulent proactive defending tactic, namely HBB-TSP, to protect live network privacy by combating attacks of temporal network inference. Specifically, to penetrate the critical network structures, HBB-TSP first brings in the Statistical Validation of Hypergraph (SVH) method to identify the pivotal connection information of the network and extract the deep backbone structure. Then, the Temporal Simple Decomposition Weighting (TSDW) strategy is introduced, which can predict the backbone network with evolution rules and add highly obfuscated features at a minimized overhead. Finally, a discriminator with multiple centrality models is used to evaluate the deceptiveness and, in turn, affect the TSDW prediction. The entire process ensures the consistency and robustness of network changes while ensuring effective adversarial resistance. Experimental results on two scale real-world datasets demonstrate the effectiveness and generalization of adversarial perturbations. In particular, it is encouraging that our proposed defending scheme outperforms the advanced countermeasures. It ensures the realization of a deceptive obfuscated network at minimum overhead and is suitable for widespread deployment in scenarios of different scales.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过高阶伪装网络拓扑混淆对抗时序构成推理
由非协作或不完整先验知识驱动的拓扑推断被广泛应用于关键目标网络的筛选和完善。然而,可感知拓扑也允许攻击者识别脆弱的瓶颈,并通过注入难以区分的低量攻击来实施难以防御的有效攻击。现有的应对措施大多是通过混淆网络数据或设置具有对抗性实例的 "巢穴"(honeypots)来实现的。然而,在实时网络链接或节点上添加扰动有两个挑战。首先,对网络施加的扰动无法方便地投射到原始网络,可扩展性差。其次,对网络信息进行重大更改既费力又不切实际。总之,如何在隐蔽性和复杂性之间取得良好的平衡是一项挑战。针对上述问题,我们提出了一种欺诈性主动防御策略,即 HBB-TSP,通过对抗时态网络推理攻击来保护实时网络隐私。具体来说,为了穿透关键网络结构,HBB-TSP 首先引入超图统计验证(SVH)方法,识别网络的关键连接信息,提取深层骨干结构。然后,引入时间简单分解加权(Temporal Simple Decomposition Weighting,TSDW)策略,利用演化规则预测骨干网络,并以最小的开销添加高混淆特征。最后,使用具有多个中心性模型的判别器来评估欺骗性,进而影响 TSDW 预测。整个过程确保了网络变化的一致性和鲁棒性,同时保证了有效的抗对抗性。在两个大规模真实数据集上的实验结果证明了对抗性扰动的有效性和通用性。尤其令人鼓舞的是,我们提出的防御方案优于先进的对抗措施。它确保以最小的开销实现欺骗性混淆网络,适合在不同规模的场景中广泛部署。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Security
Computers & Security 工程技术-计算机:信息系统
CiteScore
12.40
自引率
7.10%
发文量
365
审稿时长
10.7 months
期刊介绍: Computers & Security is the most respected technical journal in the IT security field. With its high-profile editorial board and informative regular features and columns, the journal is essential reading for IT security professionals around the world. Computers & Security provides you with a unique blend of leading edge research and sound practical management advice. It is aimed at the professional involved with computer security, audit, control and data integrity in all sectors - industry, commerce and academia. Recognized worldwide as THE primary source of reference for applied research and technical expertise it is your first step to fully secure systems.
期刊最新文献
A survey on privacy and security issues in IoT-based environments: Technologies, protection measures and future directions Practically implementing an LLM-supported collaborative vulnerability remediation process: A team-based approach An enhanced Deep-Learning empowered Threat-Hunting Framework for software-defined Internet of Things Editorial Board ReckDroid: Detecting red packet fraud in Android apps
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1