Security and Artificial Intelligence最新文献

筛选
英文 中文
Model Aggregation for Distributed Content Anomaly Detection 分布式内容异常检测的模型聚合
Security and Artificial Intelligence Pub Date : 2014-11-07 DOI: 10.1145/2666652.2666660
Sean Whalen, Nathaniel Boggs, S. Stolfo
{"title":"Model Aggregation for Distributed Content Anomaly Detection","authors":"Sean Whalen, Nathaniel Boggs, S. Stolfo","doi":"10.1145/2666652.2666660","DOIUrl":"https://doi.org/10.1145/2666652.2666660","url":null,"abstract":"Cloud computing offers a scalable, low-cost, and resilient platform for critical applications. Securing these applications against attacks targeting unknown vulnerabilities is an unsolved challenge. Network anomaly detection addresses such zero-day attacks by modeling attributes of attack-free application traffic and raising alerts when new traffic deviates from this model. Content anomaly detection (CAD) is a variant of this approach that models the payloads of such traffic instead of higher level attributes. Zero-day attacks then appear as outliers to properly trained CAD sensors. In the past, CAD was unsuited to cloud environments due to the relative overhead of content inspection and the dynamic routing of content paths to geographically diverse sites. We challenge this notion and introduce new methods for efficiently aggregating content models to enable scalable CAD in dynamically-pathed environments such as the cloud. These methods eliminate the need to exchange raw content, drastically reduce network and CPU overhead, and offer varying levels of content privacy. We perform a comparative analysis of our methods using Random Forest, Logistic Regression, and Bloom Filter-based classifiers for operation in the cloud or other distributed settings such as wireless sensor networks. We find that content model aggregation offers statistically significant improvements over non-aggregate models with minimal overhead, and that distributed and non-distributed CAD have statistically indistinguishable performance. Thus, these methods enable the practical deployment of accurate CAD sensors in a distributed attack detection infrastructure.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117025525","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}
引用次数: 14
Poisoning behavioral malware clustering 中毒行为恶意软件聚类
Security and Artificial Intelligence Pub Date : 2014-11-07 DOI: 10.1145/2666652.2666666
B. Biggio, Konrad Rieck, Davide Ariu, Christian Wressnegger, Igino Corona, G. Giacinto, F. Roli
{"title":"Poisoning behavioral malware clustering","authors":"B. Biggio, Konrad Rieck, Davide Ariu, Christian Wressnegger, Igino Corona, G. Giacinto, F. Roli","doi":"10.1145/2666652.2666666","DOIUrl":"https://doi.org/10.1145/2666652.2666666","url":null,"abstract":"Clustering algorithms have become a popular tool in computer security to analyze the behavior of malware variants, identify novel malware families, and generate signatures for antivirus systems. However, the suitability of clustering algorithms for security-sensitive settings has been recently questioned by showing that they can be significantly compromised if an attacker can exercise some control over the input data. In this paper, we revisit this problem by focusing on behavioral malware clustering approaches, and investigate whether and to what extent an attacker may be able to subvert these approaches through a careful injection of samples with poisoning behavior. To this end, we present a case study on Malheur, an open-source tool for behavioral malware clustering. Our experiments not only demonstrate that this tool is vulnerable to poisoning attacks, but also that it can be significantly compromised even if the attacker can only inject a very small percentage of attacks into the input data. As a remedy, we discuss possible countermeasures and highlight the need for more secure clustering algorithms.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"62 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120888837","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}
引用次数: 148
Lux0R: Detection of Malicious PDF-embedded JavaScript code through Discriminant Analysis of API References Lux0R:通过API引用的判别分析检测嵌入pdf的恶意JavaScript代码
Security and Artificial Intelligence Pub Date : 2014-11-07 DOI: 10.1145/2666652.2666657
Igino Corona, Davide Maiorca, Davide Ariu, G. Giacinto
{"title":"Lux0R: Detection of Malicious PDF-embedded JavaScript code through Discriminant Analysis of API References","authors":"Igino Corona, Davide Maiorca, Davide Ariu, G. Giacinto","doi":"10.1145/2666652.2666657","DOIUrl":"https://doi.org/10.1145/2666652.2666657","url":null,"abstract":"JavaScript is a dynamic programming language adopted in a variety of applications, including web pages, PDF Readers, widget engines, network platforms, office suites. Given its widespread presence throughout different software platforms, JavaScript is a primary tool for the development of novel -rapidly evolving- malicious exploits. If the classical signature- and heuristic-based detection approaches are clearly inadequate to cope with this kind of threat, machine learning solutions proposed so far suffer from high false-alarm rates or require special instrumentation that make them not suitable for protecting end-user systems.\u0000 In this paper we present Lux0R \"Lux 0n discriminant References\", a novel, lightweight approach to the detection of malicious JavaScript code. Our method is based on the characterization of JavaScript code through its API references, i.e., functions, constants, objects, methods, keywords as well as attributes natively recognized by a JavaScript Application Programming Interface (API). We exploit machine learning techniques to select a subset of API references that characterize malicious code, and then use them to detect JavaScript malware. The selection algorithm has been thought to be \"secure by design\" against evasion by mimicry attacks. In this investigation, we focus on a relevant application domain, i.e., the detection of malicious JavaScript code within PDF documents. We show that our technique is able to achieve excellent malware detection accuracy, even on samples exploiting never-before-seen vulnerabilities, i.e., for which there are no examples in training data. Finally, we experimentally assess the robustness of Lux0R against mimicry attacks based on feature addition.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124345115","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}
引用次数: 63
Non-Invasive User Tracking via Passive Sensing: Privacy Risks of Time-Series Occupancy Measurement 通过被动感知的非侵入性用户跟踪:时序占用测量的隐私风险
Security and Artificial Intelligence Pub Date : 2014-11-07 DOI: 10.1145/2666652.2666655
Xiao Wang, P. Tague
{"title":"Non-Invasive User Tracking via Passive Sensing: Privacy Risks of Time-Series Occupancy Measurement","authors":"Xiao Wang, P. Tague","doi":"10.1145/2666652.2666655","DOIUrl":"https://doi.org/10.1145/2666652.2666655","url":null,"abstract":"A large-scale sensing infrastructure can collect ample data to benefit many real-world applications. One promising application scenario is building management. However, exposure of the sensor data potentially reveals private details about building users. In this paper, we investigate indoor location privacy as a motivating example to manifest potential privacy risks in smart buildings. We apply inference techniques to reconstruct users' location traces from room-level occupancy data. Unlike other types of surveillance that are dedicated to explicit tracking such as security cam- eras, time-series occupancy traces, as aggregated environmental measurements, are typically deemed privacy-preserving. Unfortunately, it may still reveal some of the same sensitive information as privacy-invasive sensing such as video surveillance. We con- duct experiments using a publicly available dataset and synthetic data. Our results demonstrate the underlying privacy leakage via occupancy data. We further show how our evaluation can enable adaptive privacy mechanisms to control the information leakage by the sensing system.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114755765","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}
引用次数: 19
Randomized Response Schemes, Privacy and Usefulness 随机响应方案,隐私和有用性
Security and Artificial Intelligence Pub Date : 2014-11-07 DOI: 10.1145/2666652.2666654
Francesco Aldà, H. Simon
{"title":"Randomized Response Schemes, Privacy and Usefulness","authors":"Francesco Aldà, H. Simon","doi":"10.1145/2666652.2666654","DOIUrl":"https://doi.org/10.1145/2666652.2666654","url":null,"abstract":"We define the notions of weak and strong usefulness and investigate the question whether a randomized response scheme can combine two conflicting goals, namely being weakly (or even strongly) useful and, at the same time, providing ε-differential privacy. We prove the following results. First, if a class F cannot be weakly SQ-learned under the uniform distribution, thenε-differential privacy rules out weak usefulness. This extends a result from [6] that was concerned with the class of parities. Second, for a broad variety of classes F that actually can be weakly SQ-learned under the uniform distribution, we design a randomized response scheme that provides ε-differential privacy and strong usefulness.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121513396","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
On learning and recognition of secure patterns 关于安全模式的学习和识别
Security and Artificial Intelligence Pub Date : 2014-11-07 DOI: 10.1145/2666652.2666653
B. Biggio
{"title":"On learning and recognition of secure patterns","authors":"B. Biggio","doi":"10.1145/2666652.2666653","DOIUrl":"https://doi.org/10.1145/2666652.2666653","url":null,"abstract":"Learning and recognition of secure patterns is a well-known problem in nature. Mimicry and camouflage are widely-spread techniques in the arms race between predators and preys. All of the information acquired by our senses is therefore not necessarily secure or reliable. In machine learning and pattern recognition systems, we have started investigating these issues only recently, with the goal of learning to discriminate between secure and hostile patterns. This phenomenon has been especially observed in the context of adversarial settings like biometric recognition, malware detection and spam filtering, in which data can be adversely manipulated by humans to undermine the outcomes of an automatic analysis. As current pattern recognition methods are not natively designed to deal with the intrinsic, adversarial nature of these problems, they exhibit specific vulnerabilities that an adversary may exploit either to mislead learning or to avoid detection. Identifying these vulnerabilities and analyzing the impact of the corresponding attacks on pattern classifiers is one of the main open issues in the novel research field of adversarial machine learning.\u0000 In the first part of this talk, I introduce a general framework that encompasses and unifies previous work in the field, allowing one to systematically evaluate classifier security against different, potential attacks. As an example of application of this framework, in the second part of the talk, I discuss evasion attacks, where malicious samples are manipulated at test time to avoid detection. I then show how carefully-designed poisoning attacks can mislead learning of support vector machines by manipulating a small fraction of their training data, and how to poison adaptive biometric verification systems to compromise the biometric templates (face images) of the enrolled clients. Finally, I briefly discuss our ongoing work on attacks against clustering algorithms, and sketch some possible future research directions.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122187247","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
On the Practicality of Integrity Attacks on Document-Level Sentiment Analysis 文档级情感分析中完整性攻击的实用性研究
Security and Artificial Intelligence Pub Date : 2014-11-07 DOI: 10.1145/2666652.2666661
Andrew Newell, Rahul Potharaju, Luojie Xiang, C. Nita-Rotaru
{"title":"On the Practicality of Integrity Attacks on Document-Level Sentiment Analysis","authors":"Andrew Newell, Rahul Potharaju, Luojie Xiang, C. Nita-Rotaru","doi":"10.1145/2666652.2666661","DOIUrl":"https://doi.org/10.1145/2666652.2666661","url":null,"abstract":"Sentiment analysis plays an important role in the way companies, organizations, or political campaigns are run, making it an attractive target for attacks. In integrity attacks an attacker influences the data used to train the sentiment analysis classification model in order to decrease its accuracy. Previous work did not consider practical constraints dictated by the characteristics of data generated by a sentiment analysis application and relied on synthetic or pre-processed datasets inspired by spam, intrusion detection, or handwritten digit recognition. We identify and demonstrate integrity attacks against document-level sentiment analysis that take into account such practical constraints. Our attacks, while inspired by existing work, require novel improvements to function in a realistic environment where a victim performs typical steps such as data cleaning, labeling, and feature extraction prior to training the classification model. We demonstrate the effectiveness of the attacks on three datasets -- two Twitter datasets and an Android dataset.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127412489","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}
引用次数: 55
Exploitation as an inference problem 作为推理问题的开发
Security and Artificial Intelligence Pub Date : 2011-10-21 DOI: 10.1145/2046684.2046702
David A. Cock
{"title":"Exploitation as an inference problem","authors":"David A. Cock","doi":"10.1145/2046684.2046702","DOIUrl":"https://doi.org/10.1145/2046684.2046702","url":null,"abstract":"In this position paper, we suggest that an adversary seeking to exploit a side channel should be viewed as performing inference under uncertainty. We propose a set of vulnerability measures that incorporate both observational effort and computational effort. by deriving Boolean satisfiability as a special case of the marginalization problem, we justify that the measure is capable of capturing the complexity of the underlying deterministic decision problem. In the limit of unbounded computation the measure reduces to the efficiency (in number of observations) of naïve Bayesian analysis. We further hypothesize that in the limit of unbounded observations, the measure reduces to the complexity of the decision problem.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127336552","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}
引用次数: 2
Categorizing CAPTCHA 分类验证码
Security and Artificial Intelligence Pub Date : 2011-10-21 DOI: 10.1145/2046684.2046703
S. Shirali-Shahreza, M. Shirali-Shahreza
{"title":"Categorizing CAPTCHA","authors":"S. Shirali-Shahreza, M. Shirali-Shahreza","doi":"10.1145/2046684.2046703","DOIUrl":"https://doi.org/10.1145/2046684.2046703","url":null,"abstract":"CAPTCHA (Completely Automatic Public Turing Test to Tell Computer and Human Apart) systems are used to distinguish human users from computer programs automatically. The goal of them is to ask questions which human users can easily answer, but current computers cannot. Most current CAPTCHA methods are based on the weak points of OCR (Optical Character Recognition) systems. In this paper, a new CAPTCHA method is presented on the basis of object categorization. In this method, a number of objects are chosen randomly and the pictures of these objects are searched in the Internet and downloaded. The pictures are then shown to the user and the user is asked to mark the objects which belong to a specific category. If the user marks the right objects, it can be assumed that the user is a human being and not a computer program. The main advantage of this method is that it enables the human user pass even if makes a few mistakes, without compromising the security for that.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124797565","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
Topic modeling of freelance job postings to monitor web service abuse 自由职业职位发布的主题建模以监控web服务滥用
Security and Artificial Intelligence Pub Date : 2011-10-21 DOI: 10.1145/2046684.2046687
Do-kyum Kim, Marti A. Motoyama, G. Voelker, L. Saul
{"title":"Topic modeling of freelance job postings to monitor web service abuse","authors":"Do-kyum Kim, Marti A. Motoyama, G. Voelker, L. Saul","doi":"10.1145/2046684.2046687","DOIUrl":"https://doi.org/10.1145/2046684.2046687","url":null,"abstract":"Web services such as Google, Facebook, and Twitter are recurring victims of abuse, and their plight will only worsen as more attackers are drawn to their large user bases. Many attackers hire cheap, human labor to actualize their schemes, connecting with potential workers via crowdsourcing and freelancing sites such as Mechanical Turk and Freelancer.com. To identify solicitations for abuse jobs, these Web sites need ways to distinguish these tasks from ordinary jobs. In this paper, we show how to discover clusters of abuse tasks using latent Dirichlet allocation (LDA), an unsupervised method for topic modeling in large corpora of text. Applying LDA to hundreds of thousands of unlabeled job postings from Freelancer.com, we find that it discovers clusters of related abuse jobs and identifies the prevalent words that distinguish them. Finally, we use the clusters from LDA to profile the population of workers who bid on abuse jobs and the population of buyers who post their project descriptions.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127975268","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}
引用次数: 17
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学术官方微信
小红书