Identity-Based Blind Signature Scheme with Message Recovery

partially blind signature is a variant of the blind signature. The partially blind signature scheme allows a signer to sign a partially blind message that explicitly includes the pre-agreed information. In 2005, Chow et al. first proposed an ID-based partially blind signature scheme with bilinear pairings. ID-based public key systems with bilinear pairings defined on elliptic curves offer a flexible approach to achieve both simplifying the certificate management and reducing the computational cost. However, their scheme is time-consuming for requesters (or clients) with mobile devices. In 2007, Hu and Huang proposed an efficient ID-based partially blind signature scheme based on bilinear pairings. They claimed that the proposed scheme is provably secure under the random oracle model. However, this paper shows that the Hu-Huang scheme suffers from forgery attacks.

Proceedings of the 6th WSEAS International …, 2006

In this paper, we propose a new fair blind signature scheme with message recovery using pairing-based self-certified public key cryptosystems. Preserving the merits inherent in pairing-based cryptosystems, it can possess fewer bits to achieve the higher security level. In addition, our new scheme has the advantage that the authentication of the public key can be accomplished with the verification of the fair blind signature in a logically single step. Furthermore, the fairness of blind signature with message recovery can be actually achieved in our proposed scheme. Based on the proposed security proofs and performance evaluation, we affirm that we not only improve the efficiency of the previously proposed schemes, but also achieve the essential properties of blind signature with provable security.

Journal of Communications, 2012

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.

Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007

Digital signature is one of the important primitive of public-key cryptography and has become an essential technique in providing security services in modern communications. Due to the limitations imposed by both the communication bandwidth and computational power of wireless communication devices, signature schemes with less bandwidth and less computational cost are desirable for practical applications. Signature schemes with message recovery provide a feature that the message is recoverable from the signature and hence does not need to be transmitted separately for signature verification. Recently many signature schemes with message recovery have been designed in traditional as well as Identity based settings and most of the schemes are constructed using bilinear pairings over elliptic curves. Nevertheless, the computational cost of a pairing is more expensive and is higher than the scalar multiplication. Thus, signature schemes without pairing would be more appealing in terms of efficiency. In this paper, we propose an efficient identity-based message recovery scheme without pairings. In our scheme the message itself is not required to be transmitted together with the signature and so it turns out to have the least data size of communication cost. Also, we compare our scheme with the existing ID-based signature schemes with message recovery in terms of computational and communicational point of view. With the pairing-free realization, the proposed scheme is efficient and applicable for resource constrained devices.

International Journal of Innovation, Management and Technology, 2014

2008

In this paper, a novel Blind Signature Scheme (BSS) based on Elliptic Curve Discrete Logarithm Problem (ECDLP) has been proposed. The signer signs the encrypted message after receiving it from the requester. Hence the signer has no scope to learn the contents of the message that he has signed. But there is a scope to verify the authenticity of the signature on the original message by the requester and any other third party. The model has been validated using a customer and bank example and the proof of correctness has been made. The applicability of the proposed scheme can be extended to e-voting and others where the requester needs a blind signature on the message.

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009

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.

Int. J. Netw. Secur., 2019

Currently, short signature is receiving significant attention since it is particularly useful in communication with low-bandwidth as the size of the generated signature is shorter than other conventional signature schemes. In this paper, a new short signature scheme is proposed based on bilinear pairing over elliptic curve. The proposed scheme is efficient as it takes lesser number of cost effective pairing operations than the BLS signature scheme. Moreover, the proposed scheme does not require any special kind of hash function such as Map-To-Point hash function. The efficiency comparison of the proposed scheme with other similar established short signature schemes is also done. The security analysis of our scheme is done in the random oracle model under the hardness assumptions of a modified k-CAA problem, a variant of the original k-CAA problem. In this paper, we also provide an implementation result of the proposed scheme.

Information Security and Privacy, 2005

A blind signature scheme is a protocol for obtaining a digital signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients obtain afterwards. Partially blind signature is a variant such that part of the message contains pre-agreed information (agreed by the signer and the signature requester) in unblinded form, while threshold blind signature distributes the signing power to a group of signers such that a signature can only be produced by interacting with a predetermined numbers of signers. In this paper, we propose a threshold partially blind signature scheme from bilinear pairings and an ID-based partially blind signature scheme, which are provably secure in the random oracle model. To the best of authors' knowledge, we give the first discussion on these two notions.

2009

Abstract—A partially blind signature is a variant of the blind signature. The partially blind signature scheme allows a signer to sign a partially blind message that explicitly includes the pre-agreed information. In 2005, Chow et al. first proposed an ID-based partially blind signature scheme with bilinear pairings. ID-based public key systems with bilinear pairings defined on elliptic curves offer a flexible approach to achieve both simplifying the certificate management and reducing the computational cost. However, their scheme is time-consuming for requesters (or clients) with mobile devices. In 2007, Hu and Huang proposed an efficient ID-based partially blind signature scheme based on bilinear pairings. They claimed that the proposed scheme is provably secure under the random oracle model. However, this paper shows that the Hu-Huang scheme suffers from forgery attacks. Index Terms—Security, Partially blind signature, Bilinear pairings, Identity-based.