Experimental relativistic zero-knowledge proofs with unconditional security

TL;DR

This paper introduces an experimentally implemented zero-knowledge proof system that is unconditionally secure against quantum attacks, utilizing relativistic commitments and quantum nonlocality to improve efficiency and practicality.

Contribution

It presents the first unconditionally secure ZKP for graph three-coloring combining relativistic bit commitments with quantum nonlocality, significantly reducing complexity and enhancing feasibility.

Findings

Achieved unconditionally secure ZKP resistant to quantum adversaries.

Reduced round complexity and storage by thirteen orders of magnitude.

Demonstrated practical implementation of relativistic quantum cryptography.

Abstract

Zero-knowledge proofs (ZKPs) are widely applied in digital economies, such as cryptocurrencies and smart contracts, for establishing trust and ensuring privacy between untrusted parties. However, almost all ZKPs rely on unproven computational assumptions or are vulnerable to quantum adversaries. We propose and experimentally implement an unconditionally secure ZKP for the graph three-coloring problem by combining subset relativistic bit commitments with quantum nonlocality game. Our protocol achieves a linear relationship between interactive rounds and the number of edges, reducing round complexity and storage requirements by thirteen orders of magnitude, thereby significantly enhancing practical feasibility. Our work illustrates the powerful potential of integrating special relativity with quantum theory in trustless cryptography, paving the way for robust applications against quantum attacks in distrustful internet environments.