Providing Receipt-Freeness in Mixnet-Based Voting Protocols
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 245-258
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Flaws in Some Robust Optimistic Mix-Nets2003
- Optimistic Mixing for Exit-Polls2002
- An Efficient Scheme for Proving a Shuffle2001
- Mix-Networks on Permutation Networks1999
- Universally verifiable mix-net with verification work independent of the number of mix-servers1998
- A Secure and Optimally Efficient Multi-Authority Election Scheme1997
- Multi-Authority Secret-Ballot Elections with Linear Work1996
- Receipt-free secret-ballot elections (extended abstract)1994
- A practical secret voting scheme for large scale elections1993
- Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA1988