Unlock instant, AI-driven research and patent intelligence for your innovation.
An Identity-Based Lagrangian Interpolation Key Management Method
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A key management and identity technology, which is applied in the identity authentication protocol between nodes and the field of key management protocol using Lagrangian interpolation, can solve the problems of short lifespan and high computing cost, and achieve reduced computing cost and high efficiency Effect
Active Publication Date: 2018-05-04
SOUTHEAST UNIV
View PDF2 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
But the problem is that based on the symmetric key mechanism, each pair of SNs is required to be pre-deployed with at least one root key
This creates a serious problem: the mechanism requires pre-deployment of a certificate management technology such as public key infrastructure (PKI) to verify the public keys of SNs
Current identity-based mechanisms require SNs to perform pairing operations during the key exchange process, which results in high computational cost and short lifetime of SNs
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0037] In this embodiment, the Init algorithm is designed and completed. The purpose of the Init algorithm is: the base station makes the ID I have (sk I , para)ID R have (sk R , para). Including but not limited to the following steps (expressed in a table):
[0038]
[0039] The protocol flow of this embodiment is as follows figure 2 shown.
[0040] The steps in Embodiment 1 are described as follows:
[0041](1) Step 100: The base station generates a group G with a generator g, and takes a prime number q.
[0042] (2) Step 102: The base station generates two random secret numbers a and b, and a, b∈Z q (Z q is the integer addition group of modulo q), and obtains the Lagrange interpolation polynomial L(x)=a+bxmodq, x∈R (R represents a real number, and this formula is a prototype, and the following steps 106 and 108 introduce specific parameters).
[0043] (3) Step 104: the base station calculates the corresponding public key. pk 1 =g a , pk 2 =g b ∈G. and pu...
Embodiment 2
[0047] In this embodiment, the KeyGen algorithm is designed and completed. The purpose of this stage is: to realize the generation of shared key k I and the corresponding ciphertext c. Including but not limited to the following steps (expressed in a table):
[0048]
[0049] The protocol flow of this embodiment is as follows image 3 shown.
[0050] The steps and the protocol flowchart in Embodiment 2 are described as follows:
[0051] (1) Step 110: ID I Randomly generate a secret number r∈Z q , and calculate c 1 =g r ∈G,c 2 = pk 1 r ∈G,c 3 = c 1 skI ∈G, so that the corresponding ciphertext c=(c 1， c 2， c 3 ).
[0052] (2) Step 112: Calculate the shared key
Embodiment 3
[0054] In this embodiment, the RVerify algorithm is designed and completed. The purpose of this stage is to realize whether the verification has been tampered with by the attacker. Including but not limited to the following steps (expressed in a table):
[0055] steps
content
114
The receiver verifies that the received data has not been tampered with.
[0056] The protocol flow of this embodiment is as follows Figure 4 shown.
[0057] The steps in Embodiment 3 and the protocol flow chart are described as follows:
[0058] (1) Step 114: ID R verify
[0059] c 2 Is it equal to (here means c 3 power of exponent and c 1 multiplied to the power of the exponent).
[0060] if equal id R Return True otherwise return False. The reason for the existence of the above equation is that
[0061]
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
Abstract
The invention discloses an identity-based Lagrangian interpolation key management protocol, which includes the following steps: (1) Initialization stage, realizing base station initialization key material, sensor node IDI obtains private key skI and public parameter para, sensor node The IDR obtains the private key skR and the public parameter para. The algorithm required at this stage is the Initalgorithm. (2) In the key agreement stage, the initiator IDI and the responder IDR of the key agreement in this stage calculate the shared keys kI and kR respectively, and the two are equal under the premise of ensuring correctness, which completes the key agreement. The algorithms required at this stage are KeyGen algorithm, Extrac algorithm and RVerify algorithm. The invention simplifies the public key infrastructure for certificate management, and realizes significantly reducing the computing cost of sensor nodes while ensuring the correctness, confidentiality, integrity and low communication overhead cost of the identity-based key exchange protocol. Meanwhile, security analysis and experiments show that the protocol is more effective than existing schemes.
Description
technical field [0001] The invention relates to an identity authentication protocol between nodes of a wireless sensor network, in particular to an identity-based key management protocol using Lagrangian interpolation in a wireless sensor network, and belongs to the technical field of Internet of Things security. Background technique [0002] Wireless sensor networks (WSNs) have been widely deployed in military, environmental and other commercial applications. To secure the communication between two sensor nodes (SNs), a key exchange module has been deployed to generate shared keys for securing the data transmitted between SNs. To simplify certificate management in public public key infrastructures (PKI), key exchange schemes for WSNs usually use identity-based cryptography (IBC) techniques to generate shared keys. However, due to the limited energy of SNs, computational cost is a serious problem for the above key exchange systems. [0003] Therefore, in order to increase ...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More