{'fraction_non_alphanumeric': 0.016320474777448073, 'fraction_numerical': 0.004451038575667656, 'mean_word_length': 4.9734513274336285, '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 Efficient Homomorphic Coercion Resistant and E2E Verifiable Voting Scheme

This paper proposes a voting scheme that coalesces many features of an efficient e- voting scheme like receipt-freeness, uncoercibility, E2E verifiable and write-in ballot. Some of the previous schemes in the past literatures provide most of these features at the cost of increased running time. This paper proposes a simple and efficient voting scheme that is coercion resistant and E2E verifiable. It also has the write-in property. Our protocol addresses some of the major drawbacks of previous popular voting schemes to make the proposed scheme applicable for any kind of real time elections.