A practical secret voting scheme for large scale elections

This publication has 13 references indexed in Scilit:

• Bit Commitment Using Pseudo-Randomness
  Published by Springer Nature ,2001
• A Cryptographic Scheme for Computerized General Elections
  Published by Springer Nature ,2001
• Untraceable Electronic Cash
  Published by Springer Nature ,1990
• Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA
  Published by Springer Nature ,1988
• The dining cryptographers problem: Unconditional sender and recipient untraceability
  Journal of Cryptology, 1988
• Completeness theorems for non-cryptographic fault-tolerant distributed computation
  Published by Association for Computing Machinery (ACM) ,1988
• Security without identification: transaction systems to make big brother obsolete
  Communications of the ACM, 1985
• A robust and verifiable cryptographically secure election scheme
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Untraceable electronic mail, return addresses, and digital pseudonyms
  Communications of the ACM, 1981
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976