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

arXiv:1703.05426 · IEEE Transactions on Information Theory

Parallel Device-Independent Quantum Key Distribution

Rahul Jain, Carl A. Miller, Yaoyun Shi

Published Apr 9, 2020• 38 citations
arXivHTMLPDF

Abstract

A prominent application of quantum cryptography is the distribution of cryptographic keys that are provably secure. Such security proofs were extended by Vazirani and Vidick (Physical Review Letters, 113, 140501, 2014) to the deviceindependent (DI) scenario, where the users do not need to trust the integrity of the underlying quantum devices. The protocols analyzed by them and by subsequent authors all require a sequential execution of N multiplayer games, where N is the security parameter. In this work, we prove the security of a protocol where all games are executed in parallel. Besides decreasing the number of time-steps necessary for key generation, this result reduces the security requirements for DI-QKD by allowing arbitrary information leakage of each user's inputs within his or her lab. To the best of our knowledge, this is the first parallel security proof for a fully device-independent QKD protocol. Our protocol tolerates a constant level of device imprecision and achieves a linear key rate.

DOI
10.1109/tit.2020.2986740

Related papers

Fully Device-Independent Quantum Key Distribution

Umesh V. Vazirani, Thomas Vidick

Quantum cryptography promises levels of security that are impossible to replicate in a classical world. Can this security be guaranteed even when the quantum devices on which the protocol relies are untrusted? This central question dates back to the early 1990s when the challenge of achieving device-independent quantum key distribution was first formulated. We answer this challenge by rigorously proving the device-independent security of a slight variant of Ekert's original entanglement-based protocol against the most general (coherent) attacks. The resulting protocol is robust: While assuming only that the devices can be modeled by the laws of quantum mechanics and are spatially isolated from each other and from any adversary's laboratory, it achieves a linear key rate and tolerates a constant noise rate in the devices. In particular, the devices may have quantum memory and share arbitrary quantum correlations with the eavesdropper. The proof of security is based on a new quantitative understanding of the monogamous nature of quantum correlations in the context of a multiparty protocol.

arXiv:1210.1810•Physical Review Letters•Sep 29, 2014•494 citations

Fully device independent quantum key distribution

Umesh V. Vazirani, Thomas Vidick

Quantum cryptography promises levels of security that are impossible to attain in a classical world. Can this security be guaranteed to classical users of a quantum protocol, who may not even trust the quantum devices used to implement the protocol? This central question dates back to the early 1990s when the challenge of achieving Device-Independent Quantum Key Distribution (DIQKD) was first formulated. We answer the challenge by rigorously proving the device-independent security of an entanglement-based protocol building on Ekert's original proposal for quantum key distribution. The proof of security builds on techniques from the classical theory of pseudo-randomness to achieve a new quantitative understanding of the non-local nature of quantum correlations.

Communications of the ACM•Mar 20, 2019•146 citations

Security of device-independent quantum key distribution protocols: a review

Ignatius William Primaatmaja, Koon Tong Goh, Ernest Y.-Z. Tan +3 more

Device-independent quantum key distribution (DI-QKD) is often seen as the ultimate key exchange protocol in terms of security, as it can be performed securely with uncharacterised black-box devices. The advent of DI-QKD closes several loopholes and side-channels that plague current QKD systems. While implementing DI-QKD protocols is technically challenging, there have been recent proof-of-principle demonstrations, resulting from the progress made in both theory and experiments. In this review, we will provide an introduction to DI-QKD, an overview of the related experiments performed, and the theory and techniques required to analyse its security. We conclude with an outlook on future DI-QKD research.

arXiv:2206.04960•Quantum•Mar 2, 2023•68 citations

Simple and Tight Device-Independent Security Proofs

Rotem Arnon-Friedman, Renato Renner, Thomas Vidick

Device-independent security is the gold standard for quantum cryptography: not only is security based entirely on the laws of quantum mechanics, but it holds irrespective of any a priori assumptions on the quantum devices used in a protocol, making it particularly applicable in a quantum-wary environment. While the existence of device-independent protocols for tasks such as randomness expansion and quantum key distribution has recently been established, the underlying proofs of security remain very challenging, yield rather poor key rates, and demand very high quality quantum devices, thus making them all but impossible to implement in practice. We introduce a technique for the analysis of device-independent cryptographic protocols. We provide a flexible protocol and give a security proof that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries. At a high level our approach amounts to establishing a reduction to the scenario in which the untrusted device operates in an identical and independent way in each round of the protocol. This is achieved by leveraging the sequential nature of the protocol and makes use of a newly developed tool, the “entropy accumulation theorem” of Dupuis, Fawzi, and Renner [ Entropy Accumulation, preprint, 2016]. As concrete applications we give simple and modular security proofs for device-independent quantum key distribution and randomness expansion protocols based on the CHSH inequality. For both tasks, we establish essentially optimal asymptotic key rates and noise tolerance. In view of recent experimental progress, which has culminated in loophole-free Bell tests, it is likely that these protocols can be practically implemented in the near future.

