{'fraction_non_alphanumeric': 0.02280130293159609, 'fraction_numerical': 0.0, 'mean_word_length': 5.612903225806452, '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}}
Threshold proxy re-signature: definition and new constructions

Abstract The previous threshold proxy re-signature schemes have been mainly constructed with bilinear maps, the implementations of which are much more time-consuming than exponentiation operations. To solve this problem, we propose efficient threshold proxy re-signature schemes which are constructed with El-Gamal signatures. The performance analysis shows that our schemes are more efficient than the existing threshold proxy re-signature schemes. Based on the discrete logarithm problem, our schemes are provable secure in the random oracle model.