Page 162 - Towards Trustworthy Elections New Directions in Electronic Voting by Ed Gerck (auth.), David Chaum, Markus Jakobsson, Ronald L. Rivest, Peter Y. A. Ryan, Josh Benaloh, Miroslaw Kutylowski, Ben Adida ( (z-lib.org (1)

J. Furukawa, K. Mori, and K. Sako
154
Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally
[CGS97]
efficient multi-authority election scheme. European Transactions on
Telecommunications 8, 481–489 (1997); Preliminary version in: Fumy, W.
(ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer,
Heidelberg (1997)
[CFSY96] Cramer, R., Franklin, M., Schoenmakers, B., Yung, M.: Secure Secret
Ballot Election Schemes with Linear Work. In: Advances in Cryptology
— EUROCRYPT 1996 (1996)
[DJ01] Damg˚ard, I., Jurik, M.: A Generalization, a Simplification and some
Applications of Paillier’s Probabilistic Public-Key system. In: Proc. of
Public Key Cryptography 2001 (2001)
[E85] El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme
based on Discrete Logarithm. IEEE Transactions on Information The-
ory IT-31, 469–472 (1985)
[EVOX] http://theory.lcs.mit.edu/ ~ cis/voting/voting.html
[FOO92] Fujioka, A., Okamoto, T., Ohta, K.: A Practical Secret Voting Scheme
for Large Scale Elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT
1992. LNCS, vol. 718, pp. 244–251. Springer, Heidelberg (1993)
[FS86] Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to iden-
tification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO
1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)
[F04] Furukawa, J.: Efficient, verifiable shuffle decryption and its requirement
of unlinkability. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS,
vol. 2947, pp. 319–332. Springer, Heidelberg (2004)
[FS01] 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)
[FMMOS02] Furukawa, J., Miyauchi, H., Mori, K., Obana, S., Sako, K.: An Imple-
mentation of a Universally Verifiable Electronic Voting Scheme based
on Shuffling. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 16–30.
Springer, Heidelberg (2003)
[MOV] Menezes, van Oorschot, Vanstone: Handbook of Applied Cryptography.
CRC Press, Boca Raton
[Ne01] Neff, C.A.: A Verifiable Secret Shuffle and its Application to E-Voting.
In: ACMCCS 2001, pp. 116–125 (2001)
[OMAFO] Ookubo, M., Miura, F., Abe, M., Fujioka, A., Okamoto, T.: An im-
provement of a practical secret voting scheme. In: Information Security
Workshop 1999 (1999)
[PIK93] Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and
all/Nothing election scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993.
LNCS, vol. 765, pp. 248–259. Springer, Heidelberg (1994)
[Sak94] Sako, K.: Electronic voting schemes allowing open objection to the tally.
Transactions of IEICE E77-A (1) (Janaury 1994)
[SK94] Sako, K., Kilian, J.: Secure voting using partially compatible homo-
morphisms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839,
pp. 411–424. Springer, Heidelberg (1994)
[SK95] Sako, K., Kilian, J.: Receipt-free mix-type voting scheme. In:
Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS,
vol. 921, pp. 393–403. Springer, Heidelberg (1995)
[Schnorr] Schnorr, C.P.: Efficient signature generation by smart cards. Journal of
Cryptology 4, 161–174 (1991)
[SENSUS] http://lorrie.cranor.org/voting/sensus/