Practical Relativistic Zero-Knowledge for NP
This work addresses the challenge of efficient zero-knowledge proofs for NP problems in constrained environments, though it appears incremental as it builds on existing multi-prover frameworks.
The authors tackled the problem of proving NP statements in zero-knowledge with minimal communication in a multi-prover setting, resulting in novel protocols for 3-colorability that require only two trits per prover and use two local or three entangled provers.
In this work we consider the following problem: in a Multi-Prover environment, how close can we get to prove the validity of an NP statement in Zero-Knowledge ? We exhibit a set of two novel Zero-Knowledge protocols for the 3-COLorability problem that use two (local) provers or three (entangled) provers and only require them to reply two trits each. This greatly improves the ability to prove Zero-Knowledge statements on very short distances with very minimal equipment.