In the aftermath of the United States Presidential election, more and more frequently there are calls for voters to be able to place their votes from the comfort of their own home. However, many studies have found prototype systems to be either insecure or insufficiently defined for the purposes of an election on a national scale.
In this paper I will examine the security of voting applications from a different angle: the validation and verification of compiled code. There are the obvious concerns about unverified code, that we have no guarantee the protocol described by the voting procedure is the one being executed. Using work by Appel  as a model, it can be seen that even advanced cryptographic algorithms can be verified. Using Chaum’s scheme, a visual cryptography system intensely examined in Staub’s work , and originally described in Chaum’s paper , as our target enables us to have a secure algorithm that we can properly verify. Our goal will be to establish a verified code implementation for Chaum’s scheme that could be deployed to voters to confirm their votes.
Computer Science (MS)
Department, Program, or Center
Computer Science (GCCIS)
Savarese, Kyle, "Formal Verification of Receipt Validation in Chaum’s Scheme" (2017). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus