DeepAI AI Chat
Log In Sign Up

A Novel Provably Secure Key Agreement Protocol Based On Binary Matrices

by   Abdelhaliem Babiker, et al.

In this paper, a new key agreement protocol is presented. The protocol uses exponentiations of matrices over GF(2) to establish the key agreement in only single step of message exchange. Security analysis of the protocol shows that the shared secret key is indistinguishable from the random under Decisional Diffie-Hellman (DDH) Assumption for subgroup of matrices over GF(2) with prime order, and furthermore, the analysis shows that, unlike many other exponentiation based protocols, security of the protocol goes beyond the level of security provided by (DDH) Assumption and intractability of Discrete Logarithm Problem (DLP). Actually, security of the protocol completely transcends the reliance on the DLP in the sense that breaking the DLP does not mean breaking the protocol. Complexity of brute force attack on the protocol is equivalent to exhaustive search for the secret key. Analysis of the performance demonstrates that the protocol is applicable to real-time applications.


page 1

page 2

page 3

page 4


A Novel Provably Secure Key-Agreement Using Secret Subgroup Generator

: In this paper, a new key-agreement scheme is proposed and analyzed. In...

A One-way Secret Key Agreement with Security Against Active Adversaries

In a one-way secret key agreement (OW-SKA) protocol in source model, Ali...

TinyAKE: A More Practicable and Trustable Scheme for Authenticated Key Establishment in WSNs

The characteristics of high loss rate, resource constraint, being eager ...

Breaking and Fixing Unlinkability of the Key Agreement Protocol for 2nd Gen EMV Payments

To address privacy problems with the EMV standard, EMVco proposed a Blin...

Secure and Dynamic Publish/Subscribe: LCMsec

We propose LCMsec, a brokerless, decentralised Publish/Subscribe protoco...

QKD based on symmetric entangled Bernstein-Vazirani

This paper introduces a novel entanglement-based QKD protocol, that make...