Restrictive blind signatures allow a recipient to receive a blind signature on a message not know to the signer but the choice of message is restricted and must conform to certain rules. Partially blind signatures allow a signer to explicitly include necessary information (expiration date, collateral conditions, or whatever) in the resulting signatures under some agreement with receiver. Restri...

We propose a novel cryptographic primitive called conditional blind signatures. Our primitive allows a user to request blind signatures on messages of her choice. The signer has a secret Boolean input which determines if the supplied signature is valid or not. The user should not be able to distinguish between valid and invalid signatures. A designated verifier, however, can tell which signatur...

Abstract: A group blind signature require that a group member signs on group’s behalf a document without knowing its content. In this paper we propose an efficient and secure group blind signature scheme. Our scheme is an extension of the group signature scheme proposed by Ateniese, Camenisch, Joye and Tsudik that adds the blindness property. We prove that our group blind signature scheme has t...

The proxy blind signature scheme allows the designated proxy signer using the proxy secret key to generate a blind signature on behalf of the original signer. Tan et al. presented the DLP-based and ECDLP based blind signature schemes. Awasthi and Lal proposed a improved DLP-based scheme later. Recently, Sun et al. presented linkability attack on Tan et al. s and Awasthi–Lal s proxy blind signat...

Some classical Rabin signature schemes are exposed to forgery attacks. We propose some variants to counter this weakness.

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 verificati...

This paper studies non-committing type of universally composable (UC) blind signature protocols where an adversary does not necessarily commit to a message when requesting a signature. An ordinary UC blind signature functionality requires users to commit to the message to be blindly signed. It is thereby impossible to realise in the plain model. This paper first shows that even non-committing v...

Voting is a way for a voter to make a decision or express an opinion or to choose a candidate. E-voting (Electronic Voting) refers to both the electronic means of casting a vote and the electronic means of counting and publishing that votes. The E voting system has some specific advantages as compared to the traditional voting system. In this paper, a secure and efficient e-voting protocol is p...