arXiv:1607.01797•SIAM Journal on Computing•Jan 1, 2019•155 citations

Device-independent quantum key distribution with single-photon sources (Conference Presentation)

Alejandro Máttar, Daniel Cavalcanti, Jan Kołodyński +3 more

The concept of the Device-Independent Quantum Key Distribution (DI-QKD) constitutes the minimalist paradigm for quantum cryptography, in which the security of the distributed secret key is fully assured by the statistical properties of the data being shared between the parties that perform a quantum-based protocol. In particular, the secrecy of the distributed key is ultimately guaranteed not only thanks to the quantum nature of the underlying scheme, but also without making any assumptions about the operation of the devices being employed. Such a conservative approach is possible thanks to the non-local correlations exhibited within the shared data, i.e., the correlations of genuine quantum origin that, due to violation of a particular Bell inequality, cannot be explained by any form of common randomness pre-available to the parties. Such violation, however, must be revealed without performing any post-selection on the data, what would then open the so-called detection loophole and jeopardize the security of the protocol. In spite of the tremendous advances recently made to achieve higher detection efficiencies in Bell-violation experiments, DI-QKD remains a very experimentally difficult task due to the exponential increase of loss in the channel, e.g., implemented with optical fibres, with the distance separating the parties involved. Here, we describe a new and plausible solution to overcome the crucial problem of channel loss in the frame of DI-QKD optical implementations. In particular, we propose a novel protocol inspired by the entanglement swapping schemes, which by the usage of the state-of-the-art (e.g., quantum-dot-based or heralded) single-photon sources has potential, for the first time, to be implementable with current photonic and linear optics technologies. While allowing for any transmission losses that only decrease the rate of the key distribution without creating vulnerability, it tolerates overall detection efficiency at the 90% level even when requiring strict device-independence. We compare our scheme against protocols that involve sources based on spontaneous parametric down-conversion (SPDC), in order to explicitly show and explain why such SPDC-based proposals—even when enhanced by the entanglement swapping or qubit amplification techniques—are then largely outperformed when physical imperfections are rigorously taken into account.

•Jun 8, 2017•2 citations

Security proof for parallel DIQKD

Marwah, Ashutosh, Frédéric Dupuis

We present a parallel device independent quantum key distribution (DIQKD) protocol based on the CHSH game and prove its security. Using techniques developed for analysing the parallel repetition of anchored non-local games, we show that the answers on a small random linear subset of the games in the DIQKD protocol can be simulated as the output of a single-round strategy for playing the CHSH game. Then, we use the recently developed unstructured approximate entropy accumulation theorem to establish the smooth min-entropy lower bound required for the security proof. Our approach yields a more information-theoretic and general proof for parallel DIQKD compared to previous proofs.

