In this paper, a group signature scheme based on quantum walk for quantum messages is proposed. Our scheme uses long step quantum walk-based teleportation and modified quantum one-time pad to authenticate the quantum messages respectively. In our scheme, the signer in a group signs the quantum messages by quantum walk-based teleportation and modified quantum one-time pad. The verifier can verify the signature via quantum walk-based teleportation while the group manager verifies the signature and identifies the signer via modified quantum one-time pad. The security analysis shows that the scheme can reach the properties of group signature. Compared to the teleportation via EPR pairs or Bell-like states, quantum walks are more flexible and use less measurement resources. Quantum teleportation via long-step quantum walk is more secure than that via one-step quantum walk in previous related works. The scheme can apply to arbitrary finite dimensional quantum systems and can also be possible to realize in practice.
In this paper, a group signature scheme based on quantum walk for quantum messages is proposed. Our scheme uses long step quantum walk-based teleportation and modified quantum one-time pad to authenticate the quantum messages respectively. In our scheme, the signer in a group signs the quantum messages by quantum walk-based teleportation and modified quantum one-time pad. The verifier can verify the signature via quantum walk-based teleportation while the group manager verifies the signature and identifies the signer via modified quantum one-time pad. The security analysis shows that the scheme can reach the properties of group signature. Compared to the teleportation via EPR pairs or Bell-like states, quantum walks are more flexible and use less measurement resources. Quantum teleportation via long-step quantum walk is more secure than that via one-step quantum walk in previous related works. The scheme can apply to arbitrary finite dimensional quantum systems and can also be possible to realize in practice.
The quantum group signature is a variant of the arbitrated quantum signature with special properties. Most existing teleportation-based quantum group signature schemes do not possess threshold properties, and extending them to quantum threshold group signatures is difficult. Therefore, to realize the extension from ordinary quantum signature to quantum (t, n) threshold group signature and solve the problem of low efficiency of quantum signature based on joint Bell state measurement, this paper proposes a quantum (t, n) threshold group signature scheme based on generalized teleportation implemented by multi-coin quantum walk. In the proposed scheme, n signers form a group, and only t signers can generate a valid signature on behalf of the group using the quantum walking system. In addition, a verifier checks the validity of the signature through the quantum one-time pad and quantum comparison algorithm using a trusted arbiter. The security analysis shows that the proposed scheme meets the requirements of unforgeability, nonrepudiation, threshold security, signer identity traceability, and signer anonymity. In terms of efficiency, the proposed scheme uses teleportation based on multi-coin quantum walk to transmit the quantum message without the need to prepare entangled quantum states in advance. It then replaces the joint Bell measurement of quantum teleportation with a more efficient projection measurement. Moreover, the proposed scheme uses random numbers and public boards, which can avoid the repudiation of signatures and guarantee their integrity.
The quantum proxy signature is one of the most significant formalisms in quantum signatures. We put forward a quantum proxy signature scheme using quantum walk-based teleportation and quantum one-time pad CNOT (QOTP-CNOT) operation, which includes four phases, i.e., initializing phase, authorizing phase, signing phase and verifying phase. The QOTP-CNOT is achieved by attaching the CNOT operation upon the QOTP and it is applied to produce the proxy signature state. The quantum walk-based teleportation is employed to transfer the encrypted message copy derived from the binary random sequence from the proxy signer to the verifier, in which the required entangled states do not need to be prepared ahead and they can be automatically generated during quantum walks. Security analysis demonstrates that the presented proxy signature scheme has impossibility of denial from the proxy and original signers, impossibility of forgery from the original signatory and the verifier, and impossibility of repudiation from the verifier. Notably, the discussion shows the complexity of the presented algorithm and that the scheme can be applied in many real scenarios, such as electronic payment and electronic commerce.
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.
A quantum message signature scheme based on quantum teleportation is presented. In this scheme, Alice prepares N-pair particles m and m' in the same states which carry the quantum information while Bob generates N-pair particles a and b in EPR states, to each triplet composed of particles ai,bi and mi, Alice performs Bell-state measurement on mi and ai, to get signature, Bob compares the state of m'i and bi can verify the signature. This scheme does not rely on an arbitrator to verify the signature; however it has unconditional security and provides a higher efficiency in transmission.
Traditional digital signatures are based on mathematical hard problems that are vulnerable to quantum attacks. For privacy-sensitive applications such as electronic cash and electronic voting, partially blind signatures are preferable because they protect private messages while allowing signers to verify necessary public information. This paper proposes an identity-based quantum partially blind signature scheme based on quantum teleportation. Each signing session is assigned a unique identifier. The user blinds the private binary message by applying Pauli-X operations with a one-time random string, while public information remains visible to the signer. A trusted PKG performs identity authentication, signature authorization, session-key distribution, and time-period-based key lifecycle management. Quantum tags and quantum authentication codes provide verification and arbitration evidence, while quantum teleportation is used to transmit quantum information. In case of disputes, an arbitrator can verify independently stored quantum evidence, and channel monitoring enables the detection of eavesdropping and tampering. Security analysis shows that the proposed scheme satisfies partial blindness, unforgeability, and non-repudiation, and resists malicious third-party attacks. It is suitable for privacy-preserving and restricted-authorization applications such as electronic cash and electronic voting.
In this paper, we propose a multi-group e-commerce signature scheme based on quantum teleportation and Bell states. Compared with the recent quantum group signature scheme, what our scheme has optimised is the traditional signature model with only one group manager and the utilisation of quantum resources. By setting up different group managers in different groups, the scheme promotes the traditional signature model into a more practical situation and can be easily used in e-payment system. In addition, the quantum teleportation and Pauli operations based on the Bell states are used in the transaction process, and these techniques can also be easily implemented under practical situations. Finally, the security analysis shows that the scheme can defend against different attacks from internal and external sources, including intercepting resend attacks and entanglement attacks. It also proves that the scheme is reliable, safe and effective facing with denial and forgery.