Page 249 - 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)

Anonymous One-Time Broadcast Using Non-interactive Dining Cryptographer Nets
this property is an important challenge. However, it seems that to get unconditional pri-
vacy each voter must exchange a sequence of random bits (dispose of a private channel)
with other voters or with authorities, For large elections this might be a very difficult to
accomplish. 241
Acknowledgment
I would like to thank Berry Schoenmakers, who gave important feedback on an earlier
(and erroneous) version of this paper. Ron Rivest and Madhu Sudan generously shared
information on the issues of approximating the collision probability and ballot marking.

References

1. 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)
2. Traor´e, J., Arditti, D., Girault, M.: Voting protocols — state of the art and e-poll project,
http://www.francetelecom.com/sirius/rd/fr/-memento/
mento20/chap2.html.php
3. Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commu-
nications of the ACM 24(2), 84–88 (1981)
4. Chaum, D.: Blind signatures for untraceable payments. In: CRYPTO 1982, pp. 199–203
(1982)
5. Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority
election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118.
Springer, Heidelberg (1997)
6. Chaum, D.: The Dining Cryptographers Problem: Unconditional Sender and Recipient Un-
traceability. J. Cryptology 1(1), 65–75 (1988)
7. Bos, J.: Practical Privacy. PhD thesis, Technische Universiteit Eindhoven, Eindhoven, The
Netherlands (1992)
8. Cramer, R., Franklin, M.K., Schoenmakers, B., Yung, M.: Multi-authority secret-ballot elec-
tions with linear work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070,
pp. 72–83. Springer, Heidelberg (1996)
9. Moran, T., Naor, M.: Receipt-free universally-verifiable voting with everlasting privacy. In:
Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 373–392. Springer, Heidelberg (2006)
10. Jakobsson, M., Juels, A., Rivest, R.L.: Making mix nets robust for electronic voting by ran-
domized partial checking. In: USENIX Security Symposium 2002, pp. 339–353. USENIX
(2002)
11. Cr´epeau, C., Graaf, J. van de, Tapp, A.: Committed oblivious transfer and private multi-
party computation. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 110–123.
Springer, Heidelberg (1995)