Receipt-free electronic voting schemes for large scale elections

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1361, Issue , 1998, Pages 25-35

  Okamoto, Tatsuaki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY; VOTING MACHINES;

ELECTRONIC VOTING SCHEME; LARGE SCALE ELECTION; PHYSICAL ASSUMPTIONS; RECEIPT-FREE; RECEIPT-FREENESS; VOTING BOOTHS; VOTING SCHEMES;

ELECTRONIC VOTING;

EID: 84956974327     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028157     Document Type: Conference Paper

References (23)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation". Proc, of STOC'88, pp.1-10 (1988).
2. J. Benaloh and D. Tuinstra, "Receipt-Free Secret-Ballot Elections". Proc. of STOC'94, pp.544-553 (1994).
3. J. Benaloh and M. Yung, "Distributing the Power of a Government to Enhance the Privacy of Votes", Proc. of PODC'86, pp.52-62 (1986).
4. D. Chaum, "Untraceable Electronic Mail, Return Addresses. and Digital Pseudonyms", Communications of the ACM, Vol.24, No.2, pp.84-88 (1981).
5. D. Chaum, "Security without Identification: Transaction systems to Make Big Brother Obsolete", Communications of the ACM, Vol.28, No.10, pp.1030-1044 (1985).
6. D. Chaum, "Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA", Proceedings of Eurocrypt'g8, LNCS 330, Springer. Verlag, pp.177-182 (1988).
7. D. Chaum, C. Crépeau, and I. Damgård, "Multiparty Unconditionally Secure Protocols", Proc. of STOC'88, pp.11-19 (1988).
8. J. Cohen and M. Fisher, "A Robust and VerifiaMe Cryptographically Secure Election Sdmme", Proc. of FOCS, pp.372-382 (1985).
9. R. Cramer, M. Franklin, B. Schoemnakers, and M. Yung, "Multi-Authority Secret-Ballot Elections with Linear Work", Proc. of Eurocrypt'96, LNCS 1070, Springer-Verlag, pp.72-82 (1996).
10. P. Feldman, "A Practical Scheme for Non-interactive Verifiable Secret Sharing", Proc. of FOCS, pp. 427-437 (1987).
11. Feige, U., Fiat, A. and Shamir, A.: Zero-Knowledge Proofs of Identity, Journal of CRYPTOLOGY, Vol. 1, Number 2 pp.77-94(1988).
12. A. Fujioka, T. Okamoto, and K. Ohta, "A Practical Secret. Voting Scheme for Large Scale Elections", Proc. of Auscrypt '92, LNCS, Springer-Verlag, pp. 244-251 (1992).
13. O. Goldreich, S. Micali, and A. Wigderson, "How to Play Any Mental Game, or a Completeness Theorem for Protocols with Honest Majority", Proc. Of STOC, pp.218-229 (1987).
14. K. R. Iversen, "A Cryptographie Scheme for Computerized General Elections", Proc. of Crypto '91, LNCS 576, Springer-Verlag, pp.405-419 (1992).
15. M. Jakobsson, K. Sako, and R. Impagliazzo, "Designated Verifier Proofs and Their Applications", Proc. of Euroerypt '96, LNCS 1070, Springer-Verlag, pp.143-154 (1996).
16. M. Michels, "Comments on a receipt-free voting scheme", manuscript (Jan. 1997).
17. T. Okamoto, "An Electronic Voting Scheme", Proc. of IFIP'96, Advanced IT Tools, Chapman & Hall, pp. 21-30 (1996).
18. Tompa, M. and Woll, H.: Random SelfReducibitity and Zero Knowledge Interactive Proofs of Possession of Information, Proc. of FOCS'87, pp.472-482 (1987).
19. Pedersen, T. P., "Distributed Provers with Applications to Undeniable Signatures", Proceedings of Eurocrypt 91 (1992).
20. Pedersen, T. P., "Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing", Proceedings of Crypto 91, pp. 129-140 (1992).
21. Schnorr, C.P., "Efficient Signature Generation by Smart Cards", Journal of Cryptology, Vol. 4, No. 3, pp.161-174 (1991).
22. K. Sako, and J. Kilian, "Secure Voting Using Partially Compatible Homomorphisms', Proc. of Crypto'94, LNCS 839, Springer-Verlag, pp.411-424 (1994).
23. K. Sako, and J. Kilian, "Receipt-Free Mix-type Voting Scheme", Proc. Of Eurocrypt'95, LNCS 921, Springer-Verlag, pp.393-403 (1995).