A Quantum Proxy Weak Blind Signature Scheme

We present a weak blind signature scheme based on a genuinely entangled six qubits state. Different from classical blind signature schemes and current quantum signature schemes, our quantum weak 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. Our scheme has the characteristics of classical security and quantum security.     

A proxy blind signature scheme based on quantum entanglement

Using the correlation states of the GHZ triplet, a proxy blind signature scheme is presented. Existing classical proxy signatures cannot guarantee the security with the emergency of quantum computing technology, current quantum signature schemes could only deliver unconditional security, our quantum proxy blind signature scheme has the characteristics of proxy signature, non-counterfeit, non-disavowal and blindness by adopting quantum key preparation, quantum encryption algorithm and quantum entanglement, Our quantum proxy blind signature scheme has a foreseeable application to the E-business, E-governments, and etc.     

A broadcasting multiple blind signature scheme based on quantum teleportation

Using the quantum teleportation, a broadcasting multiple blind signature scheme is proposed. Different from classical multiple signature and current quantum signature schemes, which could only deliver either multiple signature or unconditional security, our scheme guarantees both by adopting quantum key preparation, quantum encryption algorithm and quantum teleportation. Our proposed scheme has the properties of multiple signature, blindness, non-disavowal, non-forgery and traceability. To the best of our knowledge, we are the first to propose the broadcasting multiple blind signature using the quantum teleportation.     

Quantum group blind signature scheme without entanglement

In this paper we propose a quantum group blind signature scheme designed for distributed e-voting system. Our scheme combines the properties of group signature and blind signature to provide anonymity of voters in an e-voting system. The unconditional security of our scheme is ensured by quantum mechanics. Without employing entanglement, the proposed scheme is easier to be realized comparing with other quantum signature schemes.     

Fair quantum blind signatures

We present a new fair blind signature scheme based on the fundamental properties of quantum mechanics. In addition, we analyse the security of this scheme, and show that it is not possible to forge valid blind signatures. Moreover, comparisons between this scheme and public key blind signature schemes are also discussed.     

A Quantum Proxy Blind Signature Scheme Based on Genuine Five-Qubit Entangled State

In this paper, a quantum proxy blind signature scheme based on controlled quantum teleportation is proposed. This scheme uses a genuine five-qubit entangled state as quantum channel and adopts the classical Vernam algorithm to blind message. We use the physical characteristics of quantum mechanics to implement delegation, signature and verification. Security analysis shows that our scheme is valid and satisfy the properties of a proxy blind signature, such as blindness, verifiability, unforgeability, undeniability.     

A Novel Quantum Broadcasting Multiple Blind Signature Scheme Based on Multi-Particle Partial Entanglement

Recently, a quantum broadcasting multiple blind signature scheme has been proposed by using GHZ entanglement, which is claimed to have foreseeable application in E-bank system. However, its security is promised by the utilized hash function. In this paper, we have designed a novel quantum broadcasting multiple blind signature scheme by utilizing a three-particle partial entanglement state. In existed quantum broadcasting multiple blind signature schemes, the collector Charlie has to verify the individual signatures before aggregating them into a multi-signature. In this new scheme, Charlie is only acting as a signature collector. Specifically, Charlie only needs to collect all the individual signatures and aggregating them into a multi-signature, which indicates that Charlie has no need to verify the individual signature any more. All the verification are executed by the receiver Bob himself. Meanwhile, the signature is generated by quantum entanglement swapping rather than using hash function, which make its security is only based on quantum physics. It is showed that multi-particle partially entangled state can be efficiently used as a resource in quantum information processing with perfect performance.

     

Blind Quantum Signature with Blind Quantum Computation

Blind quantum computation allows a client without quantum abilities to interact with a quantum server to perform a unconditional secure computing protocol, while protecting client’s privacy. Motivated by confidentiality of blind quantum computation, a blind quantum signature scheme is designed with laconic structure. Different from the traditional signature schemes, the signing and verifying operations are performed through measurement-based quantum computation. Inputs of blind quantum computation are securely controlled with multi-qubit entangled states. The unique signature of the transmitted message is generated by the signer without leaking information in imperfect channels. Whereas, the receiver can verify the validity of the signature using the quantum matching algorithm. The security is guaranteed by entanglement of quantum system for blind quantum computation. It provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.     

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.     

Arbitrary Quantum Signature Based on Local Indistinguishability of Orthogonal Product States

Digital signature plays an important role in cryptography. Many quantum digital signature (QDS) schemes have been proposed up to now since the security of classic digital signature (CDS) schemes becomes more and more vulnerable with the development of quantum computing algorithms. Most of the existing quantum signature schemes are based on probabilistic comparison of quantum states, which makes the schemes very complicated. In this paper, we propose a new QDS scheme based on local indistinguishability of orthogonal product states. In the scheme, the receiver cooperates with the arbitrator to verify the valid of the signature. The analysis of security and efficiency shows that our scheme is secure and efficient.

     

Improvement of a Quantum Proxy Blind Signature Scheme

