A quantum Diffie-Hellman protocol

Pranav Subramaniam, Abhishek Parakh

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key. Additional 'slack' rotations are used to ensure that measurement of the commutative transformations always result in the same bit value, for legitimate party, in the absence of an eavesdropper. The performance of the quantum protocol is evaluated in terms of the number of exchanges needed for a given key size and the probability of detecting an eavesdropper. We also compare the proposed protocol with BB84.

Original languageEnglish (US)
Pages (from-to)213-223
Number of pages11
JournalInternational Journal of Security and Networks
Volume11
Issue number4
DOIs
StatePublished - Jan 1 2016

Keywords

  • Key exchange algorithm
  • Perfect secrecy
  • Quantum Diffie-Hellman

ASJC Scopus subject areas

  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

A quantum Diffie-Hellman protocol. / Subramaniam, Pranav; Parakh, Abhishek.

In: International Journal of Security and Networks, Vol. 11, No. 4, 01.01.2016, p. 213-223.

Research output: Contribution to journalArticle

Subramaniam, Pranav ; Parakh, Abhishek. / A quantum Diffie-Hellman protocol. In: International Journal of Security and Networks. 2016 ; Vol. 11, No. 4. pp. 213-223.
@article{4a2881fcfd0e41068fcc7f983193b7bc,
title = "A quantum Diffie-Hellman protocol",
abstract = "In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key. Additional 'slack' rotations are used to ensure that measurement of the commutative transformations always result in the same bit value, for legitimate party, in the absence of an eavesdropper. The performance of the quantum protocol is evaluated in terms of the number of exchanges needed for a given key size and the probability of detecting an eavesdropper. We also compare the proposed protocol with BB84.",
keywords = "Key exchange algorithm, Perfect secrecy, Quantum Diffie-Hellman",
author = "Pranav Subramaniam and Abhishek Parakh",
year = "2016",
month = "1",
day = "1",
doi = "10.1504/IJSN.2016.079277",
language = "English (US)",
volume = "11",
pages = "213--223",
journal = "International Journal of Security and Networks",
issn = "1747-8405",
publisher = "Inderscience Enterprises Ltd",
number = "4",

}

TY - JOUR

T1 - A quantum Diffie-Hellman protocol

AU - Subramaniam, Pranav

AU - Parakh, Abhishek

PY - 2016/1/1

Y1 - 2016/1/1

N2 - In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key. Additional 'slack' rotations are used to ensure that measurement of the commutative transformations always result in the same bit value, for legitimate party, in the absence of an eavesdropper. The performance of the quantum protocol is evaluated in terms of the number of exchanges needed for a given key size and the probability of detecting an eavesdropper. We also compare the proposed protocol with BB84.

AB - In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key. Additional 'slack' rotations are used to ensure that measurement of the commutative transformations always result in the same bit value, for legitimate party, in the absence of an eavesdropper. The performance of the quantum protocol is evaluated in terms of the number of exchanges needed for a given key size and the probability of detecting an eavesdropper. We also compare the proposed protocol with BB84.

KW - Key exchange algorithm

KW - Perfect secrecy

KW - Quantum Diffie-Hellman

UR - http://www.scopus.com/inward/record.url?scp=84989854376&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84989854376&partnerID=8YFLogxK

U2 - 10.1504/IJSN.2016.079277

DO - 10.1504/IJSN.2016.079277

M3 - Article

AN - SCOPUS:84989854376

VL - 11

SP - 213

EP - 223

JO - International Journal of Security and Networks

JF - International Journal of Security and Networks

SN - 1747-8405

IS - 4

ER -