Please use this identifier to cite or link to this item:
|Title:||Security bounds for quantum cryptography with finite resources|
|Authors:||Scarani, V. |
|Source:||Scarani, V.,Renner, R. (2008). Security bounds for quantum cryptography with finite resources. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5106 LNCS : 83-95. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-89304-2-8|
|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. © 2008 Springer Berlin Heidelberg.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 6, 2018
checked on Mar 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.