References

Abe, M., 1999. Mix-networks on permutation networks. Adv. Cryptol., 1716: 258-273.
CrossRef  |  Direct Link  |  

Benaloh, J. and D. Tuinstra, 1994. Receipt-free secret-ballot elections (extended abstract). Proceedings of the 26th Annual ACM Symposium on theory of Computing, May 23-25, 1994, Montreal, Quebec, Canada, pp: 544-553.

Cramer, R., M. Franklin, B. Schoenmakers and M. Yung, 1996. Multi-authority Secret-ballot elections with linear work. Lect. Notes Comput. Sci., 1070: 72-83.

Cramer, R., R. Gennaro and B. Schoenmakers, 1997. A secure and optimally efficient multi-authority election scheme. Eur. Trans. Telecommun., 8: 481-490.
CrossRef  |  Direct Link  |  

Fujioka, A., T. Okamoto and K. Ohta, 1992. A practical secret voting scheme for large-scale elections. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, December 13-16, 1992, Springer-Verlag, London, UK., pp: 244-251.

Jakobsson, M., 1998. A practical mix. Adv. Cryptol., 1403: 448-461.
CrossRef  |  

Juang, W. and C. Lei, 1997. A secure and practical electronic voting scheme for real world environment. IEICE Trans. Fundam., E80-A: 64-71.

Kazue, S., 1994. Electronic voting schemes allowing open objection to the tally. Trans. IEICE, E77-A: 24-30.

Okamoto, T., 1997. Receipt-free electronic voting schemes for large scale elections. Proceedings of the 5th International Workshop on Security Protocols, April 7-9, 1997, Paris, France, pp: 25-35.

Sako, K. and J. Kilian, 1994. Secure voting using partially compatible homomorphisms. Lect. Notes Comput. Sci., 839: 411-424.
CrossRef  |  Direct Link  |  

Sako, K. and J. Kilian, 1995. Receipt-free mixtype voting scheme a practical solution to the implementation of a voting booth. Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, May 21-25, 1995, Saint-Malo, France, pp: 393-403.