Quantum Key Distribution

Functionality Description

Quantum key distribution is a task that enables two parties, Sender and Receiver, to establish a classical secret key by using quantum systems. A classical secret key is a random string of bits known to only Sender and Receiver, and completely unknown to any third party, namely an eavesdropper. Such a secret key can for example be used to encrypt a classical message sent over a public channel.

Tags: Two Party, Quantum Enhanced Classical Functionality, Specific Task, unconditional security (information theoretical security), random number generator, key generation, secret key

Protocols

• BB84 Quantum Key Distribution: Prepare and Measure Network Stage
• Device Independent Quantum Key Distribution:Entanglement Distribution Network Stage

Device-Independent Quantum Key Distribution (DI-QKD) has better security guarantees than BB84 QKD.

Properties

A quantum key distribution protocol is secure if it is correct and secret. Correctness is the statement that Sender and Receiver share the same string of bits, namely the secret key, at the end of the protocol. Secrecy is the statement that the eavesdropper is totally ignorant about the final key.

• Correctness A QKD protocol is $\epsilon _{\rm {corr}}$-correct if the probability that the final key of Sender differs from the final key of Receiver, is smaller than Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \epsilon_{\rm corr}}

• Secrecy A QKD protocol is $\epsilon _{\rm {sec}}$-secret if for every input state it holds that

Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \frac{1}{2}{\|{\rho_{K_AE}}-{\tau_{K_A}\otimes \rho_E}\|}_1\leq \epsilon_{\rm sec},} where Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \tau_{K_A}=\frac{1}{|K_A|}\sum_{k}|{k}\rangle\langle{k}|_A} is the maximally mixed state in the space of strings Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle K_A} , and ${\|\cdot \|}_{1}$ is the trace norm.

• A protocol implements a $(n,\epsilon _{\rm {corr}},\epsilon _{\rm {sec}},\ell )$-QKD if with $n$ rounds it generates an $\epsilon _{\rm {corr}}$-correct and Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \epsilon_{\rm sec}} -secret key of size $\ell$ bits.

Further Information

The security definition presented here, are proven to be sufficient to guarantee universal composability for standard QKD in (2). For device-independent quantum key distribution, attacks presented in (1) show that security can be compromised if the same devices are used to implement another instance of the protocol.

1. PR (2014) discusses security of various QKD schemes composed in other cryptographic protocols.
2. BCK (2013) Analyses device independent QKD

*contributed by Bas Dirke, Victoria Lipinska, Glaucia Murta and Jeremy Ribeiro