pith. sign in

arxiv: 2602.05057 · v2 · pith:NBHBOGFOnew · submitted 2026-02-04 · 🪐 quant-ph

Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs

Patrick Andriolo , Esteban Vasquez , Elizabeth Agudelo , Max Riegler , Matej Pivoluska , Gl\'aucia Murta This is my paper

Pith reviewed 2026-05-25 07:20 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum key distributionsecurity proofsdevice imperfectionsrealistic conditionsinformation-theoretic securityeavesdropping strategiesquantum communication protocols
0
0 comments X

The pith

Recent security proofs for quantum key distribution incorporate device imperfections while preserving information-theoretic security guarantees.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper reviews recent analytical and numerical advances that let QKD security proofs handle real device imperfections instead of relying on idealized models. Earlier proofs left a gap between theory and practice that attackers could exploit through hardware flaws. The new methods close this gap by building imperfections directly into the analysis. A sympathetic reader would care because this makes rigorous security claims applicable to actual experimental setups rather than perfect lab conditions.

Core claim

The paper presents an overview of recent analytical and numerical developments in QKD security proofs, which provide a versatile approach for incorporating imperfections and re-establishing the security of quantum communication protocols under realistic conditions.

What carries the argument

Versatile analytical and numerical techniques that model and prove security for QKD protocols when physical devices deviate from ideal assumptions.

If this is right

  • QKD protocols receive security guarantees even when transmitters and detectors exhibit realistic errors and losses.
  • The mismatch between theoretical models and experimental hardware shrinks, reducing exposure to side-channel attacks.
  • Practical QKD implementations can now be analyzed with proofs that treat device parameters as variables rather than fixed ideals.
  • Security claims extend to a broader range of eavesdropping strategies that target non-ideal hardware.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • These methods could support certification standards for commercial QKD hardware by providing quantifiable security margins under measured imperfections.
  • Numerical techniques might integrate with existing simulation platforms to let protocol designers test security before fabrication.
  • The framework could extend naturally to related tasks such as quantum repeaters or entanglement distribution where device flaws also matter.

Load-bearing premise

The cited recent developments correctly and comprehensively account for imperfections without missing relevant attack strategies or leaving unmodeled vulnerabilities in practical devices.

What would settle it

Identification of a concrete attack on a deployed QKD system that exploits an imperfection outside the scope of the reviewed proofs and successfully extracts key material despite the new analysis.

Figures

Figures reproduced from arXiv: 2602.05057 by Elizabeth Agudelo, Esteban Vasquez, Gl\'aucia Murta, Matej Pivoluska, Max Riegler, Patrick Andriolo.

