Derives pass bounds for confirmation-code-augmented FO KEM tests and proves α+β≥1 lower bound on certifier errors under honest-support harnesses that factor through final-key targets.
ovelmanns and Mikhail A. Kudinov. “Treating Dishonest Ciphertexts in Post-quantum KEMs – Explicit vs. Implicit Rejection in the FO Transform
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
What Can Verifiable Decapsulation Tests Certify? Pass Bounds and Fault-Recognition Limits for FO-Based KEMs
Derives pass bounds for confirmation-code-augmented FO KEM tests and proves α+β≥1 lower bound on certifier errors under honest-support harnesses that factor through final-key targets.