A secure anonymous internet electronic voting scheme based on the polynomial
In this paper, we use the polynomial function and Chaum's RSA (Rivest, Shamir, Adleman) blind signature scheme to construct a secure anonymous internet electronic voting scheme. In our scheme, each vote does not need to be revealed in the tallying phase. The ballot number of each candidate gets is counted by computing the degrees of two polynomials' greatest common divisor. Our scheme does not require a special voting channel and communication can occur entirely over the current internet.
Key wordselectronic voting blind signature RSA (Rivest, Shamir, Adleman) polynomial function
CLC numberTP 309
Unable to display preview. Download preview PDF.
- Riera A, Borrell J, Rifa J. An Uncoercible Verifiable Electronic Voting Protocol [C]//IFIP TC11 Conference. Vienna, Autriche, Aug 1998.Google Scholar
- Fujioka A, Okamoto T, Ohta K. A Practical Secret Voting Scheme for Large Scale Elections [C]//Advances in Cryptology—AUSCRYPT '92, Workshop on the Theory and Application of Cryptographic Techniques Gold Coast. Queensland, Australia, Dec 13–16, 1992.Google Scholar
- Chaum D. Blind Signature Systems [C].Proceedings of advances in Crypto '83. New York: Springer-Verlag, 1998. 153–156.Google Scholar
- Chaum D. Blinding for Unanticipated Signatures [C]//Advances in Cryptology-EUROCRYPT '87,Workshop on the Theory and Application of Cryptographic Techniques. Amsterdam, The Netherlands, April, 1987.Google Scholar