Noninteractive zeroknowledge arguments for QMA, with preprocessing Speaker(s): Andrea Coladangelo
Abstract:
Zeroknowledge proofs are one of the cornerstones of modern cryptography. It is well known that any language in NP admits a zeroknowledge proof. In the quantum setting, it is possible to go beyond NP. Zeroknowledge proofs for QMA have first been studied in a work of Broadbent et al (FOCS'16). There, the authors show that any language in QMA has an (interactive) zeroknowledge proof. In this talk, I will describe an idea, based on quantum teleportation, to remove interaction at the cost of adding an instanceindependent preprocessing step. Assuming the Learning With Errors problem is hard for quantum computers, the resulting protocol is a noninteractive zeroknowledge argument for QMA, with a preprocessing step that consists of (i) the generation of a Common Reference String and (ii) a single (instanceindependent) quantum message from the verifier to the prover. This is joint work with Thomas Vidick and Tina Zhang
Date: 30/09/2020  4:00 pm
