量子网络中的零知识证明
Zero Knowledge Proofs in Quantum Networks
浏览论文内容
中文总结 AI 辅助
本文提出基于量子态不可区分性的零知识验证框架，利用局域操作限制构造多方量子网络中的信息论安全零知识证明协议，确保合谋方无法获取额外信息。
中文摘要 AI 辅助
零知识证明（ZKP）能够在不泄露除陈述有效性之外的任何信息的情况下验证陈述，是密码学与信息论中的基本原语。然而，现有构造依赖于计算假设，且主要局限于双参与方场景，其在双参与方或网络场景中的信息论实现基本未被探索。在此，我们基于操作约束下量子态的不可区分性，开发了一个零知识验证框架。利用局域操作所施加的基本限制，我们证明验证者在保留验证正确性能力的同时，本质上被限制于无法提取关于底层态的信息。我们为多方量子网络构造了实现信息论安全性的显式协议，确保任何合谋参与方子集都无法获得超出陈述有效性的知识，且不受其联合计算能力的影响。
英文摘要
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.
发表机构
- Indian Statistical Institute（印度统计研究所）
机构由 AI 辅助整理，请以论文原文为准。
