A Novel Provably Secure Key-Agreement Using Secret Subgroup Generator

by   Abdelhaliem Babiker, et al.

: In this paper, a new key-agreement scheme is proposed and analyzed. In addition to being provably secure in the shared secret key indistinguishability model under Decisional Diffie-Hellman assumption for subgroup of matrices over GF(2) with prime order, which considered as basic security requirement, the scheme has an interesting feature; it uses exponentiations over cyclic group using hidden secret subgroup generator as a platform for the key exchange, whereby – unlike many other exponentiation based key exchange schemes – it transcends the reliance on intractability of Discrete Logarithm Problem in its security.


page 1

page 2

page 3

page 4


A Novel Provably Secure Key Agreement Protocol Based On Binary Matrices

In this paper, a new key agreement protocol is presented. The protocol u...

An Observer-Based Key Agreement Scheme for Remotely Controlled Mobile Robots

Remotely controlled mobile robots are important examples of Cyber-Physic...

Pre-shared Key Agreement for Secure Public Wi-Fi

This paper presents a novel pre-shared key (PSK) agreement scheme to est...

Indistinguishability Obfuscation from Well-Founded Assumptions

In this work, we show how to construct indistinguishability obfuscation ...

Koopman interpretation and analysis of a public-key cryptosystem: Diffie-Hellman key exchange

The security of public-key cryptosystems relies on computationally hard ...

Network Coding Multicast Key-Capacity

For a multi-source multi-terminal noiseless network, the key-disseminati...

Please sign up or login with your details

Forgot password? Click here to reset