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 Key Distribution Based On Generating More Than One Secret Bit Per Shared EPR Pair.

H. F. Chau, Qinan Wang, Cardythy Wong

Published Mar 8, 2016• 0 citations
OpenAlex

Abstract

Given a shared EPR pair, two cooperative parties can obtain one bit of shared secret key by separately measuring the pair along the same basis. Apparently, the Holevo bound suggests that they cannot obtain more than one secret bit per shared EPR pair. Here we show that they can do so by independently putting each of their EPR pairs in a Hilbert subspace which is unknown to the eavesdropper. We also prove the unconditional security of a practical prepare-and-measure quantum key distribution scheme based on this principle and derive its key rate in the one-way communication setting.

Related papers

Unconditional Security of Entanglement-Based Quantum Secret Sharing Schemes

Ioannis Kogias, X. D. Yu, Qiongyi He +1 more

The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes against eavesdroppers and dishonest participants remained unproven. Here we establish an unconditional security proof for continuous variable entanglement-based quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players, by utilizing ideas from the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate the practical feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results establish quantum secret sharing as a viable and practically relevant primitive for quantum communication technologies.

•Mar 10, 2016•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

Efficient quantum key distribution secure against no-signalling eavesdroppers

Acin, A, Serge Massar, Pironio, S

By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical "post-quantum" eavesdroppers limited by the no-signalling principle only. We introduce a family of quantum key distribution protocols of this type, which are more efficient than previous ones, both in terms of key rate and noise resistance. Interestingly, the best protocols involve large number of measurements. We show that in the absence of noise, these protocols can yield one secret bit per entanglement bit, implying that the key rates in the no-signalling post-quantum scenario are comparable to the key rates in usual quantum key distribution.

•May 30, 2006•84 citations

Efficient quantum key distribution secure against no-signalling eavesdroppers

Antonio Acín, Serge Massar, Stefano Pironio

By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical 'post-quantum' eavesdroppers limited by the no-signalling principle only. We introduce a family of quantum key distribution protocols of this type, which are more efficient than previous ones, both in terms of key rate and noise resistance. Interestingly, the best protocols involve large number of measurements. We show that in the absence of noise, these protocols can yield one secret bit per entanglement bit, implying that the key rates in the no-signalling post-quantum scenario are comparable to the key rates in usual quantum key distribution.

arXiv:quant-ph/0605246•New Journal of Physics•Aug 2, 2006•129 citations

A Scheme about Quantum Key Distribution Between Two Users

Ding He-wei

A quantum key distribution scheme using EPR pairs between two parties is proposed.In this scheme,Alice and Bob measure the state using Bell base and operate it using R(θ) for checking eavesdroppers during distributing the key.It is more efficient in that one uses all EPR pairs except those chosen for checking eavesdroppers.As the key,it can be proved to be secure.

Journal of Hebei Normal University•Jan 1, 2005•0 citations

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
Given a shared EPR pair, two cooperative parties can obtain one bit of shared secret key by separately measuring the pair along the same basis. Apparently, the Holevo bound suggests that they cannot obtain more than one secret bit per shared EPR pair. Here we show that they can do so by independently putting each of their EPR pairs in a Hilbert subspace which is unknown to the eavesdropper. We also prove the unconditional security of a practical prepare-and-measure quantum key distribution scheme based on this principle and derive its key rate in the one-way communication setting.
The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes against eavesdroppers and dishonest participants remained unproven. Here we establish an unconditional security proof for continuous variable entanglement-based quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players, by utilizing ideas from the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate the practical feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results establish quantum secret sharing as a viable and practically relevant primitive for quantum communication technologies.
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.
By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical "post-quantum" eavesdroppers limited by the no-signalling principle only. We introduce a family of quantum key distribution protocols of this type, which are more efficient than previous ones, both in terms of key rate and noise resistance. Interestingly, the best protocols involve large number of measurements. We show that in the absence of noise, these protocols can yield one secret bit per entanglement bit, implying that the key rates in the no-signalling post-quantum scenario are comparable to the key rates in usual quantum key distribution.
By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical 'post-quantum' eavesdroppers limited by the no-signalling principle only. We introduce a family of quantum key distribution protocols of this type, which are more efficient than previous ones, both in terms of key rate and noise resistance. Interestingly, the best protocols involve large number of measurements. We show that in the absence of noise, these protocols can yield one secret bit per entanglement bit, implying that the key rates in the no-signalling post-quantum scenario are comparable to the key rates in usual quantum key distribution.
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.