|
| related topics |
| {key, protocol, security} |
| {state, states, entangled} |
| {information, entropy, channel} |
| {let, theorem, proof} |
| {alice, bob, state} |
| {entanglement, phys, rev} |
|
Unifying classical and quantum key distillation
Matthias Christandl, Artur Ekert, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim, Renato Renner
abstract: Assume that two distant parties, Alice and Bob, as well as an adversary, Eve,
have access to (quantum) systems prepared jointly according to a tripartite
state. In addition, Alice and Bob can use local operations and authenticated
public classical communication. Their goal is to establish a key which is
unknown to Eve. We initiate the study of this scenario as a unification of two
standard scenarios: (i) key distillation (agreement) from classical
correlations and (ii) key distillation from pure tripartite quantum states.
Firstly, we obtain generalisations of fundamental results related to
scenarios (i) and (ii), including upper bounds on the key rate. Moreover, based
on an embedding of classical distributions into quantum states, we are able to
find new connections between protocols and quantities in the standard scenarios
(i) and (ii).
Secondly, we study specific properties of key distillation protocols. In
particular, we show that every protocol that makes use of pre-shared key can be
transformed into an equally efficient protocol which needs no pre-shared key.
This result is of practical significance as it applies to quantum key
distribution (QKD) protocols, but it also implies that the key rate cannot be
locked with information on Eve's side. Finally, we exhibit an arbitrarily large
separation between the key rate in the standard setting where Eve is equipped
with quantum memory and the key rate in a setting where Eve is only given
classical memory. This shows that assumptions on the nature of Eve's memory are
important in order to determine the correct security threshold in QKD.
- oai_identifier:
- oai:arXiv.org:quant-ph/0608199
- categories:
- quant-ph
- comments:
- full version
- arxiv_id:
- quant-ph/0608199
- journal_ref:
- Proceedings of the 4th Theory of Cryptography Conference, Lecture
Notes in Computer Science vol. 4392, pp. 456-478, 2007
- created:
- 2006-08-25
- updated:
- 2007-02-28
Full article ▸
|
|
| related documents |
| 0601130v2 |
| 0609094v1 |
| 0002044v2 |
| 0402170v1 |
| 0504078v2 |
| 0410031v1 |
| 0105032v2 |
| 0504161v2 |
| 9803006v5 |
| 0110038v3 |
| 0703069v1 |
| 0703099v5 |
| 0611145v1 |
| 0012078v1 |
| 0702257v2 |
| 0610096v2 |
| 0612108v1 |
| 0702059v3 |
| 0612052v2 |
| 0701149v3 |
| 0609147v1 |
| 0611070v1 |
| 0611058v2 |
| 0611250v1 |
| 0610125v1 |
|