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

M. Hirt
80
References
Cohen Benaloh, J.D.: Verifiable Secret-Ballot Elections. PhD thesis, Yale
[Ben87]
University (December 1987)
+
[BFP 01] Baudron, O., Fouque, P.-A., Pointcheval, D., Poupard, G., Stern, J.: Prac-
tical multi-candidate election system. In: Proc. 20th ACM Symposium on
Principles of Distributed Computing PODC (2001)
[BT94] Cohen Benaloh, J.D., Tuinstra, D.: Receipt-free secret-ballot elections
(extended abstract). In: Proc. 26th ACM Symposium on the Theory of
Computing (STOC), pp. 544–553. ACM, New York (1994)
[BY86] Cohen Benaloh, J.D., Yung, M.: Distributing the power of a government
to enhance the privacy of voters. In: Proc. 5th ACM Symposium on Prin-
ciples of Distributed Computing (PODC), August 1986, pp. 52–62 (1986)
[CD98] Cramer, R., Damg˚rd, I.B.: Zero-knowledge proofs for finite field arith-
a
metic or: Can zero-knowledge be for free? In: Krawczyk, H. (ed.)
CRYPTO ’98. LNCS, vol. 1462, pp. 424–441. Springer, Heidelberg (1998)
[CF85] Cohen Benaloh, J.D., Fischer, M.J.: A robust and verifiable cryptographi-
cally secure election scheme. In: Proc. 26th IEEE Symposium on the Foun-
dations of Computer Science (FOCS), pp. 372–382. IEEE, Los Alamitos
(1985)
[CFSY96] Cramer, R., Franklin, M.K., Schoenmakers, B., Yung, M.: Multi-
authority secret-ballot elections with linear work. In: Maurer, U.M. (ed.)
EUROCRYPT ’96. LNCS, vol. 1070, pp. 72–83. Springer, Heidelberg
(1996)
[CG96] Canetti, R., Gennaro, R.: Incoercible multiparty computation. In:
Proc. 37th IEEE Symposium on the Foundations of Computer Science
(FOCS), pp. 504–513 (1996)
[CGS97] Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally effi-
cient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT
’97. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997)
[Cha81] Chaum, D.: Untraceable electronic mail, return addresses, and digital
pseudonyms. Communications of the ACM 24(2), 84–88 (1981)
[Cha89] Chaum, D.: Elections with unconditionally-secret ballots and disruption
equivalent to breaking RSA. In: G¨unther, C.G. (ed.) EUROCRYPT ’88.
LNCS, vol. 330, pp. 177–182. Springer, Heidelberg (1988)
[CP92] Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell,
E.F. (ed.) CRYPTO ’92. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg
(1993)
[Cra96] Cramer, R.: Modular Design of Secure yet Practical Cryptographic Pro-
tocols. PhD thesis, CWI and Univ. of Amsterdam (November 1996)
[DJ01] Damg˚ard, I., Jurik, M.: A generalisation, a simplification and some ap-
plications of paillier’s probabilistic public-key system. In: International
Workshop on Practice and Theory in Public Key Cryptography, PKC
2001 (2001)
[ElG84] El Gamal, T.: A public key cryptosystem and a signature scheme based
on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO ’84.
LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)
[FOO92] Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for
large scale elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT ’92.
LNCS, vol. 718, pp. 244–251. Springer, Heidelberg (1993)