2006 Securecomm and Workshops最新文献_第2页

Sensor Networks that Are Provably Resilient 可证明具有弹性的传感器网络

2006 Securecomm and Workshops Pub Date : 2006-08-01 DOI: 10.1109/SECCOMW.2006.359569

R. D. Pietro, L. Mancini, A. Mei, A. Panconesi, J. Radhakrishnan

引用次数: 36

Exploiting MMS Vulnerabilities to Stealthily Exhaust Mobile Phone's Battery 利用MMS漏洞暗中耗尽手机电池

2006 Securecomm and Workshops Pub Date : 2006-08-01 DOI: 10.1109/SECCOMW.2006.359550

Radmilo Racic, Denys Ma, Hao Chen

{"title":"Exploiting MMS Vulnerabilities to Stealthily Exhaust Mobile Phone's Battery","authors":"Radmilo Racic, Denys Ma, Hao Chen","doi":"10.1109/SECCOMW.2006.359550","DOIUrl":"https://doi.org/10.1109/SECCOMW.2006.359550","url":null,"abstract":"As cellular data services and applications are being widely deployed, they become attractive targets for attackers, who could exploit unique vulnerabilities in cellular networks, mobile devices, and the interaction between cellular data networks and the Internet. In this paper, we demonstrate such an attack, which surreptitiously drains mobile devices' battery power up to 22 times faster and therefore could render these devices useless before the end of business hours. This attack targets a unique resource bottleneck in mobile devices (the battery power) by exploiting an insecure cellular data service (MMS) and the insecure interaction between cellular data networks and the Internet (PDP context retention and the paging channel). The attack proceeds in two stages. In the first stage, the attacker compiles a hit list of mobile devices - including their cellular numbers, IP addresses, and model information - by exploiting MMS notification messages. In the second stage, the attacker drains mobile devices' battery power by sending periodical UDP packets and exploiting PDP context retention and the paging channel. This attack is unique not only because it exploits vulnerable cellular services to target mobile devices hut also because the victim mobile users are unaware when their batteries are being drained. Furthermore, we identify two key vulnerable components in cellular networks and propose mitigation strategies for protecting cellular devices from such attacks from the Internet","PeriodicalId":156828,"journal":{"name":"2006 Securecomm and Workshops","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126123461","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}

引用次数: 140

Towards Cooperative Self-Protecting Mobile Devices using Trustful Relationships 基于信任关系的合作自我保护移动设备

2006 Securecomm and Workshops Pub Date : 2006-08-01 DOI: 10.1109/SECCOMW.2006.359542

S. Grob

{"title":"Towards Cooperative Self-Protecting Mobile Devices using Trustful Relationships","authors":"S. Grob","doi":"10.1109/SECCOMW.2006.359542","DOIUrl":"https://doi.org/10.1109/SECCOMW.2006.359542","url":null,"abstract":"Security remains a major topic in today's networks. Especially in the mobile area there are many security issues that have not yet been satisfactorily addressed, let alone been solved. Most of the security mechanisms and techniques used in wired networks tend to rely upon a fixed network topology. For example, firewalls and intrusion detection systems are placed at central points of a network and configured with a model of the network's structure to control and analyse the data flows transferred for harmful content. If at all, adopting these measures for the mobile world is not easy due to its dynamically changing environments and the mobile device's resource constraints that do not allow demanding analyse tasks. In this paper, we present our work in progress of developing a system architecture for cooperative and self-protecting mobile devices. Our approach is based on the assumption that a mobile network can be protected by securing all participating devices or at least all honest participating devices. Thus, we no longer insist on a global view of the network but on several local views. To make these views as precise as possible and to avoid serious performance bottlenecks on a single device we propose a strategy for coupling trusted mobile devices together into a cooperating group","PeriodicalId":156828,"journal":{"name":"2006 Securecomm and Workshops","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129641638","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

Discount Anonymous On Demand Routing for Mobile Ad hoc Networks 移动自组织网络的折扣匿名按需路由

2006 Securecomm and Workshops Pub Date : 2006-08-01 DOI: 10.1109/SECCOMW.2006.359533

Liu Yang, M. Jakobsson, S. Wetzel

{"title":"Discount Anonymous On Demand Routing for Mobile Ad hoc Networks","authors":"Liu Yang, M. Jakobsson, S. Wetzel","doi":"10.1109/SECCOMW.2006.359533","DOIUrl":"https://doi.org/10.1109/SECCOMW.2006.359533","url":null,"abstract":"Recent years have seen a large number of proposals for anonymity mechanisms operating on the application layer. Given that anonymity is no stronger than its weakest link, such proposals are only meaningful if one can offer anonymity guarantees on the communication layer as well. ANODR - or anonymous on demand routing - is one of the leading proposals to deal with this issue. In this paper, we propose a novel technique to address the same problem, but at a lower cost. Our proposal, which we dub discount-ANODR, is built around the same set of techniques as ANODR is. Our proposal has the benefit of achieving substantially lower computation and communication complexities at the cost of a slight reduction of privacy guarantees. In particular, discount-ANODR achieves source anonymity and routing privacy. A route is \"blindly generated\" by the intermediaries on the path between an anonymous source and an identified destination. Route requests in discount-ANODR bear strong similarities to route requests in existing source routing protocols, with the limitation that intermediaries only know the destination of the request and the identity of the previous intermediary - but not whether the latter was the originator of the request. The response to a route request protects the compiled route by means of iterated symmetric encryption, drawing on how messages are prepared before being submitted to a typical synchronous mix network (or onion router). The communication of data subsequently uses such \"route onions\" to channel the packet to the intended destination. We do not use any key exchange, nor do we utilize public key operations at any time; consequently, we do not need to rely on any PKI, CRL or related constructions","PeriodicalId":156828,"journal":{"name":"2006 Securecomm and Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130895181","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}

引用次数: 78

Computing with Trust: Definition, Properties, and Algorithms 基于信任的计算:定义、属性和算法

2006 Securecomm and Workshops Pub Date : 2006-08-01 DOI: 10.1109/SECCOMW.2006.359579

J. Golbeck

引用次数: 70

A Flexible Approach to Intrusion Alert Anonymization and Correlation 一种灵活的入侵警报匿名化和关联方法

2006 Securecomm and Workshops Pub Date : 2006-08-01 DOI: 10.1109/SECCOMW.2006.359544

Dingbang Xu, P. Ning

{"title":"A Flexible Approach to Intrusion Alert Anonymization and Correlation","authors":"Dingbang Xu, P. Ning","doi":"10.1109/SECCOMW.2006.359544","DOIUrl":"https://doi.org/10.1109/SECCOMW.2006.359544","url":null,"abstract":"Intrusion alert data sets are critical for security research such as alert correlation. However, privacy concerns about the data sets from different data owners may prevent data sharing and investigation. It is always desirable and sometimes mandatory to anonymize sensitive data in alert sets before they are shared and analyzed. To address privacy concerns, in this paper we propose three schemes to flexibly perform alert anonymization. These schemes are closely related but can also be applied independently. In Scheme I, we generate artificial alerts and mix them with original alerts to help hide original attribute values. In Scheme II, we further map sensitive attributes to random values based on concept hierarchies. In Scheme III, we propose to partition an alert set into multiple subsets and apply Scheme II in each subset independently. To evaluate privacy protection and guide alert anonymization, we define local privacy and global privacy, and use entropy to compute their values. Though we emphasize alert anonymization techniques in this paper, to examine the utility of data, we further perform correlation analysis for anonymized data sets. We focus on estimating similarity values between anonymized attributes and building attack scenarios from anonymized data sets. Our experimental results demonstrated the effectiveness of our techniques","PeriodicalId":156828,"journal":{"name":"2006 Securecomm and Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127873116","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

S-DV: A new approach to Secure Distance Vector routing protocols S-DV:一种安全距离矢量路由协议的新方法

2006 Securecomm and Workshops Pub Date : 2006-08-01 DOI: 10.1109/SECCOMW.2006.359578

A. Babakhouya, Y. Challal, A. Bouabdallah, S. Gharout

引用次数: 7

A Double Horizon Defense Design for Robust Regulation of Malicious Traffic 一种针对恶意流量稳健监管的双水平防御设计

2006 Securecomm and Workshops Pub Date : 2006-08-01 DOI: 10.1109/SECCOMW.2006.359585

Ying Xu, R. Guérin

{"title":"A Double Horizon Defense Design for Robust Regulation of Malicious Traffic","authors":"Ying Xu, R. Guérin","doi":"10.1109/SECCOMW.2006.359585","DOIUrl":"https://doi.org/10.1109/SECCOMW.2006.359585","url":null,"abstract":"Deploying defense mechanisms in routers holds promises for protecting infrastructure resources such as link bandwidth or router buffers against network denial-of-service (DoS) attacks. However, in spite of their efficacy against brute-force flooding attacks, existing router-based defenses often perform poorly when confronted to more sophisticated attack strategies. This paper presents the design and evaluation of a system aimed at identifying and containing a broad range of malicious traffic patterns. Its main feature is a double time horizon architecture, designed for effective regulation of attacking traffic at both short and long time scales. The short horizon component responds quickly to transient traffic surges that deviate significantly from regular (TCP) traffic, i.e., attackers that generate sporadic short bursts. Conversely, the long horizon mechanism enforces strict conformance with normal TCP behavior, but does so by considering traffic over longer time periods, and is therefore aimed at attackers that attempt to capture a significant amount of link bandwidth. The performance of the proposed system was tested extensively. Our findings suggest that the implementation cost of the system is reasonable, and that it is indeed efficient against various types of attacks while remaining transparent to normal TCP users","PeriodicalId":156828,"journal":{"name":"2006 Securecomm and Workshops","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127937212","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}

引用次数: 7

Detecting the Sybil Attack in Mobile Ad hoc Networks 移动Ad hoc网络中的Sybil攻击检测

2006 Securecomm and Workshops Pub Date : 2006-08-01 DOI: 10.1109/SECCOMW.2006.359558

Chris Piro, C. Shields, B. Levine

引用次数: 236

Effective Detection of Active Worms with Varying Scan Rate 动态蠕虫扫描速率变化的有效检测

2006 Securecomm and Workshops Pub Date : 2006-08-01 DOI: 10.1109/SECCOMW.2006.359549

Wei Yu, Xun Wang, D. Xuan, David Lee

引用次数: 23