Improvement of a quantum proxy blind signature scheme is proposed in this paper. Six-qubit entangled state functions as quantum channel. In our scheme, a trust party Trent is introduced so as to avoid David’s dishonest behavior. The receiver David verifies the signature with the help of Trent in our scheme. The scheme uses the physical characteristics of quantum mechanics to implement message blinding, delegation, signature and verification. Security analysis proves that our scheme has the properties of undeniability, unforgeability, anonymity and can resist some common attacks.     

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

A novel arbitrated quantum signature (AQS) scheme is proposed motivated by the Hamiltonian algorithm (HA) and blind quantum computation (BQC). The generation and verification of signature algorithm is designed based on HA, which enables the scheme to rely less on computational complexity. It is unnecessary to recover original messages when verifying signatures since the blind quantum computation is applied, which can improve the simplicity and operability of our scheme. It is proved that the scheme can be deployed securely, and the extended AQS has some extensive applications in E-payment system, E-government, E-business, etc.     

Multi-proxy Strong Blind Quantum Signature Scheme

A multi-proxy strong blind quantum signature scheme is proposed in this paper. An original signatory Alice delegates her signing authority to a group of proxy signatories by using a classical warrant. A blind factor is introduced by a sender U to blind a message, and the proxy signatories sign the message blindly via applying appropriate unitary operators. A receiver Bob verifies the generated signature with the help of an arbitrator Trent. The security of this scheme is based on a quantum key distribution protocol, a quantum one-time pad and other quantum properties. It is proved that our scheme has the properties of non-disavowal, non-counterfeit, multi-proxy, blindness, untraceability and can resist some common attacks.     

An arbitrated quantum signature scheme based on entanglement swapping with signer anonymity

<正>In this paper an arbitrated quantum signature scheme based on entanglement swapping is proposed.In this scheme a message to be signed is coded with unitary operators.Combining quantum measurement with quantum encryption, the signer can generate the signature for a given message.Combining the entangled states generated by the TTP’s Bell measurement with the signature information,the verifier can verify the authentication of a signature through a single quantum state measurement.Compared with previous schemes,our scheme is more efficient and less complex, furthermore,our scheme can ensure the anonymity of the signer.     

A Novel Quantum Group Proxy Blind Signature Scheme Based on Five-Qubit Entangled State

A novel quantum group proxy blind signature scheme based on five-qubit entangled state is proposed. The quantum key distribution, quantum encryption algorithm and some laws of quantum mechanics (such as quantum no-cloning theorem and Heisenberg uncertainty principle) are used to guarantee the unconditional security of this scheme. Analysis result shows that the signature can neither be forged nor disavowed by any malicious attackers and our scheme satisfies all the characteristics of group signature and proxy signature. This protocol can be applied in real life such as E-commerce transaction.

     

An Arbitrated Proxy Blind Signature Based on Hyper Entanglement Analysis

Motivated by the hyperentangled Bell states analysis, an arbitrated quantum proxy blind signature (QPBS) scheme is developed. Four participants accomplish the task of signing and verifying via exchanging the entanglement of polarization and spatial-mode degrees of freedom. Alice blinds message and sends it to a proxy signatory David who is delegated by the original signatory Charlie. David generates a signature using the delegating code while Bob verifies the signing with the help of an arbitrator Trent. Unlike previous schemes, the verifying phase is no longer executed only by a recipient. Analysis shows that when the even numbers of blinding string always equal 1, the scheme protects the proxy blind signature against forgery and disavow while maintaining the properties of verifiability and identifiability.     

An Improved Proxy Blind Signature Scheme

In this paper, we propose an improved proxy blind signature scheme based on controlled quantum teleportation. Five-qubit entangled state functions as quantum channel. We use physical characteristics of quantum mechanics to implement signature, delegation and verification. Furthermore, quantum key distribution (QKD) protocol and one-time pad are adopted in this scheme. Like classical signature protocols, our scheme can be used in many application scenarios, such as e-government and e-business.

     

A Quantum Multi-Proxy Blind Signature Scheme Based on Entangled Four-Qubit Cluster State

In this paper, a multi-proxy blind signature scheme based on controlled quantum teleportation is proposed. Entangled four-qubit Cluster state functions as quantum channel, which needs less resource to complete the quantum multi-proxy blind signature. The scheme uses the physical characteristics of quantum mechanics to guarantee its blindness, unforgeability, and undeniability. The eavesdropping check is used to ensure the security. Our scheme has a foreseeable application to the E-business, E-governments, and etc.     

A Quantum Multi-Proxy Blind Signature Scheme Based on Entangled Four-Qubit Cluster State

In this paper, a multi-proxy blind signature scheme based on controlled quantum teleportation is proposed.Entangled four-qubit Cluster state functions as quantum channel, which needs less resource to complete the quantum multi-proxy blind signature. The scheme uses the physical characteristics of quantum mechanics to guarantee its blindness, unforgeability, and undeniability. The eavesdropping check is used to ensure the security. Our scheme has a foreseeable application to the E-business, E-governments, and etc.     

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.