作者: Quan Yuan , Songping Li
DOI:
关键词: Protocol (object-oriented programming) 、 Authentication 、 Computer science 、 Key (cryptography) 、 Computer network 、 Authenticated key agreement protocol 、 Oakley protocol
摘要: Recently Eun-Kyung Ryu, Eun-Jun Yoon, and Kee-Young Yoo proposed an efficient ID-based authenticated key agreement with paring[11]. They argued that it is secure efficient. In this paper, we show protocol doesn’t satisfy the Key-Compromise Impersonate property not against reveal attack. Then propose our from shim’s protocol[15], its security efficiency was analyzed.