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

Finite Key Analysis in Quantum Cryptography

Tim Meyer

Published Jan 1, 2007• 2 citations
OpenAlex

Abstract

In view of experimental realization of quantum key distribution schemes, the study of their efficiency becomes as important as the proof of their security. The latter is the subject of most of the theoretical work about quantum key distribution, and many important results such as the proof of unconditional security have been obtained. The

Related papers

Quantum Cryptography–A Theoretical Overview

Pratik Roy, Saptarshi Sahoo, Amit Kumar Mandal +1 more

Quantum Key Distribution seems very promising as it offers unconditional security, that’s why it is being implemented by the tech giants of the networking industry and government. Having quantum phenomenon as a backbone, QKD protocols become indecipherable. Here we have focused on the complexities of quantum key distribution and how this technology has contributed to secure key communication. This article gives an updated overview of this technology and can serve as a guide to get familiar with the current trends of quantum cryptography.

Journal of quantum computing•Jan 1, 2021•3 citations

Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security

Hoi‐Kwong Lo, H. F. Chau, M. Ardehali

Journal of Cryptology•Mar 3, 2004•558 citations

Quantum Computers Render Quantum Key Distribution Unconditionally Secure

Hoi‐Kwong Lo, H. F. Chau

Quantum cryptography has long been claimed to be useful for achieving many tasks that are impossible from the perspective of conventional cryptography. Arguably, the most important problem in quantum cryptography has been a rigorous proof of the security of quantum key distribution, the most well-known application. This notoriously hard problem has eluded researchers for the last fifteen years and has become even more important after the recent surprising demonstration of the insecurity of many other quantum cryptographic schemes including quantum bit commitment. Here, we solve this long standing problem by showing that, given quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The novel technique we use is reduction from a quantum scheme to a classical scheme. The security in realistic noisy environments is then proven by using the recent theory of fault-tolerant quantum computation.

•Jan 1, 2008•0 citations

Finite key analysis for symmetric attacks in quantum key distribution (9 pages)

Tim Meyer, Hermann Kampermann

Physical Review A•Jan 1, 2006•0 citations

A Formal Approach to Unconditional Security Proofs for Quantum Key Distribution

Takahiro Kubota, Yoshihiko Kakutani, Go Kato +1 more

Lecture notes in computer science•Jan 1, 2011•2 citations

Quantum Computers Render Quantum Key Distribution Unconditionally Secure Over Arbitrarily Long Distance

Hoi‐Kwong Lo, H. F. Chau

Quantum cryptography has long been claimed to be useful for achieving many tasks that are impossible from the perspective of conventional cryptography. Arguably, the most important problem in quantum cryptography has been a rigorous proof of the security of quantum key distribution, the most well-known application. This notoriously hard problem has eluded researchers for years and has become even more important after the recent surprising demonstration of the insecurity of many other quantum cryptographic schemes including quantum bit commitment. Here, we solve this long standing problem by showing that, given quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The novel technique we use is reduction from a quantum scheme to a classical scheme. The security in realistic noisy environments is then proven by using the recent theory of fault-tolerant quantum computation.

•Mar 3, 1998•7 citations
In view of experimental realization of quantum key distribution schemes, the study of their efficiency becomes as important as the proof of their security. The latter is the subject of most of the theoretical work about quantum key distribution, and many important results such as the proof of unconditional security have been obtained. The
Quantum Key Distribution seems very promising as it offers unconditional security, that’s why it is being implemented by the tech giants of the networking industry and government. Having quantum phenomenon as a backbone, QKD protocols become indecipherable. Here we have focused on the complexities of quantum key distribution and how this technology has contributed to secure key communication. This article gives an updated overview of this technology and can serve as a guide to get familiar with the current trends of quantum cryptography.
Quantum cryptography has long been claimed to be useful for achieving many tasks that are impossible from the perspective of conventional cryptography. Arguably, the most important problem in quantum cryptography has been a rigorous proof of the security of quantum key distribution, the most well-known application. This notoriously hard problem has eluded researchers for the last fifteen years and has become even more important after the recent surprising demonstration of the insecurity of many other quantum cryptographic schemes including quantum bit commitment. Here, we solve this long standing problem by showing that, given quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The novel technique we use is reduction from a quantum scheme to a classical scheme. The security in realistic noisy environments is then proven by using the recent theory of fault-tolerant quantum computation.
Quantum cryptography has long been claimed to be useful for achieving many tasks that are impossible from the perspective of conventional cryptography. Arguably, the most important problem in quantum cryptography has been a rigorous proof of the security of quantum key distribution, the most well-known application. This notoriously hard problem has eluded researchers for years and has become even more important after the recent surprising demonstration of the insecurity of many other quantum cryptographic schemes including quantum bit commitment. Here, we solve this long standing problem by showing that, given quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The novel technique we use is reduction from a quantum scheme to a classical scheme. The security in realistic noisy environments is then proven by using the recent theory of fault-tolerant quantum computation.