{'fraction_non_alphanumeric': 0.025356576862123614, 'fraction_numerical': 0.003169572107765452, 'mean_word_length': 5.378787878787879, '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 Analysis of Chaum's Voter-Verifiable Election Scheme

Title of thesis: AN ANALYSIS OF CHAUM’S VOTER-VERIFIABLE ELECTION SCHEME Julie Ann Staub, Master of Science, 2005 Thesis directed by: Professor Jonathan Katz Department of Applied Mathematics Chaum’s Voter-Verifiable election scheme introduces a new direction for electronic voting. The scheme eliminates the need to trust any machinery or authority, and instead relies on mathematical proof to certify the trustworthiness of an election. Audits at every stage of the election create transparency that should restore voter confidence in the election process. We survey and categorize the field of electronic voting, and place Chaum’s scheme within this context. We then define a framework of formal requirements of a voting system. We present Chaum’s scheme itself, and give an analysis. Based on our technical analysis, we find the scheme to be secure. However, after considering other implementation concerns, we recognize various minor obstacles limiting its widespread adoption in today’s elections. Despite this, we believe that the substance of the scheme is promising and maybe an improved, simpler variant might better suit future elections. AN ANALYSIS OF CHAUM’S VOTER-VERIFIABLE ELECTION SCHEME