© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Advanced Quantum Technologies

Public‐Key Quantum Signature Protocol Based on Generalized Isometric Tensor

Xiuli Song, Songlin Yuan, Chencheng He

Published Sep 1, 2026• 0 citations

Abstract

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.

DOI: 10.1002/qute.70440

Related papers

How to Sign Quantum Messages

Mohammed Barhoush, Louis Salvail

Signing quantum messages has long been considered impossible even under computational assumptions. In this work, we challenge this notion and provide three innovative approaches to sign quantum messages that are the first to ensure authenticity with public verifiability. Our contributions can be summarized as follows: 1) We introduce the concept of time-dependent (TD) signatures, where the signature of a quantum message depends on the time of signing and the verification process depends on the time of the signature reception. We construct this primitive assuming the existence of post-quantum secure one-way functions (pq-OWFs) and time-lock puzzles (TLPs). 2) By utilizing verification keys that evolve over time, we eliminate the need for TLPs in our construction. This leads to TD signatures from pq-OWFs with dynamic verification keys. 3) We then consider the bounded quantum storage model, where adversaries are limited with respect to their quantum memories. We show that quantum messages can be signed with information-theoretic security in this model. Moreover, we leverage TD signatures to achieve the following objectives, relying solely on pq-OWFs: (a) We design a public key encryption scheme featuring authenticated quantum public keys that resist adversarial tampering. (b) We present a novel TD public-key quantum money scheme.

arXiv:2304.06325•Quantum•Jan 22, 2026•1 citation

Efficient quantum signature protocol of classical messages

Chaojing Tang

An efficient quantum signature protocol of classical messages which was based on quantum one-time pad and quantum key distribution was presented.The classical messages of any length could be encoded into the quantum infor-mation of determinate length because hash function was used to generate message digests.Especially for a large number of messages,the length of shared keys and the number of qubits were greatly shortened in the present protocol.Moreover,it was unnecessary for the protocol to use entangled states and only von Neumann measurement was needed.Compared with other quantum signature protocols,the efficiency of the present quantum signature protocol was greatly improved.

Journal of Communications•Jan 1, 2007•1 citation

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•0 citations

Quantum Digital Signatures

Daniel Gottesman, Isaac L. Chuang

We present a quantum digital signature scheme whose security is based on fundamental principles of quantum physics. It allows a sender (Alice) to sign a message in such a way that the signature can be validated by a number of different people, and all will agree either that the message came from Alice or that it has been tampered with. To accomplish this task, each recipient of the message must have a copy of Alice's "public key," which is a set of quantum states whose exact identity is known only to Alice. Quantum public keys are more difficult to deal with than classical public keys: for instance, only a limited number of copies can be in circulation, or the scheme becomes insecure. However, in exchange for this price, we achieve unconditionally secure digital signatures. Sending an m-bit message uses up O(m) quantum bits for each recipient of the public key. We briefly discuss how to securely distribute quantum public keys, and show the signature scheme is absolutely secure using one method of key distribution. The protocol provides a model for importing the ideas of classical public key cryptography into the quantum world.

arXiv:quant-ph/0105032•May 8, 2001•175 citations

Quantum digital signature based on quantum one-way functions

Xin Lü, Dengguo Feng

A quantum digital signature scheme based on quantum mechanics is proposed in this paper. The security of the protocol relies on the existence of quantum one-way functions by fundamental quantum principles. Our protocol involves a so-called arbitrator who validates and authenticates the signed message. This scheme uses public quantum keys publicized by the signatory to verify the validity of the signature and uses quantum one-time pad to ensure the security of quantum information on channel. To guarantee the authenticity of the transmitted quantum states, a family of quantum stabilizer code is employed. The proposed scheme presents a novel method to construct secure quantum signature systems for future secure communications

International Conference on Advanced Communication Technology•Jan 1, 2005•37 citations

Quantum Digital Signature based on Quantum One-way Functions

Xin Lü, Dengguo Feng

