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

Algorithmica

Security of Quantum Key Distribution against All Collective Attacks

Not Available Not Available, Not Available Not Available, Not Available Not Available, van de Graaf, Not Available Not Available

Published Nov 7, 2002• 80 citations
Publisher
DOI
10.1007/s00453-002-0973-6

Related papers

Secure one-sided device-independent quantum key distribution under collective attacks with enhanced robustness

Pritam Roy, Subhankar Bera, A. S. Majumdar

arXiv:2507.18744•Quantum Information Processing•Jan 31, 2026•3 citations

Security of Quantum Key Distribution Against All Collective Attacks

Eli Biham, Michel Boyer, Gilles Brassard +2 more

Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very important class of attacks called collective attacks (under a compatible noise model) which use quantum memories and gates, and which are directed against the final key. Although attacks stronger than the collective attacks can exist in principle, no explicit example was found and it is conjectured that security against collective attacks implies also security against any attack.

arXiv:quant-ph/9801022•Jan 12, 1998•34 citations

Security of Quantum Key Distribution

이충만

•Jan 1, 2018•0 citations

Security of Quantum Key Distribution

Norbert Lütkenhaus

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

Upper Bound of Collective Attacks on Quantum Key Distribution

Wei Li, Shengmei Zhao

Evaluating the theoretical limit of the amount of information Eve can steal from a quantum key distribution protocol under given conditions is one of the most important things that need to be done in security proof. In addition to source loopholes and detection loopholes, channel attacks are considered to be the main ways of information leakage, while collective attacks are considered to be the most powerful active channel attacks. Here we deduce in detail the capability limit of Eve's collective attack in non-entangled quantum key distribution, like BB84 and measurement-device-independent protocols, and entangled quantum key distribution, like device-independent protocol, in which collective attack is composed of quantum weak measurement and quantum unambiguous state discrimination detection. The theoretical results show that collective attacks are equivalent in entangled and non-entangled quantum key distribution protocols. We also find that compared with the security proof based on entanglement purification, the security proof based on collective attack not only improves the system's tolerable bit error rate, but also improves the key rate.

arXiv:1909.12584•Sep 27, 2019•0 citations

Improved postselection security analysis of phase error estimation in quantum key distribution

Yang-Guang Shan, Zhen−Qiang Yin, Shuang Wang +4 more

Quantum key distribution (QKD) enables the generation of secure keys between two distant users. Security proof of QKD against general coherent attacks is challenging, while the one against collective attacks is much easier. As an effective and general solution, the postselection method tries to extend security analyses of collective attacks to be against coherent attacks. However, it gives a bad performance. To overcome this drawback, instead of directly calculating key rate by postselection method, we propose a method correlating the failure probabilities of phase error estimation against collective and coherent attacks, enabling the use of the independent and identically distributed assumption in parameter estimation against coherent attacks. Then the key rate can be obtained by uncertainty relation of entropy. Our method can be applied to various QKD protocols, providing better performance compared with the traditional postselection method. For instance, we give the finite-key analyses of the side-channel-secure (SCS) QKD and the no-phase-postselection (NPP) twin-field (TF) QKD to show their performance improvements with the proposed method.

arXiv:2409.19538•Sep 29, 2024•1 citation
Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very important class of attacks called collective attacks (under a compatible noise model) which use quantum memories and gates, and which are directed against the final key. Although attacks stronger than the collective attacks can exist in principle, no explicit example was found and it is conjectured that security against collective attacks implies also security against any attack.
Evaluating the theoretical limit of the amount of information Eve can steal from a quantum key distribution protocol under given conditions is one of the most important things that need to be done in security proof. In addition to source loopholes and detection loopholes, channel attacks are considered to be the main ways of information leakage, while collective attacks are considered to be the most powerful active channel attacks. Here we deduce in detail the capability limit of Eve's collective attack in non-entangled quantum key distribution, like BB84 and measurement-device-independent protocols, and entangled quantum key distribution, like device-independent protocol, in which collective attack is composed of quantum weak measurement and quantum unambiguous state discrimination detection. The theoretical results show that collective attacks are equivalent in entangled and non-entangled quantum key distribution protocols. We also find that compared with the security proof based on entanglement purification, the security proof based on collective attack not only improves the system's tolerable bit error rate, but also improves the key rate.
Quantum key distribution (QKD) enables the generation of secure keys between two distant users. Security proof of QKD against general coherent attacks is challenging, while the one against collective attacks is much easier. As an effective and general solution, the postselection method tries to extend security analyses of collective attacks to be against coherent attacks. However, it gives a bad performance. To overcome this drawback, instead of directly calculating key rate by postselection method, we propose a method correlating the failure probabilities of phase error estimation against collective and coherent attacks, enabling the use of the independent and identically distributed assumption in parameter estimation against coherent attacks. Then the key rate can be obtained by uncertainty relation of entropy. Our method can be applied to various QKD protocols, providing better performance compared with the traditional postselection method. For instance, we give the finite-key analyses of the side-channel-secure (SCS) QKD and the no-phase-postselection (NPP) twin-field (TF) QKD to show their performance improvements with the proposed method.