A blind signature scheme based on ElGamal signature

The use of public key cryptosystems has received considerable attention. They are beneficial in encryption as well as signing which plays an essential role in electronic banking and financial transactions. This paper presents a new generalized blind signature scheme based on ElGamal (1985) signatures. This new scheme has a valuable property that assures that if a message is signed multiple times, the corresponding signatures will be different. This adds to the anonymity of the blind signatures. The new scheme uses number theory operations and modular arithmetic techniques to achieve the desired goal. The current research introduces a generalized signature scheme that could be used to generate blind signatures as well as ordinary ElGamal signatures. The new scheme is found to be comparable to the RSA blinding. Moreover, the new scheme has the advantage of having less computational complexity and is faster than RSA in the blinding procedure.