![Quantum Hamiltonian Complexity_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Quantum%20Hamiltonian%20Complexity_hi-res.jpg?h=450de763&itok=M65w-RVO)
Abstract
When (re)analysing the security of classical cryptographic protocols in a quantum setting, one finds that many classical proof techniques break down. Proofs of knowledge are a typical example of this: Their proofs usually involve rewinding, which is challenging in the quantum setting due to the no-cloning theorem. We present known solutions for proving the quantum security of proofs of knowledge, with a particular focus on what is not solved.