Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1502.02249 · The European Physical Journal D

Universally-composable finite-key analysis for efficient four-intensity decoy-state quantum key distribution

Haodong Jiang, Ming Gao, Bao Yan, Weilong Wang, Zhi Ma

Published Apr 1, 2016• 5 citations
arXivHTMLPDF
DOI
10.1140/epjd/e2016-60655-2

Related papers

Experimental composable security decoy-state quantum key distribution using time-phase encoding

Hua‐Lei Yin, Peng Liu, Wei-Wei Dai +5 more

Quantum key distribution (QKD) promises provably secure communications. In order to improve the secret key rate, combining a biased basis choice with the decoy-state method is proposed. Concomitantly, there is a basis-independent detection efficiency condition, which usually cannot be satisfied in a practical system, such as the time-phase encoding. Fortunately, this flaw has been recently removed theoretically and experimentally in the four-intensity decoy-state BB84 QKD protocol using the fact that the expected yields of single-photon states prepared in two bases stay the same for a given measurement basis. However, the security proofs do not fully consider the finite-key effects for general attacks. In this work, we provide the rigorous finite-key security bounds in the universally composable framework for the four-intensity decoy-state BB84 QKD protocol. We build a time-phase encoding system with 200 MHz clock to implement this protocol, in which the real-time secret key rate is more than 60 kbps over 50 km single-mode fiber.

arXiv:2002.10668•Optics Express•Sep 13, 2020•29 citations

Practical decoy state quantum key distribution with finite resource

Yong-Gang Tan, Q. Y. Cai

The European Physical Journal D•Dec 22, 2009•30 citations

Tight finite-key analysis of a practical decoy-state quantum key distribution with unstable sources

Yang Wang, Wan‐Su Bao, Chun Hua Zhou +2 more

The decoy-state quantum key distribution (QKD) protocol has been widely used in commercial QKD systems. Several QKD field networks show its practicability and commercial prospects. Importantly, practical decoy-state QKD systems should be characterized with device imperfections. In this paper, for the case without intensity fluctuations, we present the parameter estimation based on the Chernoff bound for a practical decoy-state QKD protocol and compare performances of that based on Hoeffding's inequality and the Chernoff bound, respectively. Taking intensity fluctuations into consideration, we present the finite-key analysis with composable security against general attacks based on Azuma's inequality. Our numerical results show that the finite-key analysis based on the Chernoff bound is tighter than Hoeffding's inequality when the total number of transmitting signals $N<1\ifmmode\times\else\texttimes\fi{}{10}^{12}$. Moreover, the intensity fluctuations' influence is more obvious when the data size of total transmitting signals is small. Our results emphasize the importance of the stability of the intensity modulator as well as the accurate estimation of emitted pulse's intensity.

Physical Review A•Sep 29, 2016•39 citations

Decoy State Quantum Key Distribution: Theory and Practice

Yi Zhao, Hoi‐Kwong Lo, Xiongfeng Ma +3 more

Bulletin of the American Physical Society•Mar 8, 2007•4 citations

Decoy state quantum key distribution with finite resources

Shi‐Hai Sun, Lin-Mei Liang, Cheng-Zu Li

Physics Letters A•May 15, 2009•14 citations

Finite-Key Analysis of 1-Decoy Method Quantum Key Distribution with Intensity Fluctuation

Chun Hua Zhou, Yu Zhi Zhou, Yang-Bin Xu +5 more

The decoy state quantum key distribution (QKD) protocol is proven to be an effective strategy against the photon number splitting attack. It was shown that the 1-decoy state protocol, easier to implement in the practical QKD system, outperforms the 2-decoy state protocol for block sizes of up to 108 bits. How intensity fluctuations influence the performance of the 1-decoy state protocol with finite resources remains a pending issue. In this paper, we present a finite-key analysis of the 1-decoy state protocol with intensity fluctuations and obtain the secret key rate formula about intensity fluctuations. Our numerical simulation results show that the stronger the intensity fluctuations, the lower the secret key rate for a small data block size of a few bits. Our research can provide theoretical implications for the selection of data size in the QKD system with intensity fluctuations.

Applied Sciences•May 7, 2022•1 citation
Quantum key distribution (QKD) promises provably secure communications. In order to improve the secret key rate, combining a biased basis choice with the decoy-state method is proposed. Concomitantly, there is a basis-independent detection efficiency condition, which usually cannot be satisfied in a practical system, such as the time-phase encoding. Fortunately, this flaw has been recently removed theoretically and experimentally in the four-intensity decoy-state BB84 QKD protocol using the fact that the expected yields of single-photon states prepared in two bases stay the same for a given measurement basis. However, the security proofs do not fully consider the finite-key effects for general attacks. In this work, we provide the rigorous finite-key security bounds in the universally composable framework for the four-intensity decoy-state BB84 QKD protocol. We build a time-phase encoding system with 200 MHz clock to implement this protocol, in which the real-time secret key rate is more than 60 kbps over 50 km single-mode fiber.
The decoy-state quantum key distribution (QKD) protocol has been widely used in commercial QKD systems. Several QKD field networks show its practicability and commercial prospects. Importantly, practical decoy-state QKD systems should be characterized with device imperfections. In this paper, for the case without intensity fluctuations, we present the parameter estimation based on the Chernoff bound for a practical decoy-state QKD protocol and compare performances of that based on Hoeffding's inequality and the Chernoff bound, respectively. Taking intensity fluctuations into consideration, we present the finite-key analysis with composable security against general attacks based on Azuma's inequality. Our numerical results show that the finite-key analysis based on the Chernoff bound is tighter than Hoeffding's inequality when the total number of transmitting signals $N<1\ifmmode\times\else\texttimes\fi{}{10}^{12}$. Moreover, the intensity fluctuations' influence is more obvious when the data size of total transmitting signals is small. Our results emphasize the importance of the stability of the intensity modulator as well as the accurate estimation of emitted pulse's intensity.
The decoy state quantum key distribution (QKD) protocol is proven to be an effective strategy against the photon number splitting attack. It was shown that the 1-decoy state protocol, easier to implement in the practical QKD system, outperforms the 2-decoy state protocol for block sizes of up to 108 bits. How intensity fluctuations influence the performance of the 1-decoy state protocol with finite resources remains a pending issue. In this paper, we present a finite-key analysis of the 1-decoy state protocol with intensity fluctuations and obtain the secret key rate formula about intensity fluctuations. Our numerical simulation results show that the stronger the intensity fluctuations, the lower the secret key rate for a small data block size of a few bits. Our research can provide theoretical implications for the selection of data size in the QKD system with intensity fluctuations.