Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Computers & Electrical Engineering

Vulnerability of two multiple-key agreement protocols

Mohammad Sabzinejad Farash, Majid Bayat, Mahmoud Ahmadian‐Attari

Published Mar 1, 2011• 25 citations
Publisher
DOI
10.1016/j.compeleceng.2011.02.007

Related papers

Key agreement protocols and their security analysis

Simon Blake-Wilson⋆⋆, Don B. Johnson, Alfred Menezes

Lecture notes in computer science•Jan 1, 1997•601 citations

Identity-based Authenticated Multiple Key Agreement Protocol with PKG Forward Security

Zuowen Tan

Authenticated multiple key agreement protocols not only allow participants to agree the multiple session keys within one run of the protocol but also ensure the authenticity of the other party.In 2011, Dehkordi et al. proposed an identity-based authenticated multiple key agreement protocol.In this paper, we demonstrate that Dehkordi et al.'s protocol is vulnerable to impersonation attacks.Furthermore, we have found that their protocol cannot provide perfect forward security or mutual security.Then we propose an identity-based authenticated multiple key agreement protocol which removes the weaknesses of the Dehkordi et al.'s protocol.Compared with the multiple key agreement protocols in the literature, the proposed protocol is more efficient and holds stronger security.

KSII Transactions on Internet and Information Systems•Jan 1, 2012•5 citations

Security of Multiple-Key Agreement Protocols and Propose an Enhanced Protocol.

Mohammad Sabzinejad Farash, Mahmoud Ahmadian‐Attari, Majid Bayat

•Jan 1, 2011•5 citations

An Enhanced ID-based Authenticated Multiple Key Agreement Protocol

Zuowen Tan

Authenticated multiple key agreement protocols not only allow participants to agree the multiple session keys within one run of the protocol but also ensure the authenticity of the other party. In 2011, Dehkordi et al. proposed an identity-based authenticated multiple key agreement protocol. In this paper, we demonstrate that Dehkordi et al.’s protocol is vulnerable to impersonation attack. Furthermore, we have found that their protocol cannot provide perfect forward security or mutual security. Then we propose an identity-based multiple key agreement protocol which removes the weaknesses of the Dehkordi et al.’s protocol. Compared with the multiple key agreement protocols in the literature, the proposed protocol is more efficient and holds stronger security. DOI: http://dx.doi.org/10.5755/j01.itc.42.1.1381

Information Technology And Control•Mar 13, 2013•2 citations

Post‐quantum identity‐based authenticated multiple key agreement protocol

Yang Yang, Hongji Yuan, Linbo Yan +1 more

Abstract Authenticated multiple key agreement (AMKA) protocols provide participants with multiple session keys after one round of authentication. Many schemes use Diffie–Hellman or authenticated key agreement schemes that rely on hard integer factorizations that are vulnerable to quantum algorithms. Lattice cryptography provides quantum resistance to authenticated key agreement protocols, but the certificate always incurs excessive public key infrastructure management overhead. Thus, a lightweight lattice‐based secure system is needed that removes this overhead. To answer this need, we provide a two‐party lattice‐ and identity‐based AMKA scheme based on bilateral short integer or computational bilateral inhomogeneous small integer solutions, and we provide a security proof based on the random oracle model. Compared with existing AMKA protocols, our new protocol has higher efficiency and stronger security.

ETRI Journal•Jun 27, 2023•10 citations

Security Analysis and Applications of Standard Key Agreement Protocols

Soohyun Oh, Jin Kwak, Seungwoo Lee +1 more

Lecture notes in computer science•Jan 1, 2003•7 citations
Authenticated multiple key agreement protocols not only allow participants to agree the multiple session keys within one run of the protocol but also ensure the authenticity of the other party.In 2011, Dehkordi et al. proposed an identity-based authenticated multiple key agreement protocol.In this paper, we demonstrate that Dehkordi et al.'s protocol is vulnerable to impersonation attacks.Furthermore, we have found that their protocol cannot provide perfect forward security or mutual security.Then we propose an identity-based authenticated multiple key agreement protocol which removes the weaknesses of the Dehkordi et al.'s protocol.Compared with the multiple key agreement protocols in the literature, the proposed protocol is more efficient and holds stronger security.
Authenticated multiple key agreement protocols not only allow participants to agree the multiple session keys within one run of the protocol but also ensure the authenticity of the other party. In 2011, Dehkordi et al. proposed an identity-based authenticated multiple key agreement protocol. In this paper, we demonstrate that Dehkordi et al.’s protocol is vulnerable to impersonation attack. Furthermore, we have found that their protocol cannot provide perfect forward security or mutual security. Then we propose an identity-based multiple key agreement protocol which removes the weaknesses of the Dehkordi et al.’s protocol. Compared with the multiple key agreement protocols in the literature, the proposed protocol is more efficient and holds stronger security. DOI: http://dx.doi.org/10.5755/j01.itc.42.1.1381
Abstract Authenticated multiple key agreement (AMKA) protocols provide participants with multiple session keys after one round of authentication. Many schemes use Diffie–Hellman or authenticated key agreement schemes that rely on hard integer factorizations that are vulnerable to quantum algorithms. Lattice cryptography provides quantum resistance to authenticated key agreement protocols, but the certificate always incurs excessive public key infrastructure management overhead. Thus, a lightweight lattice‐based secure system is needed that removes this overhead. To answer this need, we provide a two‐party lattice‐ and identity‐based AMKA scheme based on bilateral short integer or computational bilateral inhomogeneous small integer solutions, and we provide a security proof based on the random oracle model. Compared with existing AMKA protocols, our new protocol has higher efficiency and stronger security.