Verifiable Classroom Voting in Practice

End-to-End Verifiable E-Voting Trial for Polling Station Voting

“…Meanwhile the thermal printer printed the first part of the receipt. Based on [8], only a truncated hash (50 characters in Crockford's base-32 encoding) was printed on the receipt, while the complete crypto data including the digital signature was published at the election website. Next, the voter needed to either "confirm" or "cancel" the selection.…”

“…The first SEEV system, called DRE-i due to Hao et al [7], adopts a pre-computation strategy to encrypt ballots before the election in a structured way such that multiplying the ciphertexts after the election will cancel out random factors and hence allow everyone to verify the integrity of the tallying result without TAs. A prototype of DRE-i has been used for mobile phone-based classroom voting [8]. The second SEEV system, called DRE-ip due to Shahandashti and Hao [9], adopts an alternative real-time computation strategy to encrypt ballots during voting, while keeping an aggregated form of the random factors in memory.…”

A decentralized consensus application using blockchain ecosystem

“…Hao et al, [17] have proposed an end to end verifiable classroom voting system, without any intermediate tallying authority. Fiat Shamir transformation and DRE-i protocol are used to ensure concealing, revealing and self tallying property in the system.…”