Condition for the generation of the secret key in a BB84 like quantum key distribution protocol

Abstract

Woodhead [Phys. Rev. A 88, 012331 (2013)] derived the lower bound of the secret key rate for a Bennett-Brassard (BB84) like quantum key distribution protocol under collective attacks. However, this lower bound does not always assure the generation of the secret key and thus the protocol may have to be aborted sometimes. Thus, we modify the Woodhead's lower bound of the secret key rate in such a way that the secret key is always generated in a BB84 like quantum key distribution protocol. We show the non-linear relationship between the lower bound of the secret key rate with the error rate and fidelity. Exploiting the obtained modified lower bound of the secret key rate, we analyze two state dependent quantum cloning machines such as (i) Wootters-Zurek QCM and (ii) Modified Buzek-Hillery QCM constructed by fixing the cloning machine parameters of Buzek Hillery quantum cloning machine (QCM), which may be used by the eavesdropper to extract information from the intercepted state. We, thereafter, show that it is possible for the communicating parties to distill a secret key, even in the presence of an eavesdropper. Moreover, we also discuss the effect of the efficiency of the QCM on the generation of the secret key for a successful key distribution protocol.

12 pages, 2 figures

References in corpus (7)

• Device-independent security of quantum cryptography against collective attacks
• Distillation of secret key and entanglement from quantum states
• Security of quantum key distribution from generalised entropy accumulation
• Improving the performance of quantum cryptography by using the encryption of the error correction data
• Pseudorandom density matrices
• Upper bounds for the secure key rate of decoy state quantum key distribution
• Modified Six State Cryptographic Protocol with Entangled Ancilla States