Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs

TL;DR

This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.

Abstract

On-demand authentication is critical for scalable quantum systems, yet current approaches require the signer to initiate communication, creating unnecessary overhead. We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications. Our approach adapts the concept of zero-knowledge proofs widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys. We develop a general framework that converts any suitable quantum proof into a verifier-driven signature protocol and present a concrete implementation based on quantum measurements. The protocol achieves strong security guarantees, including resistance to forgery and privacy against curious verifiers, without relying on computational hardness assumptions and with qubit technologies. This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.

Figures (5)

• Figure 1: The relations between VIQDS and QZKP, where the double-headed arrows indicate corresponding relationships, $sk$ represents the private key, $pk$ represents the public key, and $sgn$ represents the signature.
• Figure 2: (a) Key generation. Alice generates a private key $sk$ and $N$ copies of the quantum public key $pk$. Then, she sends one copy to each of the remaining participants. (b) Pre-signing. Bob wants to let Alice sign a message $m$. He sends $m$ and a quantum challenge $\tilde{\rho}$ to Alice.
• Figure 3: (a) Signing. Alice generates the signature $sgn$ using $sk$ and $\tilde{\rho}$. Then, she sends the message-signature pair $(m,sgn)$ to Bob. (b) Verification. Bob makes a binary POVM with the inputs of $pk$, $m$, and $sgn$. If the output is $1$, he accepts the signature; otherwise, he rejects the signature.
• Figure 4: A 3-round quantum interactive proof game. $Z_1$, $Z_2$, and $Z_3$ represent the quantum operations performed in the respective steps. $P_0$ represents the prover’s internal registers, $V_0$ and $V_1$ represent the verifier’s internal registers, $Y_0$ stands for the message sent in round 2, and $X_0$ and $X_1$ stand for the messages sent in rounds 1 and 3, respectively.
• Figure 5: The relationships between $HVQZKP$, $SVQZKP$, $DVQZKP$, $QIP$, and the quantum interactive proof game.

Theorems & Definitions (24)

• Theorem 1
• Theorem 2
• Theorem 3
• proof
• Theorem 4
• proof
• Lemma 1
• proof
• Lemma 2
• proof