Agent-based trace learning in a recommendation-verification system for cybersecurity

W. Casey, Evan Wright, J. Morales, Michael Appel, Jeffrey Gennari, B. Mishra
{"title":"Agent-based trace learning in a recommendation-verification system for cybersecurity","authors":"W. Casey, Evan Wright, J. Morales, Michael Appel, Jeffrey Gennari, B. Mishra","doi":"10.1109/MALWARE.2014.6999404","DOIUrl":null,"url":null,"abstract":"Agents in a social-technological network can be thought of as strategically interacting with each other by continually observing their own local or hyperlocal information and communicating suitable signals to the receivers who can take appropriate actions. Such interactions have been modeled as information-asymmetric signaling games and studied in our earlier work to understand the role of deception, which often results in general loss of cybersecurity. While there have been attempts to model and check such a body of agents for various global properties and hyperproperties, it has become clear that various theoretical obstacles against this approach are unsurmountable. We instead advocate an approach to dynamically check various liveness and safety hyperproperties with the help of recommenders and verifiers; we focus on empirical studies of the resulting signaling games to understand their equilibria and stability. Agents in such a proposed system may mutate, publish, and recommend strategies and verify properties, for instance, by using statistical inference, machine learning, and model checking with models derived from the past behavior of the system. For the sake of concreteness, we focus on a well-studied problem of detecting a malicious code family using statistical learning on trace features and show how such a machine learner - in this study a classifier for Zeus/Zbot - can be rendered as a property, and then be deployed on endpoint devices with trace monitors. The results of this paper, in combination with our earlier work, indicate the feasibility and way forward for a recommendation-verification system to achieve a novel defense mechanism in a social-technological network in the era of ubiquitous computing.","PeriodicalId":151942,"journal":{"name":"2014 9th International Conference on Malicious and Unwanted Software: The Americas (MALWARE)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 9th International Conference on Malicious and Unwanted Software: The Americas (MALWARE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MALWARE.2014.6999404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Agents in a social-technological network can be thought of as strategically interacting with each other by continually observing their own local or hyperlocal information and communicating suitable signals to the receivers who can take appropriate actions. Such interactions have been modeled as information-asymmetric signaling games and studied in our earlier work to understand the role of deception, which often results in general loss of cybersecurity. While there have been attempts to model and check such a body of agents for various global properties and hyperproperties, it has become clear that various theoretical obstacles against this approach are unsurmountable. We instead advocate an approach to dynamically check various liveness and safety hyperproperties with the help of recommenders and verifiers; we focus on empirical studies of the resulting signaling games to understand their equilibria and stability. Agents in such a proposed system may mutate, publish, and recommend strategies and verify properties, for instance, by using statistical inference, machine learning, and model checking with models derived from the past behavior of the system. For the sake of concreteness, we focus on a well-studied problem of detecting a malicious code family using statistical learning on trace features and show how such a machine learner - in this study a classifier for Zeus/Zbot - can be rendered as a property, and then be deployed on endpoint devices with trace monitors. The results of this paper, in combination with our earlier work, indicate the feasibility and way forward for a recommendation-verification system to achieve a novel defense mechanism in a social-technological network in the era of ubiquitous computing.
网络安全推荐验证系统中基于agent的跟踪学习
社会技术网络中的代理可以被认为是通过不断观察自己的本地或超本地信息并向可以采取适当行动的接收者传递合适的信号来进行战略交互。这种相互作用已被建模为信息不对称信号游戏,并在我们早期的工作中进行了研究,以了解欺骗的作用,这通常会导致网络安全的普遍损失。虽然已经有人尝试为各种全局属性和超属性建模和检查这样的代理体,但很明显,针对这种方法的各种理论障碍是无法克服的。我们提倡在推荐器和验证器的帮助下,动态地检查各种活动性和安全性超特性;我们专注于由此产生的信号博弈的实证研究,以了解他们的平衡和稳定性。在这样一个被提议的系统中的代理可以改变、发布和推荐策略并验证属性,例如,通过使用统计推断、机器学习和使用从系统过去行为派生的模型进行模型检查。为了具体起见,我们将重点放在一个经过充分研究的问题上,即使用跟踪特征的统计学习来检测恶意代码族,并展示如何将这样的机器学习器(在本研究中是Zeus/Zbot的分类器)呈现为属性,然后将其部署在带有跟踪监视器的端点设备上。本文的结果,结合我们之前的工作,指出了在泛在计算时代,推荐验证系统在社会技术网络中实现新型防御机制的可行性和前进方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信