Beating the PNS attack in practical quantum cryptography
Xiang-Bin Wang
Abstract
In practical quantum key distribution, weak coherent state is often used and the channel transmittance can be very small therefore the protocol could be totally insecure under the photon-number-splitting attack. We propose an efficient method to verify the upper bound of the fraction of counts caused by multi-photon pluses transmitted from Alice to Bob, given whatever type of Eve's action. The protocol simply uses two coherent states for the signal pulses and vacuum for decoy pulse. Our verified upper bound is sufficiently tight for QKD with very lossy channel, in both asymptotic case and non-asymptotic case. The coherent states with mean photon number from 0.2 to 0.5 can be used in practical quantum cryptography. We show that so far our protocol is the only decoy-state protocol that really works for currently existing set-ups.
Create a lesson
Related papers
Approximate Synthetic Spectra of Quantum Systems Associated with Compact Lie Groups
Junyang Liu, Hang Wang, Houjin Wang et al.
An example of universal braiding in Links--Gould topological quantum computation
Matthew Harper, Ben-Michael Kohli
Reasoning about Shared-Qubit Concurrency in Quantum Computing
Mingsheng Ying
Information-Geometric Representation of Upper Bounds on Fluctuation Growth in Open Quantum Systems
Newshaw Bahreyni, Paul M. Alsing
Initialization-controlled fault sensitivity and force-balance plateaus in noisy variational quantum optimization
Longhui Shen, Fangzhou Jin, Bin Guo
Quantum identity authentication protocol via perturbed probability amplitudes
Xiangqun Fu, Zheng Han, Hongwei Li et al.