{'fraction_non_alphanumeric': 0.018218623481781375, 'fraction_numerical': 0.0, 'mean_word_length': 5.506578947368421, '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}}
An improved universal re-encryption based on okamoto-uchiyama cryptosystem

Universal re-encryption technique is an important tool that enables an intermediary to re-encrypt a ciphertext without any knowledge of corresponding public key. This technique, as shown by Golle et. al., conventionally utilizes ElGamal cryptosystem for its operations and generates two pairs of ciphertexts. With ElGamal cryptosystem, efficiency of this technique decreases as resources in terms of time and memory are consumed significantly by the amount of generated ciphertexts. The purpose of the paper is to increase the efficiency of universal re-encryption technique by reducing the ciphertext quantity and to make the technique suitable for resource constraint devices while keeping the facilities of conventional universal re-encryption technique in full concern. To show the effectiveness of proposed technique, this paper includes an analysis on experimental data from the simulation of mix-networks.