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

International Journal of Quantum Information

A threshold multi-verifier quantum signature scheme based on localizable distinguishability of GHZ states

Xingjia Wei, Zhi Hui Li, Na Zhou, Lijie Rui

Published Nov 29, 2024• 1 citation
Publisher

Abstract

In this paper, we propose a new quantum signature protocol with identity-based threshold multiple verifiers. In this protocol, first, the signature process combines the HMAC hash function with the participant identity to realize the compression encryption of the signature message, at the same time, the signature particles are encoded and generated by selecting the 3-particle GHZ state of the [Formula: see text] spatially localizable distinguished (LOCC), which avoids the complex entanglement operation and effectively improves the signature efficiency; second, it takes at least t verifying members of the set of valid verifications specified by the signer to verify the validity of the final signature, which increases the utility of the signature protocol in multi-verification scenarios; finally, the security analysis shows that the proposed threshold multiparty verifiable quantum signature protocol scheme can resist entanglement measurement attacks, intercept retransmission attacks, and at the same time be unforgeable, nonrepudiable, and traceable. Most importantly, the protocol does not require Quantum One-Way Function (QOWF), Quantum State Swap Test (SWAP), and has no complex entanglement operations. Therefore, the proposed scheme is more efficient than similar multiparty signature protocols.

DOI
10.1142/s0219749924500515

Related papers

An identity-verifiable quantum threshold group signature scheme based on three-particle GHZ states

Zhi-Ming Deng, Dianjun Lu, Teng Chen +1 more

Abstract With the advancement of the new generation of information technology in recent years, quantum digital signatures have been widely concerned. Among them, quantum threshold group signatures have become a hot research field due to their advantages such as low cost and strong scalability. Therefore, in this paper, we propose an identity-verifiable quantum threshold group signature scheme based on three-particle GHZ states. The characteristics of the scheme are as follows. The signers can reconstruct the key K for signature’s generation and verification by using the Shamir threshold secret sharing scheme. A quantum signature is generated by performing controlled-not operations, von Neumann measurements, and quantum Fourier transform. When the signature is verified, only classical hash values need to be compared, without comparing quantum states. Identity verification is performed between participants by using hash functions. The efficiency of the scheme is improved by using super-dense coding. Security analysis shows that our scheme is unforgeable and undeniable.

Laser Physics•Mar 28, 2024•9 citations

Quantum designated verifier multi- signature scheme without arbitrator

Ling Zhang, Qi Gui, Xiangjun Xin +2 more

Abstract We propose a quantum designated verifier multi- signature (QDVMS) scheme. In this scheme, multiple users can generate a valid signature by simultaneously signing the original message, and the designated verifier holds the exclusive capability to verify the signature’s validity. This scheme applies locally indistinguishable orthogonal product states to generate signatures, simplifying the preparation process in contrast to entangled states. Furthermore, our scheme does not require quantum one- way functions (QOWF), quantum state swapping tests (SWAP), or entangled states, which enhances its practicality and efficiency. Additionally, the absence of a third party (TP) in the entire process enhances the scheme’s security. The security analysis and comparisons with similar schemes indicate that our QDVMS scheme satisfies the security properties of DVS, and achieves information- theoretical security. Moreover, it offers higher efficiency and robust resistance against diverse attacks.

Physica Scripta•Jun 2, 2025•2 citations

Quantum homomorphic aggregation signature scheme based on GHZ states

Xingjia Wei, Zhihui Li, Haozhe Duan +1 more

A quantum homomorphic aggregation signature scheme is proposed based on GHZ states, combined with homomorphic aggregation techniques. The scheme has the following features: Firstly, by changing the existing quantum homomorphic signature scheme which generally uses Bell state as the signature particle, and choosing GHZ state as the signature particle, it can realize the signature of the multi-bit messages by preparing fewer quantum resources; Secondly, the idea of classical aggregated signature is introduced, where multiple message signatures are aggregated into a single signature by quantum entanglement swapping technique, and the verifier can determine the validity of all signatures by only one verification; At the same time, the verification of individual signatures by the aggregator is realized, and dishonest behaviors among the signature members can be detected in time; Finally, the whole signature process satisfies the basic homomorphic property. Compared with the existing quantum homomorphic signature scheme, this scheme can effectively reduce the consumption of quantum resources, improving the efficiency of signature verification and enhancing the reliability of the signature. The security analysis shows that the scheme has the verifiability, unforgeability and non-repudiation.

Modern Physics Letters B•May 7, 2024•3 citations

A quantum threshold signature protocol based on mutual unbiased basis

Xiuli Song, Fuyan Li, Siwen Hu

