Proxy Blind Signature Scheme Research Articles

Identity-based proxy blind signature scheme on lattice in high-speed network environment

The methods of network attacks are becoming more and more diverse In high-speed networks, and protecting private data is a key issue for users’ security. Proxy blind signature technology combines proxy and blind signature technology to achieve signature transitivity and message confidentiality. However, current signature schemes will not be secure in quantum environments. Meanwhile, the certificate storage of the existing scheme is relatively complicated. Therefore, to avoid the need for certificates and resist quantum attacks, this paper proposes an anti-quantum identity-based proxy blind signature (ID-Proxy-BS) scheme on lattice. This ID-Proxy-BS scheme improves the efficiency of signature through Gaussian distribution and sampling techniques. Security analysis shows that the scheme satisfies correctness, efficiency, blindness, and unforgeability.

Post-Quantum Secure Identity-Based Proxy Blind Signature Scheme on a Lattice.

Blind signatures have been widely applied when privacy preserving is required, and the delegation of blind signature rights and a proxy blind signature (Proxy-BS) become necessary when the signer cannot sign. Existing Proxy-BS schemes are based on traditional cryptographically hard problems, and they cannot resist quantum attacks. Moreover, most current Proxy-BS schemes depend on public key infrastructure (PKI), which leads to high certificate storage and management overhead. To simplify key management and resist quantum attacks, we propose a post-quantum secure identity-based proxy blind signature (ID-Proxy-BS) scheme on a lattice using a matrix cascade technique and lattice cryptosystem. Under the random oracle model (ROM), the security of the proposed scheme is proved. Security shows that the proposed scheme assures security against quantum attacks and satisfies the correctness, blindness, and unforgeability. In addition, we apply the ID-Proxy-BS scheme on a lattice to e-voting and propose a quantum-resistant proxy e-voting system, which is resistant to quantum attacks and achieves the efficiency of e-voting.

A Quantum Proxy Blind Signature Scheme Based on Superdense Coding

In this paper, we show a new quantum proxy blind signature scheme based on single particle superdense coding. We only need perform unitary operator on single qubit to blind 2-bit classical information. The scheme also satisfies the properties of blindness, unforgeability and undeniability. It has a wide application to e-payment, e-voting, e-government, and etc.

Security Analysis of Particular Quantum Proxy Blind Signature Against the Forgery Attack

As an important topic of quantum cryptography, quantum proxy blind signature has attracted more and more attentions in recent years. However, with our analysis, it can be seen that there exists a common security loophole in two particular quantum proxy blind signature schemes, i.e., the receiver can forge a valid signature without being caught by others. In order to show that, the detailed attack strategy and the potential improved ideas are proposed in this paper.

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.

Designated Verifier Proxy Blind Signature Scheme for Unmanned Aerial Vehicle Network Based on Mobile Edge Computing

Unmanned Aerial Vehicle (UAV) has enormous potential in many domains. According to the characteristics of UAV, it is important for UAV network to assure low latency and integrity and authentication of commands sent by command center or command stations to UAV. In this paper, we proposed a UAV network architecture based on mobile edge computing (MEC) which helps guarantee low latency in the UAV network. Afterwards, we proposed a designated verifier proxy blind signature (DVPBS) scheme for UAV network and proved that it is existentially unforgeable under an adaptive chosen message attack in the random oracle model. We compared the efficiency of our DVPBS scheme with other signature schemes by implementing them in jPBC and theoretically analyzing their signature length. The experiment results indicate that our DVPBS scheme is efficient. The signature length of our DVPBS is longer, but it is still short enough compared with the transmission capacity of UAV.

A Proxy Blind Signature Scheme of Quantum Information Transmission in Two-Particle State

A new proxy blind signature scheme based on controlled quantum teleportation is presented in this paper. We present a scheme for teleporting an unknown two-particle entangled state with message from a sender (Alice) to a receiver (David) via a genuine six-qubit entangled state. In this scheme, we introduce a trusted third party to enhance security and effectively resist forgery attacks. One-way hash faction, Von-Neumann measurement and unitary operation are adapted in this scheme. Our scheme uses the physical characteristics of quantum mechanics to implement delegation, signature and verification. Moreover, quantum key distribution (QKD) protocol and one-time pad are adapted in this scheme.

Cryptanalysis and Improvement of Some Quantum Proxy Blind Signature Schemes

Recently, two novel quantum proxy blind signature schemes are proposed by Zeng et al. and Yang et al., respectively. Their schemes have made a great contribution to the development of quantum proxy blind signature (QPBS). However, we find that there exist some security loopholes which have been neglected by them, i.e., the receiver can forge the signature in Zeng et al.’s scheme and the unreasonable assumption about arbitrator exists in Yang et al.’s scheme, etc. In order to overcome these problems, some improved ideas are proposed. Moreover, we give the further discussions of QPBS in this paper. Finally, we summarize some reasonable assumptions in order to satisfy the security properties of QPBS.

A provably secure delegated authentication scheme and its applications

In a proxy signature scheme, an original signer can delegate his/her signing capability to a proxy signer, so that the proxy signer can sign on behalf of the original signer. Proxy signature is an important technology in delegated authentication schemes, so it is important to design provably secure proxy signature schemes. Boldyreva et a1. (2012) gave the definition of proxy signature and formalised a model of security for proxy signature schemes. They not only formalised a model of security for proxy signature schemes, but also specified the adversary's capabilities and goals. In this paper, we propose a new provably secure proxy signature scheme under this model, which is more efficient than that of the existing ones. Furthermore, we use this signature scheme to construct a proxy blind signature scheme, and give the security analysis of the new scheme. Proxy blind signature can be applied in cloud computing.

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.

