Quantum Blind Signature Scheme Research Articles

A quantum blind signature scheme based on dense coding for non-entangled states

In some schemes, quantum blind signatures require the use of difficult-to-prepare multiparticle entangled states. By considering the communication overhead, quantum operation complexity, verification efficiency and other relevant factors in practical situations, this article proposes a non-entangled quantum blind signature scheme based on dense encoding. The information owner utilizes dense encoding and hash functions to blind the information while reducing the use of quantum resources. After receiving particles, the signer encrypts the message using a one-way function and performs a Hadamard gate operation on the selected single photon to generate the signature. Then the verifier performs a Hadamard gate inverse operation on the signature and combines it with the encoding rules to restore the message and complete the verification. Compared with some typical quantum blind signature protocols, this protocol has strong blindness in privacy protection, and higher flexibility in scalability and application. The signer can adjust the signature operation according to the actual situation, which greatly simplifies the complexity of the signature. By simultaneously utilizing the secondary distribution and rearrangement of non-entangled quantum states, a non-entangled quantum state representation of three bits of classical information is achieved, reducing the use of a large amount of quantum resources and lowering implementation costs. This improves both signature verification efficiency and communication efficiency while, at the same time, this scheme meets the requirements of unforgeability, non-repudiation, and prevention of information leakage.

Quantum blind signature scheme for supply chain financial

Quantum blind signature scheme for supply chain financial

Quantum Blind Signature Scheme Based on Quantum Walk

Quantum walks have been widely used in quantum computing and quantum simulation, and can be applied for quantum teleportation. In this paper, a quantum blind signature scheme with quantum walk-based teleportation is proposed. The sender Alice encodes the message into quantum states and divides the encrypted information into two qubit strings. Alice teleports them separately to the signer Charlie and the verifier Bob by quantum walks. Charlie accepts Alice’s request and uses Pauli operation to generate the quantum blind signatures, then sends the signatures to Bob. Bob measures two quantum messages in hands to complete verification of Charlie’s signature. In this protocol, the messages to be signed are ingeniously blinded and prepared in single particle states, the teleportation of particle states is achieved by quantum walks. Security analysis shows that the scheme can not only resist the repudiation of the signer and denial of the verifier, but also detect the forgery of the attacker, which can be widely applied in e-commerce or e-payment system.

A Quantum Blind Signature Scheme Based on Block Encryption and Quantum Fourier Transfer

Motivated by the block encryption and quantum Fourier transfer, a quantum blind signature scheme is proposed. Alice encodes the original message into three pairs of hybrid entangled states, which are distributed among three parties of communication. The measurement result of entangled pairs serves as the blind message of Alice and signature of Charlie, the verifier Bob recovers the message and verifies the signature. The information is delivered after being encoded into multi-dimensional quantum states and encrypted by quantum Fourier transforms. The analysis shows that the scheme is non-forgery, non-repudiation and blindness. In addition, the proposed scheme is more efficient against the universal and selective forgery attacks.

A New Quantum Blind Signature Scheme with BB84-State.

The blind signature is widely used in cryptography applications because it can prevent the signer from gaining the original message. Owing to the unconditional security, the quantum blind signature is more advantageous than the classical one. In this paper, we propose a new provable secure quantum blind signature scheme with the nonorthogonal single-photon BB84-state and provide a new method to encode classical messages into quantum signature states. The message owner injects a randomizing factor into the original message and then strips the blind factor from the quantum blind signature signed by the blind signer. The verifier can validate the quantum signature and announce it publicly. At last, the analytical results show that the proposed scheme satisfies all of the security requirements of the blind signature: blindness, unforgeability, non-repudiation, unlinkability, and traceability. Due to there being no use of quantum entanglement states, the total feasibility and practicability of the scheme are obviously better than the previous ones.

Quantum Blind Signature Scheme with Cluster States Based on Quantum Walk Cryptosystem

An ingenious quantum blind signature scheme with cluster states based on quantum walk cryptosystem is proposed, in which the keys are generated with quantum walks. Initial phase, signing phase and verification phase are included. In the signing phase, Alice sends the encrypted message to the signer Charlie and requests a quantum blind signature. In the verification phase, the verifier Bob verifies the authenticity and integrity of the message based on the results of the final measurements. The security analysis shows that the security of secret keys and the signature scheme, and it can be neither forged nor disavowed by illegal participants or attackers. Different from previous signature schemes, the original message is encrypted by the quantum walk algorithm, which is firstly applied to the signature scheme. Importantly, it has a wide application in e-commerce or e-payment system.

A synchronous quantum blind signature scheme with entanglement swapping

We present an arbitrated quantum blind signature scheme by entanglement swapping, which is simplified from the preparation and operation of the quantum states. Compared with the classical blind signature, quantum arbitration has added the role of the third party arbitration, so the structure of the protocol has changed. The traceability depends on the third party arbitration, and the blind operation and the signature operation can be carried out simultaneously.

Multiparty Quantum Blind Signature Scheme Based on Graph States

A multiparty quantum blind signature scheme is proposed based on the principle of graph state, in which the unitary operations of graph state particles can be applied to generate the quantum blind signature and achieve verification. Different from the classical blind signature based on the mathematical difficulty, the scheme could guarantee not only the anonymity but also the unconditionally security. The analysis shows that the length of the signature generated in our scheme does not become longer as the number of signers increases, and it is easy to increase or decrease the number of signers.

