Efficient Implementation of Cryptographic Protocols for Electronic Voting

Electronic voting implementations come in different flavors. One of them is the homomorphic encryption (encryption allowing for secure mathematical manipulation of ciphertexts) implemented in the voter's browser. This project aims at giving the timings of 2 fully operational simulations of the voting procedure, each of them using a different homomorphic encryption technique. The first one resides on the El Gamal encryption while the second resides on the Perfectly Private Audit Trail (PPAT) Commitment Consistent Encryption (CCE). It also aims at analyzing the strength of the new Verificatum library at performing computation in JavaScript in the user's browser. Alternatively, another goal is to give an idea of the strength of a cryptographic pairing implementation, since the PPATS encryption needs to compute it on the server-side.