For the existing quantum threshold signature protocols based on entangled state, it is difficult to prepare quantum resources. Meanwhile, for the quantum threshold signature protocols based on single-particle sequence, it has disadvantages of high computation and communication consumptions. To remedy these shortcomings, in this paper, we proposed a quantum threshold signature protocol based on mutual unbiased basis (MUB). In initialization stage, the message owner Alice prepares a quantum sequence [Formula: see text] with length of [Formula: see text], each single particle in [Formula: see text] is chosen from MUBs. The signature key is generated by Alice using threshold secret-sharing distribution algorithm, the verification key is generated by [Formula: see text] signers via threshold secret-sharing recovery algorithm. In signature generation phase, the signers execute the signature algorithm sequentially until the last signer and then obtain the final signature, next send it to verifier. In signature verification phase, the verifier Ver verifies the original message and the final signature using the verification key. Security analysis shows that the proposed protocol can resist interception-forgery attack, collusion attack and denial attack. Performance analysis shows that the proposed protocol is easier to prepare quantum resources than similar protocols, and has lower communication consumption, especially when the number of signers [Formula: see text] and increase gradually. Finally, the correctness of the proposed protocol is verified by simulation experiment on quantum cloud platform.

International Journal of Modern Physics B•Jan 31, 2023•7 citations

Multi-party verifiable arbitrated quantum signature scheme with information hiding function

Qin Gao, Dianjun Lu, Dongqin Wen +2 more

Abstract With the progress of science and technology, more and more researchers have begun to pay attention to quantum digital signature schemes. Arbitrated quantum signatures have attracted much attention due to their many advantages. This paper presents a multi-verifiable arbitrated quantum signature scheme with information hiding function. In this scheme, the original information and the shared key are hidden in the Bell state, so that any attacker cannot obtain the original information through quantum measurement. In this scheme, multi-verifiers connect end to end to form a ring, and the feasibility of the scheme can be verified if and only if all verifiers participate. Ring verifiers select one of them as the representative. The representative uses the one-way hash function for authentication and indicates the identity to the arbitrator. Therefore the arbitrator does not need to verify the identities of all the verifiers and improves the authentication efficiency. The security analysis shows that the scheme is undeniability, unforgeability and can resistant to intercept-resend attacks, combined attacks and cheating attacks.

Laser Physics Letters•Jul 30, 2025•3 citations

A dual-threshold verifiable multi-party quantum secret sharing scheme based on d-dimensional GHZ state

Dongqin Wen, Dianjun Lu, Gao Qin

Abstract Based on the d-dimensional Greenberger–Horne–Zeilinger (GHZ) state, this paper proposes a novel multi-party quantum secret sharing scheme with the characteristics of identity authentication and dual-threshold. In the scheme, the dealer first constructs an asymmetric binary polynomial and decomposes it into two unary polynomials, then divides the participants into two groups, and generates secret shares and corresponding polynomial pairs for each participant. The dealer prepares a three-qudit GHZ state and uses two of them to perform dual-line transmission between the two groups of participants. The participants perform specific unitary transformations on the transmitted particles. Finally, the recovery agent collects and measures the information particles to recover the secret. The scheme uses a hash function and a session key to detect fraudulent behavior and identify specific participants to achieve identity authentication. Security analysis shows that the scheme can effectively resist intercept-resend attacks, entangle-measure attacks, dishonest participant attacks and Trojan horse attacks.

