E-government is the latest trend in many countries in which the government is using the online system for delivering government services to citizens. The need for information transmission and transactions on computer networks and the Internet is increasing, leading to requirements for ensuring the safety of information transmission, and the digital signature is used to validate contents and authorize users who are involving in the E-governance system. In some cases, blind digital signatures are used to authenticate the integrity of an electronic message and the identity of the signer, but do not allow authentication of the true origin of the signed message. Although there are many digital signature schemes currently known as: RSA, Elgamal,... the approach of improving the safety level of digital signature schemes based on the hardness of solving simultaneous difficult assumptions has still remained underdeveloped and attracted rising attentions from researchers. This paper proposes a blind digital signature scheme developed from a digital signature scheme built on the difficulty of simultaneously solving the discrete logarithm problem and the root problem. The advantage of the new scheme proposed here is that it has a higher level of security than the previously published schemes in terms of its ability to resist attacks that reveal the source of the signed message.