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

Towards provable security for ad hoc routing protocols 为特设路由协议提供可证明的安全性

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

L. Buttyán, I. Vajda

引用次数: 132

Security in wireless sensor networks 无线传感器网络的安全性

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

J. Stankovic

引用次数: 281

Source-location privacy in energy-constrained sensor network routing 能量约束传感器网络路由中的源位置隐私

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

Celal Öztürk, Yanyong Zhang, W. Trappe

{"title":"Source-location privacy in energy-constrained sensor network routing","authors":"Celal Öztürk, Yanyong Zhang, W. Trappe","doi":"10.1145/1029102.1029117","DOIUrl":"https://doi.org/10.1145/1029102.1029117","url":null,"abstract":"As sensor-driven applications become increasingly integrated into our lives, issues related to sensor privacy will become increasingly important. Although many privacy-related issues can be addressed by security mechanisms, one sensor network privacy issue that cannot be adequately addressed by network security is confidentiality of the source sensor's location. In this paper, we focus on protecting the source's location by introducing suitable modifications to sensor routing protocols to make it difficult for an adversary to backtrack to the origin of the sensor communication. In particular, we focus on the class of flooding protocols. While developing and evaluating our privacy-aware routing protocols, we jointly consider issues of location-privacy as well as the amount of energy consumed by the sensor network. Motivated by the observations, we propose a flexible routing strategy, known as <i>phantom routing</i>, which protects the source's location. Phantom routing is a two-stage routing scheme that first consists of a directed walk along a random direction, followed by routing from the phantom source to the sink. Our investigations have shown that phantom routing is a powerful technique for protecting the location of the source during sensor transmissions.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"49 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":"121841950","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}

引用次数: 436

An attack on the proactive RSA signature scheme in the URSA ad hoc network access control protocol 针对URSA自组网访问控制协议中主动RSA签名方案的攻击

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

Stanislaw Jarecki, Nitesh Saxena, J. Yi

{"title":"An attack on the proactive RSA signature scheme in the URSA ad hoc network access control protocol","authors":"Stanislaw Jarecki, Nitesh Saxena, J. Yi","doi":"10.1145/1029102.1029105","DOIUrl":"https://doi.org/10.1145/1029102.1029105","url":null,"abstract":"Recently, Luo, et al. in a series of papers [17, 14, 13, 18, 15] proposed a set of protocols for providing ubiquitous and robust access control [URSA] in mobile ad hoc networks without relying on a centralized authority. The URSA protocol relies on the new proactive RSA signature scheme, which allows members in an ad hoc group to make access control decisions in a distributed manner. The proposed proactive RSA signature scheme is assumed secure as long as no more than an allowed threshold of participating members is simultaneously corrupted at any point in the lifetime of the scheme.\u0000 In this paper we show an attack on this proposed proactive RSA scheme, in which an admissible threshold of malicious group members can completely recover the group RSA secret key in the course of the lifetime of this scheme. Our attack stems from the fact that the threshold signature protocol which is a part of this proactive RSA scheme leaks some seemingly innocuous information about the secret signature key. We show how the corrupted members can in uence the execution of the scheme in such a way so that the slowly leaked information is used to reconstruct the entire shared secret.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"15 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":"125551828","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}

引用次数: 52

Admission control in Peer-to-Peer: design and performance evaluation 点对点的准入控制:设计和性能评估

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2003-10-31 DOI: 10.1145/986858.986873

Nitesh Saxena, G. Tsudik, J. Yi

{"title":"Admission control in Peer-to-Peer: design and performance evaluation","authors":"Nitesh Saxena, G. Tsudik, J. Yi","doi":"10.1145/986858.986873","DOIUrl":"https://doi.org/10.1145/986858.986873","url":null,"abstract":"Peer-to-Peer (P2P) applications and services are very common in today's computing. The popularity of the P2P paradigm prompts the need for specialized security services which makes P2P security an important and challenging research topic. Most prior work in P2P security focused on authentication, key management and secure communication. However, an important pre-requisite for many P2P security services is secure admission, or how one becomes a peer in a P2P setting. This issue has been heretofore largely untouched.This paper builds upon some recent work [11] which constructed a peer group admission control framework based on different policies and corresponding cryptographic techniques. Our central goal is to assess the practicality of these techniques. To this end, we construct and evaluate concrete P2P admission mechanisms based on various cryptographic techniques. Although our analysis focuses primarily on performance, we also consider other important features, such as: anonymity, unlinkability and accountability. Among other things, our experimental results demonstrate that, unfortunately, advanced cryptographic constructs (such as verifiable threshold signatures) are not yet ready for prime time.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133438480","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}

引用次数: 99

A security design for a general purpose, self-organizing, multihop ad hoc wireless network 一种用于通用、自组织、多跳自组织无线网络的安全设计

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2003-10-31 DOI: 10.1145/986858.986860

T. S. Messerges, J. Cukier, T. Kevenaar, L. Puhl, R. Struik, E. Callaway

引用次数: 50

A certificate revocation scheme for wireless ad hoc networks 无线自组织网络的证书撤销方案

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2003-10-31 DOI: 10.1145/986858.986866

C. Crépeau, Carlton R. Davis

引用次数: 92

Location-based pairwise key establishments for static sensor networks 静态传感器网络中基于位置的成对密钥建立

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2003-10-31 DOI: 10.1145/986858.986869

Donggang Liu, P. Ning

{"title":"Location-based pairwise key establishments for static sensor networks","authors":"Donggang Liu, P. Ning","doi":"10.1145/986858.986869","DOIUrl":"https://doi.org/10.1145/986858.986869","url":null,"abstract":"Sensor networks are ideal candidates for applications such as target tracking and environment monitoring. Security in sensor networks is critical when there are potential adversaries. Establishment of pairwise keys is a fundamental security service, which forms the basis of other security services such as authentication and encryption. However, establishing pairwise keys in sensor networks is not a trivial task, particularly due to the resource constraints on sensors. This paper presents several techniques for establishing pairwise keys in static sensor networks. These techniques take advantage of the observation that in static sensor networks, although it is difficult to precisely pinpoint sensors' positions, it is often possible to approximately determine their locations. This paper presents a simple location-aware deployment model, and develops two pairwise key predistribution schemes, a closest pairwise keys predistribution scheme and a location-based pairwise keys scheme using bivariate polynomials, by taking advantage of sensors' expected locations. The analysis in this paper indicates that these schemes can achieve better performance if such location information is available and that the smaller the deployment error (i.e., the difference between a sensor's actual location and its expected location) is, the better performance they can achieve.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126986313","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}

引用次数: 586

Security support for in-network processing in Wireless Sensor Networks 无线传感器网络中网络内处理的安全支持

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2003-10-31 DOI: 10.1145/986858.986870

Jing Deng, Richard O. Han, Shivakant Mishra

引用次数: 123

Secure long term communities in ad hoc networks 在特设网络中确保长期社区的安全

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2003-10-31 DOI: 10.1145/986858.986874

N. Prigent, C. Bidan, J. Andreaux, Olivier Heen

引用次数: 26