Demirel, Denise; Technical University of Darmstadt, Germany
Jonker, Hugo ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Volkamer, Melanie; Technical University of Darmstadt, Germany
Language :
English
Title :
Random block verification: Improving the Norwegian electoral mix net
Publication date :
2012
Event name :
Electronic Voting 2012
Event place :
Bregenz, Austria
Event date :
July 2012
Audience :
International
Main work title :
Proc. 5th International Conference on Electronic Voting (EVOTE'12)
Publisher :
Gesellschaft für Informatik e.V.
ISBN/EAN :
978-3-88579-299-4
Collection name :
Lecture Notes in Informatics; 205
Pages :
65-78
Peer reviewed :
Peer reviewed
Commentary :
Lecture Notes in Informatics 205
Proceedings of the 5th International Conference on Electronic Voting (EVOTE 2012)
Puiggalí Allepuz, J., Guasch Castelló, S.: Universally verifiable efficient reencryption mixnet. In: Proc. EVOTE 2010. LNI, vol. P-167, pp. 241-254. GI (2010)
Boneh, D., Golle, P.: Almost entirely correct mixing with applications to voting. In: Proc. CCS'02. pp. 68-77. ACM (2002)
Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24(2), 84-88 (1981)
Chaum, D., Pedersen, T.: Wallet databases with observers. In: Brickell, E. (ed.) CRYPTO'92, LNCS, vol. 740, pp. 89-105. Springer (1993)
Desmedt, Y., Kurosawa, K.: How to break a practical mix and design a new one. In: EUROCRYPT 2000. LNCS, vol. 1807, pp. 557-572. Springer (2000)
Elgamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Proc. CRYPTO'84, pp. 10-18. Springer New York, Inc., New York, NY, USA (1985)
Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Advances in Cryptology - CRYPTO'86. LNCS, vol. 263, pp. 186-194. Springer (1986)
Gjøsteen, K.: Analysis of an internet voting protocol. Cryptology ePrint Archive, Report 2010/380 (2010), http://eprint.iacr.org/
Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.: Optimistic mixing for exitpolls. In: Asiacrypt 2002, LNCS 2501. pp. 451-465. Springer-Verlag (2002)
Groth, J.: A verifiable secret shuffle of homomorphic encryptions. vol. 23, pp. 546- 579 (2010)
Jakobsson, M., Juels, A.: Millimix: Mixing in small batches. Tech. rep., Center for Discrete Mathematics #38; Theoretical Computer Science (1999)
Jakobsson, M., Juels, A., Rivest, R.L.: Making mix-nets robust for electronic voting by randomized partial checking. In: Proc. USENIX'02 (2002)
Neff, C.A.: A verifiable secret shuffle and its application to e-voting. In: CCS'01. pp. 116-125. ACM, New York, NY, USA (2001)
Schnorr, C.p.: Efficient signature generation by smart cards. Journal of Cryptology 4, 161-174 (1991).
Sako, K., Kilian, J.: Receipt-free mix-type voting scheme. In: Guillou, L.,Quisquater, J.J. (eds.) Proc. EUROCRYPT'95. LNCS, vol. 921, pp. 393-403. Springer (1995)
Terelius, B., Wikström, D.: Proofs of restricted shuffles. In: AFRICACRYPT'10. LNCS, vol. 6055, pp. 100-113. Springer (2003)
Wikström, D.: Five practical attacks for "optimistic mixing for exit-polls". In: Selected Areas in Cryptography. pp. 160-175 (2003)
Wikström, D.: A commitment-consistent proof of a shuffle. In: Proc. 14th Australasian Conference on Information Security and Privacy, LNCS, vol.5594, pp. 407-421. Springer-Verlag, Berlin, Heidelberg (2009)