Manuscript Oai272-A@1 · Oai272-A.tex · proposition · a40828a0
Proposition: Restriction is not a new impossibility theorem
Conditioning, implementation error, and protocol restrictions · lines 1096–1108 · proof included or linked
Oai272-A@1#prop:restrictions
A uniform obstruction proved for a protocol class also holds for every subclass. In particular, the zero-key conclusion of Theorem thm:bit-gap implies zero one-way key and zero key under any fixed communication budget within that model.
Proof. The same lower bound applies to each member of the smaller class. Equivalently, optimizing a rate over fewer protocols cannot increase it.
Nearby in this section
- proposition: Proposition: Public conditioning and aborts
- proposition: Proposition: Complete-interface robustness
- section: Conditioning, implementation error, and protocol restrictions
- example: Example: Dropping the public record manufactures apparent secrecy
- section: Conditioning, implementation error, and protocol restrictions