Pair-based combined hierarchical non-interactive key negotiation method

Abstract

The invention discloses a pair-based combined hierarchical non-interactive key negotiation method. The method comprises an overall scheme design and a negotiation algorithm design. The method specifically comprises the following steps: S1, registering: the PKG generates system parameters, and generates and distributes corresponding private keys for the first layer of nodes in the domain; S2, intermediate node key distribution: each intermediate node obtains its exclusive CPK private key table from the PKG distribution; S3, extracting of node keys: each intermediate node generates a CPK key component by using the own CPK private key table, and the CPK key component is combined with the hierarchical identity key to form an own node key; S4, establishing of initialization of a session channel, initiating of a communication party and completing of calculation of a session key; S5, formal communication between two parties: a receiving party calculates the session key and decrypts the communication content. The two parties can directly establish an encryption channel without additional communication for key agreement. Public key sharing is achieved through the CPK tables, and the leaf nodes only need to store the two CPK public key tables and do not need to interact with the other communication party in advance to obtain public key information of the nodes.

Description

technical field [0001] The invention relates to the technical field of communication, 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 communication. Because sensor nodes in mobile ad hoc networks (MANETs) have limited power and processing and storage capabilities, key agreement should have the following properties: [0003] No interaction: Nodes can compute the same shared secret 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 gen...

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