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

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

Navid Alamati, Giulio Malavolta, Ahmadreza Rahimi

Trapdoor Claw-free Functions (TCFs) are two-to-one trapdoor functions where it is computationally hard to find a claw, i.e., a colliding pair of inputs. TCFs have recently seen a surge of renewed interest due to new applications to quantum cryptography: as an example, TCFs enable a classical machine to verify that some quantum computation has been performed correctly. In this work, …

actions applications eprint report free functions protocols quantum