A new directed signature scheme with hybrid problems
N. N. Ramlee, Eddie Shahril Ismail · Applied Mathematical Sciences · 2013
In this paper, we proposed a new directed signature scheme based on hybrid problems; factoring and discrete logarithm. This scheme authorizes only an intended verifier to verify a resulting signature. In fact, both signer and verifier also should be able to prove the resulted signature to any third party whenever necessary. Until today, the security of many existing directed signatures is only based on a single hard problem like factoring, discrete logarithm or elliptic curve discrete logarithm. Although these schemes seem secure nowadays but in a near future, if an adversary finds a solution of these hard problems then the schemes will no longer be secured. Thus, we develop a newly designed scheme which provides greater security level than single hard problem-based scheme since it is impossible for the adversary to solve the two hard problems simultaneously.