A Hybrid E-Voting Scheme
There are two existing solutions to secure e-voting: homomorphic tallying and shuffling, each of which has its own advantages and disadvantages. The former supports efficient tallying but depends on costly vote validity check and does not support complex elections. The latter supports complex elections and dose not need vote validity check but depends on costly shuffling operations in the tallying operation. In this paper, the two techniques are combined to exploit their advantages and avoid their disadvantages. The resulting e-voting scheme is called hybrid e-voting, which supports complex elections, employs efficient vote validity check and only needs shuffling with a very small scale. So it is more efficient than the existing e-voting schemes, especially in complex elections.
Unable to display preview. Download preview PDF.
- 1.Baudron, O., Fouque, P.-A., Pointcheval, D., Stern, J., Poupard, G.: Practical multi-candidate election system. In: Twentieth Annual ACM Symposium on Principles of Distributed Computing, pp. 274–283 (2001)Google Scholar
- 6.Cramer, R., Damgård, I.B., Schoenmakers, B.: Proof of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)Google Scholar
- 9.Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science, pp. 427–437 (1987)Google Scholar
- 19.Neff, C.A.: A verifiable secret shuffle and its application to e-voting. In: ACM Conference on Computer and Communications Security 2001, pp. 116–125 (2001)Google Scholar
- 23.MacKenzie, P., Frankel, Y., Yung, M.: Robust efficient distributed rsa-key generation. p. 320 (1998)Google Scholar