A quantum digital signature protocol based on quantum mechanics is proposed in this paper. The security of the protocol relies on the existence of quantum one-way functions by quantum information theorem. This protocol involves a so-called arbitrator who validates and authenticates the signed message. In this protocol, we use privacy key algorithm to ensure the security of quantum information on channel and use quantum public keys to sign message. To guarantee the authenticity of the message, a family of quantum stabilizer codes are employed. Our protocol presents a novel method to construct ultimately secure digital system in future secure communication.

arXiv:quant-ph/0403046•Mar 5, 2004•3 citations

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.

Signing quantum messages has long been considered impossible even under computational assumptions. In this work, we challenge this notion and provide three innovative approaches to sign quantum messages that are the first to ensure authenticity with public verifiability. Our contributions can be summarized as follows: 1) We introduce the concept of time-dependent (TD) signatures, where the signature of a quantum message depends on the time of signing and the verification process depends on the time of the signature reception. We construct this primitive assuming the existence of post-quantum secure one-way functions (pq-OWFs) and time-lock puzzles (TLPs). 2) By utilizing verification keys that evolve over time, we eliminate the need for TLPs in our construction. This leads to TD signatures from pq-OWFs with dynamic verification keys. 3) We then consider the bounded quantum storage model, where adversaries are limited with respect to their quantum memories. We show that quantum messages can be signed with information-theoretic security in this model. Moreover, we leverage TD signatures to achieve the following objectives, relying solely on pq-OWFs: (a) We design a public key encryption scheme featuring authenticated quantum public keys that resist adversarial tampering. (b) We present a novel TD public-key quantum money scheme.

An efficient quantum signature protocol of classical messages which was based on quantum one-time pad and quantum key distribution was presented.The classical messages of any length could be encoded into the quantum infor-mation of determinate length because hash function was used to generate message digests.Especially for a large number of messages,the length of shared keys and the number of qubits were greatly shortened in the present protocol.Moreover,it was unnecessary for the protocol to use entangled states and only von Neumann measurement was needed.Compared with other quantum signature protocols,the efficiency of the present quantum signature protocol was greatly improved.

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

We present a quantum digital signature scheme whose security is based on fundamental principles of quantum physics. It allows a sender (Alice) to sign a message in such a way that the signature can be validated by a number of different people, and all will agree either that the message came from Alice or that it has been tampered with. To accomplish this task, each recipient of the message must have a copy of Alice's "public key," which is a set of quantum states whose exact identity is known only to Alice. Quantum public keys are more difficult to deal with than classical public keys: for instance, only a limited number of copies can be in circulation, or the scheme becomes insecure. However, in exchange for this price, we achieve unconditionally secure digital signatures. Sending an m-bit message uses up O(m) quantum bits for each recipient of the public key. We briefly discuss how to securely distribute quantum public keys, and show the signature scheme is absolutely secure using one method of key distribution. The protocol provides a model for importing the ideas of classical public key cryptography into the quantum world.

A quantum digital signature scheme based on quantum mechanics is proposed in this paper. The security of the protocol relies on the existence of quantum one-way functions by fundamental quantum principles. Our protocol involves a so-called arbitrator who validates and authenticates the signed message. This scheme uses public quantum keys publicized by the signatory to verify the validity of the signature and uses quantum one-time pad to ensure the security of quantum information on channel. To guarantee the authenticity of the transmitted quantum states, a family of quantum stabilizer code is employed. The proposed scheme presents a novel method to construct secure quantum signature systems for future secure communications

A quantum digital signature protocol based on quantum mechanics is proposed in this paper. The security of the protocol relies on the existence of quantum one-way functions by quantum information theorem. This protocol involves a so-called arbitrator who validates and authenticates the signed message. In this protocol, we use privacy key algorithm to ensure the security of quantum information on channel and use quantum public keys to sign message. To guarantee the authenticity of the message, a family of quantum stabilizer codes are employed. Our protocol presents a novel method to construct ultimately secure digital system in future secure communication.