{'fraction_non_alphanumeric': 0.012711864406779662, 'fraction_numerical': 0.0, 'mean_word_length': 5.165217391304348, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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.