Figure 1
Figure 1. Figure 1: Distribution of states in a prepare-and-measure QKD protocol. In a PM scenario, Eve intercepts the sig￾nal |ϕa,x⟩ emitted by the trusted source in Alice’s laboratory. The malicious party can couple an auxiliary state |e⟩ to it, and through an unitary operation UE it acquires information carried in |Ψ⟩BE. state (a and x) is classically stored, and the pre￾pared states are sent to Bob through the quantum cha… view at source ↗
Figure 2
Figure 2. Figure 2: Distribution of states in an EB-QKD protocol. Eve controls both the source and the quantum channel and is therefore modeled as holding the purification |Ψ⟩ABE of the quantum state ρ, the resulting distributed states to Alice and Bob. source distributes a bipartite maximally entangled state (a Bell pair) to Alice and Bob, for instance, the state |Φ +⟩ = 1 √ 2 (|00⟩ + |11⟩). (5.4) As in the PM scheme, the si… view at source ↗
Figure 3
Figure 3. Figure 3: Characterization of devices in cryptographic sce￾narios, according to the knowledge of agents about the mech￾anism of their devices. In (i) the devices of Alice and Bob are assumed to be fully characterized; (ii) relies on the assump￾tion that one of the laboratories cannot be characterized and the devices may be untrusted, being therefore treated as a black-box, and encoded in a steering scenario. The sit… view at source ↗
Figure 4
Figure 4. Figure 4: Schematic representation of the lower bound given in Eq. (9.8). In the first step, the quadratic Frank-Wolfe algo￾rithm is used to go from an initial guess ρ0 to a near-optimal variable ρ. The provable lower bound for the objective func￾tion evaluated in ρ ∗ is achieved by considering contributions from a linearization term in the near-optimal ρ together with a term appearing from duality of SDP’s. The rel… view at source ↗
Figure 5
Figure 5. Figure 5: Illustration of two methods that guarantee interior point solutions for the optimization of Eq. (9.6): (a) shows the perturbation method used by Winick et al. [16], while (b) exhibits the use of a barrier method used by Lorente et al. [18], which we detail in Sec. 9 C. The purple pentagon represent the feasible set of the optimization, with the gradi￾ent increasing toward the opaque region, which represent… view at source ↗
Figure 6
Figure 6. Figure 6: Geometric representation of two sorts of cones, represented by the regions spanned from the origin (the black dots) to the entire subset delimited by the gray dashed lines. The left cone is generated by a conic hull of three linearly independent vectors (dashed black arrows), while right cone can not be written as the conic hull of a finite amount of vectors is represented. cone is the set of positive semi… view at source ↗
Figure 7
Figure 7. Figure 7: Pictorial representation of the facial reduction method employed in Lorente et al. [18]. The optimization space performed over the feasible set S (Eq. (9.2)) with (not necessarily full rank) density matrices is reduced to S ′ after applying an isometry that allows an equivalent optimization to be performed in the reduced face S ′ over full rank operators σ, and redundant constraints to be dropped. be furth… view at source ↗
Figure 8
Figure 8. Figure 8: Pictorial intuition of de Finetti’s theorem: A global system which is symmetric under permutation (rep￾resented by the square filled with particles of different colors in a non-iid distribution) whose small fractions can be locally seen as being iid. a probability measure22 µ such that [PITH_FULL_IMAGE:figures/full_fig_p028_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Visual representations of the Markovian maps in EAT (Theorem 10.11) and GEAT (Theorem 10.12). Figure inspired on [13]. Both EAT and GEAT treat the input state to each round’s channel in a similar way: besides the sequential condition (Markov in EAT and non-signalling in GEAT) and the observed classical data Xi , one typically im￾poses no further assumptions on the per-round input states beyond those encode… view at source ↗
Figure 10
Figure 10. Figure 10: Hierarchy of sets of quantum correlations. QHA⊗HB denotes the set of correlations achievable in the bipartite tensor product Hilbert space of Alice’s and Bob’s space of states. QHAB denotes the space of correlations that can be obtained when compatibility relations are imposed between operations of these two parties. Q1 ⊂ Q2 ⊂ . . . represents the feasible sets of each level of the NPA hierarchy. Using th… view at source ↗
read the original abstract

In contrast to classical public-key cryptosystems, where the security of encoded messages relies on on computational assumptions, Quantum Key Distribution (QKD) enables two distant parties to establish a shared secret key that, when combined with a one-time pad, provides information-theoretically secure encryption, provided that the QKD protocol is supported by a rigorous security proof. In the last decades, security proofs robust against a wide range of eavesdropping strategies have established the theoretical soundness of several QKD protocols. However, most proofs are based on idealized models of the physical systems involved in such protocols and often include assumptions that are not satisfied in practical implementations. This mismatch creates a gap between theoretical security guarantees and actual experimental realizations, making QKD protocols vulnerable to attacks. To ensure the security of real-world QKD systems, it is therefore essential to account for imperfections in security analyses. In this article, we present an overview of recent analytical and numerical developments in QKD security proofs, which provide a versatile approach for incorporating imperfections and re-establishing the security of quantum communication protocols under realistic conditions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript is a survey article providing an overview of recent analytical and numerical developments in security proofs for Quantum Key Distribution (QKD) protocols. It contrasts idealized models with practical implementations, highlights the gap caused by device imperfections, and reviews techniques that incorporate such imperfections to re-establish information-theoretic security under realistic conditions.

Significance. If the survey accurately and comprehensively summarizes the cited literature on versatile security-proof methods, it would be significant for the QKD field by helping to close the theory-practice gap, which is essential for the security of real-world quantum communication systems. The descriptive nature of the central claim means its value rests on the fidelity of the literature review rather than new derivations.

minor comments (2)
  1. The abstract states that the reviewed methods 'provide a versatile approach' but does not specify the range of imperfections covered (e.g., source flaws, detector inefficiencies, or channel noise); adding one concrete example would improve clarity for readers.
  2. The manuscript structure (as described) introduces the topic via contrast with classical cryptography and idealized proofs, but lacks an explicit statement of the survey's scope or selection criteria for the 'recent developments' included; this is a presentation issue that does not affect the descriptive claim.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript, their positive summary, and their recommendation to accept. We are pleased that the survey's focus on bridging the theory-practice gap in QKD security proofs was recognized as potentially significant for the field.

Circularity Check

0 steps flagged

No significant circularity: survey paper with no derivations

full rationale

The paper is explicitly a literature survey/overview of existing analytical and numerical developments in QKD security proofs. It presents no original theorems, derivations, equations, models, or fitted parameters of its own. The central claim is descriptive (recent techniques exist that can incorporate imperfections), with no load-bearing internal chain that could reduce to self-definition, fitted inputs, or self-citation. All cited results are external to this work.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is a review paper summarizing existing literature; no new free parameters, axioms, or invented entities are introduced by the manuscript itself.

pith-pipeline@v0.9.0 · 5735 in / 1030 out tokens · 37708 ms · 2026-05-25T07:20:39.985140+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

229 extracted references · 229 canonical work pages · 8 internal anchors

  1. [1]

    CONNECTING ANALYTICAL AND NUMERICAL TECHNIQUES The methods presented in Sections 9 and 10 can be combined to provide a versatile framework for the anal- ysis of realistic QKD protocols. In particular, the tech- niques discussed in Section 10 allow one to address the most general class of eavesdropping strategies – coherent 25 HereA i−1 denotes the designa...

    work page

  2. [2]

    We also thank Marcus Huber, Monika Mothsara, Peter Brown and Ramona Wolf for useful discussions

    ACKNOWLEDGEMENTS We thank Florian Kanitschar and Mateus Ara´ ujo for helpful comments and clarifications on parts of the text. We also thank Marcus Huber, Monika Mothsara, Peter Brown and Ramona Wolf for useful discussions. This project was funded by the Austrian Research Promo- tion Agency (FFG) through the Project NSPT-QKD FO999915265

    work page

  3. [3]

    C. H. Bennett and G. Brassard, Quantum cryptogra- phy: Public key distribution and coin tossing, Theoret- ical computer science560, 7 (2014)

    work page 2014

  4. [4]

    A. K. Ekert, Quantum cryptography based on bell’s the- orem, Physical review letters67, 661 (1991)

    work page 1991

  5. [5]

    Vernam, Cipher printing telegraph systems for secret wire and radio telegraphic communi- cations, T

    G. Vernam, Cipher printing telegraph systems for secret wire and radio telegraphic communi- cations, T. Am. Inst. Elec. Eng., 55:109 (1926)

    work page 1926

  6. [6]

    Diamanti, H.-K

    E. Diamanti, H.-K. Lo, B. Qi, and Z. Yuan, Practical challenges in quantum key distribution, npj Quantum Information2, 16025 (2016). 36

    work page 2016

  7. [7]

    Pirandola, U

    S. Pirandola, U. L. Andersen, L. Banchi, M. Berta, D. Bunandar, R. Colbeck, D. Englund, T. Gehring, C. Lupo, C. Ottaviani,et al., Advances in quantum cryptography, Advances in optics and photonics12, 1012 (2020)

    work page 2020

  8. [8]

    F. Xu, X. Ma, Q. Zhang, H.-K. Lo, and J.-W. Pan, Secure quantum key distribution with realistic devices, Reviews of modern physics92, 025002 (2020)

    work page 2020

  9. [9]

    Lydersen, C

    L. Lydersen, C. Wiechers, C. Wittmann, D. Elser, J. Skaar, and V. Makarov, Hacking commercial quan- tum cryptography systems by tailored bright illumina- tion, Nature photonics4, 686 (2010)

    work page 2010

  10. [10]

    S.-H. Sun, F. Xu, M.-S. Jiang, X.-C. Ma, H.-K. Lo, and L.-M. Liang, Effect of source tampering in the secu- rity of quantum cryptography, Phys. Rev. A92, 022304 (2015)

    work page 2015

  11. [11]

    Scarani and R

    V. Scarani and R. Renner, Quantum cryptography with finite resources: Unconditional security bound for discrete-variable protocols with one-way postprocessing, Physical review letters100, 200501 (2008)

    work page 2008

  12. [12]

    Scarani and R

    V. Scarani and R. Renner, Security bounds for quan- tum cryptography with finite resources, inWorkshop on Quantum Computation, Communication, and Cryp- tography(Springer, 2008) pp. 83–95

    work page 2008

  13. [13]

    Dupuis, O

    F. Dupuis, O. Fawzi, and R. Renner, Entropy accumu- lation, Communications in Mathematical Physics379, 867 (2020)

    work page 2020

  14. [14]

    Dupuis and O

    F. Dupuis and O. Fawzi, Entropy accumulation with improved second-order term, IEEE Transactions on in- formation theory65, 7596 (2019)

    work page 2019

  15. [15]

    Metger, O

    T. Metger, O. Fawzi, D. Sutter, and R. Renner, Gener- alised entropy accumulation, Communications in Math- ematical Physics405, 261 (2024)

    work page 2024

  16. [16]

    Renner, Symmetry of large physical systems im- plies independence of subsystems, Nature Physics3, 645 (2007)

    R. Renner, Symmetry of large physical systems im- plies independence of subsystems, Nature Physics3, 645 (2007)

    work page 2007

  17. [17]

    Renner, Security of quantum key distribution, Inter- national Journal of Quantum Information6, 1 (2008)

    R. Renner, Security of quantum key distribution, Inter- national Journal of Quantum Information6, 1 (2008)

    work page 2008

  18. [18]

    Winick, N

    A. Winick, N. L¨ utkenhaus, and P. J. Coles, Reliable nu- merical key rates for quantum key distribution, Quan- tum2, 77 (2018)

    work page 2018

  19. [19]

    Ara´ ujo, M

    M. Ara´ ujo, M. Huber, M. Navascu´ es, M. Pivoluska, and A. Tavakoli, Quantum key distribution rates from semidefinite programming, Quantum7, 1019 (2023)

    work page 2023

  20. [20]

    A. G. Lorente, P. V. Parellada, M. Castillo-Celeita, and M. Ara´ ujo, Quantum key distribution rates from non- symmetric conic optimization, Quantum9, 1657 (2025)

    work page 2025

  21. [21]

    Wolf, Quantum key distribution, Lecture notes in physics988(2021)

    R. Wolf, Quantum key distribution, Lecture notes in physics988(2021)

    work page 2021

  22. [22]

    Vidick and S

    T. Vidick and S. Wehner,Introduction to quantum cryp- tography(Cambridge University Press, 2023)

    work page 2023

  23. [23]

    Scarani, H

    V. Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, M. Duˇ sek, N. L¨ utkenhaus, and M. Peev, The security of practical quantum key distribution, Reviews of modern physics81, 1301 (2009)

    work page 2009

  24. [24]

    Gisin, G

    N. Gisin, G. Ribordy, W. Tittel, and H. Zbinden, Quan- tum cryptography, Reviews of modern physics74, 145 (2002)

    work page 2002

  25. [25]

    Zhang, H

    H. Zhang, H. Zhu, R. He, Y. Zhang, C. Ding, L. Hanzo, and W. Gao, Towards global quantum key distribution, Nature Reviews Electrical Engineering , 1 (2025)

    work page 2025

  26. [26]

    V. L. Sena, F. de Melo, M. A. Dias, A. B. Tacla, and R. Chaves, Um tutorial sobre distribui¸ c˜ ao quˆ antica de chaves: dos fundamentos ` as tecnologias modernas, Revista Brasileira de Ensino de F´ ısica47, e20250373 (2025)

    work page 2025

  27. [27]

    Cryptographic security of quantum key distribution

    C. Portmann and R. Renner, Cryptographic secu- rity of quantum key distribution, arXiv preprint arXiv:1409.3525 (2014)

    work page internal anchor Pith review Pith/arXiv arXiv 2014

  28. [28]

    Portmann and R

    C. Portmann and R. Renner, Security in quantum cryptography, Reviews of Modern Physics94, 025008 (2022)

    work page 2022

  29. [29]

    Ferradini, M

    C. Ferradini, M. Sandfuchs, R. Wolf, and R. Renner, Defining security in quantum key distribution, arXiv preprint arXiv:2509.13405 (2025)

    work page arXiv 2025

  30. [30]

    Tomamichel and A

    M. Tomamichel and A. Leverrier, A largely self- contained and complete security proof for quantum key distribution, Quantum1, 14 (2017)

    work page 2017

  31. [32]

    Mizutani, T

    A. Mizutani, T. Sasaki, and G. Kato, Protocol-level description and self-contained security proof of decoy- state bb84 qkd protocol, arXiv preprint (2025), arXiv:2504.20417 [quant-ph]

    work page arXiv 2025

  32. [33]

    Tupkary, E

    D. Tupkary, E. Y.-Z. Tan, S. Nahar, L. Kamin, and N. L¨ utkenhaus, Qkd security proofs for decoy-state bb84: protocol variations, proof techniques, gaps and limitations, arXiv preprint arXiv:2502.10340 (2025)

    work page arXiv 2025

  33. [34]

    Tupkary, S

    D. Tupkary, S. Nahar, A. Arqand, E. Y. Z. Tan, and N. L¨ utkenhaus, A rigorous and complete security proof of decoy-state bb84 quantum key distribution, arxiv (2026), arXiv:2601.18035 [quant-ph]

    work page arXiv 2026

  34. [35]

    S. A. Ghoreishi, G. Scala, R. Renner, L. L. Tacca, J. Bouda, S. P. Walborn,et al., The future of secure communications: device independence in quantum key distribution, arXiv preprint arXiv:2504.06350 (2025)

    work page arXiv 2025

  35. [36]

    S. M. Arslan, S. Al-Kuwari, M. Rahim, and H. Ku- niyal, Device-independent quantum key distribution: Protocols, quantum games, and security, arXiv preprint arXiv:2505.14243 (2025)

    work page arXiv 2025

  36. [37]

    I. W. Primaatmaja, K. T. Goh, E. Y.-Z. Tan, J. T.-F. Khoo, S. Ghorai, and C. C.-W. Lim, Security of device- independent quantum key distribution protocols: a re- view, Quantum7, 932 (2023)

    work page 2023

  37. [38]

    Non-locality and Communication Complexity

    H. Buhrman, R. Cleve, S. Massar, and R. De Wolf, Non- locality and communication complexity, arXiv preprint arXiv:0907.3584 (2009)

    work page internal anchor Pith review Pith/arXiv arXiv 2009

  38. [39]

    Murta, S

    G. Murta, S. B. van Dam, J. Ribeiro, R. Hanson, and S. Wehner, Towards a realization of device-independent quantum key distribution, Quantum Science and Tech- nology4, 035011 (2019)

    work page 2019

  39. [40]

    F. Xu, M. Curty, B. Qi, and H.-K. Lo, Measurement- device-independent quantum cryptography, IEEE Jour- nal of Selected Topics in Quantum Electronics21, 148 (2014)

    work page 2014

  40. [41]

    V. C. Usenko, A. Ac´ ın, R. All´ eaume, U. L. An- dersen, E. Diamanti, T. Gehring, A. A. Hajomer, F. Kanitschar, C. Pacher, S. Pirandola,et al., Continuous-variable quantum communication, arXiv preprint usenkoarXiv:2501.12801 (2025)

    work page arXiv 2025

  41. [42]

    Juvˆ encio Gomes de Sousa, C

    D. Juvˆ encio Gomes de Sousa, C. da Silva Morais Alves, V. Loureiro da Silva, and N. Alves Ferreira Neto, Dig- ital signal processing from classical coherent systems to continuous-variable qkd: A review of cross-domain techniques, applications, and challenges, arXiv e-prints 37 , arXiv (2025)

    work page 2025

  42. [43]

    P. Wang, Y. Tian, and Y. Li, Advances in continuous variable measurement-device-independent quantum key distribution, Science China Information Sciences68, 180501 (2025)

    work page 2025

  43. [44]

    Laudenbach, C

    F. Laudenbach, C. Pacher, C.-H. F. Fung, A. Poppe, M. Peev, B. Schrenk, M. Hentschel, P. Walther, and H. H¨ ubel, Continuous-variable quantum key distribu- tion with gaussian modulation—the theory of practical implementations, Advanced Quantum Technologies1, 1800011 (2018)

    work page 2018

  44. [45]

    Diamanti and A

    E. Diamanti and A. Leverrier, Distributing secret keys with quantum continuous variables: principle, security and implementations, Entropy17, 6072 (2015)

    work page 2015

  45. [46]

    M. F. Anka, J. A. M. Rodr´ ıguez, D. F. Pinto, L. Q. Galv˜ ao, M. A. Dias, and A. B. Tacla, An introductory review of the theory of continuous-variable quantum key distribution: Fundamentals, protocols, and security, arXiv preprint (2025), arXiv:2512.01758 [quant-ph]

    work page arXiv 2025

  46. [47]

    Murta, F

    G. Murta, F. Grasselli, H. Kampermann, and D. Bruß, Quantum conference key agreement: A review, Ad- vanced Quantum Technologies3, 2000025 (2020)

    work page 2020

  47. [48]

    H.-K. Lo, M. Curty, and K. Tamaki, Secure quantum key distribution, Nature Photonics8, 595 (2014)

    work page 2014

  48. [49]

    H.-f. Chou, V. N. Ha, H. Al-Hraishawi, L. M. Garces- Socarras, J. L. Gonzalez-Rios, J. C. Merlano-Duncan, and S. Chatzinotas, Satellite-based quantum network: Security and challenges over atmospheric channel, arXiv preprint arXiv:2308.00011 (2023)

    work page arXiv 2023

  49. [50]

    Tavakoli, A

    A. Tavakoli, A. Pozas-Kerstjens, P. Brown, and M. Ara´ ujo, Semidefinite programming relaxations for quantum correlations, Reviews of Modern Physics96, 045006 (2024)

    work page 2024

  50. [51]

    Skrzypczyk and D

    P. Skrzypczyk and D. Cavalcanti,Semidefinite program- ming in quantum information science(IOP Publishing, 2023)

    work page 2023

  51. [52]

    S. P. Boyd and L. Vandenberghe,Convex optimization (Cambridge university press, 2004)

    work page 2004

  52. [53]

    A review on the decoy-state method for practical quantum key distribution

    X.-B. Wang, A review on the decoy-state method for practical quantum key distribution, arXiv preprint quant-ph/0509084 (2005)

    work page internal anchor Pith review Pith/arXiv arXiv 2005

  53. [54]

    A. A. Abushgra, Variations of qkd protocols based on conventional system measurements: A literature review, Cryptography6, 12 (2022)

    work page 2022

  54. [55]

    S. Sun, K. Goodenough, D. Bhatti, and D. Elkouss, En- hancing quantum key distribution with entanglement distillation and classical advantage distillation, arXiv preprint arXiv:2410.19334 (2024)

    work page arXiv 2024

  55. [56]

    Z. Du, G. Liu, X. Zhang, and X. Ma, Advantage distil- lation for quantum key distribution, Quantum Science and Technology10, 015050 (2024)

    work page 2024

  56. [57]

    Devetak and A

    I. Devetak and A. Winter, Distillation of secret key and entanglement from quantum states, Proceedings of the Royal Society A: Mathematical, Physical and engineer- ing sciences461, 207 (2005)

    work page 2005

  57. [58]

    C. H. Bennett, G. Brassard, and N. D. Mermin, Quan- tum cryptography without bell’s theorem, Physical re- view letters68, 557 (1992)

    work page 1992

  58. [59]

    Bruß, Optimal eavesdropping in quantum cryptog- raphy with six states, Physical Review Letters81, 3018 (1998)

    D. Bruß, Optimal eavesdropping in quantum cryptog- raphy with six states, Physical Review Letters81, 3018 (1998)

    work page 1998

  59. [60]

    Curty, M

    M. Curty, M. Lewenstein, and N. L¨ utkenhaus, Entan- glement as a precondition for secure quantum key dis- tribution, Physical review letters92, 217903 (2004)

    work page 2004

  60. [61]

    J. Yin, Y. Cao, Y.-H. Li, S.-K. Liao, L. Zhang, J.-G. Ren, W.-Q. Cai, W.-Y. Liu, B. Li, H. Dai, et al., Satellite-based entanglement distribution over 1200 kilometers, Science356, 1140 (2017)

    work page 2017

  61. [62]

    Liao, W.-Q

    S.-K. Liao, W.-Q. Cai, W.-Y. Liu, L. Zhang, Y. Li, J.-G. Ren, J. Yin, Q. Shen, Y. Cao, Z.-P. Li,et al., Satellite- to-ground quantum key distribution, Nature549, 43 (2017)

    work page 2017

  62. [63]

    H.-K. Lo, X. Ma, and K. Chen, Decoy state quan- tum key distribution, Physical review letters94, 230504 (2005)

    work page 2005

  63. [64]

    M. A. Nielsen and I. L. Chuang,Quantum computation and quantum information(Cambridge university press, 2010)

    work page 2010

  64. [65]

    Tomamichel,Quantum information processing with finite resources: mathematical foundations, Vol

    M. Tomamichel,Quantum information processing with finite resources: mathematical foundations, Vol. 5 (Springer, 2015)

    work page 2015

  65. [66]

    Tupkary, E

    D. Tupkary, E. Y.-Z. Tan, and N. L¨ utkenhaus, Secu- rity proof for variable-length quantum key distribution, Physical Review Research6, 023002 (2024)

    work page 2024

  66. [67]

    Ben-Or, M

    M. Ben-Or, M. Horodecki, D. W. Leung, D. Mayers, and J. Oppenheim, The universal composable security of quantum key distribution, inTheory of Cryptography Conference(Springer, 2005) pp. 386–406

    work page 2005

  67. [68]

    Hayashi and T

    M. Hayashi and T. Tsurumaru, Concise and tight secu- rity analysis of the bennett–brassard 1984 protocol with finite key lengths, New Journal of Physics14, 093014 (2012)

    work page 1984

  68. [69]

    Mannalath, V

    V. Mannalath, V. Zapatero, and M. Curty, Sharp finite statistics for quantum key distribution, Physical Review Letters135, 020803 (2025)

    work page 2025

  69. [70]

    Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American sta- tistical association58, 13 (1963)

    W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American sta- tistical association58, 13 (1963)

    work page 1963

  70. [71]

    Tupkary and N

    D. Tupkary and N. L¨ utkenhaus, Using cascade in quan- tum key distribution, Physical Review Applied20, 064040 (2023)

    work page 2023

  71. [72]

    Gottesman and H.-K

    D. Gottesman and H.-K. Lo, Proof of security of quan- tum key distribution with two-way classical communi- cations, IEEE Transactions on Information Theory49, 457 (2003)

    work page 2003

  72. [73]

    J. L. Carter and M. N. Wegman, Universal classes of hash functions, inProceedings of the ninth annual ACM symposium on Theory of computing(1977) pp. 106–112

    work page 1977

  73. [74]

    M. N. Wegman and J. L. Carter, New hash functions and their use in authentication and set equality, Journal of computer and system sciences22, 265 (1981)

    work page 1981

  74. [75]

    Renner and S

    R. Renner and S. Wolf, Simple and tight bounds for information reconciliation and privacy amplification, in International conference on the theory and application of cryptology and information security(Springer, 2005) pp. 199–216

    work page 2005

  75. [76]

    Brassard and L

    G. Brassard and L. Salvail, Secret-key reconciliation by public discussion, inWorkshop on the Theory and Appli- cation of of Cryptographic Techniques(Springer, 1993) pp. 410–423

    work page 1993

  76. [77]

    C. H. Bennett, G. Brassard, and J.-M. Robert, Pri- vacy amplification by public discussion, SIAM journal on Computing17, 210 (1988)

    work page 1988

  77. [78]

    Tupkary, S

    D. Tupkary, S. Nahar, and E. Y. Z. Tan, Authentication in security proofs for quantum key distribution, arxiv (2026), arXiv:2601.17960 [quant-ph]

    work page arXiv 2026

  78. [79]

    X. Ma, X. Yuan, Z. Cao, B. Qi, and Z. Zhang, Quantum random number generation, npj Quantum Information 38 2, 1 (2016)

    work page 2016

  79. [80]

    N. Jain, E. Anisimova, I. Khan, V. Makarov, C. Mar- quardt, and G. Leuchs, Trojan-horse attacks threaten the security of practical quantum cryptography, New Journal of Physics16, 123030 (2014)

    work page 2014

  80. [81]

    Gerhardt, Q

    I. Gerhardt, Q. Liu, A. Lamas-Linares, J. Skaar, V. Scarani, V. Makarov, and C. Kurtsiefer, Experimen- tally faking the violation of bell’s inequalities, Physical Review Letters107, 170404 (2011)

    work page 2011

Showing first 80 references.