نتایج جستجو برای: Random Key Predistribution

تعداد نتایج: 820182  

2012
Jirí Kur Vashek Matyas Petr Svenda

Key distribution is of a critical importance to security of wireless sensor networks (WSNs). Random key predistribution is an acknowledged approach to the key distribution problem. In this paper, we propose and analyze two novel improvements that enhance security provided by the random key predistribution schemes. The first improvement exploits limited length collisions in secure hash functions...

Journal: :CoRR 2010
Hao Chen

Key establishment is the basic necessary tool in the network security, by which pairs in the network can establish shared keys for protecting their pairwise communications. There have been some key agreement or predistribution schemes with the property that the key can be established without the interaction ([3], [4], [19]). Recently the hierarchical cryptography and the key management for hier...

2005
John P. Jones

Traditional key-management requires either the use of public key cryptography or that an on-line trusted third party arbitrate the selection and distribution of symmetric keys to communicating nodes. Recently much work has been published on random key predistribution methods, in which keys are predistributed between a limited set of node pairs and are used to bootstrap other required node pairs...

2006
Zeen Kim Jangseong Kim Kwangjo Kim

In wireless sensor network (WSN), preditibution of cryptographic keys is possibly the most practical approach to perfect network communications. In this paper, we propose a new secret key predistribution scheme to achieve a higher connectivity in WSN. For this we combine a random key predistribution scheme and hash chain method based on the prior knowledge of sensor node deployment. The propose...

Journal: :IACR Cryptology ePrint Archive 2012
Ed Kendall Michelle Kendall Wilfrid S. Kendall

A commonly used metric for comparing the resilience of key predistribution schemes is fails, which measures the proportion of network connections which are ‘broken’ by an adversary which has compromised s nodes. In ‘Random key predistribution schemes for sensor networks’, Chan, Perrig and Song present a formula for measuring the resilience in a class of random key predistribution schemes called...

2003
Haowen Chan Adrian Perrig Dawn Xiaodong Song

Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the framework of pre-distributing a random set of keys to each node. First, in the q-composite keys s...

2003
Haowen Chan Adrian Perrig Dawn Song

Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the framework of pre-distributing a random set of keys to each node. First, in the q-composite keys s...

2007
Abdülhakim Ünlü Önsel Armagan Albert Levi Erkay Savas Özgür Erçetin

In sensor networks, secure communication among sensor nodes requires secure links and consequently secure key establishment. Due to resource constraints, achieving such key establishment is non-trivial. Recently some random key predistribution techniques have been proposed to establish pairwise keys. Some of these approaches assume certain deployment knowledge is available prior to deployment a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید