Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 ωE⊥,t on abort and ωEa,b,t on acceptance. Define the abort and accepted transcript-adversary substates by

ρTEabort:=∑t∈T∣t⟩⟨t∣⊗ωE⊥,t,ρTEacc:=∑t∈T∣t⟩⟨t∣⊗∑a,b∈KωEa,b,t.

The accepted part of the full real state is ρABTEacc:=∑a,b∈K, t∈T∣a,b,t⟩⟨a,b,t∣⊗ωEa,b,t.

Their traces are pabort and pacc, with pabort+pacc=1. If pacc>0, put ρABTE⊤:=ρABTEacc/pacc and define the normalized accepted marginals directly from their classical blocks:

ρATE⊤:=∑a,t∣a,t⟩⟨a,t∣⊗1pacc∑bωEa,b,t,ρTE⊤:=∑t∣t⟩⟨t∣⊗1pacc∑a,bωEa,b,t.

For m:=∣K∣, define the uniform key state τA:=m−1∑a∈K∣a⟩⟨a∣ and the ideal uniform shared-key state τAB:=m−1∑a∈K∣a,a⟩⟨a,a∣. 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:

ρABTEideal:=∑t∣⊥,⊥,t⟩⟨⊥,⊥,t∣⊗ωE⊥,t+τAB⊗ρTEacc.

Let ρABTEreal be the normalized output from the protocol definition. The real-ideal trace-distance error is δid:=D(ρABTEreal,ρABTEideal), using Trace Distance. The correctness error is εcor:=Pr⁡[KA≠KB]=∑a≠b,ttr⁡(ωEa,b,t); the common abort output contributes no mismatch. The secrecy error is

εsec:={paccD(ρATE⊤,τA⊗ρTE⊤),pacc>0,0,pacc=0.

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