Rigorous Security Proofs for Practical Quantum Key Distribution
Devashish Tupkary

TL;DR
This thesis advances the rigorous security analysis of practical quantum key distribution protocols by developing new proof techniques, addressing real-world imperfections, and unifying existing frameworks.
Contribution
It introduces novel security proofs for variable-length QKD, extends them to coherent attacks, and provides methods to handle imperfect detectors and side channels.
Findings
Established security for variable-length QKD against IID and coherent attacks.
Developed bounds for phase error rates using observed statistics with imperfect detectors.
Created a general security framework adaptable to practical imperfections and side channels.
Abstract
This thesis is concerned with rigorous security analyses of practical Quantum Key Distribution (QKD) protocols, using a variety of modern proof techniques. The main results are as follows. First, we establish a security proof for variable-length QKD protocols against IID collective attacks, and extend this result to coherent attacks using the postselection technique. In doing so, we resolve a long-standing flaw in the application of the postselection technique to QKD, thereby placing it on a rigorous mathematical footing. Second, we develop a method to bound phase error rates in entropic uncertainty relation-based and phase error rate-based proofs, using only the observed statistics of the protocol, even when detectors are imperfect and only approximately characterized. This removes a key assumption of identical detector behaviour and enables these techniques to be applied in realistic…
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.
