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 Security Technology (SecTech)

A Simple and Robust Authenticated Multiple Key Agreement Scheme

Chin‐Chen Chang, Hao-Chuan Tsai, Yen‐Chang Chiu

Published Dec 1, 2008• 1 citation
Publisher

Abstract

Providing confidential communications and with integrity over an insecure network is an important issue. To achieve these goals, a common key, called session key, has to be established between communicating parties, and several key agreement schemes have been proposed. However, most of them were designed to establish one session key for each communication. To reduce the communication cost, establishing multiple session keys has been proposed in the past decade. Unfortunately, all of them are either insecure or have violated the original requirement, without using one-way hash functions. Herein, we propose a multiple key agreement scheme with a novel architecture, which is different from the previous variants, to enable communicating parties establish multiple session keys.

DOI
10.1109/sectech.2008.11

Related papers

Secure multi-party key establishment

Chih-Hung Li

For a secure communication through the public network, cryptographic encryption must be applied. The key establishment issue is the most important part in cryptographic encryption. Only the legitimate principals who have the key can encrypt messages and decrypt cryptograms. A secure multi-party communication held through the public network can only take place after a multi-party key establishment protocol has been executed. The multi-party key establishment protocol is designed so that the principals can receive a common key and use it to securely exchange the messages.\nIn this thesis, the secure multi-party key establishment protocols are discussed. W e start from investigating properties of two-party key establishment protocols such as motivation of using session key, adversaries in the protocols, attacks of the protocol and security analysis of the protocol. Then we give the requirements of a multi-party key establishment protocol and summarize about what should be considered in designing a multi-party key establishment protocol. After that we review some of the previous proposed multi-party key establishment protocol. The existing multi-party key establishment protocols are either impractical ( not efficient enough) or missing some important security goals such as authentication of principals. Three new protocols are proposed in this thesis. The first protocol addresses how to hold a conference for members of two hierarchical groups in an efficient way. The message broadcasting is used to reduce the cost of secure message transport.\nThe second and the third protocols manage the authentication problem by using a secret sharing scheme. We replace the principal authentication with the group authentication so that the computational overhead and communication overhead will be reduced especially in reuse of the protocol for new communication. Again, message broadcasting is used for replacing the expansive secure communication channel.\nPart of this thesis appeared in ACSC'99(Australian Computer Science Conference) and ACISP'99(Australian Conference of Information Security and Privacy).

•Jan 1, 2000•0 citations

A one-round ID-based authenticated key agreement protocol with enhanced security

Mengbo Hou, Qiuliang Xu

Authenticated key agreement protocol is used to set up the session key and establish secure channel for network communication in the open environment. So far, great deals of identity-based protocols have been proposed to provide robust mutual authentication and key establishment in the two-party setting. Majority of the existing identity-based key agreement protocols require expensive bilinear pairing operation and only provide limited security attributes. Therefore, such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis some of the schemes proposed recently, and then present a one-round ID-based authenticated key agreement protocol with enhanced security attributes, which doesn't need pairing operation and achieves most of the required security attributes, such as known-key secrecy, perfect forward secrecy, PKG Forward Secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. In addition, it captures the enhanced security attributes-Known session-specific temporary key information secrecy.

International Conference on Intelligent Control and Information Processing•Jul 1, 2011•2 citations

A Two-Party Key Agreement Protocol Based on Signature Scheme

Wang Tian-cheng

Two-Party authenticated key agreement is one of methods to generate session key.In this paper,we propose a new Two-Party agreement protocol based on the traditional signature scheme.The new scheme realizes the hiding of the information between the participants.We use Hash function to enhance the security of our protocol.

Microelectronics & Computer•Jan 1, 2013•0 citations

An efficient and secure one-round authenticated key agreement protocol without pairings

Mengbo Hou, Qiuliang Xu

Two-Party Authenticated key agreement protocol is essential for setting up the common session key for parties to establish secure channel for network communication in the open environment. Most of proposed schemes require expensive bilinear pairing operation and only provide limited security attributes. So such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis two schemes recently proposed by Cao etc., and then present a one-round ID-based authenticated key agreement protocol with more desired security attributes, which need no pairing operations while still achieve nice computational efficiency. These security attributes include known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. Moreover, it captures the enhanced security attributes known session-specific temporary key information secrecy, which means that even the ephemeral secret key were compromised, the adversary can hardly acquire the agreed session key.

International Conference on Multimedia Technology (ICMT)•Jul 1, 2011•4 citations

Identity – Based Multiple Key Agreement Scheme

Massoud Hadian Dehkordi

In order to protect some important information communicated through an insecure network, a common hidden key must be used.One can produce the common hidden key using key agreement protocols; and this helps to have high security in modern data networks.Today, the designers of public key cryptography protocols try to set the public identity of a system's users (like their email addresses) as their public key.This not only makes a cryptographic protocol more efficient but also decreases its cost.These protocols are called "identitybased ".In this article, an identitybased multiple key agreement scheme will be presented; this scheme uses the challengeresponse method to do the verification.While the number of random values produced in our scheme is the same as other schemes, the number of keys generated in this scheme is much more than what many other key agreement schemes produce,.Therefore, we will have less computational complexities campered with other schems.In this paper, we consider the security of our scheme and consequently,we will show that it satisfies many security conditions such as strong security.

