2022/12/06 by Mark Carney, Carney, Mark · 1 voice
Computer Science · Physics and Astronomy · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph) #cs.CR #quant-ph
paper · pdf · doi:10.48550/arxiv.2212.03027
arxiv published 2022/12/06 · arxiv updated 2023/08/06
This paper presents a new method for quantum identity authentication (QIA) protocols. The logic of classical zero-knowledge proofs (ZKPs) due to Schnorr is applied in quantum circuits and algorithms. This novel approach gives an exact way with which a prover P can prove they know some secret by encapsulating it in a quantum state before sending to a verifier V by means of a quantum channel - allowing for a ZKP wherein an eavesdropper or manipulation can be detected with a fail-safe design. This is achieved by moving away from the hardness of the Discrete Logarithm Problem towards the hardness of estimating quantum states. This paper presents a method with which this can be achieved and some bounds for the security of the protocol provided. With the anticipated advent of a `quantum internet', such protocols and ideas may soon have utility and execution in the real world.