Abstract

On the basis of the existing trace distance result, we present a simple and efficient method to tighten the upper bound of the guessing probability. The guessing probability of the final key k can be upper bounded by the guessing probability of another key k, if k can be mapped from the final key k. Compared with the known methods, our result is more tightened by thousands of orders of magnitude. For example, given a 10−9-secure key from the sifted key, the upper bound of the guessing probability obtained using our method is 2 × 10−3277. This value is smaller than the existing result 10−9 by more than 3000 orders of magnitude. Our result shows that from the perspective of guessing probability, the performance of the existing trace distance security is actually much better than what was assumed in the past.

Details

Title
Guessing probability in quantum key distribution
Author
Xiang-Bin, Wang 1 ; Jing-Tao, Wang 2 ; Ji-Qian, Qin 2 ; Jiang, Cong 2 ; Zong-Wen, Yu 3 

 Tsinghua University, State Key Laboratory of Low Dimensional Quantum Physics, Department of Physics, Beijing, China (GRID:grid.12527.33) (ISNI:0000 0001 0662 3178); SAICT, Jinan Institute of Quantum Technology, Jinan, China (GRID:grid.12527.33); Southern University of Science and Technology, Shenzhen Institute for Quantum Science and Engineering, and Physics Department, Shenzhen, China (GRID:grid.263817.9) 
 Tsinghua University, State Key Laboratory of Low Dimensional Quantum Physics, Department of Physics, Beijing, China (GRID:grid.12527.33) (ISNI:0000 0001 0662 3178) 
 Tsinghua University, State Key Laboratory of Low Dimensional Quantum Physics, Department of Physics, Beijing, China (GRID:grid.12527.33) (ISNI:0000 0001 0662 3178); Data Communication Science and Technology Research Institute, Beijing, China (GRID:grid.12527.33) 
Publication year
2020
Publication date
2020
Publisher
Nature Publishing Group
e-ISSN
20566387
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2405840666
Copyright
© The Author(s) 2020. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.