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.