2017DEStech Transactions on Computer Science and EngineeringRequires access

An Improved Certificate-less Authenticated Key Agreement Protocol

Jie Ling, Zi-jian YU

Open publisher page 0 citations

Abstract

Through the analysis of the certificate-less authenticated key agreement protocol with security issue of key-compromise impersonation and invalid authentication, this paper proposes an efficient protocol based on Discrete Logarithm Problem and Computational Diffie-Hellman Problem assumptions to solve the security issue and reduce the overhead. During the conversation, the two entities each have three secret values, namely, the partial private key from Key Generate Center (KGC), the long-term private key from the entity itself, and the temporary private key for each conversation generated by the entity itself. Through the theoretical analysis, this scheme provides mutual authentication, forward security and key compromise impersonation, preventing MITM attack and keeping the session key secure as long as the communication parties with a secret value is not disclosed.

About this research paper

What this paper is about

Through the analysis of the certificate-less authenticated key agreement protocol with security issue of key-compromise impersonation and invalid authentication, this paper proposes an efficient protocol based on Discrete Logarithm Problem and Computational Diffie-Hellman Problem assumptions to solve the security issue and reduce the overhead. During the conversation, the two entities each have three secret values, namely, the partial private key from Key Generate Center (KGC), the long-term private key from the entity itself, and the temporary private key for each conversation generated by the entity itself. Through the theoretical analysis, this scheme provides mutual authentication, forward security and key compromise impersonation, preventing MITM attack and keeping the session key secure as long as the communication parties with a secret value is not disclosed.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Through the analysis of the certificate-less authenticated key agreement protocol with security issue of key-compromise impersonation and invalid authentication, this paper proposes an efficient protocol based on Discrete Logarithm Problem and Computational Diffie-Hellman Problem assumptions to solve the security issue and reduce the overhead. During the conversation, the two entities each have three secret values, namely, the partial private key from Key Generate Center (KGC), the long-term private key from the entity itself, and the temporary private key for each conversation generated by the entity itself. Through the theoretical analysis, this scheme provides mutual authentication, forward security and key compromise impersonation, preventing MITM attack and keeping the session key secure as long as the communication parties with a secret value is not disclosed.

Key concepts: Computer science, Computer security, Session key, Key-agreement protocol, Key (lock), Public-key cryptography, Authentication (law), Implicit certificate

Related papers

Back to paper searchBrowse research topicsOriginal source
An Improved Certificate-less Authenticated Key Agreement Protocol — Research Paper | ScholarLens