Paper Info
Title
Strongly secure identity-based authenticated key agreement protocols
Abstract
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.
Year
DOI
Venue
2011
10.1016/j.compeleceng.2011.03.001
Computers & Electrical Engineering
Keywords
Field
DocType
previous id-based aka scheme,id-based aka protocol,key agreement protocol,strong eck model,secure variant,original scheme,random oracle model,basic desirable security property,master key forward secrecy,standard computational bilinear diffie-hellman,gap bilinear diffie-hellman assumption,it security,diffie hellman,provable security,forward secrecy
Overhead (computing),Authentication,Master key,Computer science,Computer security,Random oracle,Computer network,Forward secrecy,Security properties,AKA,Bilinear interpolation
Journal
Volume
Issue
ISSN
37
2
Computers and Electrical Engineering
Citations 
PageRank 
References 
15
0.59
26
Authors
4
Name
Order
Citations
PageRank
Liang Ni1562.09
Gong-Liang Chen216013.54
Jian-hua Li355898.16
Yanyan Hao4451.50