Rapid mixing and security of Chaum’s visual electronic voting

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

Volumn 2808, Issue , 2003, Pages 132-145

  Gomułkiewicz, Marcin ^a   Klonowski, Marek ^a   Kutyłowski, Mirosław ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Electronic voting; Markov chain; Mix network; Path coupling; Randomized partial checking; Rapid mixing

Indexed keywords

ELECTRONIC VOTING; MARKOV PROCESSES; MIXING; STOCHASTIC SYSTEMS; VOTING MACHINES;

ELECTRONIC VOTING; ELECTRONIC VOTING SCHEME; MIX NETWORKS; MIX SERVERS; PATH COUPLING; RANDOMIZED PARTIAL CHECKING; RAPID MIXING; SECURITY LEVEL; SECURITY STANDARDS; VISUAL CRYPTOGRAPHY;

PROBABILITY DISTRIBUTIONS;

EID: 0142250278     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39650-5_8     Document Type: Conference Paper

References (10)

1. Aldous, D.: RandomWalks of FiniteGroups and Rapidly Mixing Markov Chains. In: Azéma, J., Yor, M. (eds.): Séminare de Probabilités XVII 1981/82. Lecture Notes in Mathematics, Vol. 986. Springer-Verlag, Berlin (1983) 243-297
2. Bubley, B., Dyer, M.: Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. In: Proceedings of the 38th Symposium on Foundations of Computer Science. Miami Beach, FL, 19-22 October 1997. IEEE Computer Society Press, Los Alamitos, CA 223-231
3. Bubley, R., Dyer, M.: Faster Random Generation of Linear Extensions. In: Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms. San Francisco, CA, 25-27 January 1998. SIAM, Philadelphia, PA 355-363
4. Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. In: Communications of the ACM. (1981) 24(2):84-88
5. Chaum, D.: Secret-Ballot Receipts and Transparent Integrity. Better and Less-costly Electronic Voting at Polling Places. http://www.vreceipt.com/article.pdf
6. Czumaj, A., Kutyłowski, M.: Delayed Path Coupling and Generating Random Permutations. In: Random Structures and Algorithms. (2000) 17(3-4): 238-259
7. Czumaj, A., Kanarek, P., Kutyłowski, M., Loryś K.: Switching Networks for Generating Random Permutations. In: Switching Networks: Recent Advances. Kluwer Academic Publishers, (2001)
8. Czumaj, A., Kanarek, P., Kutyłowski, M., Loryś, K.: Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. 10th Annual Symposium on Discrete Algorithms, ACM-SIAM, New York- Philadelphia, (1999) 271-280
9. Jakobsson, M., Juels, A., Rivest, R.R.: Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking. http://www.rsasecurity.com/rsalabs/staff/bios/mjakobsson/rpcmix/rpcmix.pdf
10. Naor, M., Shamir, A.: Visual Cryptography. In: De Santis, A. (ed): Advances in Cryptology – Eurocrypt’ 94. Lecture Notes in Computer Science, Vol. 950. Springer-Verlag, Berlin (1995) 1-12