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

Multi-party Key-Exchange with Perfect Forward Secrecy

Susmita Mandal, Sujata Mohanty

Published Dec 1, 2014• 7 citations
Publisher

Abstract

The paper proposes a multi-party key exchange scheme with Perfect Forward Secrecy (PFS) which ensures that a session key derived from a set of long-term public and private keys used in the protocol to authenticate, does not compromise the secrecy of session key. In this protocol, each group establishes connection by communicating through a trusted third party. The trusted party acts as a group controller generates a public key and broadcasts it among the groups. Each group generate their public keys and send to trusted party. After receiving all the keys the group controller shares it among all the parties to generate the session key. Similarly, each group manager of individual group communicates with the members of the corresponding group. The security of the proposed scheme is analysed rigorously and proved to be resistant against non-repudiation attack, replay attack, chosen cipher attack, man-in-the middle attack. The scheme has wider applications such as, sending encrypted e-mail in a military environment to multiple users, securing submitted bids information in online tender, contract signing by many organizations, etc.

DOI
10.1109/icit.2014.30

Related papers

Perfect Forward Secure Two-Party Key Agreement Protocol with Key Escrow

Mengbo Hou, Qiuliang Xu, Tao Ban

Authenticated key agreement protocol is an important primitive for establishing session key to provide secure communications in open and distributed environment. Key escrow is essential in situations where confidentiality and audit trail are legal requirements, whilst perfect forward secrecy is desirable to provide stronger security. i.e. the adversary couldn't acquire the past session keys even the long term key of user was compromised. In this paper, we present a secure two-party identity-based authenticated key agreement protocol, which was inspired on a new identity-based encryption scheme first proposed by Gentry (Eurocrypt'06). The new protocol achieves most of the required security attributes and can be used properly in the escrow mode. We show that the scheme 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 attribute.

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

An Identity Based Key Exchange Scheme with Perfect Forward Security

Sonalin Subhadarshini

Identity-based authenticated key exchange protocol(IBAKE) with perfect forward security(PFS) is one of the major advancement in the field of cryptography. This protocol is used to establish secure communication between two parties who are provided with their own unique identities, by establishing their common secret keys without the need of sending and verifying their public key certificates. This scheme involves a key generation centre(KGC) which would provide the two parties involved, with their static key that can be authenticated by the parties. Our protocol can be viewed as a variant of the protocol proposed by Xie et al. in 2012 [8]. Our protocol does not rely on bilinear pairings. We have made a comparative study of the existing protocol and the proposed protocol and proved that our protocol is more efficient. We have also provided enough proofs to verfy that our protocol is secure under attacks and is not forgeable.

•Jan 1, 2015•0 citations

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

An Enhanced and Secure Protocol for Authenticated Key Exchange.

Fuw-Yi Yang, Jinn-ke Jan

Abstract An enhanced authentication key exchange protocol was proposed to exchange multiple session keys between two participants at a time. This paper shows that this enhanced protocol is insecure under the known session key attack, known long-term private key attack, signature forgery attack, and replay attack. This paper also proposes an enhanced and secure key agreement protocol for exchanging multiple session keys in one run of the protocol. The protocol is secure against the attacks mentioned above. Besides, a formal proof is given to guarantee the security of the proposed protocol under other potential attacks. Keywords Authentication, Diffie-Hellman key exchange, perfect forward secrecy, session key. 1.

•Jan 1, 2004•4 citations

Towards Modelling Perfect Forward Secrecy for One-round Group Key Exchange.

Zheng Yang, Daigu Zhang

We propose two security models for one-round group key exchange (ORGKE), which are called as g-eCKw and g-eCK-PFS. The g-eCK-PFS is a stronger variant of g- eCKw, which particularly formulates perfect forward se- crecy for ORGKE. A new tripartite ORGKE is proposed to provide g-eCKw security without random oracles under standard assumptions, that is also more e_cient than its predecessor by Li and Yang on CANS'13. We also show how to transform (compile) a g-eCKw secure protocol to achieve g-eCK-PFS security. In particular, our result enables us to prove the security of the first ORGKE protocol that achieves perfect forward secrecy without random oracles in a strong security model allowing adversary to compromise critical information of session participants such as long-term or ephemeral private key.

International journal of network security•Mar 1, 2016•8 citations

Proficient key management scheme for multicast groups using group key agreement and broadcast encryption

E. Abirami, T. Padmavathy

