Identity-based Blind Signature Scheme Research Articles

An Identity-Based Blind Signature Scheme Using Lattice with Provable Security

With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.

A Secure End-to-End Verifiable Internet-Voting System Using Identity-Based Blind Signature

The end-to-end (E2E) verification enables a voter to check if his ballot is recorded as he intended and the public to check if the system has correctly counted all of the recorded ballots. The Internet voting systems based on the principle of E2E verifiability have many challenges; the most important is its security. Several E2E voting systems have been discussed in the last decade in terms of analyzing the e-voting system and formalizing its security requirements. This article presents an E2E verifiable internet voting system that provides mobility to a voter and allows him to cast his vote secretly in public computer with the benefit of early voting. The proposed system aims to support the election process universally by using the voter's unique identification and biometric features. We propose a new identity-based blind signature scheme that ensures the voter's anonymity. We adopt the Boneh–Lynn–Shacham short signature scheme that ensures the vote privacy with the least ballot size. The system provides a digital witness to a voter that enables him to check whether his vote is recorded as he meant and the public to check if all the recorded ballots are counted correctly. The privacy of the proposed system is achieved under the well-known elliptic curve discrete logarithm and gap Diffie–Hellman assumptions.

An Identity-Based Anti-Quantum Privacy-Preserving Blind Authentication in Wireless Sensor Networks.

With the development of wireless sensor networks, IoT devices are crucial for the Smart City; these devices change people’s lives such as e-payment and e-voting systems. However, in these two systems, the state-of-art authentication protocols based on traditional number theory cannot defeat a quantum computer attack. In order to protect user privacy and guarantee trustworthy of big data, we propose a new identity-based blind signature scheme based on number theorem research unit lattice, this scheme mainly uses a rejection sampling theorem instead of constructing a trapdoor. Meanwhile, this scheme does not depend on complex public key infrastructure and can resist quantum computer attack. Then we design an e-payment protocol using the proposed scheme. Furthermore, we prove our scheme is secure in the random oracle, and satisfies confidentiality, integrity, and non-repudiation. Finally, we demonstrate that the proposed scheme outperforms the other traditional existing identity-based blind signature schemes in signing speed and verification speed, outperforms the other lattice-based blind signature in signing speed, verification speed, and signing secret key size.

Application of Identity-Based Blind Signature in the Performance Evaluation

This paper describes identity-based digital signature. On this basis, we introduce blind digital signature to propose a new identity-based blind digital signature scheme and analyze the performance between this new scheme and a previous one. Then we discuss the application of identity-based blind digital signature in the performance evaluation and design an online performance evaluation scheme.

New blind signature scheme without trusted private key generator

In order to eliminate the inherent key escrow problem in identity-based public key cryptosystem,a new identity-based blind signature scheme without trusted Private Key Generator(PKG) was proposed.Under the random oracle model,the scheme was proved to be existentially unforgeable against adaptive chosen message and identity attacks from common attackers or semi-honest PKG,and the security was reduced to computational Diffie-Hellman assumption.For the forgery attacks from the malicious PKG,the legitimate signer can prove to the arbitration institution that the signature is forged by trace algorithm.

Round-Optimal ID-Based Blind Signature Schemes without ROS Assumption

This paper presents two Identity-Based Blind Signature (IBBS) schemes based on bilinear pairings. Both of them enjoy the following features. First, they achieve the optimal bound of round complexity for blind signatures,i.e., each signature can be blindly generated with one round (or two moves) of message exchanges between the signature requesting user and signer. Second, their security is proved without the ROS assumption, which assumes that it is infeasible to find an overdetermined, solvable system of linear equations modulo q with random inhomogenities. Due to this reason, the order of underlying group does not need to be very large any more, as compared to the previous work. Third, the key extraction algorithm used is the most popular one in ID-based cryptography. In fact, the proposed two constructions are first IBBS schemes enjoying all the above advantages. Different from other IBBS schemes, these two IBBS schemes are constructed from scratch in the sense that new ID-based signature schemes are customized and new assumptions (e.g., two versions of one-more bilinear Diffie- Hellman inversion assumption) are formalized.We also show that the new ID-based schemes and new assumptions may have other interesting applications.

