# A largely self-contained and complete security proof for quantum key distribution

@article{Tomamichel2015ALS, title={A largely self-contained and complete security proof for quantum key distribution}, author={Marco Tomamichel and Anthony Leverrier}, journal={arXiv: Quantum Physics}, year={2015} }

In this work we present a security analysis for quantum key distribution, establishing a rigorous tradeoff between various protocol and security parameters for a class of entanglement-based and prepare-and-measure protocols. The goal of this paper is twofold: 1) to review and clarify the state-of-the-art security analysis based on entropic uncertainty relations, and 2) to provide an accessible resource for researchers interested in a security analysis of quantum cryptographic protocols that…

## 77 Citations

### Device-Independent Quantum Key Distribution

- PhysicsArXiv
- 2021

This paper presents a large-scale simulation of the response of the immune system to laser-spot assisted, 3D image analysis and shows the importance of knowing the number of cells in the nervous system and how they respond to laser treatment.

### 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.

### Finite-key security analysis for multilevel quantum key distribution

- Computer Science
- 2015

A detailed security analysis of a d-dimensional quantum key distribution protocol based on two and three mutually unbiased bases (MUBs) both in an asymptotic and finite-key-length scenario and the possibility of an experimental realization of the 3-MUB QKD protocol with the orbital angular momentum degrees of freedom of photons is discussed.

### Security of quantum key distribution from generalised entropy accumulation

- Computer Science, Mathematics
- 2022

This work shows that for a very broad class of QKD protocols, security against collective attacks implies security against general attacks, which can be applied much more broadly and easily.

### Device-independent quantum key distribution with random key basis

- Computer ScienceNature communications
- 2021

This work significantly narrows the gap between the theory and practice of DIQKD with a simple variant of the original protocol based on the celebrated Clauser-Horne-Shimony-Holt (CHSH) Bell inequality, and shows that the proposed protocol significantly improves over the original DIZKD protocol, enabling positive keys in the high noise regime for the first time.

### On the Everlasting Security of Password-Authenticated Quantum Key Exchange

- Computer Science, MathematicsArXiv
- 2019

This paper investigates the possibility of implementing this authenticated classical channel by the means of human-memorable passwords and presents a construction of a quantum PAKE scheme based on QKD, and proves its everlasting security in this simulation-based model.

### Quantum Key Distribution in the Non-Asymptotic Regime

- Computer Science
- 2015

This thesis deals with the question how to generate a key to encrypt messages between two honest parties that an eavesdropper does not gain any information about and presents the different steps of the protocol and retrace them with the help of the BB84-protocol.

### Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices

- Computer Science, MathematicsSTOC
- 2014

This work shows how to expand a random seed at an exponential rate without trusting the underlying quantum devices, and has the following new features: tolerating a constant level of implementation imprecision, requiring only a unit size quantum memory per device component for the honest implementation, and allowing a large natural class of constructions.

### Towards a realization of device-independent quantum key distribution

- Computer ScienceQuantum Science and Technology
- 2019

A fully finite size analysis of device independent protocols using the CHSH inequality both for collective and coherent attacks and describes experimental improvements that can lead to a DI QKD implementation in the near future.

### Quantum key distribution with any two independent and identically distributed states

- Computer Science
- 2020

A security proof of a QKD protocol where the usage of any light source is allowed as long as it emits two independent and identically distributed (i.i.d.) states, which substantially simplifies the requirements on light sources.

## References

SHOWING 1-10 OF 47 REFERENCES

### Postselection technique for quantum channels with applications to quantum cryptography.

- Mathematics, Computer SciencePhysical review letters
- 2009

A general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems, and a simple proof for the fact that security of a discrete-variable quantum key distribution protocol against collective attacks implies security of the protocol against the most general attacks.

### Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security

- Computer ScienceJournal of Cryptology
- 2004

A simple modification that essentially doubles the efficiency of the BB84 quantum key distribution scheme and guarantees the security of the scheme against the most general eavesdropping strategy is devised, generalizing Shor and Preskill's proof of security of BB84.

### Finite-key security against coherent attacks in quantum key distribution

- Computer Science
- 2010

Finite-key analysis is necessary for finding the maximal achievable secret key rate and the corresponding optimal number of signals and is applied in the analysis of a recently proposed protocol.

### Cryptographic security of quantum key distribution

- Computer Science, MathematicsArXiv
- 2014

This work provides several examples of QKD composed in sequence and parallel with different cryptographic schemes to illustrate how the error of a composed protocol is the sum of the errors of the individual protocols.

### A monogamy-of-entanglement game with applications to device-independent quantum cryptography

- Computer Science
- 2013

This work considers a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system, and implies that the optimal guessing probability can be achieved without the use of entanglement.

### Simple proof of security of the BB84 quantum key distribution protocol

- Computer SciencePhysical review letters
- 2000

We prove that the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution is secure. We first give a key distribution protocol based on entanglement purification, which can be…

### Tight finite-key analysis for quantum cryptography

- Computer Science, MathematicsNature communications
- 2012

Here it is shown that gaps between theory and experiment can be simultaneously overcome by using a recently developed proof technique based on the uncertainty relation for smooth entropies.

### Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way postprocessing.

- Computer Science, MathematicsPhysical review letters
- 2008

A bound for the security of quantum key distribution with finite resources under one-way postprocessing is derived, based on a definition of security that is composable and has an operational meaning, for standard protocols such as Bennett-Brassard 1984 and six-states protocol.

### Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths

- Computer Science, Mathematics
- 2012

A tight security analysis of the Bennett–Brassard 1984 protocol takes into account the finite-size effect of key distillation and achieving unconditional security, utilizing the normal approximation of the hypergeometric function.

### Sifting attacks in finite-size quantum key distribution

- Computer Science, Mathematics
- 2015

This work shows that iterative sifting leads to two security issues: some rounds are more likely to be key rounds than others, and the public communication of past measurement choices changes this bias round by round, and proves the finite-key security of this combination.