Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Post-quantum κ\kappa κ-to-1 trapdoor claw-free functions from extrapolated dihedral cosets

Xingyu Yan, Licheng Wang, Lize Gu, Ziyi Li, Jingwen Suo

Published May 13, 2024• 0 citations
Publisher
DOI
10.1007/s11128-024-04387-w

Related papers

Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols

Navid Alamati, Giulio Malavolta, Ahmadreza Rahimi

Lecture notes in computer science•Jan 1, 2022•13 citations

Leveraging the hardness of dihedral coset problem for quantum cryptography

Xingyu Yan, Lize Gu, Jingwen Suo +1 more

Quantum Information Processing•Sep 17, 2022•2 citations

Quantum cryptanalysis of hash and claw-free functions

Gilles Brassard A, Peter Høyer, Alain Tapp

arXiv:quant-ph/9705002•Lecture notes in computer science•Jan 1, 1998•250 citations

A new quantum claw-finding algorithm for three functions

Kazuo Iwama, Akinori Kawachi

New Generation Computing•Dec 1, 2003•1 citation

A New Quantum Claw-finding Algorithm for Three Functions

亮周 河内, Akinori Kawachi

•Jan 1, 2003•0 citations

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

Charles Lim, Yao Ma

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 certifiable key relation, an NP relation capturing a family's honest keys with witnesses recoverable from the trapdoor; and certified key generation, which emits with each key a certificate of membership satisfying completeness, certificate soundness with extractability, and key privacy. We instantiate certifiable key relations for different constructions, each met generically by a zero-knowledge argument of knowledge for the relation. As our main application, a generic compiler turns any TCF-based proof of quantumness into a zero-knowledge one, with each security property following from its counterpart in the certification scheme. Finally, we delimit the primitive's reach: for protocols resting on injective invariance, an accepting certificate is itself a family distinguisher, leaking exactly the bit such protocols must hide.

cs.CRCross-listedarXiv:2609.25819•Sep 23, 2026•0 citations
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 certifiable key relation, an NP relation capturing a family's honest keys with witnesses recoverable from the trapdoor; and certified key generation, which emits with each key a certificate of membership satisfying completeness, certificate soundness with extractability, and key privacy. We instantiate certifiable key relations for different constructions, each met generically by a zero-knowledge argument of knowledge for the relation. As our main application, a generic compiler turns any TCF-based proof of quantumness into a zero-knowledge one, with each security property following from its counterpart in the certification scheme. Finally, we delimit the primitive's reach: for protocols resting on injective invariance, an accepting certificate is itself a family distinguisher, leaking exactly the bit such protocols must hide.