Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Public-key quantum signature for classical messages without third-party verification

Huimin Chen, Heng-Yue Jia, Xia Wu, Han-Xiao Kong, Xiuli Wang

Published Aug 13, 2022• 9 citations
Publisher
DOI
10.1007/s11128-022-03627-1

Related papers

Compressed Verification for Post-quantum Signatures with Long-Term Public Keys

Gustavo Banegas, Anaëlle Le Dévéhat, Benjamin Smith

arXiv:2509.03098•Lecture notes in computer science•Nov 12, 2025•0 citations

Quantum Signature without Classical Private Key

Mingcan Chen, Xiangjun Xin, Dongsheng Chen

International Journal of Theoretical Physics•Feb 1, 2022•7 citations

Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem

Liu, Le-Ran, He, Min-Quan, Zhang, Dan-Bo +1 more

We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur~(QMA)-completeness of the consistency of local density matrices. The protocol functions as a true public-key cryptography system, where the public key is a set of local density matrices generated from the private key, a global quantum state. This construction uniquely eliminates the need for trusted third parties, pre-shared secrets, or authenticated classical channels for public key distribution, making a significant departure from symmetric protocols like quantum key distribution. We provide a rigorous security analysis, proving the scheme's unforgeability against adaptive chosen-message attacks by quantum adversaries. The proof proceeds by a formal reduction, demonstrating that a successful forgery would imply an efficient quantum algorithm for the QMA-complete Consistency of Quantum Marginal Problem~(QMP). We further analyze the efficiency of verification using partial quantum state tomography, establishing the protocol's theoretical robustness and outlining a path towards practical implementation

arXiv:2506.16904•Jun 20, 2025•1 citation

Quantum-Resistant Identity-Based Signature with Message Recovery and Proxy Delegation

Xiuhua Lu, Qiaoyan Wen, Wei Yin +4 more

Digital signature with proxy delegation, which is a secure ownership enforcement tool, allows an original signer to delegate signature rights to a third party called proxy, so that the proxy can sign messages on behalf of the original signer. Many real-world applications make use of this secure mechanism, e.g., digital property transfer. A traditional digital signature mechanism is required to bind a message and its signature together for verification. This may yield extra cost in bandwidth while the sizes of message and signature are relatively huge. Message recovery signature, enabling to reduce the cost of bandwidth, embeds a message into the corresponding signature; therefore, only the signature will be transmitted to the verifier and the message can further be recovered from the signature. In this paper, we, for the first time, propose a novel digital signature scheme in the identity-based context with proxy delegation and message recovery features and, more importantly, our scheme is quantum resistant, in a particular lattice-based signature. Our scheme achieves delegation information and signature existential unforgeability against adaptive chosen warrant and identity. Compared with the seminal lattice-based message recovery signature, our scheme is independent from public key infrastructure, realizes delegation transfer of signature rights, and compresses signature length ulteriorly. To the best of our knowledge, this paper is the first of its type.

Symmetry•Feb 20, 2019•7 citations

An efficient quantum digital signature for classical messages

Mingqiang Wang, Xue Wang, Tao Zhan

Quantum Information Processing•Sep 6, 2018•19 citations

Public‐Key Quantum Signature Protocol Based on Generalized Isometric Tensor

Xiuli Song, Songlin Yuan, Chencheng He

ABSTRACT This paper presents a one‐time quantum public‐key signature protocol for classical messages that integrates message‐level generalized‐isometric‐tensor compression, a Full Quantum One‐Way Function (Full QOWF), public control‐dependent unitary encoding, and symmetric‐subspace quantum‐signature compression. The message‐level compressor reduces the message‐dependent length from to , while the transcript digest binds the message, compression metadata, compressed length, and one‐time public‐key identifier. For each control position, independent quantum private‐key branches are generated and mapped to public‐key states by the Full QOWF. The selected signature tag is encoded by a public unitary, and its identical copies are compressed in the symmetric subspace before transmission. Verification decompresses each block, reverses the unitary encoding, evaluates the Full QOWF, and performs repeated SWAP tests against authenticated public‐key copies. Under ideal implementation, honest signatures are accepted with probability one. Conditional one‐time unforgeability is established under quantum second‐preimage resistance, authenticated finite‐copy public‐key distribution, and bounded‐copy accepting‐preimage generation hardness. The online signature cost is reduced to qubits; for and , each repeated block decreases from 2048 to 507 transmitted qubits.

Advanced Quantum Technologies•Sep 1, 2026•0 citations
We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur~(QMA)-completeness of the consistency of local density matrices. The protocol functions as a true public-key cryptography system, where the public key is a set of local density matrices generated from the private key, a global quantum state. This construction uniquely eliminates the need for trusted third parties, pre-shared secrets, or authenticated classical channels for public key distribution, making a significant departure from symmetric protocols like quantum key distribution. We provide a rigorous security analysis, proving the scheme's unforgeability against adaptive chosen-message attacks by quantum adversaries. The proof proceeds by a formal reduction, demonstrating that a successful forgery would imply an efficient quantum algorithm for the QMA-complete Consistency of Quantum Marginal Problem~(QMP). We further analyze the efficiency of verification using partial quantum state tomography, establishing the protocol's theoretical robustness and outlining a path towards practical implementation
Digital signature with proxy delegation, which is a secure ownership enforcement tool, allows an original signer to delegate signature rights to a third party called proxy, so that the proxy can sign messages on behalf of the original signer. Many real-world applications make use of this secure mechanism, e.g., digital property transfer. A traditional digital signature mechanism is required to bind a message and its signature together for verification. This may yield extra cost in bandwidth while the sizes of message and signature are relatively huge. Message recovery signature, enabling to reduce the cost of bandwidth, embeds a message into the corresponding signature; therefore, only the signature will be transmitted to the verifier and the message can further be recovered from the signature. In this paper, we, for the first time, propose a novel digital signature scheme in the identity-based context with proxy delegation and message recovery features and, more importantly, our scheme is quantum resistant, in a particular lattice-based signature. Our scheme achieves delegation information and signature existential unforgeability against adaptive chosen warrant and identity. Compared with the seminal lattice-based message recovery signature, our scheme is independent from public key infrastructure, realizes delegation transfer of signature rights, and compresses signature length ulteriorly. To the best of our knowledge, this paper is the first of its type.
ABSTRACT This paper presents a one‐time quantum public‐key signature protocol for classical messages that integrates message‐level generalized‐isometric‐tensor compression, a Full Quantum One‐Way Function (Full QOWF), public control‐dependent unitary encoding, and symmetric‐subspace quantum‐signature compression. The message‐level compressor reduces the message‐dependent length from to , while the transcript digest binds the message, compression metadata, compressed length, and one‐time public‐key identifier. For each control position, independent quantum private‐key branches are generated and mapped to public‐key states by the Full QOWF. The selected signature tag is encoded by a public unitary, and its identical copies are compressed in the symmetric subspace before transmission. Verification decompresses each block, reverses the unitary encoding, evaluates the Full QOWF, and performs repeated SWAP tests against authenticated public‐key copies. Under ideal implementation, honest signatures are accepted with probability one. Conditional one‐time unforgeability is established under quantum second‐preimage resistance, authenticated finite‐copy public‐key distribution, and bounded‐copy accepting‐preimage generation hardness. The online signature cost is reduced to qubits; for and , each repeated block decreases from 2048 to 507 transmitted qubits.