Two new authenticated key agreement protocols in the certificateless setting are presented in this paper. Both are proved secure in the extended Canetti-Krawczyk model, under the BDH assumption. The first one is more efficient than the Lippold et al.'s (LBG) protocol, and is proved secure in the same security model. The second protocol is proved secure under the Swanson et al.'s security model, a weaker model. As far as we know, our second proposed protocol is the first one proved secure in the Swanson et al.'s security model. If no pre-computations are done, the first protocol is about 26% faster than LBG, and the second protocol is about 49% faster than LBG, and about 31% faster than the first one. If pre-computations of some operations are done, our two protocols remain faster.
Denise H. GOYA
the Universidade Federal do ABC
Dionathan NAKAMURA
Universidade de São Paulo
Routo TERADA
Universidade de São Paulo
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
Denise H. GOYA, Dionathan NAKAMURA, Routo TERADA, "Certificateless Key Agreement Protocols under Strong Models" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 10, pp. 1822-1832, October 2016, doi: 10.1587/transfun.E99.A.1822.
Abstract: Two new authenticated key agreement protocols in the certificateless setting are presented in this paper. Both are proved secure in the extended Canetti-Krawczyk model, under the BDH assumption. The first one is more efficient than the Lippold et al.'s (LBG) protocol, and is proved secure in the same security model. The second protocol is proved secure under the Swanson et al.'s security model, a weaker model. As far as we know, our second proposed protocol is the first one proved secure in the Swanson et al.'s security model. If no pre-computations are done, the first protocol is about 26% faster than LBG, and the second protocol is about 49% faster than LBG, and about 31% faster than the first one. If pre-computations of some operations are done, our two protocols remain faster.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.1822/_p
Copy
@ARTICLE{e99-a_10_1822,
author={Denise H. GOYA, Dionathan NAKAMURA, Routo TERADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Certificateless Key Agreement Protocols under Strong Models},
year={2016},
volume={E99-A},
number={10},
pages={1822-1832},
abstract={Two new authenticated key agreement protocols in the certificateless setting are presented in this paper. Both are proved secure in the extended Canetti-Krawczyk model, under the BDH assumption. The first one is more efficient than the Lippold et al.'s (LBG) protocol, and is proved secure in the same security model. The second protocol is proved secure under the Swanson et al.'s security model, a weaker model. As far as we know, our second proposed protocol is the first one proved secure in the Swanson et al.'s security model. If no pre-computations are done, the first protocol is about 26% faster than LBG, and the second protocol is about 49% faster than LBG, and about 31% faster than the first one. If pre-computations of some operations are done, our two protocols remain faster.},
keywords={},
doi={10.1587/transfun.E99.A.1822},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - Certificateless Key Agreement Protocols under Strong Models
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1822
EP - 1832
AU - Denise H. GOYA
AU - Dionathan NAKAMURA
AU - Routo TERADA
PY - 2016
DO - 10.1587/transfun.E99.A.1822
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2016
AB - Two new authenticated key agreement protocols in the certificateless setting are presented in this paper. Both are proved secure in the extended Canetti-Krawczyk model, under the BDH assumption. The first one is more efficient than the Lippold et al.'s (LBG) protocol, and is proved secure in the same security model. The second protocol is proved secure under the Swanson et al.'s security model, a weaker model. As far as we know, our second proposed protocol is the first one proved secure in the Swanson et al.'s security model. If no pre-computations are done, the first protocol is about 26% faster than LBG, and the second protocol is about 49% faster than LBG, and about 31% faster than the first one. If pre-computations of some operations are done, our two protocols remain faster.
ER -