Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Calculation of key reduction for B92 QKD protocol

Miralem Mehić, Pavol Partila, Jaromír Továrek, Miroslav Vozn̆ák

Published May 21, 2015• 6 citations

Abstract

It is well known that Quantum Key Distribution (QKD) can be used with the highest level of security for distribution of the secret key, which is further used for symmetrical encryption. B92 is one of the oldest QKD protocols. It uses only two non-orthogonal states, each one coding for one bit-value. It is much faster and simpler when compared to its predecessors, but with the idealized maximum efficiencies of 25% over the quantum channel. B92 consists of several phases in which initial key is significantly reduced: secret key exchange, extraction of the raw key (sifting), error rate estimation, key reconciliation and privacy amplification. QKD communication is performed over two channels: the quantum channel and the classical public channel. In order to prevent a man-in-the-middle attack and modification of messages on the public channel, authentication of exchanged values must be performed. We used Wegman-Carter authentication because it describes an upper bound for needed symmetric authentication key. We explained the reduction of the initial key in each of QKD phases.

DOI: 10.1117/12.2177149

Related papers

Authentication in Quantum Key Distribution : Security Proof and Universal Hash Functions

Aysajan Abidin

Quantum Key Distribution (QKD) is a secret key agreement technique that consists of two parts: quantum transmission and measurement on a quantum channel, and classical post-processing on a public communication channel. It enjoys provable unconditional security provided that the public communication channel is immutable. Otherwise, QKD is vulnerable to a man-in-the-middle attack. Immutable public communication channels, however, do not exist in practice. So we need to use authentication that implements the properties of an immutable channel as well as possible. One scheme that serves this purpose well is the Wegman-Carter authentication (WCA), which is built upon Almost Strongly Universal2 (ASU2) hashing. This scheme uses a new key in each authentication attempt to select a hash function from an ASU2 family, which is then used to generate the authentication tag for a message. The main focus of this dissertation is on authentication in the context of QKD. We study ASU2 hash functions, security of QKD that employs a computationally secure authentication, and also security of authentication with a partially known key. Specifically, we study the following. First, Universal hash functions and their constructions are reviewed, and as well as a new construction of ASU2 hash functions is presented. Second, security of QKD that employs a specific computationally secure authentication is studied. We present detailed attacks on various practical implementations of QKD that employs this authentication. We also provide countermeasures and prove necessary and sufficient conditions for upgrading the security of the authentication to the level of unconditional security. Third, Universal hash function based multiple authentication is studied. This uses a fixed ASU2 hash function followed by one-time pad encryption, to keep the hash function secret. We show that the one-time pad is necessary in every round for the authentication to be unconditionally secure. Lastly, we study security of the WCA scheme, in the case of a partially known authentication key. Here we prove tight information-theoretic security bounds and also analyse security using witness indistinguishability as used in the Universal Composability framework.

Jan 1, 201317 citations

An Efficient Algorithm on Quantum Computing With Quantum Key Distribution for Secure Communication

Ganapathy Senthil Murugan

Currently many symmetric key cryptographic tools which are known to be quantum-safe. They all share Secret symmetric keys through an untrusted medium which is usually done with public key methods which are prone to quantum attacks. One among the recommended solutions to the key distribution problem is Quantum Key Distribution (QKD). QKD utilizes an authenticated Communication channel along with a quantum communication channel so that a secret key is generated. Whatever may be the protocol to implement proposed QKD, they all need both a quantum channel, and an authenticated classical. OTP (One Time Pad) is used when two parties wish to communications have to share a key called pad. This pad is a randomly generated key and the length of the key should be equal to the message so it can be sent. The proposed QKD parameters that result in almost 35.67% smaller keys for quantum security and an implementation of QKD in network which is publicly available and usable in practice.

International journal of communicationMay 14, 20202 citations

Quantum cryptography and authentication with low key-consumption

Aysajan Abidin, Christoph Pacher, Thomas Lorünser +2 more

Quantum Key Distribution (QKD - also referred to as Quantum Cryptography) is a technique for secret key agreement. It has been shown that QKD rigged with Information-Theoretic Secure (ITS) authentication (using secret key) of the classical messages transmitted during the key distribution protocol is also ITS. Note, QKD without any authentication can trivially be broken by man-in-the-middle attacks. Here, we study an authentication method that was originally proposed because of its low key consumption; a two-step authentication that uses a publicly known hash function, followed by a secret strongly universal2 hash function, which is exchanged each round. This two-step authentication is not information-theoretically secure but it was argued that nevertheless it does not compromise the security of QKD. In the current contribution we study intrinsic weaknesses of this approach under the common assumption that the QKD adversary has access to unlimited resources including quantum memories. We consider one implementation of Quantum Cryptographic protocols that use such authentication and demonstrate an attack that fully extract the secret key. Even including the final key from the protocol in the authentication does not rule out the possibility of these attacks. To rectify the situation, we propose a countermeasure that, while not information-theoretically secure, restores the need for very large computing power for the attack to work. Finally, we specify conditions that must be satisfied by the two-step authentication in order to restore information-theoretic security.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEOct 6, 20113 citations

Simulating B92 Protocol in Depolarizing Channel

Xiaofang Xu, Xiaoyu Chen

The B92 protocol is a two quantum states protocol in quantum cryptography. It is one of the basic models of quantum key distribution (QKD) in depolarizing channel. We simulate the rate of secure key distribution in depolarizing channel on a classical computer with the method of event-by-event simulation.After the event-by-event simulation of quantum transmission, data reconciliation and privacy amplification are done to obtain the secure key. We give the simulation results of private classical capacity with respect to the depolarizing coefficient.

International Conference on Computational Intelligence and Software Engineering (CiSE)Sep 1, 20103 citations

A QKD protocol with a two-way quantum channel

Farnaz Zamani, Pramode K. Verma

Quantum key distribution (QKD) provides unconditional physical layer security for the distribution of encryption keys between legitimate parties. This paper presents a quantum key distribution protocol over a two-way quantum channel. This protocol does not require any classical communication channel for key sifting and key reconciliation. Utilizing the proposed protocol, one can reduce the overhead in the classical channel and increase the speed with which keys can be exchanged. Absence of a classical communication channel reduces operational overhead.

IEEE International Conference on Advanced Networks and Telecommunications SystemsDec 1, 201120 citations

Single-state semi-quantum key distribution protocol and its security proof

Zhang Wei, Daowen Qiu, Paulo Mateus

Semi-quantum key distribution (SQKD) can share secret keys by using less quantum resource than its fully quantum counterparts, and this likely makes SQKD become more practical and realizable. In this paper, we present a new SQKD protocol by introducing the idea of B92 protocol in fully quantum cryptography into SQKD. In this protocol, the sender Alice just sends one quantum state to the classical Bob and Bob just prepares a fixed state in the preparation process. It is much simpler than the existing SQKD and potentially much easier to be implemented. It can be seen as a semi-quantum version of B92 protocol, compared to the protocol BKM07 as the semi-quantum version of BB84 in fully quantum cryptography. We verify that it is more efficient than the existing single-state SQKD protocols by introducing an efficiency parameter. Specifically, we prove it is secure against a restricted collective attack by computing a lower bound of the key rate in the asymptotic scenario. Then we can find a threshold value of errors such that for all error rates less than this value, the secure key can be definitely established between the legitimate users definitely. We make an illustration of how to compute the threshold value in case the reverse channel is a depolarizing one with parameter [Formula: see text]. Though the threshold value is a little smaller than those of some existing SQKD protocols, it can be comparable to the B92 protocol in fully quantum cryptography.

International Journal of Quantum InformationJun 1, 202018 citations