{'fraction_non_alphanumeric': 0.014705882352941176, 'fraction_numerical': 0.0, 'mean_word_length': 5.5701754385964914, '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}}
Universal Designated Multi Verifier Signature without Random Oracles

In this paper, we present a strong universal designated multi verifier signature scheme based on bilinear pairings, which does not resort to random oracles. The security of the proposed scheme relies on the hardness of solving q-Strong Diffie-Hellman problem. The proposed scheme is more efficient than the existing universal designated multi verifier signature schemes. The signing and the designation phases of the proposed scheme are pairing-free and thus the scheme is ideal for devices with constrained computational capabilities. The proposed scheme finds several applications such as in certification systems, software licensing and fair distributed contract signing etc.