Write, autoreview, editor, reviewer
3,129
edits
Quantum Key Distribution: Difference between revisions
Jump to navigation
Jump to search
no edit summary
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
==Functionality Description== | ==Functionality Description== | ||
Quantum key distribution is a task that enables two parties, | 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:''' [[:Category: Two Party Protocols|Two Party]], [[:Category: Quantum Enhanced Classical Functionality|Quantum Enhanced Classical Functionality]], [[:Category: Specific Task|Specific Task]], unconditional security (information theoretical security), random number generator, key generation, secret key | '''Tags:''' [[:Category: Two Party Protocols|Two Party]], [[:Category: Quantum Enhanced Classical Functionality|Quantum Enhanced Classical Functionality]], [[:Category: Specific Task|Specific Task]], unconditional security (information theoretical security), random number generator, key generation, secret key | ||
| Line 13: | Line 13: | ||
[[Category: Prepare and Measure Network Stage]] [[Category:Entanglement Distribution Network stage]] | [[Category: Prepare and Measure Network Stage]] [[Category:Entanglement Distribution Network stage]] | ||
==Properties== | ==Properties== | ||
A quantum key distribution protocol is secure if it is ''correct'' and ''secret''. Correctness is the statement that | 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 <math>\epsilon_{\rm corr}</math>-correct if the probability that the final key of | *'''Correctness''' A QKD protocol is <math>\epsilon_{\rm corr}</math>-correct if the probability that the final key of Sender differs from the final key of Receiver, is smaller than <math>\epsilon_{\rm corr}</math> | ||
*'''Secrecy''' A QKD protocol is <math>\epsilon_{\rm sec}</math>-secret if for every input state it holds that | *'''Secrecy''' A QKD protocol is <math>\epsilon_{\rm sec}</math>-secret if for every input state it holds that | ||