A Pair-based Combined Hierarchical Interactionless Key Agreement Method

Abstract

The invention discloses a pair-based combined hierarchical non-interaction key negotiation method, which includes overall scheme design and negotiation algorithm design; specifically includes the following steps: S1 registration; PKG generation system parameters, which are generated by the first-layer nodes in the domain And distribute the corresponding private key; S2: intermediate node key distribution; each intermediate node obtains its own CPK private key table from PKG distribution. S3: node key extraction; each intermediate node uses its own CPK private key table to generate a CPK key component, which is combined with the hierarchical identity key to form its own node key. S4: Establish the initialization of the session channel, initiate the communication party and complete the calculation of the session key. S5: The two parties communicate formally; the receiver calculates the session key and decrypts the communication content. The two parties can directly establish an encrypted channel without additional communication for key negotiation. The CPK table is used to realize the sharing of public keys. The leaf node only needs to store two CPK public key tables, and does not need to interact with the communicating party in advance to obtain the public key information of the node.

Description

technical field [0001] The invention relates to the technical field of communications, in particular to a pair-based combined hierarchical non-interaction key negotiation method. Background technique [0002] Currently, key agreement is a fundamental security function that enables two nodes to negotiate a shared key to protect their communications. Because sensor nodes in mobile ad hoc networks (MANETs) have limited power and processing storage capabilities, key agreement should have the following properties: [0003] No interaction: Nodes can compute the same shared key without interaction so energy and bandwidth consumption can be significantly reduced. [0004] Identity-based: Each node only needs to know its own private key and the identity of the other party to calculate the shared secret key, which minimizes the interaction required to effectively establish communication. [0005] · Hierarchical structure: The scheme is to distribute the responsibility of key generat...

AI Technical Summary

Problems solved by technology

[0008] (1) Gennaro et al. (2008) established two non-interactive hierarchical key agreement schemes, but they are only safe for any number of leaf node key leaks. And they cannot be well extended to Many more levels, which do not even conform to the generalized IBNIKA (Kenneth, 2009) level definition extension.

[0009] (2) Under the bilinear mapping, Guo et al. (2011) tried to propose an effective HIB-NIKA. But we found that it is not as safe as they claim

However, the complex computational load of multi-line pairs is unacceptable for applications in resource-constrained environments, so it is impractical and undesirable to use multi-line pairs to construct HIB-NIKA in wireless ad hoc networks

Images