KSII Transactions on Internet and Information Systems•Jan 1, 2011•12 citations

Provably Secure Two-Party Explicit Authenticated Key Agreement Protocol

Minghui Zheng, Jing Chen

This paper considers the issue on authenticated two-party key agreement protocol over an insecure public network. Many authenticated key agreement protocols have been proposed to meet the challenges. Based on bilinear pairing, Zhou et al. proposed a two-party key agreement with implicit key authentication in 2011. Implicit key authentication can be easily achieved by encrypting the later communications using the session key. However, we can not ensure how participants using the session key protocol. This paper will transform the Zhou's implicit authenticated key agreement protocol into the explicit one with key confirmation by introducing the authenticators, and show the proposed protocol is provably secure under the random-oracle model.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Jun 1, 2012•0 citations
Providing confidential communications and with integrity over an insecure network is an important issue. To achieve these goals, a common key, called session key, has to be established between communicating parties, and several key agreement schemes have been proposed. However, most of them were designed to establish one session key for each communication. To reduce the communication cost, establishing multiple session keys has been proposed in the past decade. Unfortunately, all of them are either insecure or have violated the original requirement, without using one-way hash functions. Herein, we propose a multiple key agreement scheme with a novel architecture, which is different from the previous variants, to enable communicating parties establish multiple session keys.
For a secure communication through the public network, cryptographic encryption must be applied. The key establishment issue is the most important part in cryptographic encryption. Only the legitimate principals who have the key can encrypt messages and decrypt cryptograms. A secure multi-party communication held through the public network can only take place after a multi-party key establishment protocol has been executed. The multi-party key establishment protocol is designed so that the principals can receive a common key and use it to securely exchange the messages.\nIn this thesis, the secure multi-party key establishment protocols are discussed. W e start from investigating properties of two-party key establishment protocols such as motivation of using session key, adversaries in the protocols, attacks of the protocol and security analysis of the protocol. Then we give the requirements of a multi-party key establishment protocol and summarize about what should be considered in designing a multi-party key establishment protocol. After that we review some of the previous proposed multi-party key establishment protocol. The existing multi-party key establishment protocols are either impractical ( not efficient enough) or missing some important security goals such as authentication of principals. Three new protocols are proposed in this thesis. The first protocol addresses how to hold a conference for members of two hierarchical groups in an efficient way. The message broadcasting is used to reduce the cost of secure message transport.\nThe second and the third protocols manage the authentication problem by using a secret sharing scheme. We replace the principal authentication with the group authentication so that the computational overhead and communication overhead will be reduced especially in reuse of the protocol for new communication. Again, message broadcasting is used for replacing the expansive secure communication channel.\nPart of this thesis appeared in ACSC'99(Australian Computer Science Conference) and ACISP'99(Australian Conference of Information Security and Privacy).
Authenticated key agreement protocol is used to set up the session key and establish secure channel for network communication in the open environment. So far, great deals of identity-based protocols have been proposed to provide robust mutual authentication and key establishment in the two-party setting. Majority of the existing identity-based key agreement protocols require expensive bilinear pairing operation and only provide limited security attributes. Therefore, such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis some of the schemes proposed recently, and then present a one-round ID-based authenticated key agreement protocol with enhanced security attributes, which doesn't need pairing operation and achieves most of the required security attributes, such as known-key secrecy, perfect forward secrecy, PKG Forward Secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. In addition, it captures the enhanced security attributes-Known session-specific temporary key information secrecy.
Two-Party Authenticated key agreement protocol is essential for setting up the common session key for parties to establish secure channel for network communication in the open environment. Most of proposed schemes require expensive bilinear pairing operation and only provide limited security attributes. So such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis two schemes recently proposed by Cao etc., and then present a one-round ID-based authenticated key agreement protocol with more desired security attributes, which need no pairing operations while still achieve nice computational efficiency. These security attributes include known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. Moreover, it captures the enhanced security attributes known session-specific temporary key information secrecy, which means that even the ephemeral secret key were compromised, the adversary can hardly acquire the agreed session key.
In order to protect some important information communicated through an insecure network, a common hidden key must be used.One can produce the common hidden key using key agreement protocols; and this helps to have high security in modern data networks.Today, the designers of public key cryptography protocols try to set the public identity of a system's users (like their email addresses) as their public key.This not only makes a cryptographic protocol more efficient but also decreases its cost.These protocols are called "identitybased ".In this article, an identitybased multiple key agreement scheme will be presented; this scheme uses the challengeresponse method to do the verification.While the number of random values produced in our scheme is the same as other schemes, the number of keys generated in this scheme is much more than what many other key agreement schemes produce,.Therefore, we will have less computational complexities campered with other schems.In this paper, we consider the security of our scheme and consequently,we will show that it satisfies many security conditions such as strong security.
This paper considers the issue on authenticated two-party key agreement protocol over an insecure public network. Many authenticated key agreement protocols have been proposed to meet the challenges. Based on bilinear pairing, Zhou et al. proposed a two-party key agreement with implicit key authentication in 2011. Implicit key authentication can be easily achieved by encrypting the later communications using the session key. However, we can not ensure how participants using the session key protocol. This paper will transform the Zhou's implicit authenticated key agreement protocol into the explicit one with key confirmation by introducing the authenticators, and show the proposed protocol is provably secure under the random-oracle model.