Provably secure certificate-based proxy blind signature scheme from pairings

In 2003, C. Gentry introduced the paradigm of certificate-based encryption (CBE) to combine the merits of public key cryptography (PKC) and identity-based PKC (ID-PKC). The invention of CBE also remove the key escrow as well as secret key distribution problem in ID-PKC and the third party queries problem of PKC. This article presents the first short and efficient provably secure certificate-based proxy blind signature (CB-PBS) scheme from pairing over elliptic curves. The proposed CB-PBS scheme is proven secure under adaptively chosen message and ID attack in the random oracle model. Through efficiency comparison with existing related efficient PBS schemes, it is shown that the proposed CB-PBS scheme is the most efficient and short signature scheme. Due to the shortest length, it is the most appealing to implement in low bandwidth communication systems to design e-cash, e-voting, etc.

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.

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.

Cryptanalysis and improvement of a ECDLP based proxy blind signature scheme

The proxy blind signature scheme (PBSS), allows the authorized proxy signer to use his proxy private key to create a legal blind signature on behalf of original signer. Recently, Alghazzawi, Salim and Hasan (A-S-H), presented the elliptic curve cryptography (ECC) based PBSS. However, we found their scheme is vulnerable to a linkability attack, which shows that there was lacked of unlinkability. In this paper, the improvements are being done in this regards in such a manner that the proposed signature scheme satisfies all the security properties, including unlinkability property. The security of the proposed PBSS rely on the elliptic curve discrete logarithm problem (ECDLP). The signature scheme presented can be implemented in low power and small processor device such as smart card.

An Efficient Identity‐Based Proxy Blind Signature for Semioffline Services

Fog computing extends the cloud computing to the network edge and allows deploying a new type of semioffline services, which can provide real‐time transactions between two entities, while the central cloud server is offline and network edge devices are online. For an e‐payment system and e‐voting with such feature, proxy blind signature is a cornerstone to protect users’ privacy. However, the signature based on number theorem, such as hard mathematical problems on factoring problem, discrete logarithm problem, and bilinear pairings, cannot defeat quantum computers attack. Meanwhile, these schemes need to depend on complex public key infrastructure. Thus, we construct an identity‐based proxy blind signature scheme based on number theorem research unit lattice, which can defeat quantum computers attack and does not need to depend on public key infrastructure. The security of the proposed scheme is dependent on Ring‐Small Integer Solution problem over number theorem research unit lattice. The proposed scheme meets the properties of blind signature and proxy signature. Then we compare the proposed scheme with other existing proxy blind signature schemes; the result shows that the proposed scheme outperforms ZM scheme except in proxy signer’s signature size and can be more secure than TA scheme and MMHP scheme.

An Improved Quantum Proxy Blind Signature Scheme Based on Genuine Seven-Qubit Entangled State

An improved quantum proxy blind signature scheme based on controlled teleportation is proposed in this paper. Genuine seven-qubit entangled state functions as quantum channel. We use the physical characteristics of quantum mechanics to implement delegation, signature and verification. Security analysis shows that our scheme is unforgeability, undeniability, blind and unconditionally secure. Meanwhile, we propose a trust party to provide higher security, the trust party is costless.

Efficient message recovery proxy blind signature scheme from pairings

AbstractThe recent applications of communication technology like e‐bookings, e‐shopping, e‐cash, etc. have inspired the need of delegation of signing capacity along with anonymity. A proxy blind signature scheme is a method of such delegation along with anonymity. In these signature schemes, a user can get a signature on a document of her/his choice from a proxy signer (who is signing the document on behalf of an original signer with delegated signing power) without revealing its contents. These signature schemes are mostly used by low bandwidth systems and thus small messages are signed. In this article, we introduce a proxy blind signature scheme with message recovery to shorten the message signature size. Through comparison with existing efficient proxy blind signature schemes, we show that the proposed scheme is the shortest in size and more efficient in computation cost.

A Secure ID-Based Blind and Proxy Blind Signature Scheme from Bilinear Pairings

ABSTRACTIn a blind signature scheme, the signer cannot link the relationship between the blind message and the signature of the chosen message. That is, blind signatures allow the user to obtain a signature of a message in a way that the signer learns neither the message nor the resulting signature. Therefore, it is very suitable for electronic commerce applications. A proxy signature allows the user to sign messages on behalf of the original signer. It is very useful when the original signer is not available to sign a specific document. A proxy blind signature combines the properties of both proxy signatures and blind signatures and is useful for e-cash and e-commerce applications. In this article, we propose a secure ID-based blind and proxy blind signature scheme from bilinear pairings. The proposed scheme satisfies the security properties of both blind and proxy blind signature scheme.

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 Proxy Blind Signature Scheme

A novel quantum proxy blind signature scheme is proposed. In this scheme, a special type of non-maximally entangled three-qubit state is introduced as a quantum channel, which can realize perfect teleportation. The message sender U blinds his message by means of preparing two groups of non-orthogonal single-photon states. According to the original signer Charlie’s delegation message, the proxy signer Alice generates a corresponding signature. The arbitrator Trent can help the receiver Bob verify the signature, and also prevent Bob from doing any damage. The above-mentioned advantages make this scheme different from some existing schemes. It is showed that our scheme has the properties of undeniability, unforgeability, blindness, untraceability. Moreover, it is free from intercept-resend attack.