{'fraction_non_alphanumeric': 0.02510460251046025, 'fraction_numerical': 0.0, 'mean_word_length': 4.837398373983739, '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}}
Cryptanalysis of Short Signature Scheme Without Random Oracles Assumption

This paper presents an attack on a new short signature scheme from bilinear pairing proposed by Dan Boneh et al. at J. Crypt. We show that an attacker can alter the public key of the signer and then can forge the signer’ s signature for any message m. Furthermore, we argue that the well-accepted notion of security for signature schemes, namely existential unforgeability against adaptive chosen-message attacks, is not adequate for the multi-user setting. We firstly define a new notion of security named non-repudiation for the short signature schemes. We believe that the signature scheme, which satisfies non-repudiation, is more secure.