A Strong Designated Verifier Signature Scheme with Hybrid Cryptographic Hard Problems

Abstract The security of the most of the existing strong designated verifier signature (SDVS) scheme are based on a single cryptographic hard problem. Although these schemes seem secure today, there is a possibility for an adversary to find a solution for this problem in the future and if this happens, then such SDVS schemes will no longer be secure. We develop a new SDVS scheme based on hybrid problems; factorization and discrete logarithm. The new developed scheme provides a greater security level than those previous designated SDVS schemes and satisfies the security properties and requirements of a SDVS scheme.