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:1610.06876 · Quantum Science and Technology

Finite-key-size effect in a commercial plug-and-play QKD system

Poompong Chaiwongkhot, Shihan Sajeed, Lars Lydersen, Vadim Makarov

Published Aug 14, 2017• 32 citations
arXivHTMLPDF

Abstract

Abstract A security evaluation against the finite-key-size effect was performed for a commercial plug-and-play quantum key distribution (QKD) system. We demonstrate the ability of an eavesdropper to force the system to distill key from a smaller length of sifted-key. We also derive a key-rate equation that is specific for this system. This equation provides bounds above the upper bound of secure key under finite-key-size analysis. From this equation and our experimental data, we show that the keys that have been distilled from the smaller sifted-key size fall above our bound. Thus, their security is not covered by finite-key-size analysis. Experimentally, we could consistently force the system to generate the key outside of the bound. We also test manufacturer’s software update. Although all the keys after the patch fall under our bound, their security cannot be guaranteed under this analysis. Our methodology can be used for security certification and standardization of QKD systems.

DOI
10.1088/2058-9565/aa804b

Related papers

Practical evaluation of security for quantum key distribution

Masahito Hayashi

Many papers have proven the security of quantum key distribution (QKD) systems in the asymptotic framework. The degree of the security has not been discussed in the finite coding-length framework, sufficiently. However, to guarantee any implemented QKD system required, it is needed to evaluate a protocol with a finite coding length. For this purpose, we derive a tight upper bound of the eavesdropper's information. This bound is better than existing bounds. We also obtain the exponential rate of the eavesdropper's information. Further, we approximate our bound by using the normal distribution.

arXiv:quant-ph/0602113•Physical Review A•Aug 7, 2006•66 citations

Numerical method for finite-size security analysis of quantum key distribution

Hongyi Zhou, Toshihiko Sasaki, Masato Koashi

Quantum key distribution (QKD) enables secure information exchange with untrusted quantum links between remote communication parties. A central task in the studies of QKD protocols is security analysis, which aims at deriving the length of the final key such that it is secure regardless of the eavesdropper's computational power. In literature, the security analysis has been done both analytically and numerically. Compared to analytical methods which tend to require techniques specific to each QKD protocol, numerical ones are more general since they can be directly applied to many QKD protocols with little adaptation. However, current numerical methods are carried out based on some assumptions such as working in the asymptotic limit and collective attacks from eavesdroppers. In this work, we remove these assumptions and develop a numerical finite-size security analysis against general attacks for a large class of QKD protocols. We also give an example of applying the method to the recent phase-matching QKD protocol with a simplified protocol design. Our result shows that the finite-size key rate can surpass the linear key-rate bound with a practical QKD system operated for only several hours.

arXiv:2111.08315•Physical Review Research•Aug 12, 2022•12 citations

Quantum key distribution with an unknown and untrusted source

Yi Bing Zhao, Bing Qi, Hoi‐Kwong Lo

The security of a standard bidirectional ``plug-and-play'' quantum key distribution (QKD) system has been an open question for a long time. This is mainly because its source is equivalently controlled by an eavesdropper, which means the source is unknown and untrusted. Qualitative discussion on this subject has been made previously. In this paper, we solve this question directly by presenting the quantitative security analysis on a general class of QKD protocols whose sources are unknown and untrusted. The securities of standard Bennett-Brassard 1984 protocol, $\text{weak}+\text{vacuum}$ decoy state protocol, and one-decoy state protocol, with unknown and untrusted sources are rigorously proved. We derive rigorous lower bounds to the secure key generation rates of the above three protocols. Our numerical simulation results show that QKD with an untrusted source gives a key generation rate that is close to that with a trusted source.

arXiv:0802.2725•Physical Review A•May 20, 2008•119 citations

A new design of plug-and-play quantum key distribution with enhanced security

Ruoyang Qi, Haoran Zhang, Jiancun Gao +2 more

