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

Quantum Information and Computation

Proof of unconditional security of six-state quantum key distribution scheme

Hoi‐Kwong Lo

Published Aug 1, 2001• 112 citations
Publisher

Abstract

We prove the unconditional sercurity of the standard six-state scheme for quantum key distribution (QKD).
DOI
10.26421/qic1.2-4

Related papers

Proof of unconditional security of six-state quatum key distribution scheme

LoHoi-Kwong

We prove the unconditional security of the standard six-state scheme for quantum key distribution (QKD). We demonstrate its unconditional security up to a bit error rate of 12.7 percents, by allowi...

Quantum Information and Computation•Aug 1, 2001•4 citations

Proof of unconditional security of six-state quantum key distribution scheme

Hoi‐Kwong Lo

We prove the unconditional security of the standard six-state scheme for quantum key distribution (QKD). We demonstrate its unconditional security up to a bit error rate of 12.7 percents, by allowing only one-way classical communications in the error correction/privacy amplification procedure between Alice and Bob. This shows a clear advantage of the six-state scheme over another standard scheme---BB84, which has been proven to be secure up to only about 11 percents, if only one-way classical communications are allowed. Our proof technique is a generalization of that of Shor-Preskill's proof of security of BB84. We show that a advantage of the six-state scheme lies in the Alice and Bob's ability to establish rigorously from their test sample the non-trivial mutual information between the bit-flip and phase error patterns. A modified version of the degenerate quantum codes studied by DiVincenzo, Shor and Smolin is employed in our proof.

arXiv:quant-ph/0102138•Feb 27, 2001•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

Finite Key Analysis in Quantum Cryptography

Tim Meyer

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

•Jan 1, 2007•2 citations

Fundamental and practical problems of QKD security: the actual and perceived situation

Horace P. Yuen

It is widely believed that quantum key distribution (QKD) has been proved unconditionally secure for realistic models applicable to various current experimental schemes. Here we summarize briefly why this is not the case, from both the viewpoints of fundamental quantitative security and applicable models of security analysis, with some morals drawn.

arXiv:1109.1066•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 6, 2011•3 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
We prove the unconditional security of the standard six-state scheme for quantum key distribution (QKD). We demonstrate its unconditional security up to a bit error rate of 12.7 percents, by allowing only one-way classical communications in the error correction/privacy amplification procedure between Alice and Bob. This shows a clear advantage of the six-state scheme over another standard scheme---BB84, which has been proven to be secure up to only about 11 percents, if only one-way classical communications are allowed. Our proof technique is a generalization of that of Shor-Preskill's proof of security of BB84. We show that a advantage of the six-state scheme lies in the Alice and Bob's ability to establish rigorously from their test sample the non-trivial mutual information between the bit-flip and phase error patterns. A modified version of the degenerate quantum codes studied by DiVincenzo, Shor and Smolin is employed in our proof.