Qauntum Safe Proofs (QSP) funded by

A proof systems is a fundamental primitive in cryptography with diverse applications since the introduction of zero-knowledge proofs nearly four decades ago. Non-interactive proof systems are crucial for blockchain-related technologies, and verifying the post-quantum security of existing proof systems is paramount. However, certain proof techniques, such as the rewinding technique employed in interactive proof systems, require further development in the quantum setting. Our research focuses on presenting a quantum definition for the simulation-soundness and verifying the security of non-interactive proof systems (NIZKs) with respect to this definition. Additionally, we ensure the post-quantum security of cash systems built from an NIZK and extend the classical result to the complexity classes QMA, QIP and etc. Finally, we investigate the (post-)quantum security of proof systems constructed from MPC-in-the-Head paradigm.