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

Informatica

An Efficient Two-Party Identity-Based Key Exchange Protocol

Yuh‐Min Tseng

Published Jan 1, 2007• 43 citations
Publisher

Abstract

A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. Afterwards, several improved protocols were proposed to reduce the number of communication steps and the communicational cost required by Gunther's protocol. This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. The proposed key exchange protocol provides implicit key authentication as well as the desired security attributes of an authenticated key exchange protocol.

DOI
10.15388/informatica.2007.168

Related papers

An Efficient Two-Party Identity-Based Key Exchange Protocol

TsengYuh-Min

A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-bas...

•Jan 1, 2007•0 citations

An Efficient ID-based Two-party Key Exchange Protocol

Xiang Shun-bo

ID-based protocols are used to establish session keys with identity information of principals.An ID-based key exchange protocol was proposed based on the difficulty of computing a discrete logarithm problem,and the performance and security of the proposed protocol were analyzed.The analysis shows that the proposed protocol has better performance and it can satisfy the security requirements of the two-party key exchange protocol.

Xinxi wangluo anquan•Jan 1, 2011•0 citations

On the Design of Key Exchange Protocol and its Variants

Susmita Mandal

With the advancement in Internet-based technologies, network applications are no longer just limited to one-to-one communication; instead, it has become a publicly accessible resource. Regardless of this growth, such applications bring specific challenges concerning authentication, integrity, and privacy. Cryptography stands as an ideal solution to overcome these issues through an interactive method of secure communication called Key Exchange. Key exchange protocols allow two or more entities to agree upon a shared secret transmitted over a public channel without revealing any information to an eavesdropper. This thesis contributes to the design and analysis of the variants of key exchange protocols along with their applications. As per the security requirements, the proposed schemes are either designed in an interactive model or a non-interactive model. Each scheme undergoes a series of formal and informal security analysis. The formal analysis provides simulation result using cryptographic models. Whereas, an informal analysis showcases the theoretical proves on known attacks where an adversary controls the network. The performance analysis maps the protocol’s efficiency based on the computation cost and communication size. The first contribution introduces an interactive two-party authenticated key exchange protocol. We begin by investigating the security flaws in an existing system such as, lack of user anonymity, trace attack, clogging attack, and failure to resist replay attack. Then proposed an authenticated self-certified key exchange protocol that overcomes the addressed issues. Also, it eliminates the requirements of a trusted certificate authority to authorize the entities. The scheme achieves anonymity during session execution, mutual authentication and enables session key agreement.Based on the ideology, an application is designed, forsecure communication between ad-hoc nodes in a mobile ad-hoc network. The second contribution contributes to the design of an Identity-based authenticated three-party key exchange protocol that overcomes the incapability of managing huge peer-to-peer communication and high computation cost faced by two-party authenticated key exchange protocols. The proposed scheme preserves user privacy by enabling the property of anonymity and ensures non-repudiation. Based on the ideology, an application is designed to establish a secure session key between two users with the help of a trusted server for an electronic payment system. The third contribution proposes an interactive pairing-free certificateless authenticated group key agreement scheme suitable for a resource constrained mobile network. The scheme allows any user to join or leave the group dynamically. The key agreement protocol devised in this scheme ensures un-deniability property by incorporating the signcryption, and unsigncryption algorithm. The final contribution presents a non-interactive Identity-based deniable authentication protocol that allows an intended receiver to identify the origin of a given message without being able to prove sender’s identity to a third party.

•Jan 1, 2018•0 citations

Efficient Authenticated ID-Based Group Key Agreement Protocol

M Arifi, Mahmoud Gardeshi

Group key exchange protocols play main role in group applications such as computer networks, telecommunication and military systems. Given the wide range of usage of group applications, research and design of these protocols can play an important role in securing international exchanges, trade and military issues. Most existing group key exchange protocols establish multi-party or group key exchange protocols based on extending the two party well known Diffie- Hellman key exchanges. The security of these protocols is based on this assumption that difficulty of solving group Dif- fie-Hellman problem can be reduced to the difficulty of two party Diffie-Hellman problems. In spite of this assumption, Group key exchanges are not simply extension of two party protocols. In fact there are many differences and challenges that must be considered in design and implementation of these protocols. This difference is due to essential difference between peer to peer communication and group communication. In group communication in addition to considering the main goal e.g. obtaining group session key, consideration of group member changing is important too. In this paper, a Dynamic ID-based Group Key Agreement protocol based on Weil pairing is proposed. This complete ternary tree struc- ture is used and dynamic changes in group are considered too. Finally we show that the proposed protocol is more effi- cient than other protocols with similar structure and also satisfies all known security requirements .

•Jan 1, 2011•1 citation

A new certificateless authenticated two-party key agreement

YuXiu-Ying, ZhangWen-Fang, HeDa-Ke

Authenticated key agreement (AKA) protocol allows two or multi-parties exchange messages, authenticate each other and establish shared session keys for later secure communications over an open network. The certificateless -based authenticated key agreement protocols combined the advantages of the traditional PKI and the identity-based cryptography. This paper analyzes a proposed AKA protocol[6] and presents a new certificateless AKA protocol. Furthermore, we examines the security of the new protocol and compare it to the existing certificateless key agreement protocols in efficiency. The new proposed scheme achieves almost all of the desired security attributes and is more practicable.

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

An Enhanced Two-Party Key Agreement Protocol in the Key Escrow Mode

Mengbo Hou, Qiuliang Xu

