An efficient eCK secure identity based Two Party Authenticated Key Agreement scheme with security against active adversaries

Daniel, Renu Mary; Rajsingh, Elijah Blessing; Silas, Salaja

doi:10.1016/j.ic.2020.104630

Cited by 10 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, Zhang et al’s protocols did not have ephemeral key reveal resistance. In 2020, Daniel et al [ 30 ] pointed out that Bala et al’s protocol [ 21 ] could not resist an ephemeral key reveal attack. They also provided an ID-AKA protocol and presented its security proof in the eCK model [ 27 ].…”

Section: Related Workmentioning

confidence: 99%

“…However, its computational cost was still higher, which needed five-point multiplication operations in the elliptic curve. Furthermore, they pointed out that protocol [ 27 ] suffered from key offset attacks; however, key offset attacks could be simply avoided by adding a message authentication code using the same method in [ 30 ].…”

Section: Related Workmentioning

confidence: 99%

“…Here, the protocol PWCAS-22 [ 33 ] is based on physical unclonable function (PUF), and ZHVLH-23 [ 37 ] is based on pseudo-random permutation (PRF). The HC protocol [ 13 ], the NCL-16-II protocol [ 27 ], the DRS-20 protocol [ 30 ], and our protocols are provably secure in the eCK security model. But events in the security proof of NCL-16-II [ 27 ] are not complementary, which mismatches the freshness definition.…”

Section: Performance and Comparisonmentioning

confidence: 99%

“…The next sections will present the cryptanalysis of several ID-AKA protocols [21][22][23] first, and then provide the proposed ID-AKA protocols. [27] eCK@ Yes Yes Yes Yes GDH DRS-20 [30] eCK Yes Yes Yes Yes GDH DSH-21 [29] eCK* Yes Yes Yes Yes GDH PWCAS-22 [33] eCK* Yes Yes Yes Yes PUF ZHVLH-23 [37] eCK* Yes Yes Yes Yes PRF eCK* and mBR* are without the case where an active adversary may alter all public key materials not only the temporary public key. "-" denotes that there is no formal security proof for the protocol.…”

Section: Developments Of Ka Protocolsmentioning

confidence: 99%

See 3 more Smart Citations

Cryptanalysis and Improvement of Several Identity-Based Authenticated and Pairing-Free Key Agreement Protocols for IoT Applications

Sun,

Li,

Zhang

et al. 2023

Sensors

View full text Add to dashboard Cite

Internet of Things (IoT) applications have been increasingly developed. Authenticated key agreement (AKA) plays an essential role in secure communication in IoT applications. Without the PKI certificate and high time-complexity bilinear pairing operations, identity-based AKA (ID-AKA) protocols without pairings are more suitable for protecting the keys in IoT applications. In recent years, many pairing-free ID-AKA protocols have been proposed. Moreover, these protocols have some security flaws or relatively extensive computation and communication efficiency. Focusing on these problems, the security analyses of some recently proposed protocols have been provided first. We then proposed a family of eCK secure ID-AKA protocols without pairings to solve these security problems, which can be applied in IoT applications to guarantee communication security. Meanwhile, the security proofs of these proposed ID-AKA protocols are provided, which show they can hold provable eCK security. Some more efficient instantiations have been provided, which show the efficient performance of these proposed ID-AKA protocols. Moreover, comparisons with similar schemes have shown that these protocols have the least computation and communication efficiency at the same time.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%