Relativistic (Or 2-prover 1-round) zero-knowledge protocol for NP secure against quantum adversaries

Abstract

In this paper, we show that the zero-knowledge construction for HAMILTONIAN CYCLE remains secure against quantum adversaries in the relativistic setting. Our main technical contribution is a tool for studying the action of consecutive measurements on a quantum state which in turn gives upper bounds on the value of some entangled games. This allows us to prove the security of our protocol against quantum adversaries. We also prove security bounds for the (single-round) relativistic string commitment and bit commitment in parallel against quantum adversaries. As an additional consequence of our result, we answer an open question from [Unr12] and show tight bounds on the quantum knowledge error of some Σ-protocols.