In an open and distributed environment, authenticated key agreement protocol, as an important cryptographic primitive, is used to authenticate entities and establish session key in order to provide secure communications. Key escrow is essential in situations where confidentiality and audit trail are legal requirements, whilst perfect forward secrecy and known session-specific temporary information secrecy attributes are desirable to provide stronger security. In this paper, we give a cryptanalysis on the scheme due to Wang et al., which is based on the identity-based encryption scheme proposed by Gentry (Eurocrypt'06), and then present an enhanced secure two-party identity-based authenticated key agreement protocol. The new proposed protocol achieves most of the required security attributes and can be used properly in the escrow mode. Security analysis shows that it achieves the attributes of known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. In addition, it captures the perfect forward secrecy and known session-specific temporary information secrecy attributes.

International Conference on Multimedia Information Networking and Security•Jan 1, 2009•0 citations
A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. Afterwards, several improved protocols were proposed to reduce the number of communication steps and the communicational cost required by Gunther's protocol. This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. The proposed key exchange protocol provides implicit key authentication as well as the desired security attributes of an authenticated key exchange protocol.
With the advancement in Internet-based technologies, network applications are no longer just limited to one-to-one communication; instead, it has become a publicly accessible resource. Regardless of this growth, such applications bring specific challenges concerning authentication, integrity, and privacy. Cryptography stands as an ideal solution to overcome these issues through an interactive method of secure communication called Key Exchange. Key exchange protocols allow two or more entities to agree upon a shared secret transmitted over a public channel without revealing any information to an eavesdropper. This thesis contributes to the design and analysis of the variants of key exchange protocols along with their applications. As per the security requirements, the proposed schemes are either designed in an interactive model or a non-interactive model. Each scheme undergoes a series of formal and informal security analysis. The formal analysis provides simulation result using cryptographic models. Whereas, an informal analysis showcases the theoretical proves on known attacks where an adversary controls the network. The performance analysis maps the protocol’s efficiency based on the computation cost and communication size. The first contribution introduces an interactive two-party authenticated key exchange protocol. We begin by investigating the security flaws in an existing system such as, lack of user anonymity, trace attack, clogging attack, and failure to resist replay attack. Then proposed an authenticated self-certified key exchange protocol that overcomes the addressed issues. Also, it eliminates the requirements of a trusted certificate authority to authorize the entities. The scheme achieves anonymity during session execution, mutual authentication and enables session key agreement.Based on the ideology, an application is designed, forsecure communication between ad-hoc nodes in a mobile ad-hoc network. The second contribution contributes to the design of an Identity-based authenticated three-party key exchange protocol that overcomes the incapability of managing huge peer-to-peer communication and high computation cost faced by two-party authenticated key exchange protocols. The proposed scheme preserves user privacy by enabling the property of anonymity and ensures non-repudiation. Based on the ideology, an application is designed to establish a secure session key between two users with the help of a trusted server for an electronic payment system. The third contribution proposes an interactive pairing-free certificateless authenticated group key agreement scheme suitable for a resource constrained mobile network. The scheme allows any user to join or leave the group dynamically. The key agreement protocol devised in this scheme ensures un-deniability property by incorporating the signcryption, and unsigncryption algorithm. The final contribution presents a non-interactive Identity-based deniable authentication protocol that allows an intended receiver to identify the origin of a given message without being able to prove sender’s identity to a third party.
Group key exchange protocols play main role in group applications such as computer networks, telecommunication and military systems. Given the wide range of usage of group applications, research and design of these protocols can play an important role in securing international exchanges, trade and military issues. Most existing group key exchange protocols establish multi-party or group key exchange protocols based on extending the two party well known Diffie- Hellman key exchanges. The security of these protocols is based on this assumption that difficulty of solving group Dif- fie-Hellman problem can be reduced to the difficulty of two party Diffie-Hellman problems. In spite of this assumption, Group key exchanges are not simply extension of two party protocols. In fact there are many differences and challenges that must be considered in design and implementation of these protocols. This difference is due to essential difference between peer to peer communication and group communication. In group communication in addition to considering the main goal e.g. obtaining group session key, consideration of group member changing is important too. In this paper, a Dynamic ID-based Group Key Agreement protocol based on Weil pairing is proposed. This complete ternary tree struc- ture is used and dynamic changes in group are considered too. Finally we show that the proposed protocol is more effi- cient than other protocols with similar structure and also satisfies all known security requirements .
Authenticated key agreement (AKA) protocol allows two or multi-parties exchange messages, authenticate each other and establish shared session keys for later secure communications over an open network. The certificateless -based authenticated key agreement protocols combined the advantages of the traditional PKI and the identity-based cryptography. This paper analyzes a proposed AKA protocol[6] and presents a new certificateless AKA protocol. Furthermore, we examines the security of the new protocol and compare it to the existing certificateless key agreement protocols in efficiency. The new proposed scheme achieves almost all of the desired security attributes and is more practicable.
In an open and distributed environment, authenticated key agreement protocol, as an important cryptographic primitive, is used to authenticate entities and establish session key in order to provide secure communications. Key escrow is essential in situations where confidentiality and audit trail are legal requirements, whilst perfect forward secrecy and known session-specific temporary information secrecy attributes are desirable to provide stronger security. In this paper, we give a cryptanalysis on the scheme due to Wang et al., which is based on the identity-based encryption scheme proposed by Gentry (Eurocrypt'06), and then present an enhanced secure two-party identity-based authenticated key agreement protocol. The new proposed protocol achieves most of the required security attributes and can be used properly in the escrow mode. Security analysis shows that it achieves the attributes of known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. In addition, it captures the perfect forward secrecy and known session-specific temporary information secrecy attributes.