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

Journal of Hunan University

An Efficient Secret Key Distribution Scheme Based on Interaction-Free Measurement

Yan Dong

Published Jan 1, 2002• 0 citations
OpenAlex

Abstract

We first introduce a conventional quantum key distribution model based on interaction free measurement.After analysing that model,we give a more efficient new scheme.The security against two intercept eavesdropping strategies in ideal channel and device is shown.At last,we introduce a technique called privacy amplification to distil a high secret key subsequence from the original secret key sequence.

Related papers

Practical scheme to share a secret key through a quantum channel with a 27.6% bit error rate

H. F. Chau

A secret key shared through quantum key distribution between two cooperative players is secure against any eavesdropping attack allowed by the laws of physics. Yet, such a key can be established only when the quantum channel error rate due to eavesdropping or imperfect apparatus is low. Here, a practical quantum key distribution scheme by making use of an adaptive privacy amplification procedure with two-way classical communication is reported. Then, it is proven that the scheme generates a secret key whenever the bit error rate of the quantum channel is less than $0.5\ensuremath{-}0.1\sqrt{5}\ensuremath{\approx}27.6%,$ thereby making it the most error resistant scheme known to date.

Physical Review A•Dec 20, 2002•232 citations

The attack strategy for a quantum key distribution protocol based on Bell’s theorem

Chan Myae Hein, T. F. Kamalov

Abstract A new eavesdropping strategy is proposed for the Quantum Key Distribution (QKD) protocol. This scheme represents a new kind of intercept/resend strategy based on Bell’s theorem. Quantum key distribution (QKD) provides the foremost reliable form of secure key exchange, using only the input-output statistics of the devices to realize information-theoretic security. In this paper, we present an improved QKD protocol that can simultaneously distribute the quantum secret key. We are already using the QKD protocol with simulated results matched completely with the theoretical concepts.

Journal of Physics Conference Series•Oct 1, 2021•0 citations

Practical Scheme To Share A Secret Key Through An Up To 27.6% Bit Error Rate Quantum Channel

H. F. Chau

A secret key shared through quantum key distribution between two cooperative players is secure against any eavesdropping attack allowed by the laws of physics. Yet, such a key can be established only when the quantum channel error rate due to eavesdropping or imperfect apparatus is low. Here, I report a practical quantum key distribution scheme making use of an adaptive privacy amplification procedure with two-way classical communication. Then, I prove that the scheme generates a secret key whenever the bit error rate of the quantum channel is less than $0.5-0.1\sqrt{5} \approx 27.6%$, thereby making it the most error resistant scheme known to date.

arXiv:quant-ph/0205060•May 11, 2002•6 citations

Privacy Amplification for Quantum Key Distribution

Yongmin Li

Privacy amplification is an essential part of distilling highly secret shared information in quantum key distribution.Two accelerating algorithms used for privacy amplification are introduced in this paper.The combination of the two accelerating algorithms not only has the merits of high security,but also effectively reduces the computation time.By using the combined algorithm,we have achieved secret-key distillation for continuous variable quantum key distribution.

Acta Sinica Quantum Optica•Jan 1, 2013•0 citations

Secure Reusable Base-String in Quantum Key Distribution

Kai Wen, Fu‐Guo Deng, Long, Gui Lu

Protecting secure random key from eavesdropping in quantum key distribution protocols has been well developed. In this letter, we further study how to detect and eliminate eavesdropping on the random base string in such protocols. The correlation between the base string and the key enables Alice and Bob to use specific privacy amplification to distill and reuse the previously shared base string with unconditional security and high efficiency. The analysis of the unconditional secure reusable base string brings about new concept and protocol design technique.

arXiv:0706.3791•Jun 26, 2007•3 citations

The art of distilling [secret key generation]

Marten van Dijk, Henk van Tilborg

Aultmore and Balvenie want to agree on a common secret key. They have at their disposal a noisy channel and an error free public channel. The situation is complicated by an adversary, Ellen, who eavesdrops the noisy channel and the public channel. Fortunately for Aultmore and Balvenie, the eavesdropping channel is noisy as well. This will enable them to generate a secret key. In the literature, this is done in three phases; the advantage distillation phase, the information reconciliation phase, and the privacy amplification phase. We show that the first two phases are based on the same concept and that presently known techniques used in both phases are basically special cases of a more general technique.

IEEE Information Theory Workshop (ITW)•Nov 27, 2002•4 citations
We first introduce a conventional quantum key distribution model based on interaction free measurement.After analysing that model,we give a more efficient new scheme.The security against two intercept eavesdropping strategies in ideal channel and device is shown.At last,we introduce a technique called privacy amplification to distil a high secret key subsequence from the original secret key sequence.
A secret key shared through quantum key distribution between two cooperative players is secure against any eavesdropping attack allowed by the laws of physics. Yet, such a key can be established only when the quantum channel error rate due to eavesdropping or imperfect apparatus is low. Here, a practical quantum key distribution scheme by making use of an adaptive privacy amplification procedure with two-way classical communication is reported. Then, it is proven that the scheme generates a secret key whenever the bit error rate of the quantum channel is less than $0.5\ensuremath{-}0.1\sqrt{5}\ensuremath{\approx}27.6%,$ thereby making it the most error resistant scheme known to date.
Abstract A new eavesdropping strategy is proposed for the Quantum Key Distribution (QKD) protocol. This scheme represents a new kind of intercept/resend strategy based on Bell’s theorem. Quantum key distribution (QKD) provides the foremost reliable form of secure key exchange, using only the input-output statistics of the devices to realize information-theoretic security. In this paper, we present an improved QKD protocol that can simultaneously distribute the quantum secret key. We are already using the QKD protocol with simulated results matched completely with the theoretical concepts.
A secret key shared through quantum key distribution between two cooperative players is secure against any eavesdropping attack allowed by the laws of physics. Yet, such a key can be established only when the quantum channel error rate due to eavesdropping or imperfect apparatus is low. Here, I report a practical quantum key distribution scheme making use of an adaptive privacy amplification procedure with two-way classical communication. Then, I prove that the scheme generates a secret key whenever the bit error rate of the quantum channel is less than 0.5−0.15≈27.60.5-0.1\sqrt{5} \approx 27.6%0.5−0.15​≈27.6, thereby making it the most error resistant scheme known to date.
Protecting secure random key from eavesdropping in quantum key distribution protocols has been well developed. In this letter, we further study how to detect and eliminate eavesdropping on the random base string in such protocols. The correlation between the base string and the key enables Alice and Bob to use specific privacy amplification to distill and reuse the previously shared base string with unconditional security and high efficiency. The analysis of the unconditional secure reusable base string brings about new concept and protocol design technique.
Aultmore and Balvenie want to agree on a common secret key. They have at their disposal a noisy channel and an error free public channel. The situation is complicated by an adversary, Ellen, who eavesdrops the noisy channel and the public channel. Fortunately for Aultmore and Balvenie, the eavesdropping channel is noisy as well. This will enable them to generate a secret key. In the literature, this is done in three phases; the advantage distillation phase, the information reconciliation phase, and the privacy amplification phase. We show that the first two phases are based on the same concept and that presently known techniques used in both phases are basically special cases of a more general technique.