2022 International Conference on Computer Communications and Networks (ICCCN)最新文献

筛选
英文 中文
Evaluating Feature Robustness for Windows Malware Family Classification Windows恶意软件家族分类特征鲁棒性评价
2022 International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2022-07-01 DOI: 10.1109/ICCCN54977.2022.9868914
Adam Duby, Teryl Taylor, Gedare Bloom, Yanyan Zhuang
{"title":"Evaluating Feature Robustness for Windows Malware Family Classification","authors":"Adam Duby, Teryl Taylor, Gedare Bloom, Yanyan Zhuang","doi":"10.1109/ICCCN54977.2022.9868914","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868914","url":null,"abstract":"Machine learning approaches to classify malware by family save analysts valuable time during incident response. A key challenge for these approaches is selecting features that are robust against concept drift, which describes the change in malware over time. In this paper, we evaluate a dynamic feature set based on Windows handles (e.g., files, registry keys) for malware family classification. Specifically, we examine the features' vulnerabilities and evaluate their robustness against concept drift. We curated a novel dataset that simulates the manipulations that attackers may invoke on malware samples. We demonstrate improved robustness to concept drift over traditional API call-based features by training machine learning classifiers on malware collected in the wild, and testing the classifiers against samples that underwent manipulations. Further, we investigate time decay due to concept drift using temporally consistent evaluations that do not assume access to newer information. The evaluation shows that our features are robust against malware obfuscation. Furthermore, we empirically demonstrate how malware labeling conventions (malware type or family) can affect results, and make recommendations for dataset construction.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134545420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Inferring User Activities from IoT Device Events in Smart Homes: Challenges and Opportunities 从智能家居中的物联网设备事件推断用户活动:挑战与机遇
2022 International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2022-07-01 DOI: 10.1109/ICCCN54977.2022.9868917
Xuanli Lin, Yinxin Wan, Kuai Xu, Feng Wang, G. Xue
{"title":"Inferring User Activities from IoT Device Events in Smart Homes: Challenges and Opportunities","authors":"Xuanli Lin, Yinxin Wan, Kuai Xu, Feng Wang, G. Xue","doi":"10.1109/ICCCN54977.2022.9868917","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868917","url":null,"abstract":"The ubiquitous deployment of IoT devices in smart homes has led to growing research interests in studying the home network traffic for various applications such as network measurements, device profiling, and IoT device event inference. Recent studies have shown that user activities can be inferred from a home network using extracted device event logs. However, existing solutions for user activity inference such as IoTMosaic and $text{E2AP}$ have limitations when handling ambiguities caused by device malfunctions. In this paper, we first identify the challenges faced by the existing user activity inference algorithms and the root causes of their poor performances on certain types of inputs. We then show that useful information can still be obtained even in situations where device malfunctions introduce ambiguities in user activity patterns. We achieve so by designing an extension to the existing algorithms. We also apply our extension in a digital forensics application. Our extensive experimental evaluations demonstrate that our solutions can effectively provide insights to user activity inference despite the presence of indistinguishable user activity patterns.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128790382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Defense-Attack Game under Multiple Preferences and Budget Constraints with Equilibrium 多偏好和预算约束下具有均衡的攻防博弈
2022 International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2022-07-01 DOI: 10.1109/ICCCN54977.2022.9868861
Nadia Niknami, Abdalaziz Sawwan, Jie Wu
{"title":"A Defense-Attack Game under Multiple Preferences and Budget Constraints with Equilibrium","authors":"Nadia Niknami, Abdalaziz Sawwan, Jie Wu","doi":"10.1109/ICCCN54977.2022.9868861","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868861","url":null,"abstract":"Cyber-security research often focuses on attack-defense games where a strategic attacker seeks to destroy the defender's targets or kill him. In such a game there is a defender who just try to protect himself. In the real world, players can choose to protect themselves as well as kill their opponents to maximize their overall gain. In this case, the player allocates their budget for both defending and attacking actions and decides how well to attack and how well to defend against others. Players should allocate their budgets appropriately for each action throughout multiple rounds when playing such a game. The probabilities of surviving and killing in each round are determined by what happened in the previous rounds and the amount of the remaining budget. Players can continue playing until they die or run out of money. It is possible for the player not to be aware of everything his opponent does. Despite knowing that his opponent is playing according to one of the possible types, he cannot see which action exactly he is taking. Likewise, it may be the case that the player only sees the opponent's action, but does not know what its objective is. To meet this challenge, this paper develops a game where players decide how to allocate resources when they have partial information. For a model with complete information, equilibrium can be found and, as an extension, models with incomplete and imperfect information are also discussed. Our simulation examines how utility changes based on prior beliefs, total budgets, costs, and uncertainty.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126545347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tracing Tor Hidden Service Through Protocol Characteristics 通过协议特征跟踪隐藏服务
2022 International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2022-07-01 DOI: 10.1109/ICCCN54977.2022.9868859
Yi Qin, Tianming Zheng, Yue Wu, Futai Zou
{"title":"Tracing Tor Hidden Service Through Protocol Characteristics","authors":"Yi Qin, Tianming Zheng, Yue Wu, Futai Zou","doi":"10.1109/ICCCN54977.2022.9868859","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868859","url":null,"abstract":"Tor is a relay-based communication network that provides users with anonymous access to the Internet. Tor hidden services protect the identities of the content publishers to achieve anonymity and anti-censorship. However, hidden services are abused to conduct illegal activities, including hosting botnets and trading drugs. This paper proposes a tracing approach to locate illegal hidden services based on the Tor protocol characteristics, which allows a Tor client to embed a signal into a Tor circuit connecting with the illegal hidden service. Once the Tor node nearest to the the hidden service detects the signal, the identity of the hidden service can be revealed. Our approach is simple, powerful, and stable compared with previous methods. We implemented the approach and performed experiments over the Tor network, whose results show that our approach is feasible and effective, with 100% accuracy, 99.25% true positive rate, and zero false positive rate.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116396285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IoBT-OS: Optimizing the Sensing-to-Decision Loop for the Internet of Battlefield Things IoBT-OS:优化战场物联网的感知到决策回路
2022 International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2022-07-01 DOI: 10.1109/ICCCN54977.2022.9868920
Dongxin Liu, T. Abdelzaher, Tianshi Wang, Yigong Hu, Jinyang Li, Shengzhong Liu, M. Caesar, Deepti Kalasapura, Joydeep Bhattacharyya, N. Srour, Jae H. Kim, Guijun Wang, Greg Kimberly, Shouchao Yao
{"title":"IoBT-OS: Optimizing the Sensing-to-Decision Loop for the Internet of Battlefield Things","authors":"Dongxin Liu, T. Abdelzaher, Tianshi Wang, Yigong Hu, Jinyang Li, Shengzhong Liu, M. Caesar, Deepti Kalasapura, Joydeep Bhattacharyya, N. Srour, Jae H. Kim, Guijun Wang, Greg Kimberly, Shouchao Yao","doi":"10.1109/ICCCN54977.2022.9868920","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868920","url":null,"abstract":"Recent concepts in defense herald an increasing degree of automation of future military systems, with an emphasis on accelerating sensing-to-decision loops at the tactical edge, reducing their network communication footprint, and improving the inference quality of intelligent components in the loop. These requirements pose resource management challenges, calling for operating-system-like constructs that optimize the use of limited computational resources at the tactical edge. This paper describes these challenges and presents IoBT-OS, an operating system for the Internet of Battlefield Things that aims to optimize decision latency, improve decision accuracy, and reduce corresponding resource demands on computational and network components. A simple case-study with initial evaluation results is shown from a target tracking application scenario.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116237090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Security and Threats of Intelligent Reflecting Surface Assisted Wireless Communications 智能反射面辅助无线通信的安全性与威胁
2022 International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2022-07-01 DOI: 10.1109/ICCCN54977.2022.9868867
H. Tang, S. Sarp, Yanxiao Zhao, Wei Wang, Chunsheng Xin
{"title":"Security and Threats of Intelligent Reflecting Surface Assisted Wireless Communications","authors":"H. Tang, S. Sarp, Yanxiao Zhao, Wei Wang, Chunsheng Xin","doi":"10.1109/ICCCN54977.2022.9868867","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868867","url":null,"abstract":"Intelligent Reflecting Surface (IRS) has been demonstrated as a promising and innovative technology for next-generation wireless communications. It can be utilized to flexibly re-configure the fundamental communication environment to realize low-cost, energy-saving, and low-interference wireless communications. On the other hand, malicious users may also utilize the powerful capability of the IRS to re-configure the communication environment to achieve an advantageous position to launch security attacks such as eavesdropping and jamming wireless networks. Therefore, while the integration of IRS into wireless communications brings promising new opportunities, it also raises significant concerns from the security perspective. This issue has not been thoroughly studied in the literature. In this paper, we first introduce the recent works of using IRS in wireless communications by grouping them into two categories: 1) securing communication via IRS and 2) launching attacks using IRS. We then derive a critical performance metric, the Signal-to-Noise Ratio (SNR), for evaluating IRS-assisted wireless communication systems. Next, we present four typical scenarios of utilizing IRS for security or threats to wireless communications. At last, we evaluate the IRS-assisted system with regard to the SNR performance affected by the IRS in those four scenarios toward a deeper understanding of the potential of IRS-assisted wireless communication systems in terms of security and threats.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"39 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114102661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Graph Representation of Computer Network Resources for Precise Allocations 计算机网络资源精确分配的图形表示
2022 International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2022-07-01 DOI: 10.1109/ICCCN54977.2022.9868852
Stuart Baxley, D. Gurkan, Hamidreza Validi, Illya V. Hicks
{"title":"Graph Representation of Computer Network Resources for Precise Allocations","authors":"Stuart Baxley, D. Gurkan, Hamidreza Validi, Illya V. Hicks","doi":"10.1109/ICCCN54977.2022.9868852","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868852","url":null,"abstract":"Distributed networked systems form an essential resource for computation and applications ranging from commercial, military, scientific, and research communities. Allocation of resources on a given infrastructure is realized through various mapping systems that are tailored towards specific use cases of the requesting applications. While HPC system requests demand compute resources heavy on processor and memory, cloud applications may demand distributed web services that are composed of networked processing and some memory. All resource requests allocate on the infrastructure with some form of network connectivity. However, during mapping of resources, the features and topology constraints of network components are typically handled indirectly through abstractions of user requests. This paper is on a novel graph representation that enables precise mapping methods for distributed networked systems. The proposed graph representations are demonstrated to allocate specific network components and adjacency requirements of a requested graph on a given infrastructure. Furthermore, we report on application of business policy requirements that resulted in increased utilization and a gradual decrease in idle node count as requests are mapped using our proposed methods.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114452099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Internet Security Aesthetics: Can internet transparency afford social trust? 网络安全美学:网络透明能否提供社会信任?
2022 International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2022-07-01 DOI: 10.1109/ICCCN54977.2022.9868880
Fiona Carroll, Rhyd Lewis
{"title":"Internet Security Aesthetics: Can internet transparency afford social trust?","authors":"Fiona Carroll, Rhyd Lewis","doi":"10.1109/ICCCN54977.2022.9868880","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868880","url":null,"abstract":"The internet has made everything convenient. Through the world wide web it has almost single-handily trans-formed the way we live our lives. In doing so, we have become so fuelled by cravings for fast and cheap web connections that we find it difficult to take in the bigger picture. It is widely documented that we need a safer and more trusting internet, but few know or agree on what this actually means. This paper introduces a new body of research that explores whether there needs to be a fundamental shift in how we design and deliver these online spaces. In detail, the authors suggest the need for an internet security aesthetic that opens up the internet (from end to end) to fully support the people that are using it. Going forward, this research highlights that social trust needs to be a key concern in defining the future value of the internet.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126721797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
FLOR: A Federated Learning-based Music Recommendation Engine FLOR:一个基于学习的联邦音乐推荐引擎
2022 International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2022-07-01 DOI: 10.1109/ICCCN54977.2022.9868921
Jasper Sha, Nathaniel Basara, Joseph Freedman, Hailu Xu
{"title":"FLOR: A Federated Learning-based Music Recommendation Engine","authors":"Jasper Sha, Nathaniel Basara, Joseph Freedman, Hailu Xu","doi":"10.1109/ICCCN54977.2022.9868921","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868921","url":null,"abstract":"Music recommendations are normally based on a users prior artist and genre preference, or based on a similar users preference. This may result in recommendations for users being limited to subsections of artists and sub-genres, rather than offering an exploration of different genres that are similar to the user's vocal preferences. In this work, we propose a federated learning-based approach that scalably tunes music clusters to accurately describe users' preferences in a particular genre. It uses deep clustering on frequency sets and mel-spectrograms of songs. It can improve song recommendations based on the user's musical tastes.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126363136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
The 31st International Conference on Computer Communications and Networks 第31届计算机通信与网络国际会议
2022 International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2022-07-01 DOI: 10.1109/icccn54977.2022.9868860
{"title":"The 31st International Conference on Computer Communications and Networks","authors":"","doi":"10.1109/icccn54977.2022.9868860","DOIUrl":"https://doi.org/10.1109/icccn54977.2022.9868860","url":null,"abstract":"","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126519135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书