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.
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CR 2years
2026 2representative 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.
- Guarded Equivalence Predicates for Scalable Formal Hardware Information-Flow Verification