On the security of random key pre-distribution schemes

  title={On the security of random key pre-distribution schemes},
  author={M. Ramkumar and N. Memon},
  journal={Proceedings from the Fifth Annual IEEE SMC Information Assurance Workshop, 2004.},
  • M. Ramkumar, N. Memon
  • Published 2004
  • Computer Science
  • Proceedings from the Fifth Annual IEEE SMC Information Assurance Workshop, 2004.
Key pre-distribution (KPD) schemes, which are inherently trade-offs between security and complexity, are perhaps well suited for securing large-scale deployments of resource constrained nodes without persistent access to a trusted authority (TA). However, the need to offset their inherent security limitations, calls for some degree of tamper-resistance of nodes. Obviously, if absolute tamper-resistance is guaranteed, KPD schemes are rendered secure. In practice, however, tamper-resistance will… Expand
Safe renewal of a random key pre-distribution scheme for trusted devices
  • M. Ramkumar
  • Computer Science
  • Proceedings from the Sixth Annual IEEE SMC Information Assurance Workshop
  • 2005
The author address issues involved in safe renewal of a recently proposed random key pre-distribution scheme, HARPS (hashed random preloaded subsets) (Ramkumar, et al., 2005). Expand
Security bootstrap model of key pre-sharing by polynomial group in mobile Ad Hoc Network
The experimental results show that the proposed security bootstrap model of key pre-sharing by a polynomial group based on (t, n) threshold schema of Lagrange Polynomial Group (LPG) and one-way hash function to establish a distributive security infrastructure can ensure the security of MANET environment with better performance. Expand
We investigate the applicability of key pre-distribution schemes for securing ad hoc networks. While most key pre-distribution (KPD) schemes satisfy the fundamental requirements to serve as anExpand
Integrating group key distribution for securing UPnP services
  • J. Surbot, S. Witosurapot
  • Computer Science
  • 2010 2nd International Conference on Computer Engineering and Technology
  • 2010
It is shown how the KPD mechanism can be integrated into UPnP service discovery and utilization processes, which would be contributed to the extensive use of UpnP technology in some applications, where group security is needed. Expand
A Full Connection and Less Memory Usage Scheme for Distributed Sensor Networks
This work proposed a novel key management scheme which fulfills power control, less memory usage, and full connection, and is simple, efficient, and secure, if the sensor nodes cannot be compromised within a threshold time bound. Expand
An Efficient Key-Update Scheme for Wireless Sensor Networks
A novel key-update scheme is proposed for wireless sensor networks where the center server in a wireless sensor network first broadcasts a series of randomly generated code slices to sensor nodes, which assemble a common program based on the permutation to derive their common key. Expand
Stealthy attacks and defense strategies in competing sensor networks
Stealthy Attacks and Defense Strategies in Competing Sensor Networks. (August 2008) Aleksandra Czarlinska, B.A.Sc., University of Toronto Chair of Advisory Committee: Dr. Deepa Kundur The fundamentalExpand
Evolutionary Computation Guided Energy Efficient Key Organization in Wireless Communication (ECEEKO)
In this paper an Evolutionary Computation based energy efficient novel key organization (ECEEKO) policy has been proposed by incorporating computational safety, power management and restricted usageExpand


Random key predistribution schemes for sensor networks
The random-pairwise keys scheme is presented, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation. Expand
A matrix key-distribution scheme
A new key-distribution scheme is presented that lets each node have a set of keys of which it shares a distinct subset with every other node that has the advantage that the numbers of keys that must be generated is proportional to the number of nodes. Expand
Perfectly-Secure Key Distribution for Dynamic Conferences
This paper considers the model where interaction is allowed in the common key computation phase, and shows a gap between the models by exhibiting an interactive scheme in which the user's information is only k + t - 1 times the size of the commonKey. Expand
Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks
  • M. Ramkumar, Nasir Menon
  • Computer Science
  • GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)
  • 2003
This paper introduces a novel key management scheme, RPS - random preloaded subset key distribution - which satisfies all the stringent requirements on primitives that could be used to secure mobile ad hoc networks. Expand
A pairwise key pre-distribution scheme for wireless sensor networks
This paper proposes a new key pre-distribution scheme, which substantially improves the resilience of the network compared to the existing schemes, and exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that any nodes other than these compromised nodes are affected is close to zero. Expand
Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach
This paper presents a scalable and distributed protocol that enables two nodes to establish a pairwise shared key on the fly, without requiring the use of any on-line key distribution center. Expand
Secret Key Agreement without Public-Key Cryptography
This project focuses primarily on Leighton and Micali's secret-key agreement without the use of public-key encryption techniques, which is extremely efficient when implemented in software and has significant advantages over existing systems like Kerberos. Expand
A pairwise key predistribution scheme for wireless sensor networks
A new key predistribution scheme is proposed which substantially improves the resilience of the network compared to previous schemes, and an in-depth analysis of the scheme in terms of network resilience and associated overhead is given. Expand
An Optimal Class of Symmetric Key Generation Systems
  • R. Blom
  • Computer Science
  • 1984
The objective of this paper is to present a class of SKGS for which the amount of secret information needed by each user to generate his keys is the least possible while at the same time a certain minimum number of users have to cooperate to resolve the uncertainty of unknown keys. Expand
Efficient and Secure Source Authentication for Multicast
This paper proposes several substantial modifications and improvements to TESLA, which allows receivers to authenticate most packets as soon as they arrive, and improves the scalability of the scheme, reduce the space overhead for multiple instances, increase its resistance to denial-of-service attacks, and more. Expand