TRIPARTITE KEY AGREEMENT PROTOCOL USING TRIPLE DECOMPOSITION SEARCH PROBLEMTripartite Key Agreement Protocol • October 1st, 2012
A Key Agreement Protocol is a tool by which two parties can share a common key for their subsequent communication .Many cryptographic protocols are based on the hardness of Integer Factorization and Discrete Logarithm Problem. Very few Protocols are based on search problems in non – abelian groups. In this paper we present a Tripartite Key Agreement Protocol Using Triple Decomposition Search Problem using which three parties may agree on a common shared key in two rounds. We have chosen Discrete Heisenberg group and three cyclic sub groups as our platform to apply the above protocol.
Tripartite Key Agreement Protocol using Conjugacy Problem in Braid GroupsTripartite Key Agreement Protocol • December 26th, 2011
Braid groups were first introduced by Emil Artin in 1925. First cryptosystem, using Braid groups as a platform was discovered by Anshel et al in 2001. After the publication of this paper several cryptosystems on Braid groups had been designed. In this paper we have proposed a tripartite authenticated key agreement protocol using conjugacy problem which works in a braid group. We have proved that our protocol meet the security attributes under the assumption that the Braid Decomposition Problem (BDP) and the Conjugacy Search Problem (CSP) are hard in braid group.
Tripartite Key Agreement Protocol Using Decomposition Search Problem Authenticated by Digital SignatureTripartite Key Agreement Protocol • March 25th, 2023
Key Agreement protocol (KAP) is one of the fundamental cryptographic primitives after encryption and digital signature which enables two or more entities arrive at a common key, which may be later used for any cryptographic purpose. In this paper we proposed an authenticated tripartite key agreement protocol. The decomposition search problem plays the role of one way function. The five dimensional Discrete Heisenberg group is chosen as the platform group which is non abelian. The KAP proposed in this paper is authenticated by digital signature. Thus, the proposed KAP satisfies all the necessary security attributes required.
