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

Unconditionally Secure Electronic Voting
123
9. Cr´peau, C.: Efficient cryptographic protocols based on noisy channels. In:
e
Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 306–317. Springer,
Heidelberg (1997)
10. 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)
11. Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In:
FOCS 1987, pp. 427–437 (1987)
12. Fujisaki, E., Okamoto, T.: A practical and provably secure scheme for publicly
verifiable secret sharing and its applications. In: Nyberg, K. (ed.) EUROCRYPT
1998. LNCS, vol. 1403, pp. 32–46. Springer, Heidelberg (1998)
13. Hanaoka, G., Imai, H., M¨uller-Quade, J., Nascimento, A.C.A., Otsuka, A.,
Winter, A.J.: Information theoretically secure oblivious polynomial evaluation:
Model, bounds, and constructions. In: Wang, H., Pieprzyk, J., Varadharajan, V.
(eds.) ACISP 2004. LNCS, vol. 3108, pp. 62–73. Springer, Heidelberg (2004)
14. Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized
cipher. Journal of Cryptology 5(1), 53–66 (1992)
15. Moran, T., Naor, M.: Receipt-free universally-verifiable voting with everlasting pri-
vacy. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 373–392. Springer,
Heidelberg (2006)
16. Naor, M., Pinkas, B.: Oblivious Transfer and Polynomial Evaluation. In: STOC
1999, pp. 245–254 (1999)
17. Nascimento, A.C.A., M¨uller-Quade, J., Otsuka, A., Hanaoka, G., Imai, H.: Uncon-
ditionally non-interactive verifiable secret sharing secure against faulty majorities
in the commodity based model. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS
2004. LNCS, vol. 3089, pp. 355–368. Springer, Heidelberg (2004)
18. Rivest, R.: Unconditionally secure commitment and oblivious transfer schemes us-
ing private channels and a trusted initializer (manuscript)
19. Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its appli-
cation to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666,
pp. 148–164. Springer, Heidelberg (1999)
20. Shor, P.W.: Polynomial-Time Algorithms for Prime Factorization and Discrete
Logarithms on a Quantum Computer. SIAM J. Comput. 26(5), 1484–1509 (1997)
21. Shamir, A., Tromer, E.: Factoring large numbers with the TWIRL device. In:
Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 1–26. Springer, Heidelberg
(2003)
22. Stadler, M.A.: Publicly verifiable secret sharing. In: Maurer, U.M. (ed.)
EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996)