This letter proposes an identity-based authenticated key agreement protocol. Different from available comparable ones, the new protocol realizes implicit authentication without bilinear pairings which makes it more efficient. The security of proposed protocol can be reduced to the standard Computational Diffie-Hellman problem. Two variants of the protocol are also given, with one achieving the security-efficiency trade-off and the other providing authenticated key agreement between users of different domains.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Xuefei CAO, Weidong KOU, Yong YU, Rong SUN, "Identity-Based Authenticated Key Agreement Protocols without Bilinear Pairings" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 12, pp. 3833-3836, December 2008, doi: 10.1093/ietfec/e91-a.12.3833.
Abstract: This letter proposes an identity-based authenticated key agreement protocol. Different from available comparable ones, the new protocol realizes implicit authentication without bilinear pairings which makes it more efficient. The security of proposed protocol can be reduced to the standard Computational Diffie-Hellman problem. Two variants of the protocol are also given, with one achieving the security-efficiency trade-off and the other providing authenticated key agreement between users of different domains.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.12.3833/_p
Copy
@ARTICLE{e91-a_12_3833,
author={Xuefei CAO, Weidong KOU, Yong YU, Rong SUN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Identity-Based Authenticated Key Agreement Protocols without Bilinear Pairings},
year={2008},
volume={E91-A},
number={12},
pages={3833-3836},
abstract={This letter proposes an identity-based authenticated key agreement protocol. Different from available comparable ones, the new protocol realizes implicit authentication without bilinear pairings which makes it more efficient. The security of proposed protocol can be reduced to the standard Computational Diffie-Hellman problem. Two variants of the protocol are also given, with one achieving the security-efficiency trade-off and the other providing authenticated key agreement between users of different domains.},
keywords={},
doi={10.1093/ietfec/e91-a.12.3833},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Identity-Based Authenticated Key Agreement Protocols without Bilinear Pairings
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3833
EP - 3836
AU - Xuefei CAO
AU - Weidong KOU
AU - Yong YU
AU - Rong SUN
PY - 2008
DO - 10.1093/ietfec/e91-a.12.3833
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2008
AB - This letter proposes an identity-based authenticated key agreement protocol. Different from available comparable ones, the new protocol realizes implicit authentication without bilinear pairings which makes it more efficient. The security of proposed protocol can be reduced to the standard Computational Diffie-Hellman problem. Two variants of the protocol are also given, with one achieving the security-efficiency trade-off and the other providing authenticated key agreement between users of different domains.
ER -