TRIPARTITE KEY AGREEMENT PROTOCOL USING TRIPLE DECOMPOSITION SEARCH PROBLEMTripartite Key Agreement • 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.
Pairing-Based One-Round Tripartite Key Agreement ProtocolsTripartite Key Agreement • October 30th, 2004
Abstract. Since Joux published the first pairing-based one-round tripartite key agreement pro- tocol [13], many authenticated protocols have been proposed. However most of them were soon broken or demonstrated not to achieve some desirable security attributes. In this paper we present a protocol variant based on Shim’s work [20]. As the formalized model of this type of AK protocols is not mature, the security properties of the protocol are heuristically investigated by attempting a list of attacks. The attack list presented in the paper has both the importance in theory and the meaning in practice and can be used to evaluate other tripartite and group key agreement protocols.
Pairing-Based One-Round Tripartite Key Agreement ProtocolsTripartite Key Agreement • November 8th, 2007
Abstract. Since Joux published the first pairing-based one-round tri- partite key agreement protocol [12], many authenticated protocols have been proposed. However most of them were soon broken or proved not to achieve some desirable security attributes. In this paper we present two protocol variants based on Shim [19] and Zhang et al.’s work [23]. As the formalized model of this kind of AK protocols is not mature, the security properties of the protocols are heuristically investigated by attempting a list of attacks described in the literature and presented as a reference, that can be used to evaluate other protocols.
Tripartite Key Agreement Protocol Using Decomposition Search Problem Authenticated by Digital SignatureTripartite Key Agreement • 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.