Key Management techniques are exercised to distribute and update keys such that illegitimate parties cannot ingress group communications. Key management, however can exhibit information about the stream of group association, such as group size and the number of joining and leaving users. This is a threat to applications with confidential group membership information. This project proposes a new key management paradigm which a combination of traditional broadcast encryption and group key agreement which never reveals the group dynamic information to outsiders and achieves both forward secrecy and backward secrecy. It provides a secure key management model not only with public and private key but also two more keys called group key and session key. It is distributed to multiple user overtime. It also overcomes the limitation of quantum point to point key sharing. It offers reliability and convenience of use, as well as to introduce a secure and efficient key management technique for any quantum cryptography network in real time.

International Conference on Information Communication and Embedded Systems•Feb 1, 2017•4 citations
The paper proposes a multi-party key exchange scheme with Perfect Forward Secrecy (PFS) which ensures that a session key derived from a set of long-term public and private keys used in the protocol to authenticate, does not compromise the secrecy of session key. In this protocol, each group establishes connection by communicating through a trusted third party. The trusted party acts as a group controller generates a public key and broadcasts it among the groups. Each group generate their public keys and send to trusted party. After receiving all the keys the group controller shares it among all the parties to generate the session key. Similarly, each group manager of individual group communicates with the members of the corresponding group. The security of the proposed scheme is analysed rigorously and proved to be resistant against non-repudiation attack, replay attack, chosen cipher attack, man-in-the middle attack. The scheme has wider applications such as, sending encrypted e-mail in a military environment to multiple users, securing submitted bids information in online tender, contract signing by many organizations, etc.
Authenticated key agreement protocol is an important primitive for establishing session key to provide secure communications in open and distributed environment. Key escrow is essential in situations where confidentiality and audit trail are legal requirements, whilst perfect forward secrecy is desirable to provide stronger security. i.e. the adversary couldn't acquire the past session keys even the long term key of user was compromised. In this paper, we present a secure two-party identity-based authenticated key agreement protocol, which was inspired on a new identity-based encryption scheme first proposed by Gentry (Eurocrypt'06). The new protocol achieves most of the required security attributes and can be used properly in the escrow mode. We show that the scheme 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 attribute.
Identity-based authenticated key exchange protocol(IBAKE) with perfect forward security(PFS) is one of the major advancement in the field of cryptography. This protocol is used to establish secure communication between two parties who are provided with their own unique identities, by establishing their common secret keys without the need of sending and verifying their public key certificates. This scheme involves a key generation centre(KGC) which would provide the two parties involved, with their static key that can be authenticated by the parties. Our protocol can be viewed as a variant of the protocol proposed by Xie et al. in 2012 [8]. Our protocol does not rely on bilinear pairings. We have made a comparative study of the existing protocol and the proposed protocol and proved that our protocol is more efficient. We have also provided enough proofs to verfy that our protocol is secure under attacks and is not forgeable.
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).
Abstract An enhanced authentication key exchange protocol was proposed to exchange multiple session keys between two participants at a time. This paper shows that this enhanced protocol is insecure under the known session key attack, known long-term private key attack, signature forgery attack, and replay attack. This paper also proposes an enhanced and secure key agreement protocol for exchanging multiple session keys in one run of the protocol. The protocol is secure against the attacks mentioned above. Besides, a formal proof is given to guarantee the security of the proposed protocol under other potential attacks. Keywords Authentication, Diffie-Hellman key exchange, perfect forward secrecy, session key. 1.
We propose two security models for one-round group key exchange (ORGKE), which are called as g-eCKw and g-eCK-PFS. The g-eCK-PFS is a stronger variant of g- eCKw, which particularly formulates perfect forward se- crecy for ORGKE. A new tripartite ORGKE is proposed to provide g-eCKw security without random oracles under standard assumptions, that is also more e_cient than its predecessor by Li and Yang on CANS'13. We also show how to transform (compile) a g-eCKw secure protocol to achieve g-eCK-PFS security. In particular, our result enables us to prove the security of the first ORGKE protocol that achieves perfect forward secrecy without random oracles in a strong security model allowing adversary to compromise critical information of session participants such as long-term or ephemeral private key.
Key Management techniques are exercised to distribute and update keys such that illegitimate parties cannot ingress group communications. Key management, however can exhibit information about the stream of group association, such as group size and the number of joining and leaving users. This is a threat to applications with confidential group membership information. This project proposes a new key management paradigm which a combination of traditional broadcast encryption and group key agreement which never reveals the group dynamic information to outsiders and achieves both forward secrecy and backward secrecy. It provides a secure key management model not only with public and private key but also two more keys called group key and session key. It is distributed to multiple user overtime. It also overcomes the limitation of quantum point to point key sharing. It offers reliability and convenience of use, as well as to introduce a secure and efficient key management technique for any quantum cryptography network in real time.