On “A new quantum blind signature with unlinkability”

This article points out a security loophole in Shi et al.'s quantum blind signature scheme. By using the modification attack, a message owner can cheat a signature receiver with a fake message---signature pair without being detected.

A Novel Quantum Blind Signature Scheme with Four-Particle Cluster States

A Novel Quantum Blind Signature Scheme with Four-Particle Cluster States

A Novel Quantum Blind Signature Scheme with Four-particle GHZ States

In an arbitrated quantum signature scheme, the signer signs the message and the receiver verifies the signature’s validity with the assistance of the arbitrator. We present an arbitrated quantum blind signature scheme by using four-particle entangled Greenberger-Horne-Zeilinger (GHZ) states. By using the special relationship of four-particle GHZ states, we cannot only support the security of quantum signature, but also guarantee the anonymity of the message owner. It has a wide application to E-payment system, E-government, E-business, and etc.

A Weak Quantum Blind Signature with Entanglement Permutation

Motivated by the permutation encryption algorithm, a weak quantum blind signature (QBS) scheme is proposed. It involves three participants, including the sender Alice, the signatory Bob and the trusted entity Charlie, in four phases, i.e., initializing phase, blinding phase, signing phase and verifying phase. In a small-scale quantum computation network, Alice blinds the message based on a quantum entanglement permutation encryption algorithm that embraces the chaotic position string. Bob signs the blinded message with private parameters shared beforehand while Charlie verifies the signature’s validity and recovers the original message. Analysis shows that the proposed scheme achieves the secure blindness for the signer and traceability for the message owner with the aid of the authentic arbitrator who plays a crucial role when a dispute arises. In addition, the signature can neither be forged nor disavowed by the malicious attackers. It has a wide application to E-voting and E-payment system, etc.

Quantum blind signature with an offline repository

We propose a quantum blind signature scheme that achieves perfect security under the assumption of an honest offline repository. The security of the protocol also relies on perfect private quantum channels, which are achievable using quantum one-time pads with keys shared via a quantum key distribution (QKD) protocol. The proposed approach ensures that signatures cannot be copied and that the sender must compromise to a single message, which are important advantages over classical protocols for certain applications.

Cryptanalysis of a Batch Proxy Quantum Blind Signature Scheme

The security analysis of a batch proxy quantum blind signature scheme is given, which shows it does not satisfy the verifiability of proxy blind signature. Furthermore, a malicious signature receiver can forge valid batch proxy blind signatures. Therefore, this scheme also does not satisfy the unforgeability of proxy blind signature in the sense. A feasible method to deal with these problems is also discussed in the end.

Attack and improvements of fair quantum blind signature schemes

Blind signature schemes allow users to obtain the signature of a message while the signer learns neither the message nor the resulting signature. Therefore, blind signatures have been used to realize cryptographic protocols providing the anonymity of some participants, such as: secure electronic payment systems and electronic voting systems. A fair blind signature is a form of blind signature which the anonymity could be removed with the help of a trusted entity, when this is required for legal reasons. Recently, a fair quantum blind signature scheme was proposed and thought to be safe. In this paper, we first point out that there exists a new attack on fair quantum blind signature schemes. The attack shows that, if any sender has intercepted any valid signature, he (she) can counterfeit a valid signature for any message and can not be traced by the counterfeited blind signature. Then, we construct a fair quantum blind signature scheme by improved the existed one. The proposed fair quantum blind signature scheme can resist the preceding attack. Furthermore, we demonstrate the security of the proposed fair quantum blind signature scheme and compare it with the other one.

Cryptanalysis of fair quantum blind signatures

We investigate the fair quantum blind signature scheme proposed by Wang and Wen [Wang T Y and Wen Q Y 2010 Chin. Phys. B 19 060307], which uses the fundamental properties of quantum mechanics and the availability of a trusted arbitrator. However, in this paper, we find that the protocol cannot satisfy the property of non-forgeability even under the condition that the trusted arbitrator is totally credible. Moreover, a simple feasible suggestion for improving the protocol is proposed.

Quantum blind signature based on Two-State Vector Formalism

Two-State Vector Formalism (TSVF) including pre- and postselected states is a complete description of a system between two measurements. Consequently TSVF gives a perfect solution to the Mean King problem. In this paper, utilizing the dramatic correlation in the verification, we propose a quantum blind signature scheme based on TSVF. Compared with Wen's scheme, our scheme has 100% efficiency. Our scheme guarantees the unconditional security. Moreover, the proposed scheme, which is easy to implement, can be applied to E-payment system.

A weak blind signature scheme based on quantum cryptography

In this paper, we present a weak blind signature scheme based on the correlation of EPR (Einstein–Padolsky–Rosen) pairs. Different from classical blind signature schemes and current quantum signature schemes, our quantum blind signature scheme could guarantee not only the unconditionally security but also the anonymity of the message owner. To achieve that, quantum key distribution and one-time pad are adopted in our scheme. Experimental analysis proved that our scheme have the characteristics of non-counterfeit, non-disavowal, blindness and traceability. It has a wide application to E-payment system, E-government, E-business, and etc.