Laser Physics•Aug 1, 2025•1 citation
In this paper, we propose a new quantum signature protocol with identity-based threshold multiple verifiers. In this protocol, first, the signature process combines the HMAC hash function with the participant identity to realize the compression encryption of the signature message, at the same time, the signature particles are encoded and generated by selecting the 3-particle GHZ state of the [Formula: see text] spatially localizable distinguished (LOCC), which avoids the complex entanglement operation and effectively improves the signature efficiency; second, it takes at least t verifying members of the set of valid verifications specified by the signer to verify the validity of the final signature, which increases the utility of the signature protocol in multi-verification scenarios; finally, the security analysis shows that the proposed threshold multiparty verifiable quantum signature protocol scheme can resist entanglement measurement attacks, intercept retransmission attacks, and at the same time be unforgeable, nonrepudiable, and traceable. Most importantly, the protocol does not require Quantum One-Way Function (QOWF), Quantum State Swap Test (SWAP), and has no complex entanglement operations. Therefore, the proposed scheme is more efficient than similar multiparty signature protocols.
Abstract With the advancement of the new generation of information technology in recent years, quantum digital signatures have been widely concerned. Among them, quantum threshold group signatures have become a hot research field due to their advantages such as low cost and strong scalability. Therefore, in this paper, we propose an identity-verifiable quantum threshold group signature scheme based on three-particle GHZ states. The characteristics of the scheme are as follows. The signers can reconstruct the key K for signature’s generation and verification by using the Shamir threshold secret sharing scheme. A quantum signature is generated by performing controlled-not operations, von Neumann measurements, and quantum Fourier transform. When the signature is verified, only classical hash values need to be compared, without comparing quantum states. Identity verification is performed between participants by using hash functions. The efficiency of the scheme is improved by using super-dense coding. Security analysis shows that our scheme is unforgeable and undeniable.
Abstract We propose a quantum designated verifier multi- signature (QDVMS) scheme. In this scheme, multiple users can generate a valid signature by simultaneously signing the original message, and the designated verifier holds the exclusive capability to verify the signature’s validity. This scheme applies locally indistinguishable orthogonal product states to generate signatures, simplifying the preparation process in contrast to entangled states. Furthermore, our scheme does not require quantum one- way functions (QOWF), quantum state swapping tests (SWAP), or entangled states, which enhances its practicality and efficiency. Additionally, the absence of a third party (TP) in the entire process enhances the scheme’s security. The security analysis and comparisons with similar schemes indicate that our QDVMS scheme satisfies the security properties of DVS, and achieves information- theoretical security. Moreover, it offers higher efficiency and robust resistance against diverse attacks.
A quantum homomorphic aggregation signature scheme is proposed based on GHZ states, combined with homomorphic aggregation techniques. The scheme has the following features: Firstly, by changing the existing quantum homomorphic signature scheme which generally uses Bell state as the signature particle, and choosing GHZ state as the signature particle, it can realize the signature of the multi-bit messages by preparing fewer quantum resources; Secondly, the idea of classical aggregated signature is introduced, where multiple message signatures are aggregated into a single signature by quantum entanglement swapping technique, and the verifier can determine the validity of all signatures by only one verification; At the same time, the verification of individual signatures by the aggregator is realized, and dishonest behaviors among the signature members can be detected in time; Finally, the whole signature process satisfies the basic homomorphic property. Compared with the existing quantum homomorphic signature scheme, this scheme can effectively reduce the consumption of quantum resources, improving the efficiency of signature verification and enhancing the reliability of the signature. The security analysis shows that the scheme has the verifiability, unforgeability and non-repudiation.
For the existing quantum threshold signature protocols based on entangled state, it is difficult to prepare quantum resources. Meanwhile, for the quantum threshold signature protocols based on single-particle sequence, it has disadvantages of high computation and communication consumptions. To remedy these shortcomings, in this paper, we proposed a quantum threshold signature protocol based on mutual unbiased basis (MUB). In initialization stage, the message owner Alice prepares a quantum sequence [Formula: see text] with length of [Formula: see text], each single particle in [Formula: see text] is chosen from MUBs. The signature key is generated by Alice using threshold secret-sharing distribution algorithm, the verification key is generated by [Formula: see text] signers via threshold secret-sharing recovery algorithm. In signature generation phase, the signers execute the signature algorithm sequentially until the last signer and then obtain the final signature, next send it to verifier. In signature verification phase, the verifier Ver verifies the original message and the final signature using the verification key. Security analysis shows that the proposed protocol can resist interception-forgery attack, collusion attack and denial attack. Performance analysis shows that the proposed protocol is easier to prepare quantum resources than similar protocols, and has lower communication consumption, especially when the number of signers [Formula: see text] and increase gradually. Finally, the correctness of the proposed protocol is verified by simulation experiment on quantum cloud platform.
Abstract With the progress of science and technology, more and more researchers have begun to pay attention to quantum digital signature schemes. Arbitrated quantum signatures have attracted much attention due to their many advantages. This paper presents a multi-verifiable arbitrated quantum signature scheme with information hiding function. In this scheme, the original information and the shared key are hidden in the Bell state, so that any attacker cannot obtain the original information through quantum measurement. In this scheme, multi-verifiers connect end to end to form a ring, and the feasibility of the scheme can be verified if and only if all verifiers participate. Ring verifiers select one of them as the representative. The representative uses the one-way hash function for authentication and indicates the identity to the arbitrator. Therefore the arbitrator does not need to verify the identities of all the verifiers and improves the authentication efficiency. The security analysis shows that the scheme is undeniability, unforgeability and can resistant to intercept-resend attacks, combined attacks and cheating attacks.
Abstract Based on the d-dimensional Greenberger–Horne–Zeilinger (GHZ) state, this paper proposes a novel multi-party quantum secret sharing scheme with the characteristics of identity authentication and dual-threshold. In the scheme, the dealer first constructs an asymmetric binary polynomial and decomposes it into two unary polynomials, then divides the participants into two groups, and generates secret shares and corresponding polynomial pairs for each participant. The dealer prepares a three-qudit GHZ state and uses two of them to perform dual-line transmission between the two groups of participants. The participants perform specific unitary transformations on the transmitted particles. Finally, the recovery agent collects and measures the information particles to recover the secret. The scheme uses a hash function and a session key to detect fraudulent behavior and identify specific participants to achieve identity authentication. Security analysis shows that the scheme can effectively resist intercept-resend attacks, entangle-measure attacks, dishonest participant attacks and Trojan horse attacks.