Blind signature scheme, an important cryptographic primitive, is applicable in protocols that guarantee the anonymity of the participants. This scheme is increasingly used in untraceable payment and electronic voting systems. In this paper we improve ElGamal signature scheme and then we propose a new blind signature based on that. ElGamal signature scheme has an important advantage into RSA signature scheme which is non-deterministic and means that there are many valid signatures for any given message. This property also exists in our new blind signature scheme. Having low computational complexity for signature requester and the signer is one of the advantages of the newly developed scheme and as a result makes it very efficient.
Rights and permissions | |
![]() | This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |