Threshold signature is an important branch of the digital signature scheme, which can distribute signature rights and avoid the abuse of signature rights. With the continuous development of quantum computation and quantum information, quantum threshold signatures are gradually becoming more popular. Recently, a quantum (t, n) threshold group signature scheme was analyzed that uses techniques such as quantum-controlled-not operation and quantum teleportation. However, this scheme cannot resist forgery attack and does not conform to the design of a threshold signature in the signing phase. Based on the original scheme, we propose an improved quantum (t, n) threshold signature scheme using quantum (t, n) threshold secret sharing technology. The analysis proves that the improved scheme can resist forgery attack and collusion attack, and it is undeniable. At the same time, this scheme reduces the level of trust in the arbitrator during the signature phase.
Threshold signature is an important branch of the digital signature scheme, which can distribute signature rights and avoid the abuse of signature rights. With the continuous development of quantum computation and quantum information, quantum threshold signatures are gradually becoming more popular. Recently, a quantum (t, n) threshold group signature scheme was analyzed that uses techniques such as quantum-controlled-not operation and quantum teleportation. However, this scheme cannot resist forgery attack and does not conform to the design of a threshold signature in the signing phase. Based on the original scheme, we propose an improved quantum (t, n) threshold signature scheme using quantum (t, n) threshold secret sharing technology. The analysis proves that the improved scheme can resist forgery attack and collusion attack, and it is undeniable. At the same time, this scheme reduces the level of trust in the arbitrator during the signature phase.
Abstract Quantum secret sharing plays a key role as a foundational method for distributing a secret to all participants in quantum cryptography. Group authentication plays a significant role in safeguarding information as it confirms the identity of communication parties. This paper presents a d − level t , m threshold quantum secret-sharing scheme combined with group authentication. Group members can simultaneously authenticate their identities through group authentication. Using the Lagrange interpolation polynomial, the group authentication method disperses multiple secret shares to group members and later allows joint verification of some or all members. The complexities of the developed group authentication scheme are much lower than those found in widely recognized existing group authentication methods. This algorithm allows each participant to keep their secret shares secure and undisclosed. By avoiding transmission of these shares, external eavesdroppers are unable to obtain any secret information. This protocol offers security, efficiency, and practicality. Security analysis reveals its ability to resist intercept-resend attacks, entangle-measure attacks, collusion attacks, and forgery attacks. The proposed scheme ensures both confidentiality and integrity.
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.
In this paper, we propose a new secure quantum group signature with Bell states, which may have applications in e-payment system, e-government, e-business, etc. Compared with the recent quantum group signature protocols, our scheme is focused on the most general situation in practice, i.e. only the arbitrator is trusted and no intermediate information needs to be stored in the signing phase to ensure the security. Furthermore, our scheme has achieved all the characteristics of group signature—anonymity, verifiability, traceability, unforgetability and undeniability, by using some current developed quantum and classical technologies. Finally, a feasible security analysis model for quantum group signature is presented.
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 Most of Quantum Secret Sharing(QSS) are (n, n) threshold 2-level schemes, in which the 2-level secret cannot be reconstructed until all n shares are collected. In this paper, we propose a (t, n) threshold d-level QSS scheme, in which the d-level secret can be reconstructed only if at least t shares are collected. Compared with (n, n) threshold 2-level QSS, the proposed QSS provides better universality, flexibility, and practicability. Moreover, in this scheme, any one of the participants does not know the other participants’ shares, even the trusted reconstructor Bob1 is no exception. The transformation of the particles includes some simple operations such as d-level CNOT, Quantum Fourier Transform(QFT), Inverse Quantum Fourier Transform(IQFT), and generalized Pauli operator. The transformed particles need not to be transmitted from one participant to another in the quantum channel. Security analysis shows that the proposed scheme can resist intercept-resend attack, entangle-measure attack, collusion attack, and forgery attack. Performance comparison shows that it has lower computation and communication costs than other similar schemes when 2 < t < n − 1.
Group signature scheme is a method of allowing a member of a group to sign a message anonymously on behalf of the group. The group administrator is in charge of adding group members and has the ability to reveal the original signer in the event of disputes. Based on controlled quantum teleportation with three-particle entangled W states, we propose a new quantum group signature scheme with designated receiver. Security analysis proves that the proposed scheme possesses the characteristics of group signature and resists the usual attacks. Compared with previous proposed schemes, this scheme follows security definition of group signature fully and meets its basic requirements.