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

International Conference on Computational Intelligence and Security (CIS)

A Provably Secure Identity-Based Key Agreement Protocol from Key Encapsulation Scheme

Yang Cai, Qiuliang Xu, Zhihua Zheng

Published Nov 1, 2012• 1 citation
Publisher

Abstract

In this paper, we present a two-party key agreement protocol, which is secure in standard model. By using the Goldreich-Levin hardcore predicate, we reduce the security of our scheme to Computational Bilinear Diffie-Hellman assumption, and a proof is given. Furthermore, with the consistency of messages exchanged publicly verifiable, our scheme achieves most of the known security attributes.

DOI
10.1109/cis.2012.147

Related papers

A Provably Secure Two-Party Attribute-Based Key Agreement Protocol

Hao Wang, Qiuliang Xu, Tao Ban

In this paper, we present a two-party attribute-based key agreement protocol, which is secure in random oracle model under the Bilinear Diffe-Hellman assumption. It is inspired by a fuzzy identity-based encryption scheme first proposed by Sahai and Waters. The attribute-based key agreement scheme is a new type of identity-based key agreement scheme, in which we can view identity as a set of descriptive attributes. Our scheme not only preserves the advantages of traditional identity-based key agreement protocol, but also provides some new properties, such as hiding the identity information of the individual, increasing the flexibility of key management.

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)•Sep 1, 2009•16 citations

Certificateless Two-party Authenticated Key Agreement Protocol With Provable Security

Jian Shu

This paper studies two-party authenticated agreement protocol in the certificateless public setting.Most of existing schemes either are proved insecure or have computation burden.Basesd on twin Diffie-Hellman problem introduced by Cash,Kiltz and Shoup,an efficient certificateless authenticated two-party key agreement protocol using bilinear pair is proposed.To construct an effective decision oracle for twin Diffie-Hellman problem,generic method of extracting partial private key is proposed.the method,with one master key and two hash functions.is applied to the design of protocol.When compared with other schemes with provable security,the proposed scheme,with the same message bandwidth,achieve efficiency in computational cost.The security of the proposed scheme has been proven in the random oracle model without Gap assumption.

Journal of Chinese Computer Systems•Jan 1, 2012•2 citations

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

An Identity-Based Group Key Agreement Protocol from Pairing

Hongji Wang, Gang Yao, Qingshan Jiang

In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, using most of those protocols, the session key which users arrive is depended on the identity information. In this paper, we first propose a two-party identity-based key agreement protocol based on pairings whose security relies on the hardness of the bilinear Diffie-Hellman problem in the random oracle model, and the session key is independent of the identity information. After that we extend the protocol to an identity-based group key agreement protocol, which uses no broadcasting. The proposed key agreement protocol achieves the security attributes: known session key security, perfect forward secrecy, no key compromise impersonation, no unknown key share and no key control.

International Conference on Availability, Reliability and Security (ARES)•Mar 1, 2008•10 citations

An efficient two-party key exchange protocol with strong security

Shao-feng DENG, LI Yi-fa, Yiqun Deng

Combined public key (CPK) cryptography does not need certificates to guarantee the authenticity of public keys and avoids the inherent key escrow problem of identity-based cryptography. Based on the efficient CPK scheme, we present an efficient three-round two-party authenticated key exchange protocol with strong security, which is provably secure in the standard model under the decisional Diffie-Hellman (DDH) assumption. The protocol can keep the session key secret from the adversary except that one party’s ephemeral private key and static private key are all revealed to the adversary. Compared to the existing protocols, this protocol not only assures strong security but also is more efficient.

Wuhan University Journal of Natural Sciences•May 12, 2010•2 citations

Provably secure identity-based authenticated key agreement protocol and its application

Shuai Shao, Bin Tian, Xin Wang +1 more

We point out the RYY+ identity-based (ID-based) key agreement protocol is vulnerable to Key-compromise impersonation (KCI) attack and Intermediate results leakage (IRL) attack. Then we give the improved protocol which provides KCI and IRL resistance. The novel protocol is provably secure under the gap Bilinear Diffie-Hellman assumption in the seCK model, which enhances the adversary's queries comparing with previous ID based AKE models. The proposed scheme also has an advantage over most previous schemes on security and efficiency.

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)•Oct 1, 2012•0 citations
In this paper, we present a two-party key agreement protocol, which is secure in standard model. By using the Goldreich-Levin hardcore predicate, we reduce the security of our scheme to Computational Bilinear Diffie-Hellman assumption, and a proof is given. Furthermore, with the consistency of messages exchanged publicly verifiable, our scheme achieves most of the known security attributes.
In this paper, we present a two-party attribute-based key agreement protocol, which is secure in random oracle model under the Bilinear Diffe-Hellman assumption. It is inspired by a fuzzy identity-based encryption scheme first proposed by Sahai and Waters. The attribute-based key agreement scheme is a new type of identity-based key agreement scheme, in which we can view identity as a set of descriptive attributes. Our scheme not only preserves the advantages of traditional identity-based key agreement protocol, but also provides some new properties, such as hiding the identity information of the individual, increasing the flexibility of key management.
This paper studies two-party authenticated agreement protocol in the certificateless public setting.Most of existing schemes either are proved insecure or have computation burden.Basesd on twin Diffie-Hellman problem introduced by Cash,Kiltz and Shoup,an efficient certificateless authenticated two-party key agreement protocol using bilinear pair is proposed.To construct an effective decision oracle for twin Diffie-Hellman problem,generic method of extracting partial private key is proposed.the method,with one master key and two hash functions.is applied to the design of protocol.When compared with other schemes with provable security,the proposed scheme,with the same message bandwidth,achieve efficiency in computational cost.The security of the proposed scheme has been proven in the random oracle model without Gap assumption.
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, using most of those protocols, the session key which users arrive is depended on the identity information. In this paper, we first propose a two-party identity-based key agreement protocol based on pairings whose security relies on the hardness of the bilinear Diffie-Hellman problem in the random oracle model, and the session key is independent of the identity information. After that we extend the protocol to an identity-based group key agreement protocol, which uses no broadcasting. The proposed key agreement protocol achieves the security attributes: known session key security, perfect forward secrecy, no key compromise impersonation, no unknown key share and no key control.
Combined public key (CPK) cryptography does not need certificates to guarantee the authenticity of public keys and avoids the inherent key escrow problem of identity-based cryptography. Based on the efficient CPK scheme, we present an efficient three-round two-party authenticated key exchange protocol with strong security, which is provably secure in the standard model under the decisional Diffie-Hellman (DDH) assumption. The protocol can keep the session key secret from the adversary except that one party’s ephemeral private key and static private key are all revealed to the adversary. Compared to the existing protocols, this protocol not only assures strong security but also is more efficient.
We point out the RYY+ identity-based (ID-based) key agreement protocol is vulnerable to Key-compromise impersonation (KCI) attack and Intermediate results leakage (IRL) attack. Then we give the improved protocol which provides KCI and IRL resistance. The novel protocol is provably secure under the gap Bilinear Diffie-Hellman assumption in the seCK model, which enhances the adversary's queries comparing with previous ID based AKE models. The proposed scheme also has an advantage over most previous schemes on security and efficiency.