Tight finite-key analysis for passive decoy-state quantum key distribution under general attacks

@article{Zhou2014TightFA,
  title={Tight finite-key analysis for passive decoy-state quantum key distribution under general attacks},
  author={Chun Zhou and Wansu Bao and Hongwei Li and Yang Wang and Yuan Li and Zhen-Qiang Yin and Wei Chen and Zhengfu Han},
  journal={Physical Review A},
  year={2014},
  volume={89}
}
For quantum key distribution (QKD) using spontaneous parametric-down-conversion sources (SPDCSs), the passive decoy-state protocol has been proved to be efficiently close to the theoretical limit of an infinite decoy-state protocol. In this paper, we apply a tight finite-key analysis for the passive decoy-state QKD using SPDCSs. Combining the security bound based on the uncertainty principle with the passive decoy-state protocol, a concise and stringent formula for calculating the key… 
15 Citations

Figures from this paper

Improved secure bounds for passive decoy state quantum key distribution system
TLDR
The improved Chernoff bound method is applied in the passive decoy-state method and an improved bound for estimating the final key rate is obtained and the method can reach the highest final key rates among existing results, which can be considered as the best choice for QKD implementations with passive mudulation.
Biased decoy-state measurement-device-independent quantum key distribution with finite resources
TLDR
The simulations show that proper basis choice combined with deliberate intensity choice can substantially enhance the performance of decoy-state MDI-QKD and, without a full optimization program, the protocol can bring a long-distance implementation ofMDI- QKD with a reasonable data size of total transmitting signals.
Finite-key security analyses on passive decoy-state QKD protocols with different unstable sources
TLDR
According to the PDS QKD protocols, an optimizing programming respectively is established and the lower bounds of finite-key rates are simulated, which show that at different transmission distances, the affections of different fluctuations on key rates are different.
Biased decoy-state measurement-device-independent quantum cryptographic conferencing with finite resources.
TLDR
A biased decoy-state measurement-device-independent quantum cryptographic conferencing protocol is designed and analyzed and it is demonstrated that with a finite size of data it is possible to perform secure MDI-QCC over reasonable distances.
Finite-key analysis of a practical decoy-state high-dimensional quantum key distribution
TLDR
This work provides a finite-key security analysis for the recently proposed practical highdimensional decoy-state QKD protocol based on time-energy entanglement, and employs two methods to estimate the statistical fluctuation of the postselection probability and give a tighter bound on the secure-key capacity.
Detector-decoy high-dimensional quantum key distribution.
TLDR
This paper proposes a detector-decoy high-dimensional quantum key distribution protocol that can promise the security under Gsussian collective attacks with much simpler operations in practical implementation, and shows that without varying the source intensity, this protocol performs much better than one- Decoy-state protocol and as well as the two-Decoy- state protocol in the infinite-size regime.
Finite-key bound for semi-device-independent quantum key distribution.
TLDR
This paper proposes a practical SDI prepare-and-measure BB84 protocol, and introduces min entropy for security proof, to obtain a security bound under the practical condition with finite resources.
Passive decoy-state quantum key distribution for the weak coherent photon source with finite-length key*
Passive decoy-state quantum key distribution systems, proven to be more desirable than active ones in some scenarios, also have the problem of device imperfections like finite-length keys. In this
M ay 2 01 6 Practical decoy-state round-robin differential-phase-shift quantum key distribution
TLDR
Finite decoy-state method for RDPS, the performance of which is close to the infinite one, is proposed and can distribute secret keys over a distance of 128 km when the length of pulses packet is 32, which confirms the great practical advantage of this method.
...
1
2
...

References

SHOWING 1-10 OF 51 REFERENCES
Theory of quantum computation
Short review article on quantum computation accepted for Supplement III, Encyclopaedia of Mathematics (publication expected Summer 2001). See also this http URL
New
Phys
  • Rev. A 89, 022307
  • 2014
Nat
  • Commun. 3, 634
  • 2012
Phys
  • Rev. Lett. 100, 200501
  • 2008
Phys
  • Rev. Lett. 99, 180503
  • 2007
Int
  • J. Quantum Inf. 9, 903
  • 2011
Commun
  • Math. Phys. 328, 251
  • 2014
Nat
  • Commun. 5, 3732
  • 2014
Phy
  • Rev. A 89, 012329
  • 2014
...
1
2
3
4
5
...