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

Beijing Daxue Xuebao. Zirankexueban

Identity-Based Authenticated Key Agreement Protocols without Bilinear Pairing in Multiple PKG Environments

Junquan Li

Published Jan 1, 2012• 0 citations
OpenAlex

Abstract

The authors present an identity-based authenticated key agreement protocol without bilinear pairing in multiple PKG environments.Reduced to the standard computational Diffie-Hellman(CDH) assumption in the random oracle model,the protocol security is given a complete proof based on the security of proposed ID-based exponential challenge-response(XCR) signature scheme and dual challenge-response(DCR) signature scheme.Compared with previous identity-based authenticated key agreement protocols,the new protocol shows better performances.

Related papers

Provably Secure Identity-based Authenticated Key Agreement Protocols in Multiple PKG Environment

Pla Information

Most available identity-based authenticated key agreement protocols require that both protocol participants are from the same PKG(Private Key Generator) environment.However,safe communication is requisite between protocol participants that are from different PKG environment in practice.In this paper,a new identity-based AKA(Authenticated Key Agreement) protocol is proposed in multiple PKG environment,which makes use of a new technique called twin Diffie-Hellman problem.Moreover,the security of the proposed protocol can be reduced to the standard CDH and BDH assumption in the eCK model,which makes use of the trapdoor test technology proposed by Cash et al in Eurocrypt 2008.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Jan 1, 2010•1 citation

New Identity-based Authenticated Key Agreement Protocol

Hui Ding, Yin Xin-chun

This paper designs an identity-based authenticated key agreement protocol with perfect forward security of Private Key Generator(PKG).It is proved to provide known key security,forward secrecy,key-compromise impersonation and so on in standard model.Its security is based on Bilinear Decisional Diffie-Hellman(BDDH) assumption,so its security is higher than the protocols based on the weaker assumption.

Jisuanji gongcheng•Jan 1, 2010•0 citations

Efficient strongly-secure identity-based authenticated key agreement protocol

Jian Shu

Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.

Journal of Computer Applications•Jan 1, 2012•0 citations

Identity-based authenticated key agreement protocols in multiple PKG environments in the standard model

Juan You, Song Xia, Junquan Li

Most available identity-based authenticated key agreement protocols require that both protocol participants are from the same PKG environment, which are unfit for roaming between different domains and the asymmetric computational environment in heterogeneous integrated network. So it is quite needed to propose identity-based authenticated key agreement protocol in multiple PKG environments. This paper presents an identity-based authenticated key agreement protocol in multiple PKG environments in standard model, which is an improved version of recent proposed protocol. The intruder's ability is improved to issue one PKG's master private key in ID-BJM model for multiple PKG environments. The new protocol is proved secure in improved ID-BJM model.

IEEE International Conference on Computer Science and Automation Engineering•Jun 1, 2011•2 citations

An Efficient Tripartite Identity-Based Authenticated Key Agreement Protocol

Xiaotong Fu, Shufang Guo, Ruijun Shi

In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2013•2 citations

Pairing-free Single Round Certificateless and Identity Based Authenticated Key Exchange Protocols

Saikrishna Badrinarayanan, Chandrasekharan Pandu Rangan

Designing efficient key agreement protocols is a fundamental cryptographic problem. In this paper, we first define a security model for key agreement in certificateless cryptography that is an extension of earlier models. We note that the existing pairing free protocols are not secure in our model. We design an efficient pairing-free, single round protocol that is secure in our model based on the hardness assumption of the Computational Diffie Hellman (CDH) problem. We also observe that previously existing pairing-free protocols were secure based on much stronger assumptions such as the hardness of the Gap Diffie Hellman problem. We use a restriction of our scheme to design an efficient pairing-free single round identity based key agreement protocol that is secure in the id-CK+ model based on the hardness assumption of the CDH problem. Additionally, both our schemes satisfy several other security properties such as forward secrecy, resistance to reflection attacks etc.

International Conference on Security and Cryptography•Jan 1, 2014•1 citation
The authors present an identity-based authenticated key agreement protocol without bilinear pairing in multiple PKG environments.Reduced to the standard computational Diffie-Hellman(CDH) assumption in the random oracle model,the protocol security is given a complete proof based on the security of proposed ID-based exponential challenge-response(XCR) signature scheme and dual challenge-response(DCR) signature scheme.Compared with previous identity-based authenticated key agreement protocols,the new protocol shows better performances.
Most available identity-based authenticated key agreement protocols require that both protocol participants are from the same PKG(Private Key Generator) environment.However,safe communication is requisite between protocol participants that are from different PKG environment in practice.In this paper,a new identity-based AKA(Authenticated Key Agreement) protocol is proposed in multiple PKG environment,which makes use of a new technique called twin Diffie-Hellman problem.Moreover,the security of the proposed protocol can be reduced to the standard CDH and BDH assumption in the eCK model,which makes use of the trapdoor test technology proposed by Cash et al in Eurocrypt 2008.
Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.
Most available identity-based authenticated key agreement protocols require that both protocol participants are from the same PKG environment, which are unfit for roaming between different domains and the asymmetric computational environment in heterogeneous integrated network. So it is quite needed to propose identity-based authenticated key agreement protocol in multiple PKG environments. This paper presents an identity-based authenticated key agreement protocol in multiple PKG environments in standard model, which is an improved version of recent proposed protocol. The intruder's ability is improved to issue one PKG's master private key in ID-BJM model for multiple PKG environments. The new protocol is proved secure in improved ID-BJM model.
In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.
Designing efficient key agreement protocols is a fundamental cryptographic problem. In this paper, we first define a security model for key agreement in certificateless cryptography that is an extension of earlier models. We note that the existing pairing free protocols are not secure in our model. We design an efficient pairing-free, single round protocol that is secure in our model based on the hardness assumption of the Computational Diffie Hellman (CDH) problem. We also observe that previously existing pairing-free protocols were secure based on much stronger assumptions such as the hardness of the Gap Diffie Hellman problem. We use a restriction of our scheme to design an efficient pairing-free single round identity based key agreement protocol that is secure in the id-CK+ model based on the hardness assumption of the CDH problem. Additionally, both our schemes satisfy several other security properties such as forward secrecy, resistance to reflection attacks etc.