Device-independent quantum key distribution based on measurement inputs
arXiv:1308.6447 · doi:10.1103/PhysRevA.92.062304
Abstract
We provide an analysis of a new family of device independent quantum key distribution (QKD) protocols with several novel features: (a) The bits used for the secret key do not come from the results of the measurements on an entangled state but from the choices of settings; (b) Instead of a single security parameter (a violation of some Bell inequality) a set of them is used to estimate the level of trust in the secrecy of the key. The main advantage of these protocols is a smaller vulnerability to imperfect random number generators made possible by feature (a). We prove the security and the robustness of such protocols. We show that using our method it is possible to construct a QKD protocol which retains its security even if the source of randomness used by communicating parties is strongly biased. As a proof of principle, an explicit example of a protocol based on the Hardy's paradox is presented. Moreover, in the noiseless case, the protocol is secure in a natural way against any type of memory attack, and thus allows to reuse the device in subsequent rounds. We also analyse the robustness of the protocol using semi-definite programming methods. Finally, we present a post-processing method, and observe a paradoxical property that rejecting some random part of the private data can increase the key rate of the protocol.
arXiv comment10 pages, 5 figure: In this modified version of the manuscript we have added a new section to show fact that our protocol is much better than the standard ones when the random number generators used by the parties are imperfect
References in corpus (18)
- The Security of Practical Quantum Key Distribution
- Device-independent security of quantum cryptography against collective attacks
- No Signalling and Quantum Key Distribution
- Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulses implementations
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- From Bell's Theorem to Secure Quantum Key Distribution
- Bounding the set of quantum correlations
- Fully device independent quantum key distribution
- Secure device-independent quantum key distribution with causally independent measurement devices
- More Randomness from the Same Data
- Secrecy extraction from no-signalling correlations
- Using complete measurement statistics for optimal device-independent randomness evaluation
- Weak randomness in device independent quantum key distribution and the advantage of using high dimensional entanglement
- Device-independent bounds for Hardy's experiment
- Unconditionally secure device-independent quantum key distribution with only two devices
- Weak randomness completely trounces the security of QKD
- Robustness of quantum randomness expansion protocols in the presence of noise
- Hardy's Non-locality Paradox and Possibilistic Conditions for Non-locality