Zero Knowledge Proofs in Quantum Networks

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.

Proofs and disproofs of some conjectures on zero-sum problems of new types
Yang Li, San Ling, Zhonghua Sun +1
arXiv14 Oct 2026PreprintarXiv licenceFull textAlgebra & number theory Combinatorics & discrete mathematicsarXiv
A study on a privacy preservation method for VANETs based on certificateless anonymous authentication and non-interactive zero-knowledge proof
Zhaowei Hu, Hangyi Quan, ShiYun Ni +1
PLOS One27 Oct 2026Peer-reviewedCC BY 4.0Full textAlgebra & number theoryPLOSPMC
Universal CKM for Environment-Aware Wireless Networks: Enabling Cross-Device and Cross-Task Channel Knowledge Transfer
Haiquan Lu, Yong Zeng, Cheng-Xiang Wang +2
arXiv29 Sep 2026PreprintarXiv licenceFull textGeneral mathematicsarXiv
Private communication via zero-private-capacity quantum channels
Chengkai Zhu, Xin Wang
arXiv9 Sep 2026PreprintCC BY 4.0Full textGeneral mathematics Quantum physics & quantum informationarXiv
Average-and Last-Iterate Lower Bounds for Optimistic Matrix Mirror-Prox in Quantum Zero-Sum Games
Yiheng Su, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Pucheng Xiong
arXiv30 Sep 2026PreprintarXiv licenceFull textOptimisation & control Quantum physics & quantum informationarXiv

Cite

BibTeX RIS

BibTeX

@misc{paul2026zero,
  title = {{Zero Knowledge Proofs in Quantum Networks}},
  author = {Tuhin Paul and Srijani Das and Manasi Patra and Ramij Rahaman},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.35339},
  eprint = {2609.35339},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.35339},
  note = {CC BY-SA 4.0},
}

RIS

TY  - UNPB
TI  - Zero Knowledge Proofs in Quantum Networks
AU  - Tuhin Paul
AU  - Srijani Das
AU  - Manasi Patra
AU  - Ramij Rahaman
PY  - 2026
DA  - 2026/09/28
PB  - arXiv
DO  - 10.48550/arxiv.2609.35339
UR  - https://arxiv.org/abs/2609.35339
AB  - 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.
ER  -

Abstract

Related

Cite