Quantum Key Distribution: Difference between revisions

From Quantum Protocol Zoo
Jump to navigation Jump to search
Line 2: Line 2:
Quantum key distribution is a task that enables two parties,  Alice and Bob, to establish a classical secret key by using quantum systems. A classical secret key is a random string of bits known to only Alice and Bob, 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.
Quantum key distribution is a task that enables two parties,  Alice and Bob, to establish a classical secret key by using quantum systems. A classical secret key is a random string of bits known to only Alice and Bob, 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  
'''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
 
[[Category: Two Party Protocols]], [[Category: Quantum Enhanced Classical Functionality]],  [[Category:Specific Task]]


[[Category: Two Party Protocols]] [[Category: Quantum Enhanced Classical Functionality]] [[Category:Specific Task]]


==Protocols==
==Protocols==

Revision as of 07:35, 10 December 2018

Functionality

Quantum key distribution is a task that enables two parties, Alice and Bob, to establish a classical secret key by using quantum systems. A classical secret key is a random string of bits known to only Alice and Bob, 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

Properties

A quantum key distribution protocol is secure if it is correct and secret. Correctness is the statement that Alice and Bob 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 -correct if the probability that the final key of Alice differs from the final key of Bob, is smaller than
  • Secrecy A QKD protocol is -secret if for every input state it holds that

where is the maximally mixed state in the space of strings , and is the trace norm.

  • A protocol implements a -QKD if with rounds it generates an -correct and -secret key of size bits.

Discussion

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