Abstract
Electronic voting schemes must provide universal verifiability and receipt-freeness. However, since their objectives are mutually contradictory, providing both properties are difficult. To date, most electronic voting schemes provide only one of these properties and those few which provide both properties are not practical due to heavy computational requirements. In this paper, we present an efficient electronic voting scheme that provides both properties. The proposed scheme uses a trusted third party called HS (Honest Shuffler) and requires only one-way untappable channels from HSs to voters. Currently, this is the weakest physical assumption required for receipt-freeness. Among the schemes which assume only one-way untappable channels and provide both properties, our scheme requires the least amount of computation.
This work was supported by Korea Research Foundation Grant (KRF-2003-003-D00445).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sako, K., Kilian, J.: Receipt-free Mix-Type Voting Scheme: A Practical Solution to the Implementation of a Voting Booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393–403. Springer, Heidelberg (1995)
Okamoto, T.: Receipt-Free Electronic Voting Schemes for Large Scale Elections. In: Christianson, B., Crispo, B., Lomas, T., Roe, M. (eds.) Security Protocols 1997. LNCS, vol. 1361, pp. 25–35. Springer, Heidelberg (1998)
Hirt, H.: Receipt-free Voting with Randomizers. Presentated at the Workshop on Trustworthy Elections (2001), http://www.vote.caltech.edu/wote01/
Hirt, M., Sako, K.: Efficient Receipt-Free Voting Based on Homomorphic Encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 539–556. Springer, Heidelberg (2000)
Lee, B., Kim, K.: Receipt-free Electronic Voting through Collaboration of Voter and Honest Verifier. In: Proc. of the JWISC 2000, pp. 101–108 (2000)
Furukawa, J., Sako, K.: An Efficient Scheme for Proving a Shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 368–387. Springer, Heidelberg (2001)
Cramer, R., Franklin, M.K., Schoenmakers, B., Yung, M.: Multi-Authority Secret-Ballot Elections with Linear Work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 72–83. Springer, Heidelberg (1996)
Lee, B., Kim, K.: Receipt-Free Electronic Voting Scheme with a Tamper-Resistant Randomizer. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 389–406. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, S., Oh, H. (2004). A New Universally Verifiable and Receipt-Free Electronic Voting Scheme Using One-Way Untappable Channels. In: Chi, CH., Lam, KY. (eds) Content Computing. AWCC 2004. Lecture Notes in Computer Science, vol 3309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30483-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-30483-8_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23898-0
Online ISBN: 978-3-540-30483-8
eBook Packages: Springer Book Archive