A novel electronic cash system with trustee-based anonymity revocation from pairing

Untraceable electronic cash is an attractive payment tool for electronic-commerce because its anonymity property can ensure the privacy of payers. However, this anonymity property is easily abused by criminals. In this paper, several recent untraceable e-cash systems are examined. Most of these provide identity revealing only when the e-cash is double spent. Only two of these systems can disclose the identity whenever there is a need, and only these two systems can prevent crime. We propose a novel e-cash system based on identity-based bilinear pairing to create an anonymity revocation function. We construct an identity-based blind signature scheme, in which a bank can blindly sign on a message containing a trustee-approved token that includes the user’s identity. On demand, the trustee can disclose the identity for e-cash using only one symmetric operation. Our scheme is the first attempt to incorporate mutual authentication and key agreement into e-cash protocols. This allows the proposed system to attain improvement in communication efficiency when compared to previous works.

An efficient identity-based blind signature scheme without bilinear pairings

The blind signature schemes are useful in some applications where the anonymity is a big issue. Examples include the online voting systems and the electronic cash systems. Since the first identity-based blind signature scheme was proposed by Zhang et al., many identity-based blind signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately 20 times higher than that of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, we propose an identity based blind signature scheme without bilinear pairings. With both the running time and the size of the signature being saved greatly, our scheme is more practical than the related schemes in application.

Secure Identity-Based Blind Signature Scheme in the Standard Model

The only known construction of identity-based blind signature schemes that are secure in the standard model is based on the generic approach of attaching certificates to ordinary (i.e. non-identity-based) blind signature schemes, and thus the identity-based blind signature schemes constructed using this method are somewhat inefficient and have long signature size. In this paper, we present the first direct construction of an identity-based blind signature scheme based on Waters' recently proposed identity-based encryption scheme and Paterson-Schuldt's ID-based signature. Our identity-based blind signature scheme is communicationally efficient and only needs two data exchanges between the signer and the user, and the signatures are short. We prove that our scheme is concurrently secure in the standard model assuming that the computational Diffie-Hellman problem is hard.

Identity-based blind signature scheme based on BLS signatures

Depending on BLS signing algorithm,blind signing algorithm of BLS signatures,and aggregating algorithm of BLS signatures,a new efficient identity-based blind signature scheme was proposed.First,the round complexity of this scheme was optimal,i.e.it was enough for the user and the signer to respectively transmit only one message during each blind signing process.Second,its security was based on the so-called one-more Computational Diffie-Hellman Assumption(CDH) assumption,while the security of the other similar identity-based signature scheme was based on the stronger assumption-ROS assumption.Additionally,this scheme was computationally efficient and had very short signature length.Therefore, it was very suitable for the applications such as e-cash and e-voting.

New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model

We explicitly describe and analyse blind hierachical identity-based encryption (blind HIBE) schemes, which are natural generalizations of blind IBE schemes [20]. We then uses the blind HIBE schemes to construct: (1) An identity-based blind signature scheme secure in the standard model, under the computational Diffie-Hellman (CDH) assumption, and with much shorter signature size and lesser communication cost, compared to existing proposals. (2) A new mechanism supporting a user to buy digital information over the Internet without revealing what he/she has bought, while protecting the providers from cheating users.

A new efficient ID-based proxy blind signature scheme

We propose an identity-based proxy blind signature scheme from bilinear pairings which combines the advantages of proxy signature and of blind signature. Furthermore, our scheme can prevent the original signer from generating the proxy blind signature, thus the profits of the proxy signer are guaranteed. We introduce bilinear pairings to minimize computational overhead and to improve the related performance of our scheme. In addition, the proxy blind signature presented in This work is nonrepudiable and it fulfills perfectly the security requirements of a proxy blind signature.

Efficient ID-based proxy blind signature scheme

In a proxy blind signature scheme, the proxy signer is allowed to generate a blind signature on behalf of the original signer. The proxy blind signature scheme is useful in several applications such as e-voting and e-payment. In this paper, we propose an identity-based proxy blind signature scheme which combines the advantages of proxy signature and of blind signature. Our scheme fulfills perfectly the security requirements of a proxy blind signature. Comparing the previous scheme, our scheme needs less computational overhead and is more efficient.