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 Journal of Computer Sciences and Engineering

An Authenticated Key Agreement Protocol Using Artins Braid Group

Atul Chaturvedi, Dept. of Mathematics, PSIT, Kanpur, India, Dept. of Computer Science, PSIT, Kanpur, India, Dept. of Computer Science, IET, Lucknow, India, Dept. of Electronics and Communication, PSIT, Kanpur, India, Manoj Kumar Misra, S.P. Tripathi, Varun Shukla

Published Dec 31, 2017• 1 citation
Publisher

Abstract

This paper proposes a new and efficient key agreement protocol where trusted third party (TTP) is involved. There are various available schemes which are based on number theoretic, elliptic curves etc. Due to the availability of modern computers, these schemes are vulnerable to man in the middle attack (MITM). So there is a requirement of new technique for key agreement which surprises the intruders and enhances the security of communication system. Our proposed protocol utilizes the property of a non commutative group. We have given the security proof of our protocol keeping the fact in mind that decomposition and conjugacy search problem are hard in a group which is non commutative.

DOI
10.26438/ijcse/v5i12.233236

Related papers

Provably Secure Certificateless Two-Party Authenticated Key Agreement Protocol without Pairing

Manman Geng, Futai Zhang

Key agreement is one of the fundamental cryptographic primitives in public key cryptography. So far several certificateless two-party authenticated key agreement (CL-T-AKA) protocols have been proposed. However, all these protocols are based on bilinear map and most of them are without formal security proof. In this paper, we present a new formal security model of CL-T-AKA protocols and bring forward the first two-party key agreement protocol without the computation of expensive bilinear map. Our protocol is secure under the security model assuming the Gap-DH problem is intractable. With respect to efficiency, our protocol requires a single round of communication in which each party sends only one group element, and needs only five modular exponentiation computations. In addition, we point out that an existing certificateless two-party key agreement protocol cannot resist man-in-the-middle attack.

International Conference on Computational Intelligence and Security (CIS)•Jan 1, 2009•47 citations

An Efficient Authenticated Group Key Agreement Protocol

Yongzhong He, Han Zhen

Authenticated group key agreement is an important cryptographic mechanism underlying many collaborative and distributed applications. Some identity-based authenticated group key agreement schemes are proposed, however most of these protocols are vulnerable to insider attacks, while the other protocols are not efficient in communication. In this paper a new authenticated group key agreement protocol is proposed based on a modified identity-based cryptography infrastructure with new system setup and key extraction algorithms. The main feature of this protocol is that it needs only one round, which is optimal in terms of communication complexity; meanwhile the protocol is secure against insider attacks such as impersonation attacks and other known attacks.

IEEE International Carnahan Conference on Security Technology (ICCST)•Oct 1, 2007•13 citations

An Improved Key Agreement Protocol on Braid Groups

Tang Xue

Shor,Boneh,Liptonon et al. present some remarkable quantum algorithms which can solve integer factoring problem, discrete logarithm problem and discrete logarithm problem on elliptic curves in quantum polynomial time. These quantum algorithms are great challenges to classical public key cryptographies based on the above-described hard problems. It seems that braid group is a kind of considerable public key cryptography platform, but current key agreement protocols, such as AAG,AAFG and BDH, all have different degrees of security weaknesses.This paper takes advantage of random braids and non-conjugate transformations to present an improved braid key agreement protocol related to AAG and AAFG, which can make the two communication parties securely share a common key over any insecure channel. This protocol can resists current length-based attacks, linear representation attacks and other conjugacy search attacks.

•Jan 1, 2006•0 citations

A new method based on certificateless authenticated key agreement protocols

Jun Ma

The tripartite key agreement protocol that Joux has proposed is more efficient and simple,but it is vulnerable to man-in-the-middle attack.A new method based on certificateless authenticated key agreement protocols is proposed,which extends tripartite key agreement to multi-party accompanied by its authentication function.It has a lot of advantages,such as a short signature,high calculation efficiency,simple management about certificate and escrow-free anonymous key.The new method enjoys much secure prosperity,for instance,which has a non-key control and forward security,resists man-in-themiddle and leaked disguise attack,and so on.

Information technology newsletter•Jan 1, 2013•0 citations

New authenticated key agreement protocols

Hassan M. A. Elkamchouchi, Yasmine A. Saleh, Aliaa M. Sary

Key agreement protocols are used to establish common keys between two or more entities. The established key can then be used to assure confidentiality of exchanged messages through encryption. Additionally, authenticated key agreement protocols offer implicit authentication. In this paper, new authenticated key agreement protocols are proposed and their security properties are investigated. We start by examining the two-party case and then develop extensions to three parties as well as extensions to any group of k parties. The proposed protocols try to keep exchanged messages and computations minimal, while offering adequate security guarantees. Finally, we develop a variant of our multi-party key agreement protocol tailored for secure group communications among mobile devices.

