{'fraction_non_alphanumeric': 0.015105740181268883, 'fraction_numerical': 0.0, 'mean_word_length': 5.314285714285714, '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}}
Certificateless nominative signature scheme based upon DLP

This paper presents a certificateless nominative signature scheme based upon computational hard problems namely, Discrete Logarithmic Problem and Computational Diffie-Helman problem. In the proposed scheme, the partial key is used by user with the random secret of the user to generate the private and public key. The nominative signature is publicly verifiable, convertible and only the nominee can verify the validity of the signature. The scheme can withstand key replacement attack. Also, the proposed scheme is proved to be secure against unforgeability both in Type I and Type II adversary model.