Space-Efficient Keying in Wireless Communication Networks

  title={Space-Efficient Keying in Wireless Communication Networks},
  author={N. Mittal},
  journal={Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007)},
  • N. Mittal
  • Published 2007
  • Computer Science
  • Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007)
We investigate the problem of assigning keys to nodes in a network such that each node is able to communicate with every other node in a secure manner. We propose a key assignment scheme that assigns at most [log n]2 keys to each node, where n is the number of nodes in the network. The key that two nodes should use to securely communicate with each other is derived from at most [log n] keys and can be computed in O(log n) time. Finally, the collusion resistance of our scheme degrades gracefully… Expand

Figures from this paper

Leveraging Social Contacts for Message Confidentiality in Delay Tolerant Networks
This paper designs a scheme that allows users to leverage social contact information to exchange confidential and authentic messages and evaluates the proposed scheme by analyzing real-world social network data, simulating communication scenarios, and through an informal security analysis. Expand
Symmetric Key Approaches to Securing BGP—A Little Bit Trust Is Enough
This paper presents a new flexible threat model that assumes for any path of length h, at least one BGP router is trustworthy, where h is a parameter that can be tuned according to security requirements and presents two new symmetric key approaches to securing BGP: the centralized key Distribution approach and the distributed key distribution approach. Expand


Key Grids: A Protocol Family for Assigning Symmetric Keys
It is shown that kradicn colluding processes can compromise the security of the k-th protocol in the protocol family, a family of log n protocols for assigning symmetric keys to n processes in a network so that each process can use its assigned keys to communicate securely with every other process. Expand
Logarithmic Keying of Communication Networks
This paper presents a more efficient scheme for assigning symmetric keys to the different processes in a communication network, referred to as logarithmic keying, and shows that it can be used in rich classes of communication networks that include star networks, acyclic networks, limited- cycle networks, and planar networks. Expand
Secret instantiation in ad-hoc networks
These protocols provide a continuum where the level of privacy and authentication depends upon user requirements and capabilities and propose two probabilistic protocols that maintain O(log n) secrets and where the probability of security compromise between two users is inversely proportional to the number of secrets they maintain. 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
A key-management scheme for distributed sensor networks
A key-management scheme designed to satisfy both operational and security requirements of DSNs is presented, which relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes. Expand
Providing robust and ubiquitous security support for mobile ad-hoc networks
This paper describes a solution that supports ubiquitous security services for mobile hosts, scales to network size, and is robust against break-ins and employs localized certification schemes to enable ubiquitous services. Expand
Design of Secure End-toEnd Protocols for Mobile Systems
This paper proposes secure end-to-end protocols between mobile users using a combination of public key and symmetric key based systems that enable mutual authentication and establish a shared secret key between mobile Users. Expand
The quest for security in mobile ad hoc networks
An overview of security problems for mobile ad hoc networks is provided, distinguishing the threats on basic mechanisms and on security mechanisms and the solution to protect the security mechanisms is described. Expand
Key Distribution Protocol for Digital Mobile Communication Systems
A key distribution protocol is proposed for digital mobile communication systems that can be used with a star-type network and a countermeasure is proposed to cope with a possible active attack by a conspiracy of two opponents. Expand
Security for Sensor Networks
This chapter identifies the vulnerabilities associated with the operational paradigms currently employed by Wireless Sensor Networks and a framework for implementing security in WSNs, which identifies the security measures necessary to mitigate the identified vulnerabilities. Expand