How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Abort-aware real and ideal QKD outputs and security errors
Definition
Fix one adversarial strategy in a protocol from Finite authenticated key-distribution protocol. Write its final output blocks as on abort and on acceptance. Define the abort and accepted transcript-adversary substates by
The accepted part of the full real state is .
Their traces are and , with . If , put and define the normalized accepted marginals directly from their classical blocks:
For , define the uniform key state and the ideal uniform shared-key state . The abort-aware ideal full output keeps the real abort branch and the accepted transcript-adversary marginal, but replaces the accepted keys with a uniform shared key independent of both:
Let be the normalized output from the protocol definition. The real-ideal trace-distance error is , using Trace Distance. The correctness error is ; the common abort output contributes no mismatch. The secrecy error is
This is an unconditional convention: the normalized secrecy distance on acceptance is weighted by the acceptance probability. Errors in a protocol are uniform bounds on these strategy-specific quantities over all allowed adversarial strategies.
Depends on
Used by
Dependency tree · two levels
28 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Christopher Portmann and Renato Renner, Cryptographic Security of Quantum Key Distribution (2014), §§3.3–4.3 (standard reference, not scraped)
- Joseph M. Renes, Quantum Information Theory, ETH Zürich lecture notes (HS2014; revised 4 February 2015), §8.3 (standard reference, not scraped)
- M. Ben-Or, M. Horodecki, D. W. Leung, D. Mayers, and J. Oppenheim, The Universal Composable Security of Quantum Key Distribution (2005), §§2 and 4 (standard reference, not scraped)
- John Watrous, The Theory of Quantum Information (2018), Chapter 1, §1.1.3 (standard reference, not scraped)