International Conference on Computer Engineering & Systems (ICCES)•Nov 1, 2011•12 citations

Convertible Authenticated Encryption Scheme over Braid Group

Wei Yun

The rapid development of quantum computing brings great challenges to public key cryptosystems.The braid group,which is non-commutative,provides a new platform of constructing cryptographic protocols.A convertible authenticated encryption scheme over braid group is proposed on the difficulty of conjugacy search problem and multiple conjugacy problem,in which only the designated receiver can recover and authenticate the message,when the sender repudiates the signature,the receiver can prove the dishonesty of the sender by converting the signature to an ordinary one without the cooperating of the sender.As for the resistance against quantum attacks,the proposed scheme has advantage over the schemes based on commutative algebraic structures.

Jisuanji gongcheng•Jan 1, 2011•0 citations
This paper proposes a new and efficient key agreement protocol where trusted third party (TTP) is involved. There are various available schemes which are based on number theoretic, elliptic curves etc. Due to the availability of modern computers, these schemes are vulnerable to man in the middle attack (MITM). So there is a requirement of new technique for key agreement which surprises the intruders and enhances the security of communication system. Our proposed protocol utilizes the property of a non commutative group. We have given the security proof of our protocol keeping the fact in mind that decomposition and conjugacy search problem are hard in a group which is non commutative.
Key agreement is one of the fundamental cryptographic primitives in public key cryptography. So far several certificateless two-party authenticated key agreement (CL-T-AKA) protocols have been proposed. However, all these protocols are based on bilinear map and most of them are without formal security proof. In this paper, we present a new formal security model of CL-T-AKA protocols and bring forward the first two-party key agreement protocol without the computation of expensive bilinear map. Our protocol is secure under the security model assuming the Gap-DH problem is intractable. With respect to efficiency, our protocol requires a single round of communication in which each party sends only one group element, and needs only five modular exponentiation computations. In addition, we point out that an existing certificateless two-party key agreement protocol cannot resist man-in-the-middle attack.
Authenticated group key agreement is an important cryptographic mechanism underlying many collaborative and distributed applications. Some identity-based authenticated group key agreement schemes are proposed, however most of these protocols are vulnerable to insider attacks, while the other protocols are not efficient in communication. In this paper a new authenticated group key agreement protocol is proposed based on a modified identity-based cryptography infrastructure with new system setup and key extraction algorithms. The main feature of this protocol is that it needs only one round, which is optimal in terms of communication complexity; meanwhile the protocol is secure against insider attacks such as impersonation attacks and other known attacks.
Shor,Boneh,Liptonon et al. present some remarkable quantum algorithms which can solve integer factoring problem, discrete logarithm problem and discrete logarithm problem on elliptic curves in quantum polynomial time. These quantum algorithms are great challenges to classical public key cryptographies based on the above-described hard problems. It seems that braid group is a kind of considerable public key cryptography platform, but current key agreement protocols, such as AAG,AAFG and BDH, all have different degrees of security weaknesses.This paper takes advantage of random braids and non-conjugate transformations to present an improved braid key agreement protocol related to AAG and AAFG, which can make the two communication parties securely share a common key over any insecure channel. This protocol can resists current length-based attacks, linear representation attacks and other conjugacy search attacks.
The tripartite key agreement protocol that Joux has proposed is more efficient and simple,but it is vulnerable to man-in-the-middle attack.A new method based on certificateless authenticated key agreement protocols is proposed,which extends tripartite key agreement to multi-party accompanied by its authentication function.It has a lot of advantages,such as a short signature,high calculation efficiency,simple management about certificate and escrow-free anonymous key.The new method enjoys much secure prosperity,for instance,which has a non-key control and forward security,resists man-in-themiddle and leaked disguise attack,and so on.
Key agreement protocols are used to establish common keys between two or more entities. The established key can then be used to assure confidentiality of exchanged messages through encryption. Additionally, authenticated key agreement protocols offer implicit authentication. In this paper, new authenticated key agreement protocols are proposed and their security properties are investigated. We start by examining the two-party case and then develop extensions to three parties as well as extensions to any group of k parties. The proposed protocols try to keep exchanged messages and computations minimal, while offering adequate security guarantees. Finally, we develop a variant of our multi-party key agreement protocol tailored for secure group communications among mobile devices.
The rapid development of quantum computing brings great challenges to public key cryptosystems.The braid group,which is non-commutative,provides a new platform of constructing cryptographic protocols.A convertible authenticated encryption scheme over braid group is proposed on the difficulty of conjugacy search problem and multiple conjugacy problem,in which only the designated receiver can recover and authenticate the message,when the sender repudiates the signature,the receiver can prove the dishonesty of the sender by converting the signature to an ordinary one without the cooperating of the sender.As for the resistance against quantum attacks,the proposed scheme has advantage over the schemes based on commutative algebraic structures.