Entanglement generation secure against general attacks

Abstract

We present a security proof for establishing private entanglement by means of recurrence-type entanglement distillation protocols over noisy quantum channels. We consider protocols where the local devices are imperfect, and show that nonetheless a confidential quantum channel can be established, and used to e.g. perform distributed quantum computation in a secure manner. While our results are not fully device independent (which we argue to be unachievable in settings with quantum outputs), our proof holds for arbitrary channel noise and noisy local operations, and even in the case where the eavesdropper learns the noise. Our approach relies on non-trivial properties of distillation protocols which are used in conjunction with de-Finetti and post-selection-type techniques to reduce a general quantum attack in a non-asymptotic scenario to an i.i.d. setting. As a side result, we also provide entanglement distillation protocols for non-i.i.d. input states.

10 pages + 31 pages supplementary material, 1 + 13 figures, V2: replaced with accepted version, improved presentation and results,

References in corpus (7)

• Device-independent security of quantum cryptography against collective attacks
• Post-selection technique for quantum channels with applications to quantum cryptography
• Entanglement purification and quantum error correction
• One-and-a-half quantum de Finetti theorems
• Distilling entanglement from arbitrary resources
• Quantum authentication with key recycling
• Efficient Simulation for Quantum Message Authentication

Cited by in corpus (6)

• Advances in Quantum Cryptography
• Modular architectures for quantum networks
• Long-range big quantum-data transmission
• Attacking the Quantum Internet
• Efficient entanglement purification protocols for d-level systems
• Simple proof of confidentiality for private quantum channels in noisy environments