An efficient mixnet-based voting scheme providing receipt-freeness

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

Volumn 3184, Issue , 2004, Pages 152-161

  Aditya, Riza ^a   Lee, Byoungcheon ^a,b   Boyd, Colin ^a   Dawson, Ed ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b Joongbu University   (South Korea)

Author keywords

Designated verifier re encryption proof; Electronic voting; Mixnet; Randomization; Re encryption; Receipt freeness

Indexed keywords

RANDOM PROCESSES; VOTING MACHINES;

ELECTRONIC VOTING; MIX-NET; RANDOMIZATION; RE-ENCRYPTION; RECEIPT-FREENESS;

CRYPTOGRAPHY;

EID: 33750277385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30079-3_16     Document Type: Article

References (12)

1. Masayuki Abe. Mix-networks on permutations networks. In Advances in Cryptology - ASIACRYPT 99, pages 258-273, 1999.
2. Masayuki Abe and Hideki Imai. Flaws in some robust optimistic mix-nets. In Advances in Cryptology - ACISP 03, pages 39-50, 2003.
3. Riza Aditya, Colin Boyd, Ed Dawson, and Kapali Viswanathan. Secure e-voting for preferential elections. In Second International Conference, EGOV 2003, pages 246-249, 2003.
4. Josh Benaloh and Dwight Tuinstra. Receipt-free secret-ballot elections. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 544-553, 1994.
5. Dan Boneh and Philippe Golle. Almost entirely correct mixing with applications to voting. In 9th ACM Conference on Computer and Communications Security CCS 02, pages 68-77, 2002.
6. David Chaum and Torben Pryds Pedersen. Wallet databases with observers. In Advances in Cryptology - CRYPTO 92, pages 89-105, 1993.
7. Jun Furukawa and Kazue Sako. An efficient scheme for proving a shuffle. In Advances in Cryptology - CRYPTO 01, pages 368-387, 2001.
8. Philippe Golle, Sheng Zhong, Dan Boneh, Markus Jakobsson, and Ari Juels. Optimistic mixing for exit-polls. In Advances in Cryptology - ASIACRYPT 02, pages 451-465, 2002.
9. Byoungcheon Lee, Colin Boyd, Ed Dawson, Kwangjo Kim, Jeongmo Yang, and Seungjae Yoo. Providing receipt-freeness in mixnet-based voting protocols. In Information Security and Cryptology - ICISC 03, pages 245-258, 2004.
10. Torben P. Pedersen. A threshold cryptosystem without a trusted party (extended abstract). In Advances in Cryptology - EUROCRYPT 91, pages 522-526, 1991.
11. Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, November 1979.
12. Douglas Wikström. How to break, fix and optimize "optimistic mix for exit-polls". Technical report, Swedish Institute of Computer Science, 2002. Available from http://www.sics.se/libindex.htlm, last accessed 08 October 2003.