arXiv:2507.03991•Jul 5, 2025•0 citations
A prominent application of quantum cryptography is the distribution of cryptographic keys that are provably secure. Such security proofs were extended by Vazirani and Vidick (Physical Review Letters, 113, 140501, 2014) to the deviceindependent (DI) scenario, where the users do not need to trust the integrity of the underlying quantum devices. The protocols analyzed by them and by subsequent authors all require a sequential execution of N multiplayer games, where N is the security parameter. In this work, we prove the security of a protocol where all games are executed in parallel. Besides decreasing the number of time-steps necessary for key generation, this result reduces the security requirements for DI-QKD by allowing arbitrary information leakage of each user's inputs within his or her lab. To the best of our knowledge, this is the first parallel security proof for a fully device-independent QKD protocol. Our protocol tolerates a constant level of device imprecision and achieves a linear key rate.
Quantum cryptography promises levels of security that are impossible to replicate in a classical world. Can this security be guaranteed even when the quantum devices on which the protocol relies are untrusted? This central question dates back to the early 1990s when the challenge of achieving device-independent quantum key distribution was first formulated. We answer this challenge by rigorously proving the device-independent security of a slight variant of Ekert's original entanglement-based protocol against the most general (coherent) attacks. The resulting protocol is robust: While assuming only that the devices can be modeled by the laws of quantum mechanics and are spatially isolated from each other and from any adversary's laboratory, it achieves a linear key rate and tolerates a constant noise rate in the devices. In particular, the devices may have quantum memory and share arbitrary quantum correlations with the eavesdropper. The proof of security is based on a new quantitative understanding of the monogamous nature of quantum correlations in the context of a multiparty protocol.
Quantum cryptography promises levels of security that are impossible to attain in a classical world. Can this security be guaranteed to classical users of a quantum protocol, who may not even trust the quantum devices used to implement the protocol? This central question dates back to the early 1990s when the challenge of achieving Device-Independent Quantum Key Distribution (DIQKD) was first formulated. We answer the challenge by rigorously proving the device-independent security of an entanglement-based protocol building on Ekert's original proposal for quantum key distribution. The proof of security builds on techniques from the classical theory of pseudo-randomness to achieve a new quantitative understanding of the non-local nature of quantum correlations.
Device-independent quantum key distribution (DI-QKD) is often seen as the ultimate key exchange protocol in terms of security, as it can be performed securely with uncharacterised black-box devices. The advent of DI-QKD closes several loopholes and side-channels that plague current QKD systems. While implementing DI-QKD protocols is technically challenging, there have been recent proof-of-principle demonstrations, resulting from the progress made in both theory and experiments. In this review, we will provide an introduction to DI-QKD, an overview of the related experiments performed, and the theory and techniques required to analyse its security. We conclude with an outlook on future DI-QKD research.
Device-independent security is the gold standard for quantum cryptography: not only is security based entirely on the laws of quantum mechanics, but it holds irrespective of any a priori assumptions on the quantum devices used in a protocol, making it particularly applicable in a quantum-wary environment. While the existence of device-independent protocols for tasks such as randomness expansion and quantum key distribution has recently been established, the underlying proofs of security remain very challenging, yield rather poor key rates, and demand very high quality quantum devices, thus making them all but impossible to implement in practice. We introduce a technique for the analysis of device-independent cryptographic protocols. We provide a flexible protocol and give a security proof that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries. At a high level our approach amounts to establishing a reduction to the scenario in which the untrusted device operates in an identical and independent way in each round of the protocol. This is achieved by leveraging the sequential nature of the protocol and makes use of a newly developed tool, the “entropy accumulation theorem” of Dupuis, Fawzi, and Renner [ Entropy Accumulation, preprint, 2016]. As concrete applications we give simple and modular security proofs for device-independent quantum key distribution and randomness expansion protocols based on the CHSH inequality. For both tasks, we establish essentially optimal asymptotic key rates and noise tolerance. In view of recent experimental progress, which has culminated in loophole-free Bell tests, it is likely that these protocols can be practically implemented in the near future.
The concept of the Device-Independent Quantum Key Distribution (DI-QKD) constitutes the minimalist paradigm for quantum cryptography, in which the security of the distributed secret key is fully assured by the statistical properties of the data being shared between the parties that perform a quantum-based protocol. In particular, the secrecy of the distributed key is ultimately guaranteed not only thanks to the quantum nature of the underlying scheme, but also without making any assumptions about the operation of the devices being employed. Such a conservative approach is possible thanks to the non-local correlations exhibited within the shared data, i.e., the correlations of genuine quantum origin that, due to violation of a particular Bell inequality, cannot be explained by any form of common randomness pre-available to the parties. Such violation, however, must be revealed without performing any post-selection on the data, what would then open the so-called detection loophole and jeopardize the security of the protocol. In spite of the tremendous advances recently made to achieve higher detection efficiencies in Bell-violation experiments, DI-QKD remains a very experimentally difficult task due to the exponential increase of loss in the channel, e.g., implemented with optical fibres, with the distance separating the parties involved. Here, we describe a new and plausible solution to overcome the crucial problem of channel loss in the frame of DI-QKD optical implementations. In particular, we propose a novel protocol inspired by the entanglement swapping schemes, which by the usage of the state-of-the-art (e.g., quantum-dot-based or heralded) single-photon sources has potential, for the first time, to be implementable with current photonic and linear optics technologies. While allowing for any transmission losses that only decrease the rate of the key distribution without creating vulnerability, it tolerates overall detection efficiency at the 90% level even when requiring strict device-independence. We compare our scheme against protocols that involve sources based on spontaneous parametric down-conversion (SPDC), in order to explicitly show and explain why such SPDC-based proposals—even when enhanced by the entanglement swapping or qubit amplification techniques—are then largely outperformed when physical imperfections are rigorously taken into account.
We present a parallel device independent quantum key distribution (DIQKD) protocol based on the CHSH game and prove its security. Using techniques developed for analysing the parallel repetition of anchored non-local games, we show that the answers on a small random linear subset of the games in the DIQKD protocol can be simulated as the output of a single-round strategy for playing the CHSH game. Then, we use the recently developed unstructured approximate entropy accumulation theorem to establish the smooth min-entropy lower bound required for the security proof. Our approach yields a more information-theoretic and general proof for parallel DIQKD compared to previous proofs.