Random key distribution method and device

Abstract

The embodiment of the invention discloses a random secret key allocation method and relates to the technical field of safety in order to achieve the purpose that in a node random deploy network, one path secret key is allocated to any two nodes with low energy consumption, and thus the confidentiality of data transmission of the two nodes is guaranteed. The random secret key allocation method includes the steps that deploy parameters are calculated according to a safety strategy of an application scene before the nodes are deployed; a secret key ring is loaded, and the secret key ring is a set of small random secret keys; after the nodes are deployed randomly, the path secret key of a source node (or a destination node) is directly encrypted with a secret key shared with the destination node (or the source node) and transmitted to the destination node (or the source node) through a physically connected path; or after being encrypted through some neighbor node, the path secret key is further transmitted to the destination node (or the source node) through a physically connected path; after the destination node (or the source node) receives encrypted information transmitted by the opposite side, the path secret key is obtained through decryption.

Description

technical field [0001] The present invention relates to the field of security technology, in particular to a method and device for allocating keys to randomly deployed network nodes. Background technique [0002] In 2002, Eschemauer and Gligor proposed a random key pre-distribution method, usually called EG scheme. The key distribution method is divided into three stages: pre-distribution, shared key discovery, and path key establishment. The first stage occurs before key deployment. The system selects a large random key set, called the key pool, and then randomly extracts a small key set for each node, called the key ring. The second stage can occur in the neighbor node discovery process. The node broadcasts its own key ring identifier. The node receiving the broadcast information compares its own key ring identifier with the received key ring identifier and finds the same key. identifier, add the shared key identifier field to the record of the neighbor node, and the key...

AI Technical Summary

Problems solved by technology

Another method proposes to first establish a physical connection path from the source node to the destination node, and then find a node that shares a key with both the destination node and the source node on the path; this method enables the EG scheme to use the random graph theory to ensure high connectivity rate drop and, therefore, are usually not considered

[0005] In addition, there are the following problems in the path key establishment phase of the EG scheme: First, as an application layer protocol, it is necessary to modify the underlying routing protocol in the path key establishment phase to find a physically and logically connected path so that the key distribution method Second, in the process of physical path search, all nodes that receive routing information and respond need to perform calculations such as searching the neighbor list, which brings a lot of computational burden

Thirdly, the EG scheme only guarantees that the connectivity rate is close to 1 in the case of uniform distribution, but in a randomly deployed network, the distribution of neighbor nodes of a node is uneven, and the connectivity rate between nodes cannot be guaranteed.

Finally, since there is a shared key between physically connected path nodes in the path key establishment process, the number of hops in the path increases

Images