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

Advances in sensor and ad-hoc network security: perspective and status 传感器与自组网安全研究进展:展望与现状

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102231

V. Gligor

引用次数: 0

RFID security without extensive cryptography RFID安全，不需要大量的加密

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102229

S. Karthikeyan, Mikhail Nesterenko

{"title":"RFID security without extensive cryptography","authors":"S. Karthikeyan, Mikhail Nesterenko","doi":"10.1145/1102219.1102229","DOIUrl":"https://doi.org/10.1145/1102219.1102229","url":null,"abstract":"A Radio Frequency Identification Device (RFID) allows effective identification of a large number of tagged objects without physical or visual contact. RFID systems are a promising technology for supply chain management and inventory control. As individual item tagging becomes a reality, privacy concerns over RFID use come to the fore. The shared radio medium allow eavesdropping and unauthorized tag reading which poses threats to individual's privacy. Moreover, due to the mode of use of RFIDs, new threats emerge. For example, an intruder may be able to track the movement of an individual by repeatedly querying an RFID attached to the item that this individual carries. The limited size and cost considerations do not allow to implement conventional cryptographic systems on RFIDs. In this paper we propose an efficient RFID tag identification algorithm that incorporates reader-authentication. Our algorithm is secure against the anticipated threats to RFID systems. Our algorithm does not require computationally expensive cryptographic mechanisms, it relies on rather simple matrix multiplication. To further enhance the utility of our algorithm we propose a scheme that allows for the algorithm to carry out secure identification of multiple tags simultaneously.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115360615","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}

引用次数: 194

Time synchronization attacks in sensor networks 传感器网络中的时间同步攻击

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102238

T. Roosta, M. Manzo, S. Sastry

引用次数: 143

Improved topology assumptions for threshold cryptography in mobile ad hoc networks 移动自组织网络中阈值加密的改进拓扑假设

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102228

G. D. Crescenzo, Renwei Ge, G. Arce

{"title":"Improved topology assumptions for threshold cryptography in mobile ad hoc networks","authors":"G. D. Crescenzo, Renwei Ge, G. Arce","doi":"10.1145/1102219.1102228","DOIUrl":"https://doi.org/10.1145/1102219.1102228","url":null,"abstract":"Mobile Ad Hoc Networks (MANET), due to their lack of physical infrastructures or centralized authorities, pose a number of security challenges to a protocol designer. In particular, several typical application scenarios demand the design of protocols that cannot base their security on the existence of trusted parties or setup information, but rather need to leverage uniquely on assumptions limiting the corrupting power of the adversaries. This naturally defines security design and analysis paradigms similar to those of the Threshold Cryptography area, where it is typically assumed that an adversary can corrupt up to a limited amount of entities or resources. Therefore a secure realization of primitives from Threshold Cryptography in MANET promises to be applicable to several MANET protocols.Recently, in [10], we started the analysis of Threshold Cryptography solutions over MANET, by focusing on the problem of extending to these networks known efficient threshold signature schemes for wired networks. In particular, we noted a major design difficulty due to the lack of full network connectivity that significantly constrained the network topology assumptions under which a MANET threshold signature scheme can be proved secure. In this paper we continue our investigation and present a new MANET threshold signature scheme that is secure under significantly improved topology assumptions. Surprisingly, we break through an apparent barrier due to well-known results from the Distributed Computing area.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124466540","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}

引用次数: 16

The security of vehicular ad hoc networks 车载自组织网络的安全性

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102223

M. Raya, J. Hubaux

引用次数: 1251

A quantitative trust establishment framework for reliable data packet delivery in MANETs 面向manet中可靠数据包传输的定量信任建立框架

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102222

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

引用次数: 206

AnonDSR: efficient anonymous dynamic source routing for mobile ad-hoc networks AnonDSR:高效的移动ad-hoc网络匿名动态源路由

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102226

R. Song, L. Korba, George Yee

引用次数: 181

Defending against path-based DoS attacks in wireless sensor networks 无线传感器网络中基于路径的DoS攻击防御

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102235

Jing Deng, Richard O. Han, Shivakant Mishra

引用次数: 248

Information assurance in manets and wireless sensor networks 无线传感器网络中的信息保障

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102220

R. Poovendran

{"title":"Information assurance in manets and wireless sensor networks","authors":"R. Poovendran","doi":"10.1145/1102219.1102220","DOIUrl":"https://doi.org/10.1145/1102219.1102220","url":null,"abstract":"Manets and sensor networks are two classes of the wireless ad hoc networks with resource constraints. Manets typically consist of devices that have high capabilities, mobile and operate in coalitions. Sensor networks are typically deployed in specific geographical regions for monitoring and sensing. Both these wireless networks are characterized by their ad hoc nature that lack pre deployed infrastructure for computing and communication. Resource constraints, medium pathloss, and signal interference limit the communication range between any tow nodes, leading to the need for a multihop communication network. Such a network must be collaboratively formed and supported by the resource constraint nodes. For meaningful service provision, such a network must be able to provide confidentiality, integrity, and entity verification among participating nodes. In this talk, we will focus on such networks and discuss the challenges ahead that require fresh approaches in trust establishment and secure network service operations. We will take secure location services, probabilistic pre key deployment strategies, and group mobility scenarios of VANETs as examples to demonstrate the challenges in trust establishment and providing privacy.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116999636","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 security of group communication schemes based on symmetric key cryptosystems 基于对称密钥密码体制的群通信方案安全性研究

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102224

Shouhuai Xu

{"title":"On the security of group communication schemes based on symmetric key cryptosystems","authors":"Shouhuai Xu","doi":"10.1145/1102219.1102224","DOIUrl":"https://doi.org/10.1145/1102219.1102224","url":null,"abstract":"Many emerging applications in both wired and wireless networks, such as information dissemination and distributed collaboration in an adversarial environment, need support of secure group communications. There have been many such schemes in the setting of wired networks. These schemes can be directly adopted in, or appropriately adapted to, the setting of wireless networks such as mobile ad hoc networks (MANETs) and sensor networks. In this paper we show that the popular group communication schemes that we have examined are vulnerable to the following attack: an outsider adversary who compromises a legitimate group member could obtain some or all past group keys as well as the current group key; this is in sharp contrast to the widely-accepted belief that a such adversary can only obtain the current group key. This attack is very powerful also because it provides the adversary the following flexibility: since the adversary knows which members are the \"most valuable\" ones from its own perspective of view, compromise of any such member leads to the exposure of all the past and current group keys. This flexibility is particularly relevant in the setting of MANETs and sensor networks because they are typically deployed in a small area and the adversary can capture and compromise the easiest-to-obtain node. In order to deal with this powerful attack, we formalize two security models for stateful and stateless group communication schemes, respectively. We show that some practical methods can make a subclass of the group communication schemes immune to this attack at the following extra expense: at each rekeying event, a group member conducts logarithmically-many pseudorandom function evaluations.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115348571","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