# Fully device-independent quantum key distribution.

@article{Vazirani2014FullyDQ, title={Fully device-independent quantum key distribution.}, author={Umesh V. Vazirani and Thomas Vidick}, journal={Physical Review Letters}, year={2014}, volume={113}, pages={140501} }

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…

## 254 Citations

Fully device independent quantum key distribution

- Computer ScienceCommun. ACM
- 2019

This work rigorously proves the device-independent security of an entanglement-based protocol building on Ekert's original proposal for quantum key distribution and builds on techniques from the classical theory of pseudo-randomness to achieve a new quantitative understanding of the non-local nature of quantum correlations.

Simple and tight device-independent security proofs

- Computer Science, MathematicsSIAM J. Comput.
- 2019

A flexible protocol is provided and a security proof is given that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries, which is likely that these protocols can be practically implemented in the near future.

Full Security of Quantum Key Distribution From No-Signaling Constraints

- Computer ScienceIEEE Transactions on Information Theory
- 2014

We analyze a cryptographic protocol for generating a distributed secret key from correlations that violate a Bell inequality by a sufficient amount, and prove its security against eavesdroppers,…

Practical device-independent quantum cryptography via entropy accumulation

- Computer ScienceNature Communications
- 2017

A property of entropy, termed “entropy accumulation”, is presented, which asserts that the total amount of entropy of a large system is the sum of its parts, which is used to prove the security of cryptographic protocols, including device-independent quantum key distribution, while achieving essentially optimal parameters.

qu an tph ] 2 6 M ar 2 01 9 Simple and tight device-independent security proofs

- Computer Science, Mathematics
- 2019

A flexible protocol is provided and a security proof is given that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries, which is likely that these protocols can be practically implemented in the near future.

Indian Statistical Institute Master ’ s Thesis Device Independent Quantum Cryptography For Finite Samples

- Computer Science, Mathematics
- 2017

This thesis upgrades the existing device independent quantum cryptographic protocols for finite samples by fixing the accuracy parameter appropriately for all the protocols, and shows that the adversary can’t perform any fruitful attack due to this information leakage.

Simple proof of confidentiality for private quantum channels in noisy environments

- Computer ScienceQuantum Science and Technology
- 2019

A simple proof of confidentiality for parallel quantum channels established via entanglement distillation based on hashing, in the presence of noise, and a malicious eavesdropper who is restricted only by the laws of quantum mechanics is provided.

The Statistics and Security of Quantum Key Distribution

- Computer Science
- 2018

The Trojan Horse Attack is investigated, a form of side-channel attack that could threaten the security of existing key distribution protocols, and a framework based on Markov chains and probability generating functions is developed to show how one may easily calculate an analytic expression for the completion time of a probabilistic process.

Completely device-independent quantum key distribution

- Computer Science, Mathematics
- 2016

Using recent advances in the fields of randomness amplification and randomness expansion, it is demonstrated that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries -- an assumption without which any type of cryptography would be pointless to begin with.

Experimental demonstration of Gaussian protocols for one-sided device-independent quantum key distribution

- Computer Science
- 2014

All protocols that can be 1sDI and their maximum loss tolerance are identified, and a direct link between the relevant EPR steering inequality and the secret key rate is established, further strengthening the relationship between these asymmetric notions of nonlocality and device independence.

## References

SHOWING 1-10 OF 38 REFERENCES

Device-independent quantum key distribution secure against collective attacks

- Computer Science
- 2009

This proof exploits the full structure of quantum theory, but only holds against collective attacks, where the eavesdropper is assumed to act on the quantum systems of the honest parties independently and identically in each round of the protocol.

Full Security of Quantum Key Distribution From No-Signaling Constraints

- Computer ScienceIEEE Transactions on Information Theory
- 2014

We analyze a cryptographic protocol for generating a distributed secret key from correlations that violate a Bell inequality by a sufficient amount, and prove its security against eavesdroppers,…

No signaling and quantum key distribution.

- PhysicsPhysical review letters
- 2005

A key distribution scheme provably secure against general attacks by a postquantum eavesdropper limited only by the impossibility of superluminal signaling is described, which stems from violation of a Bell inequality.

Memory attacks on device-independent quantum cryptography.

- Computer SciencePhysical review letters
- 2013

This work identifies a critical weakness of device-independent protocols that rely on public communication between secure laboratories that aims to achieve composable security in the case of two parties using a small number of devices to repeatedly share keys with each other (and no other party).

Secure device-independent quantum key distribution with causally independent measurement devices.

- Computer Science, MathematicsNature communications
- 2011

This work shows that device-independent QKD is possible with key rates comparable to those of standard schemes, and provides a general security proof for a large class of protocols in a model in which the raw key is generated by independent measurements.

Security of practical private randomness generation

- Computer Science
- 2013

It is pointed out that in most real, practical situations, where the concept of device independence is used as a protection against unintentional flaws or failures of the quantum apparatuses, it is sufficient to show that the generated string is random with respect to an adversary that holds only classical side information; i.e., proving randomness against quantum side information is not necessary.

Quantum cryptography with imperfect apparatus

- MathematicsProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998

This paper proposes and gives a concrete design for a new concept, self-checking source, which requires the manufacturer of the photon source to provide certain tests; these tests are designed such that, if passed, the source is guaranteed to be adequate for the security of the quantum key distribution protocol, even though the testing devices may not be built to the original specification.

Quantum cryptography: Public key distribution and coin tossing

- Computer ScienceTheor. Comput. Sci.
- 2014

Experimental Quantum Cryptography

- Computer ScienceEUROCRYPT
- 1990

Initial results from an apparatus and protocol designed to implement quantum public key distribution are described, by which two users exchange a random quantum transmission, consisting of very faint flashes of polarized light, which remains secure against an adversary with unlimited computing power.

Secrecy extraction from no-signaling correlations

- Computer Science
- 2006

Quantum cryptography shows that one can guarantee the secrecy of correlation on the sole basis of the laws of physics, that is, without limiting the computational power of the eavesdropper. The usual…