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

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•164 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.

arXiv:quant-ph/0205060•Physical Review A•Dec 20, 2002•238 citations

Unconditional security of entanglement-based continuous-variable quantum secret sharing

Ioannis Kogias, Yu Xiang, 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 still remains unproven almost two decades after their original conception. Here we establish an unconditional security proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the 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 contribute to validating quantum secret sharing as a viable primitive for quantum technologies.

arXiv:1603.03224•Physical Review A•Jan 12, 2017•200 citations

An Efficient High Capacity Quantum Key Distribution Scheme

Gui‐Lu Long, Xiao Shu Liu

A novel secure quantum key distribution scheme using EPR pairs is presented. It has three distinct features: 1) it is very efficient. Unlike existing quantum key distribution schemes, this scheme uses all EPR pairs in distributing the key except those chosen for checking eavesdroppers; 2) this protocol has high capacity because each EPR pair carries 2 bits of key code while existing schemes carry only one bit of key code; 3) this scheme can be used for distributing a common key among arbitrary number of parties.

•Dec 13, 2000•2 citations

Simple and Rigorous Proof Method for the Security of Practical Quantum Key Distribution in the Single-Qubit Regime Using Mismatched Basis Measurements

Michel Boyer, Gilles Brassard, Nicolas Godbout +2 more

Quantum key distribution (QKD) protocols aim at allowing two parties to generate a secret shared key. While many QKD protocols have been proven unconditionally secure in theory, practical security analyses of experimental QKD implementations typically do not take into account all possible loopholes, and practical devices are still not fully characterized for obtaining tight and realistic key rates. We present a simple method of computing secure key rates for any practical implementation of discrete-variable QKD (which can also apply to measurement-device-independent QKD), initially in the single-qubit lossless regime, and we rigorously prove its unconditional security against any possible attack. We hope our method becomes one of the standard tools used for analysing, benchmarking, and standardizing all practical realizations of QKD.

arXiv:2208.13754•Quantum Reports•Jan 18, 2023•3 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.
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.
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 still remains unproven almost two decades after their original conception. Here we establish an unconditional security proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the 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 contribute to validating quantum secret sharing as a viable primitive for quantum technologies.
A novel secure quantum key distribution scheme using EPR pairs is presented. It has three distinct features: 1) it is very efficient. Unlike existing quantum key distribution schemes, this scheme uses all EPR pairs in distributing the key except those chosen for checking eavesdroppers; 2) this protocol has high capacity because each EPR pair carries 2 bits of key code while existing schemes carry only one bit of key code; 3) this scheme can be used for distributing a common key among arbitrary number of parties.
Quantum key distribution (QKD) protocols aim at allowing two parties to generate a secret shared key. While many QKD protocols have been proven unconditionally secure in theory, practical security analyses of experimental QKD implementations typically do not take into account all possible loopholes, and practical devices are still not fully characterized for obtaining tight and realistic key rates. We present a simple method of computing secure key rates for any practical implementation of discrete-variable QKD (which can also apply to measurement-device-independent QKD), initially in the single-qubit lossless regime, and we rigorously prove its unconditional security against any possible attack. We hope our method becomes one of the standard tools used for analysing, benchmarking, and standardizing all practical realizations of QKD.