论文部分内容阅读
An efficient authenticated key agreement protocol is proposed,which makes use of bilinear pairings and self-certified public keys. Its security is based on the security assumptions of the bilinear Diffie-Hellman problem and the computational Diffie-Hellman problem. Users can choose their private keys independently. The public keys and identities of users can be verified implicitly when the session key being generating in a logically single step. A trusted Key Generation Center is no longer required as in the ID-based authenticated key agreement protocols. Compared with existing authenticated key agreement protocols from pairings, the new proposed protocol is more efficient and secure.
It makes use of bilinear pairings and self-certified public keys. Its security is based on the security assumptions of the bilinear Diffie-Hellman problem and the computational Diffie-Hellman problem. Users can choose their private keys independently. The public keys and identities of users can be verified implicitly when the session key being generated in a logically single step. A trusted Key Generation Center is no longer required as in the ID-based authenticated key agreement protocols. Compared with existing authenticated key agreement protocols from pairings, the new proposed protocol is more efficient and secure.