ACM Workshop on Security of ad hoc and Sensor Networks最新文献_第4页

Denial-of-service resistant quality-of-service signaling for mobile ad hoc networks 移动自组织网络中抗拒绝服务的服务质量信令

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2004-10-25 DOI: 10.1145/1029102.1029108

Marek Hejmo, B. L. Mark, Charikleia Zouridaki, Roshan K. Thomas

引用次数: 6

Detection and prevention of MAC layer misbehavior in ad hoc networks ad hoc网络中MAC层错误行为的检测与预防

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2004-10-25 DOI: 10.1145/1029102.1029107

A. Cárdenas, Svetlana Radosavac, J. Baras

引用次数: 156

Securing quality-of-service route discovery in on-demand routing for ad hoc networks 确保自组织网络按需路由的服务质量路由发现

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2004-10-25 DOI: 10.1145/1029102.1029120

Yih-Chun Hu, David B. Johnson

{"title":"Securing quality-of-service route discovery in on-demand routing for ad hoc networks","authors":"Yih-Chun Hu, David B. Johnson","doi":"10.1145/1029102.1029120","DOIUrl":"https://doi.org/10.1145/1029102.1029120","url":null,"abstract":"An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use demanding applications such as videoconferencing, Voice over IP, and streaming media when they are connected through an ad~hoc network. Because overprovisioning, a common technique in wired networks, is often impractical in wireless networks for reasons such as power, cost, and government regulation, Quality of Service (QoS) routing is even more important in wireless networks than in wired networks. Though a number of QoS-routing protocols have been proposed for use in ad~hoc networks, security of such protocols has not been considered.\u0000 In this paper, we develop SQoS, a secure form of QoS-Guided Route Discovery for on-demand ad~hoc network routing. SQoS relies entirely on symmetric cryptography. Symmetric cryptographic primitives are three to four orders of magnitude faster (in computation time) than asymmetric cryptography. In addition, we show that in general, existing QoS-Guided Route Discovery can, for a single Route Discovery, transmit a number of packets exponential in the number of network nodes, creating an opportunity for Denial-of-Service (DoS) attacks. SQoS limits this overhead to be linear in the number of network nodes by providing the source with control over which Route Requests are forwarded.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115536221","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}

引用次数: 40

TinyPK: securing sensor networks with public key technology TinyPK:利用公钥技术保护传感器网络

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2004-10-25 DOI: 10.1145/1029102.1029113

Ronald J. Watro, D. Kong, Sue-fen Cuti, Charles Gardiner, C. Lynn, P. Kruus

引用次数: 764

Reputation-based framework for high integrity sensor networks 基于声誉的高完整性传感器网络框架

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2004-10-25 DOI: 10.1145/1029102.1029115

S. Ganeriwal, M. Srivastava

{"title":"Reputation-based framework for high integrity sensor networks","authors":"S. Ganeriwal, M. Srivastava","doi":"10.1145/1029102.1029115","DOIUrl":"https://doi.org/10.1145/1029102.1029115","url":null,"abstract":"The traditional approach of providing network security has been to borrow tools from cryptography and authentication. However, we argue that the conventional view of security based on cryptography alone is not sufficient for the unique characteristics and novel misbehaviors encountered in sensor networks. Fundamental to this is the observation that cryptography cannot prevent malicious or non-malicious insertion of data from internal adversaries or faulty nodes. \u0000 We believe that in general tools from different domains such as economics, statistics and data analysis will have to be combined with cryptography for the development of trustworthy sensor networks. Following this approach, we propose a reputation-based framework for sensor networks where nodes maintain reputation for other nodes and use it to evaluate their trustworthiness. We will show that this framework provides a scalable, diverse and a generalized approach for countering all types of misbehavior resulting from malicious and faulty nodes.\u0000 We are currently developing a system within this framework where we employ a Bayesian formulation, specifically a beta reputation system, for reputation representation, updates and integration. We will explain the reasoning behind our design choices, analyzing their pros & cons. We conclude the paper by verifying the efficacy of this system through some preliminary simulation results.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129771250","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}

引用次数: 1377

An advanced signature system for OLSR 先进的OLSR签名系统

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2004-10-25 DOI: 10.1145/1029102.1029106

D. Raffo, C. Adjih, T. Clausen, P. Mühlethaler

引用次数: 126

Location-aware key management scheme for wireless sensor networks 无线传感器网络的位置感知密钥管理方案

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2004-10-25 DOI: 10.1145/1029102.1029110

Dijiang Huang, M. Mehta, D. Medhi, L. Harn

{"title":"Location-aware key management scheme for wireless sensor networks","authors":"Dijiang Huang, M. Mehta, D. Medhi, L. Harn","doi":"10.1145/1029102.1029110","DOIUrl":"https://doi.org/10.1145/1029102.1029110","url":null,"abstract":"Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Recently, several pairwise key schemes have been proposed for large distributed sensor networks. These schemes randomly select a set of keys from a key pool and install the keys in the memory of each sensor. After deployment, the sensors can set up keys by using the preinstalled keys. Due to lack of tamper-resistant hardware, the sensor networks are vulnerable to node capture attacks. The information gained from captured nodes can be used to compromise communication among uncompromised sensors. Du et al. [1], Liu and Ning [2] proposed to use the known deployment information to reduce the memory requirements and mitigate the consequences of node capture attack. Our analysis shows that the assumption of random capture of sensors is too weak. An intelligent attacker can selectively capture sensors to get more information with less efforts. In addition to selective node capture attack, all recent proposals are vulnerable to node fabrication attack, in which an attacker can fabricate new sensors by manipulating the compromised secret keys and then deploy the fabricated sensors into the sensor system. To counter these attacks, we propose a grid-group scheme which uses known deployment information. Unlike the pairwise key scheme using deployment information proposed by Du et al., we uniformly deploy sensors in a large area; instead of randomly distributing keys from a large key pool to each sensor, we systematically distribute secret keys to each sensor from a structured key pool. Our performance analysis shows that our scheme requires less number of keys preinstalled for each sensor and is resilient to selective node capture attack and node fabrication attack.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131797632","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}

引用次数: 260

Connectivity properties of secure wireless sensor networks 安全无线传感器网络的连接特性

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2004-10-25 DOI: 10.1145/1029102.1029112

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

引用次数: 87

Revisiting random key pre-distribution schemes for wireless sensor networks 无线传感器网络随机密钥预分配方案研究

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2004-10-25 DOI: 10.1145/1029102.1029111

Joengmin Hwang, Yongdae Kim

{"title":"Revisiting random key pre-distribution schemes for wireless sensor networks","authors":"Joengmin Hwang, Yongdae Kim","doi":"10.1145/1029102.1029111","DOIUrl":"https://doi.org/10.1145/1029102.1029111","url":null,"abstract":"Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective. To solve this problem, several key pre-distribution schemes have been proposed for sensor networks based on random graph theory. In these schemes, a set of randomly chosen keys or secret information is pre-distributed to each sensor node and a network is securely formed based on this information. Most of the schemes assumed that the underlying physical network is dense enough, that is, the degree of each node is hig.\u0000 In this paper, we revisit the random graph theory and use giant component theory by Erdos and Renyi to show that even if the node degree is small, most of the nodes in the network can be connected. Further, we use this fact to analyze the Eschenhauer et. al's, Du et. al's, and Chan et. al's key pre-distribution schemes and evaluate the relation between connectivity, memory size, and security. We show that we can reduce the amount of memory required or improve security by trading-off a very small number of isolated nodes. Our simulation results show that the communication overhead does not increase significantly even after reducing the node degree. In addition, we present an approach by which nodes can dynamically adjust their transmission power to establish secure links with the targeted networked neighbors. Finally, we propose an effcient path-key identification algorithm and compare it with the existing scheme.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129150071","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}

引用次数: 221

Resilient aggregation in sensor networks 传感器网络中的弹性聚合

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2004-10-25 DOI: 10.1145/1029102.1029116

D. Wagner

引用次数: 443