Scholarlink

<p>Zero Knowledge Proofs based on computational hardness assumptions are fundamental primitives for secure user authentication. This paper proposes a novel Designated Verifier Zero Knowledge Proof that leverages the inherent randomness of quantum bits. Unlike traditional constructions relying on computationally intractable NP problems, the proposed protocol derives its security from the physical layer, specifically the uncertainty principle of quantum state projections in misaligned measurement bases. A rigorous formal mathematical analysis establishes the completeness, soundness and zero knowledge properties of the scheme. Furthermore, the protocol’s performance is evaluated via a quantum simulator under realistic error-prone conditions. The results demonstrate that the construction is robust against dishonest parties while remaining feasible under constrained quantum resources, offering a scalable approach for secure quantum authentication.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Conjugate coding based designated verifier quantum zero knowledge proof for user authentication

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年4月10日

查看全文
  • Jorge Garcia-Diaz,
  • Daniel Escanez-Exposito,
  • Pino Caballero-Gil,
  • Jezabel Molina-Gil

摘要

Zero Knowledge Proofs based on computational hardness assumptions are fundamental primitives for secure user authentication. This paper proposes a novel Designated Verifier Zero Knowledge Proof that leverages the inherent randomness of quantum bits. Unlike traditional constructions relying on computationally intractable NP problems, the proposed protocol derives its security from the physical layer, specifically the uncertainty principle of quantum state projections in misaligned measurement bases. A rigorous formal mathematical analysis establishes the completeness, soundness and zero knowledge properties of the scheme. Furthermore, the protocol’s performance is evaluated via a quantum simulator under realistic error-prone conditions. The results demonstrate that the construction is robust against dishonest parties while remaining feasible under constrained quantum resources, offering a scalable approach for secure quantum authentication.