Key Distribution in Wireless Sensor Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In resource-constrained wireless sensor and actuator networks, existing key distribution methods for secure communication are inefficient due to high computation and memory requirements, particularly in dynamically changing networks with large sizes, where symmetric cryptography is often used but struggles with key discovery.
Innovation Solution
A method where nodes use a list of cryptographic elements with a common root to generate an encryption key based on the identifier of the communicating node, eliminating the need to build the complete set of encryption elements and reducing computational effort by directly determining the position of the shared keying material from node identifiers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a different key is provided for every possible pair of nodes, then optimal resilience is achieved, but minimal scalability and high computation/memory requirements result
Solution Approach 1:
The key distribution is segmented into two components: a global key known to all nodes and node-specific key components. This segmentation allows nodes to efficiently determine shared keys with other nodes without requiring complete pairwise key sets, thus reducing computation and memory requirements while maintaining security resilience.
Solution Approach 2:
The global key is pre-distributed to all nodes before deployment. This preliminary action enables nodes to immediately participate in secure communications without requiring complex key establishment procedures, reducing both computation overhead and memory requirements while maintaining system resilience.
2Productivity
If the same symmetric key is loaded in all nodes, then optimal scalability is achieved, but minimal resilience results
Solution Approach 1:
While maintaining a common global key for efficient scalability, each node is assigned unique node-specific key components. This local differentiation ensures that compromise of one node does not compromise the entire network, thus providing resilience while maintaining the scalability benefits of a shared key structure.
3Measurement precision
If complete set of encryption elements is built for key discovery, then accurate key matching is achieved, but high computation power and memory capacity are required
Solution Approach 1:
The method extracts only the essential key components needed for secure communication: the global key and node-specific components. By taking out only these necessary elements rather than maintaining complete encryption element sets, nodes can accurately discover shared keys with minimal computation and memory requirements.
Data Source
AI summary
The present invention relates to a communication system comprising a first node and second node adapted for communicating in a network, wherein the first node comprises a first list of keying materials including a plurality of keying materials, wherein the second node comprises a second list of keying materials including a plurality of keying materials, wherein the first node further comprises a receiver for receiving from the second node a second node identifier, a controller being arranged for determining from the second node identifier the position in the first list of at least one keying material having a common root with one keying material of the second list, and for generating an encryption key by means of the keying material having a common root and the second node identifier.