Paper Info
Title
Security Bounds for Quantum Cryptography with Finite Resources
Abstract
A practical quantum key distribution (QKD) protocol necessarily runs in finite time and, hence, only a finite amount of communication is exchanged. This is in contrast to most of the standard results on the security of QKD, which only hold in the limit where the number of transmitted signals approaches infinity. Here, we analyze the security of QKD under the realistic assumption that the amount of communication is finite. At the level of the general formalism, we present new results that help simplifying the actual implementation of QKD protocols: in particular, we show that symmetrization steps, which are required by certain security proofs (e.g., proofs based on de Finetti's representation theorem), can be omitted in practical implementations. Also, we demonstrate how two-way reconciliation protocols can be taken into account in the security analysis. At the level of numerical estimates, we present the bounds with finite resources for "device-independent security" against collective attacks.
Year
DOI
Venue
2008
10.1007/978-3-540-89304-2_8
TQC
Keywords
Field
DocType
device-independent security,security analysis,finite resources,certain security proof,qkd protocol,actual implementation,finite time,finite amount,practical quantum key distribution,quantum cryptography,practical implementation,finite resource,security bounds,quantum physics,quantum key distribution
Quantum key distribution,Representation theorem,Symmetrization,Infinity,Theoretical computer science,Mathematical proof,Security analysis,Quantum cryptography,Formalism (philosophy),Calculus,Mathematics
Conference
Volume
ISSN
Citations 
5106
Proceedings of TQC2008, Lecture Notes in Computer Science 5106 (Springer Verlag, Berlin), pp. 83-95 (2008)
7
PageRank 
References 
Authors
0.64
8
2
Name
Order
Citations
PageRank
Valerio Scarani1286.00
Renato Renner2129790.91