{"title":"Towards modeling the behavior of physical intruders in a region monitored by a wireless sensor network","authors":"Pranav Krishnamoorthy, M. Wright","doi":"10.1145/1866423.1866425","DOIUrl":"https://doi.org/10.1145/1866423.1866425","url":null,"abstract":"A priority task for homeland security is the coverage of large spans of open border that cannot be continuously physically monitored for intrusion. Low-cost monitoring solutions based on wireless sensor networks have been identified as an effective means to perform perimeter monitoring. An ad-hoc wireless sensor network scattered near a border could be used to perform surveillance over a large area with relatively little human intervention. Determining the effectiveness of such an autonomous network in detecting and thwarting an intelligent intruder is a difficult task. We propose a model for an intelligent attacker that attempts to find a detection-free path in a region with sparse sensing coverage. In particular, we apply reinforcement learning (RL) - a machine learning approach - for our model. RL algorithms are well suited for scenarios in which specifying and finding an optimal solution is difficult. By using RL, our attacker can easily adapt to new scenarios by translating constraints into rewards. We compare our RL-based technique to a reasonable heuristic in simulation. Our results suggest that our RL-based attacker model is significantly more effective, and therefore more realistic, than the heuristic approach.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124779990","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}
{"title":"Synthetic security policy generation via network traffic clustering","authors":"T. Samak, E. Al-Shaer","doi":"10.1145/1866423.1866433","DOIUrl":"https://doi.org/10.1145/1866423.1866433","url":null,"abstract":"Security policies are an essential part in the operations of any networking system. Test policies are always needed for conducting research and development. Such policies are required in various phases of research related to many problems as performance optimization, device testing, and configuration analysis.\u0000 In this paper, we introduce a novel technique that utilizes trace repositories to generate traffic-driven firewall policies. An online clustering mechanism is designed and developed to infer rule criteria and policy structure from the traffic. The approach generates policies relevant to the environment while satisfying structural features specified by testing requirements. Clustering parameters are tuned to fit the need of the testing domain. High level structural features (policy size, distinct rules, rule specificity, etc) are mapped to algorithm input parameters. The technique evaluation shows the flexibility as well as the accuracy of the generated policies compared to actual administrator-defined policies.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128773734","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}
Markus Huber, M. Mulazzani, S. Schrittwieser, E. Weippl
{"title":"Cheap and automated socio-technical attacks based on social networking sites","authors":"Markus Huber, M. Mulazzani, S. Schrittwieser, E. Weippl","doi":"10.1145/1866423.1866435","DOIUrl":"https://doi.org/10.1145/1866423.1866435","url":null,"abstract":"The vastly and steadily increasing data pool collected by social networking sites can have severe implications once this information becomes available to attackers. Whilst socio-technical attacks such as social engineering relied upon expensive background information collection techniques such as dumpster diving, social engineering attacks can nowadays be fully automated with data collected from social networking sites. In this paper we discuss several socio-technical attacks to finally present a novel large-scale social spam attack based on social networking sites.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"269 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114240542","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}
Z. Bankovic, J. C. Vallejo, P. Malagón, Á. Araujo, Jose M. Moya
{"title":"Eliminating routing protocol anomalies in wireless sensor networks using AI techniques","authors":"Z. Bankovic, J. C. Vallejo, P. Malagón, Á. Araujo, Jose M. Moya","doi":"10.1145/1866423.1866426","DOIUrl":"https://doi.org/10.1145/1866423.1866426","url":null,"abstract":"The specific nature of routing in sensor networks has made possible new sorts of attacks that can have closer insight and effect on the networks packets, the most important being the packet tampering. Routing attacks on the network level are the first step in tampering with the packets. In this work we propose a solution for detecting and eliminating these attacks that couples reputation systems with clustering techniques, namely unsupervised genetic algorithm and self-organizing maps, trained for detecting outliers in data. The algorithms use the feature space based on sequences of routing hops that provides ability of detecting wide range of attacks. We further present a flexible way of integrating the solution into targeted sensor network that can easily adapt its computational requirements to the existing network resources. The solution offers many benefits: scalable solution, fast response to adversarial activities, ability to detect unknown attacks, high adaptability, flexible integration, and high ability in detecting and confining attacks.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134640561","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}
{"title":"Lexical feature based phishing URL detection using online learning","authors":"Aaron Blum, Brad Wardman, T. Solorio, Gary Warner","doi":"10.1145/1866423.1866434","DOIUrl":"https://doi.org/10.1145/1866423.1866434","url":null,"abstract":"Phishing is a form of cybercrime where spammed emails and fraudulent websites entice victims to provide sensitive information to the phishers. The acquired sensitive information is subsequently used to steal identities or gain access to money. This paper explores the possibility of utilizing confidence weighted classification combined with content based phishing URL detection to produce a dynamic and extensible system for detection of present and emerging types of phishing domains. Our system is capable of detecting emerging threats as they appear and subsequently can provide increased protection against zero hour threats unlike traditional blacklisting techniques which function reactively.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121174863","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}
{"title":"The limits of automatic OS fingerprint generation","authors":"David W. Richardson, S. Gribble, Tadayoshi Kohno","doi":"10.1145/1866423.1866430","DOIUrl":"https://doi.org/10.1145/1866423.1866430","url":null,"abstract":"Remote operating system fingerprinting relies on implementation differences between OSs to identify the specific variant executing on a remote host. Because these differences can be subtle and difficult to find, most fingerprinting tools require expert manual effort to construct discriminative fingerprints and classification models. In prior work, Caballero et al. proposed a promising technique to eliminate manual intervention: the automatic generation of fingerprints using an approach similar to fuzz testing [6]. Their work evaluated the technique in a small-scale, carefully controlled test environment. In this paper, we re-examine automatic OS fingerprinting in a more challenging large-scale scenario to better understand the viability of the technique. In contrast to the prior work, we find that automatic fingerprint generation suffers from several limitations and technical hurdles that can limit its effectiveness, particularly in more demanding, realistic environments.\u0000 We use machine learning algorithms from the well-known Weka [11] data mining toolkit to automatically generate fingerprints over 329 different machine instances, and we compare the accuracy of our automatically generated fingerprints to Nmap. Our results suggest that overfitting to non-OS-specific behavioral differences, the indistinguishability of different OS variants, the biasing of an automatic tool to the makeup of the training data, and the lack of ability of an automatic tool to exploit protocol and software semantics significantly limit the usefulness of this technique in practice. Automatic techniques can help identify candidate signatures, but our results suggest that manual expertise will remain an integral part of fingerprint generation.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126492054","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}
{"title":"Empirical evaluation of authorship obfuscation using JGAAP","authors":"P. Juola, Darren Vescovi","doi":"10.1145/1866423.1866427","DOIUrl":"https://doi.org/10.1145/1866423.1866427","url":null,"abstract":"Authorship attribution is an important emerging security tool. However, just as criminals may wear gloves to hide their fingerprints, so authors may choose to mask their style to escape detection. Most authorship studies have focused on cooperative and/or unaware authors who do not take such precautions. Using a newly published corpus (the Brennan-Greenstadt Obfuscation corpus), we use the JGAAP system (www.jgaap.com) to test different methods of authorship attribution against essays written in deliberate attempt to mask style. We confirm that this is an issue.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134423551","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}
{"title":"Relational network-service clustering analysis with set evidences","authors":"Li Pu, B. Faltings, Qiang Yang, Derek Hao Hu","doi":"10.1145/1866423.1866432","DOIUrl":"https://doi.org/10.1145/1866423.1866432","url":null,"abstract":"Network administrators are faced with a large amount of network data that they need to sift through to analyze user behaviors and detect anomalies. Through a network monitoring tool, we obtained TCP and UDP connection records together with additional information of the associated users and software in an enterprise network. Instead of using traditional payload inspection techniques, we propose a method that clusters such network traffic data by using relations between entities so that it can be analyzed for frequent behaviors and anomalies. Relational methods like Markov Logic Networks is able to avoid the feature extraction stage and directly handle multi-relation situations. We extend the common pairwise representation in relational models by adopting set evidence to build a better objective for the network service clustering problem. The automatic clustering process helps the administrator filter out normal traffic in shorter time and get an abstract overview of opening transport layer ports in the whole network, which is beneficial for assessing network security risks. Experimental results on synthetic and real datasets suggest that our method is able to discover underlying services and anomalies (malware or abused ports) with good interpretations.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127607970","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}
{"title":"Adjustable autonomy for cross-domain entitlement decisions","authors":"J. Beal, J. Webb, M. Atighetchi","doi":"10.1145/1866423.1866436","DOIUrl":"https://doi.org/10.1145/1866423.1866436","url":null,"abstract":"Cross-domain information exchange is a growing problem, as business and governmental organizations increasingly need to integrate their information systems with those of partially trusted partners. Current identity management and access control technologies operate only within a specific domain and are unable to scale to the asymmetric, heterogeneously administered, and highly restrictive security policies of cross-domain environments. We approach the problem as one of adjustable autonomy, in which the human administrator needs to encode policy intent in a way that allows routine decisions about policy interactions to be safely delegated to the machine. In this paper, we present work toward such a system, combining a lattice representation of access control decisions and client attributes with search through a space of cross-domain mapping relations. This combination enables a policy resolution algorithm that resolves routine policy interactions while flagging potential conflicts for attention from a human administrator.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127323041","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}
{"title":"Towards security policy decisions based on context profiling","authors":"Markus Miettinen, N. Asokan","doi":"10.1145/1866423.1866428","DOIUrl":"https://doi.org/10.1145/1866423.1866428","url":null,"abstract":"With the increasing popularity of personal mobile devices like smartphones, more and more ordinary users create and consume valuable, private and sensitive data such as photos, videos, messages, documents as well as access credentials for various resources and services. Without proper access control policies, such data may be disclosed in ways that the user did not intend. Although various applications and services support the possibility of fine-grained security and privacy policies, end users are not capable of understanding or adjusting the policies to suit their needs.\u0000 In this position paper we argue that context information can be used to infer likely access control policies. We motivate by briefly describing three usage scenarios where context related to the location of a device can be used to set access control policies. We argue that a simple measure like the \"familiarity\" of a device and/or context can be calculated and used to infer appropriate policy settings. Finally, we report on our experience in using context observations collected from the devices of two test participants over a period of time.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117287589","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}