Strongly secure identity-based authenticated key agreement protocols

✍ Scribed by Liang Ni; Gongliang Chen; Jianhua Li; Yanyan Hao

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 272 KB
• Volume: 37
• Category: Article
• ISSN: 0045-7906
• DOI: 10.1016/j.compeleceng.2011.03.001

✦ Synopsis

In this paper, we present a strongly secure identity-based (ID-based) two-party authenticated key agreement (AKA) protocol, which captures all basic desirable security properties including master key forward secrecy, ephemeral secrets reveal resistance and so on, and is provably secure in the extended Canetti-Krawczyk (eCK) model. The security of the protocol can be reduced to the standard Computational Bilinear Diffie-Hellman assumption in the random oracle model. Our scheme is secure as long as each party has at least one uncompromised secret. Also, we give a strongly secure variant of the protocol. The variant has a much lower computational overhead than the original scheme, while its security relies on the Gap Bilinear Diffie-Hellman assumption. Currently, there are few ID-based AKA protocols that are provably secure in the strong eCK model. Compared with previous ID-based AKA schemes, our protocols have advantages over them in security or efficiency.