Robust, simple, and flexible quantum key distribution (QKD) is vital for realising practical applications of this technique. Contrary to typical phase-coded QKD schemes, the plug-and-play QKD design requires only one arm-length-insensitive interferometer without active feedback, in which the noise is automatically compensated by the two-way structure. However, there are certain possible loopholes in the typical plug-and-play designs, which require consideration and strict monitoring. This study proposes a new design of plug-and-play QKD based on two-way protocol with enhanced security and presents an experimental demonstration of said scheme. The security is analysed under a collective attack scenario assisted by the decoy state method. The scheme was implemented in a 50.4 km commercial fibre without active feedback. The system showed highly robust performance with an ultra-low error rate and maintained an ultra-high visibility of 0.9947+/-0.0002 through significant environmental changes over 24 hours. We analysis the performance of the system and give a brief discussion of the possible loopholes in practical applications.

•Oct 12, 2020•0 citations

Sifting attacks in finite-size quantum key distribution

Corsin Pfister, Norbert Lütkenhaus, Stephanie Wehner +1 more

A central assumption in quantum key distribution (QKD) is that Eve has no knowledge about which rounds will be used for parameter estimation or key distillation. Here we show that this assumption is violated for iterative sifting , a sifting procedure that has been employed in some (but not all) of the recently suggested QKD protocols in order to increase their efficiency. We show that iterative sifting leads to two security issues: (1) some rounds are more likely to be key rounds than others, (2) the public communication of past measurement choices changes this bias round by round. We analyze these two previously unnoticed problems, present eavesdropping strategies that exploit them, and find that the two problems are independent. We discuss some sifting protocols in the literature that are immune to these problems. While some of these would be inefficient replacements for iterative sifting, we find that the sifting subroutine of an asymptotically secure protocol suggested by Lo et al (2005 J. Cryptol. 18 133–65 ), which we call LCA sifting, has an efficiency on par with that of iterative sifting. One of our main results is to show that LCA sifting can be adapted to achieve secure sifting in the finite -key regime. More precisely, we combine LCA sifting with a certain parameter estimation protocol, and we prove the finite-key security of this combination. Hence we propose that LCA sifting should replace iterative sifting in future QKD implementations. More generally, we present two formal criteria for a sifting protocol that guarantee its finite-key security. Our criteria may guide the design of future protocols and inspire a more rigorous QKD analysis, which has neglected sifting-related attacks so far.

arXiv:1506.07502•New Journal of Physics•Apr 29, 2016•24 citations

Security of Plug-and-Play QKD Arrangements with Finite Resources

Pedro J. Salas

The security of a passive plug-and-play QKD arrangement in the case of finite (resources) key lengths is analysed. It is assumed that the eavesdropper has full access to the channel so an unknown and untrusted source is assumed. To take into account the security of the BB84 protocol under collective attacks within the framework of quantum adversaries, a full treatment provides the well-known equations for the secure key rate. A numerical simulation keeping a minimum number of initial parameters constant as the total error sought and the number of pulses is carried out. The remaining parameters are optimized to produce the maximum secure key rate. Two main strategies are addressed: with and without two-decoy-states including the optimization of signal to decoy relationship.

