An improvement on a practical secret voting scheme

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

Volumn 1729, Issue , 1999, Pages 225-234

  Ohkubo, Miyako ^a   Miura, Fumiaki ^a   Abe, Masayuki ^a   Fujioka, Atsushi ^a   Okamoto, Tatsuaki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

OKAMOTO; ROUND COMPLEXITY; VOTING SCHEMES;

SECURITY OF DATA;

EID: 84948123363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47790-x_19     Document Type: Conference Paper

References (28)

1. M. Abe, Universally Verifiable Mix-Net with Verification Work Independent of The Number Of Mix-Servers, in Advances in Cryptology | EUROCRYPT '98, Lecture Notes in Computer Science 1403, Springer-Verlag, Berlin, pp.437-447 (1998).
2. M. Abe, A Mix-network on Permutation Networks, IEICE Technical Report (May, 1999).
3. M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.1-10 (May, 1988).
4. J. Benaloh and M. Yung, Distributing the Power of a Government to Enhance the Privacy of Votes, Proceedings of the 5th ACM Symposium on Principles of Distributed Computing, pp.52-62 (Aug., 1986).
5. D. L. Chaum, Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM, Vol.24, No.2, pp.84-88 (Feb., 1981).
6. D. Chaum, Security without Identification: Transaction systems to Make Big Brother Obsolete, Communications of the ACM, Vol.28, No.10, pp.1030-1044 (Oct., 1985).
7. D. Chaum, The Dining Cryptographers Problem: Unconditional Sender and Re-cipient Untraceability, Journal of Cryptology, Vol.1, No.1, pp.65-75 (1988).
8. D. Chaum, Elections with Unconditionally-Secret Ballots and Disruption Equiv-alent to Breaking RSA, in Advances in Cryptology | EUROCRYPT '88, Lecture Notes in Computer Science 330, Springer-Verlag, Berlin, pp.177-182 (1988).
9. L. F. Cranor and R. K. Cytron, Design and Implementation of a Practical Security-Conscious Electronic Polling System, WUCS-96-02, Deportment of Com-puter Science, Washington University, St. Louis (Jan., 1996).
10. D. Chaum, C. Crépeau, and I. Damgård, Multiparty Unconditionally Secure Protocols, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.11-19 (May, 1988).
11. R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung, Multi-Authority Secret-Ballot Elections with Linear Work, in Advances in Cryptology | EURO-CRYPT '96, Lecture Notes in Computer Science 1070, Springer-Verlag, Berlin, pp.72-83 (1996).
12. J. Cohen and M. Fisher, A Robust and Verifiable Cryptographically Secure Election Scheme, 26th Annual Symposium on Foundations of Computer Science, IEEE, pp.372-382 (Oct., 1985).
13. R. Cramer, R. Gennaro, and B. Schoenmakers, A Secure and Optimally Efficient Multi-Authority Election Scheme, in Advances in Cryptology | EURO-CRYPT '97, Lecture Notes in Computer Science 1233, Springer-Verlag, Berlin, pp.103-118 (1997).
14. J. Camenisch, J. Pireteau, and M. Stadler, Blind Signatures based on the Discrete Logarithm Problem, in Advances in Cryptology | EUROCRYPT '94, Lecture Notes in Computer Science 950, Springer-Verlag, Berlin, pp.428-432 (?1994?).
15. Y. G. Desmedt and Y. Frankel, Threshold Cryptosystems, in Advances in Cryp-tology | CRYPTO '89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, pp.307-315 (1990).
16. W. Diffie and M. E. Hellman, New Directions in Cryptography, IEEE Transac-tions on Information Theory, Vol.IT-22, No.6, pp.644-654 (Nov., 1976).
17. A. Fujioka, T. Okamoto, and K. Ohta. A Practical Secret Voting Scheme for Large Scale Elections, in Advances in Cryptology | AUSCRYPT '92, Lecture Notes in Computer Science 718, Springer-Verlag, Berlin, pp.244-251 (1993).
18. O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp.218-229 (May, 1987).
19. M. A. Herschberg, Secure Electronic Voting Over the World Wide Web, Master Thesis in Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1997).
20. M. Jakobsson, A Practical Mix, in Advances in Cryptology | EUROCRYPT '98, Lecture Notes in Computer Science 1403, Springer-Verlag, Berlin, pp.448-461 (1998).
21. A. Pfitzmann, A Switched Broadcast ISDN to Decrease User Observability, 1984 International Zurich Seminar on Digital Communications, IEEE, pp.183-190 (Mar., 1984).
22. C. Park, K. Itoh, and K. Kurosawa, Efficient Anonymous Channel and All/Nothing Election Scheme, in Advances in Cryptology | EUROCRYPT '93, Lecture Notes in Computer Science 765, Springer-Verlag, Berlin, pp.248-259 (1994).
23. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani, Fault Tolerant Anonymous Channel, in ICICS98, Lecture Notes in Computer Science 1334, Springer-Verlag, Berlin, pp.440-444 (1998).
24. R. Rivest, A. Shamir, and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Vol. 21, No. 2, pp. 120-126 (Feb., 1978).
25. C. P. Schnorr, Efficient Signature Generation for Smart Cards, Journal of Cryp-tology, Vol.3, No.4, pp.239-252 (1991).
26. B. Schoenmakers, A Simple Publicly Verifiable Secret Sharing Scheme and its Application to Electronic Voting, Crypto '99 (To appear).
27. K. Sako and J. Kilian, Secure Voting using Partially Compatible Homomor-phisms, in Advances in Cryptology | CRYPTO '94, Lecture Notes in Computer Science 839, Springer-Verlag, Berlin, pp.411-424 (1994).
28. K. Sako and J. Kilian, Receipt-Free Mix-Type Voting Scheme | A Practical Solution to the Implementation of a Voting Booth |, in Advances in Cryptology | EUROCRYPT '95, Lecture Notes in Computer Science 921, Springer-Verlag, Berlin, pp.393-403 (1995).