Quantum networks enable information-free proof verification among many parties
Zero Knowledge Proofs in Quantum Networks
Cryptography and SecuritySocial and Information Networks
Summary
Sometimes you want to prove something is true without sharing any extra details. The authors find a way to do this using quantum states in networks of multiple people, relying on physics limits instead of complex math assumptions. Their method stops anyone from learning more than just whether the statement is true, even if they work together and have unlimited computing power. This is like a magic proof where nobody learns the secret, only the fact that the secret is correct.
What this means in practice
- •For quantum network engineers: Create secure multiparty verification protocols that reveal no information beyond statement validity, without relying on computational hardness.
- •For cryptography system designers: Design information-theoretically secure proof systems that operate over quantum communication networks for enhanced privacy guarantees.
A theory result. No direct application yet.
Authors
Tuhin Paul, Srijani Das, Manasi Patra, Ramij Rahaman
Abstract
Zero-knowledge proofs (ZKPs) enable the verification of a statement without revealing any information beyond its validity and constitute a fundamental primitive in cryptography and information theory. However, existing constructions rely on computational assumptions and are predominantly confined to bipartite settings, leaving their information-theoretic realization in bipartite or network scenarios largely unexplored. Here we develop a framework for zero-knowledge verification based on the indistinguishability of quantum states under operational constraints. Exploiting the fundamental limitations imposed by local operations, we show that a verifier is inherently restricted from extracting information about the underlying state while retaining the ability to verify correctness. We construct explicit protocols for multiparty quantum networks that achieve information-theoretic security, ensuring that no subset of collaborating parties can gain knowledge beyond the validity of the statement, independent of their joint computational power.