Abstract
Modlnt is a compact Java class designed for the arbitrary-precision modular arithmetic operations used in secure cryptographical applications, including auctions and electronic voting. The library is small enough to port to a Java-enabled cellular phone. In this paper, we present a new electronic voting system using the Modlnt library, in which voters have their ballots encrypted with the public key of a trusted agent and cast them to an untrusted server, which tallies them without decrypting the ballot and updates a linear-feedback shift register (LFSR) consisting of log n ciphertexts. The privacy of voters is therefore assured assuming that the security of the public-key crypto system is maintained, and the trusted party keeps their private key secure. This feature reduces the costs of management of the counting server, which is now free from the risks of being compromised.
Chapter PDF
References
A. Fujioka, M. Abe, M. Ohkubo and F. Hoshino, “Implementation and Experimentation of Practical Electronic Voting” , Proc. of Symposium on Cryptography and Information Security, Vol 48, 2000 (in Japanese).
M. Abe, “Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers,” IEICE Trans. Fundamentals, Vol. E83-A, 2000.
J. Furukawa and K. Sako, “An Efficient Scheme for Proving a Shuffle,” Proc. of CRYPTO’01, LNCS 2139, pp. 368–387, 2001.
Japanese Governmental Survey in Influence of Information Technologies at Home in 2002, (http://www5.cao.go.jp/seikatsu/2002/0405itchousa/index.html).
NTT Docomo Official Page, (http://www.nttdocomo.co.jp/ September 2002) .
i-mode Official Page, (http://www.nttdocomo.co.jp/p_s/imode/ September 2002) .
J. Katz, S. Myers and R. Ostrovsky, “Cryptographic Counters and Applications to Electronic Voting,” in proc. of EUROCRYPT’02, pp. 78–92, 2001.
R. Crammer, I. Damgard, and B. Schoenmakers, “Proofs of partial knowledge and simplified design of witness hiding protocols,” Proc. of CRYPTO ’94, pp. 174–187, 1994.
R. Cramer, R. Gennaro and B. Schoenmakers, “A Secure and Optimally Efficient Multi-Authority Election Scheme,” Proc. of EUROCRYPT 1997, 2001.
R. Cramer, I. Damgård, and B. Schoenmakers, “Proofs of partial knowledge and simplified design of witness hiding protocols,” Proc. of CRYPTO ’94, pp.174–187, 1994.
M. Jakobsson and A. Juels, “Mix and Match: Secure Function Evaluation via Ciphertexts,” Proc. of ASIACRYPTO 2000, LNCS 1967, pp. 162–177, 2000.
“E-Japan Priority Policy Program 2003”, IT Strategic Headquarter, (http://www.kantei.go.jp/foreign/policy/it/0808summary/030808gaiyo_e.pdf), August 2003.
“The electromagnetic recording voting device” (the special law of electronic voting), February, 2002.
“Regulation regarding Voting by Electromagnetic Recording Voting Device in the Election of Niimi City Assembly and Mayor” , Niimi City, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kikuchi, H., Nakazato, J. (2004). Modint: A Compact Modular Arithmetic Java Class Library for Cellular Phones, and its Application to Secure Electronic Voting. In: Deswarte, Y., Cuppens, F., Jajodia, S., Wang, L. (eds) Security and Protection in Information Processing Systems. SEC 2004. IFIP — The International Federation for Information Processing, vol 147. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8143-X_12
Download citation
DOI: https://doi.org/10.1007/1-4020-8143-X_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-8016-1
Online ISBN: 978-1-4020-8143-9
eBook Packages: Springer Book Archive