On the Construction of Trapdoor Claw-Free Functions with Certifiable Key
A cs.CR paper defines certifiable keys for trapdoor claw-free functions and compiles quantumness proofs into zero-knowledge.
An arXiv cs.CR paper gives a family-agnostic way to certify honestly generated keys for noisy trapdoor claw-free functions. It defines a certifiable key relation, with trapdoor-recoverable witnesses, and certified key generation offering completeness, extractable certificate soundness, and key privacy. Zero-knowledge arguments of knowledge instantiate the relation, and a compiler turns any TCF-based proof of quantumness into a zero-knowledge proof. For protocols based on injective invariance, an accepting certificate itself distinguishes the family and leaks the bit those protocols must hide.
- Defines certifiable key relations and certified key generation for noisy TCFs.
- Instantiates certificates with zero-knowledge arguments of knowledge.
- Compiles any TCF proof of quantumness into a zero-knowledge proof.
- Shows injective-invariance certificates can leak the hidden distinguishing bit.
From the original article
1 min read at arxiv.orgTrapdoor 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.
By Charles Lim · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.