Practical Relativistic Zero-Knowledge for NP

TL;DR

This paper introduces two practical zero-knowledge protocols for NP problems in multi-prover settings, achieving minimal communication and equipment, advancing the feasibility of secure proofs in real-world scenarios.

Contribution

It presents novel zero-knowledge protocols for 3-colorability using minimal prover communication and entanglement, improving practical applicability.

Findings

Protocols require only two or three provers with minimal replies.

Protocols enable zero-knowledge proofs over short distances.

Significantly reduces equipment and communication complexity.

Abstract

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.