arXiv:1304.1730•Apr 5, 2013•0 citations
Abstract A security evaluation against the finite-key-size effect was performed for a commercial plug-and-play quantum key distribution (QKD) system. We demonstrate the ability of an eavesdropper to force the system to distill key from a smaller length of sifted-key. We also derive a key-rate equation that is specific for this system. This equation provides bounds above the upper bound of secure key under finite-key-size analysis. From this equation and our experimental data, we show that the keys that have been distilled from the smaller sifted-key size fall above our bound. Thus, their security is not covered by finite-key-size analysis. Experimentally, we could consistently force the system to generate the key outside of the bound. We also test manufacturer’s software update. Although all the keys after the patch fall under our bound, their security cannot be guaranteed under this analysis. Our methodology can be used for security certification and standardization of QKD systems.
Many papers have proven the security of quantum key distribution (QKD) systems in the asymptotic framework. The degree of the security has not been discussed in the finite coding-length framework, sufficiently. However, to guarantee any implemented QKD system required, it is needed to evaluate a protocol with a finite coding length. For this purpose, we derive a tight upper bound of the eavesdropper's information. This bound is better than existing bounds. We also obtain the exponential rate of the eavesdropper's information. Further, we approximate our bound by using the normal distribution.
Quantum key distribution (QKD) enables secure information exchange with untrusted quantum links between remote communication parties. A central task in the studies of QKD protocols is security analysis, which aims at deriving the length of the final key such that it is secure regardless of the eavesdropper's computational power. In literature, the security analysis has been done both analytically and numerically. Compared to analytical methods which tend to require techniques specific to each QKD protocol, numerical ones are more general since they can be directly applied to many QKD protocols with little adaptation. However, current numerical methods are carried out based on some assumptions such as working in the asymptotic limit and collective attacks from eavesdroppers. In this work, we remove these assumptions and develop a numerical finite-size security analysis against general attacks for a large class of QKD protocols. We also give an example of applying the method to the recent phase-matching QKD protocol with a simplified protocol design. Our result shows that the finite-size key rate can surpass the linear key-rate bound with a practical QKD system operated for only several hours.
The security of a standard bidirectional ``plug-and-play'' quantum key distribution (QKD) system has been an open question for a long time. This is mainly because its source is equivalently controlled by an eavesdropper, which means the source is unknown and untrusted. Qualitative discussion on this subject has been made previously. In this paper, we solve this question directly by presenting the quantitative security analysis on a general class of QKD protocols whose sources are unknown and untrusted. The securities of standard Bennett-Brassard 1984 protocol, weak+vacuum\text{weak}+\text{vacuum}weak+vacuum decoy state protocol, and one-decoy state protocol, with unknown and untrusted sources are rigorously proved. We derive rigorous lower bounds to the secure key generation rates of the above three protocols. Our numerical simulation results show that QKD with an untrusted source gives a key generation rate that is close to that with a trusted source.
Robust, simple, and flexible quantum key distribution (QKD) is vital for realising practical applications of this technique. Contrary to typical phase-coded QKD schemes, the plug-and-play QKD design requires only one arm-length-insensitive interferometer without active feedback, in which the noise is automatically compensated by the two-way structure. However, there are certain possible loopholes in the typical plug-and-play designs, which require consideration and strict monitoring. This study proposes a new design of plug-and-play QKD based on two-way protocol with enhanced security and presents an experimental demonstration of said scheme. The security is analysed under a collective attack scenario assisted by the decoy state method. The scheme was implemented in a 50.4 km commercial fibre without active feedback. The system showed highly robust performance with an ultra-low error rate and maintained an ultra-high visibility of 0.9947+/-0.0002 through significant environmental changes over 24 hours. We analysis the performance of the system and give a brief discussion of the possible loopholes in practical applications.
A central assumption in quantum key distribution (QKD) is that Eve has no knowledge about which rounds will be used for parameter estimation or key distillation. Here we show that this assumption is violated for iterative sifting , a sifting procedure that has been employed in some (but not all) of the recently suggested QKD protocols in order to increase their efficiency. We show that iterative sifting leads to two security issues: (1) some rounds are more likely to be key rounds than others, (2) the public communication of past measurement choices changes this bias round by round. We analyze these two previously unnoticed problems, present eavesdropping strategies that exploit them, and find that the two problems are independent. We discuss some sifting protocols in the literature that are immune to these problems. While some of these would be inefficient replacements for iterative sifting, we find that the sifting subroutine of an asymptotically secure protocol suggested by Lo et al (2005 J. Cryptol. 18 133–65 ), which we call LCA sifting, has an efficiency on par with that of iterative sifting. One of our main results is to show that LCA sifting can be adapted to achieve secure sifting in the finite -key regime. More precisely, we combine LCA sifting with a certain parameter estimation protocol, and we prove the finite-key security of this combination. Hence we propose that LCA sifting should replace iterative sifting in future QKD implementations. More generally, we present two formal criteria for a sifting protocol that guarantee its finite-key security. Our criteria may guide the design of future protocols and inspire a more rigorous QKD analysis, which has neglected sifting-related attacks so far.
The security of a passive plug-and-play QKD arrangement in the case of finite (resources) key lengths is analysed. It is assumed that the eavesdropper has full access to the channel so an unknown and untrusted source is assumed. To take into account the security of the BB84 protocol under collective attacks within the framework of quantum adversaries, a full treatment provides the well-known equations for the secure key rate. A numerical simulation keeping a minimum number of initial parameters constant as the total error sought and the number of pulses is carried out. The remaining parameters are optimized to produce the maximum secure key rate. Two main strategies are addressed: with and without two-decoy-states including the optimization of signal to decoy relationship.