On the Construction of Trapdoor Claw-Free Functions with Certifiable Key

Trapdoor claw-free functions TCFs underpin much of classical-quantum cryptographic interaction, yet every TCF-based protocol states its guarantees relative to an honestly generated key. We give a family-agnostic abstraction of key certification for noisy TCF constructions, built on two notions: a...

Certified Randomness without Structure against Shallow-Query Adversaries

In a recent breakthrough, Yamakawa and Zhandry J. ACM 2024 constructed a proof of quantumness in the quantum random oracle model QROM in which the quantum prover samples a codeword preimage of a publicly computable function H. They conjectured that given any H, a successful prover must sample the...