Indefinite causal key distribution
Hector Spencer-Wood

TL;DR
This paper introduces a novel quantum key distribution protocol utilizing indefinite causal order, enabling eavesdropper detection without public key comparison, and demonstrating security against certain attacks.
Contribution
It presents the first QKD protocol in an ICO framework that detects eavesdroppers without revealing key information publicly, advancing quantum cryptography methods.
Findings
Eavesdroppers cannot gain useful information without detection
The protocol is secure against specific individual attacks
It reveals unique phenomena due to indefinite causal order
Abstract
We propose a quantum key distribution (QKD) protocol that is carried out in an indefinite causal order (ICO). In QKD, one considers a setup in which two parties, Alice and Bob, share a key with one another in such a way that they can detect whether an eavesdropper, Eve, has learnt anything about the key. To our knowledge, in all QKD protocols proposed until now, Eve is detected by publicly comparing a subset of Alice and Bob's key and checking for errors. We find that a consequence of our protocol is that it is possible to detect eavesdroppers without publicly comparing any information about the key. Indeed, we prove that it is not possible for eavesdroppers, performing any individual attack, to extract useful information about the shared key without inducing a nonzero probability of being detected. We also prove the security of this protocol against a class of individual eavesdropping…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata
