Simple and efficient hash-based verifiable mixing for remote electronic voting
- 17 November 2009
- journal article
- Published by Elsevier in Computer Communications
- Vol. 33 (6) , 667-675
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Distributed Verification of Mixing - Local Forking Proofs ModelLecture Notes in Computer Science, 2008
- An Efficient Aggregate Shuffle Argument SchemeLecture Notes in Computer Science, 2007
- The VoteSecureTM Secure Internet Voting System2005
- An Efficient Scheme for Proving a Shuffle2001
- Wallet Databases with Observers2001
- Universally verifiable mix-net with verification work independent of the number of mix-servers1998
- A practical secret voting scheme for large scale elections1993
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- A robust and verifiable cryptographically secure election scheme1985
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981