Vote Verification using Hard AI Problems
نویسندگان
چکیده
Recently proposed end-to-end independently-verifiable (E2E) voting schemes provide encrypted paper receipts to voters, who may later check that these receipts are in the electronic ballot box. Unfortunately, few voters are likely to follow up on the voting process after leaving the voting site; as a result, few receipts will be checked. This paper describes an enhancement to E2E schemes that does not require the voter to perform a task outside the polling booth. It enables the voter to electronically transmit her receipt, from the polling booth, to a trusted external verifier. This is done through the use of a human-verifiable digital signature primitive whose (short-lived) security depends on the hardness of an AI problem. The primitive enables the voter to be certain—without access to trusted computational power in the voting booth—that the receipt has been securely deposited with the external verifier. The approach presents several advantages: the voter is not required to do anything outside the polling booth, no receipts are needed after polling, all receipts generated by the polling machine can be checked, and any classical digital signatures on receipts can be checked instantaneously by the trusted verifier. Additionally, an audio-based format is an easy extension for those with visual disabilities. The cost of these benefits is the introduction of the verifier, who needs to be trusted not to launch a denial-of-service attack.
منابع مشابه
How to prove the validity of a complex ballot encryption to the voter and the public
One crucial aspect of any verifiable electronic voting system that uses encryption is the proof that the vote encryption is well-formed, i.e. the proof that the vote encryption encrypts a valid vote accordingly to the race specification. It makes no sense accepting an encrypted vote if, at the end of the election, the vote cannot be included in the tally because it is badly formed. Proving the ...
متن کاملVerification and Validation and Artificial Intelligence
Artificial Intelligence (AI) is useful. AI can deliver more functionality for reduced cost. AI should be used more widely but won’t be unless developers can trust adaptive, nondeterministic, or complex AI systems. Verification and validation is one method used by software analysts to gain that trust. AI systems have features that make them hard to check using conventional V&Vmethods. Neverthele...
متن کاملTowards New Security Primitives Based on Hard AI Problems
Many security primitives are based on hard mathematical problems. Using hard AI problems for security has emerged as an exciting new paradigm (with Captcha being the most successful example). However, this paradigm has achieved just a limited success, and has been under-explored. In this paper, we motivate and sketch a new security primitive based on hard AI problems.
متن کاملAI-Complete, AI-Hard, or AI-Easy - Classification of Problems in AI
The paper contributes to the development of the theory of AI-Completeness by formalizing the notion of AIComplete and AI-Hard problems. The intended goal is to provide a classification of problems in the field of General Artificial Intelligence. We prove Turing Test to be an instance of an AI-Complete problem and further show numerous AI problems to be AI-Complete or AI-Hard via polynomial time...
متن کاملAssuring the Guardians
Ultra-critical systems are growing more complex, and future systems are likely to be autonomous and cannot be assured by traditional means. Runtime Verification (RV) can act as the last line of defense to protect the public safety, but only if the RV system itself is trusted. In this paper, we describe a model-checking framework for runtime monitors. This tool is integrated into the Copilot lan...
متن کامل