.png){kind=icon}
Return
Conjugate coding based designated verifier quantum zero knowledge proof for user authentication
.png){kind=icon}
OA
AI
DOI：10.1007/s12095-026-00878-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Quantum zero knowledge proof
Quantum cryptography
Authentication protocol
Quantum key distribution
Conjugate coding
Journal
C
IF:
1.1
Papers:
67
Citations:
0
Organization
Cited Papers
ShareSave
ShareSaveAlgebraic language for the efficient representation and optimization of quantum circuits.png)
PHYSICA SCRIPTA
PHYSICA SCRIPTAIF2.6
PREAI
ShareSaveExperimental implementation of a quantum zero-knowledge proof for user authenticationOPTICS EXPRESSOAAI
OPTICS EXPRESSIF3.3
OAAIShareSave
View more