CryptoDB
Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols
| Authors: |
|
|---|---|
| Download: | |
| Presentation: | Slides |
| Conference: | TCC 2022 |
| Abstract: | 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, we propose a new family of (almost two-to-one) TCFs based on conjectured hard problems on isogeny-based group actions. This is the first candidate construction that is not based on lattice-related problems and the first scheme (from any plausible post-quantum assumption) with a deterministic evaluation algorithm. To demonstrate the usefulness of our construction, we show that our TCF family can be used to devise a computational test of qubit, which is the basic building block used in general verification of quantum computations. |
BibTeX
@inproceedings{tcc-2022-32585,
title={Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols},
publisher={Springer-Verlag},
author={Navid Alamati and Giulio Malavolta and Ahmadreza Rahimi},
year=2022
}