A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting
- 16 December 1999
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 148-164
- https://doi.org/10.1007/3-540-48405-1_10
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding ProtocolsPublished by Springer Science and Business Media LLC ,2007
- Transferred Cash Grows in SizePublished by Springer Science and Business Media LLC ,2001
- Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)Published by Springer Science and Business Media LLC ,2000
- A Secure and Optimally Efficient Multi-Authority Election SchemeLecture Notes in Computer Science, 1997
- Digital payment systems with passive anonymity-revoking trusteesLecture Notes in Computer Science, 1996
- Multi-Authority Secret-Ballot Elections with Linear WorkLecture Notes in Computer Science, 1996
- A practical scheme for non-interactive verifiable secret sharingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Distributing the power of a government to enhance the privacy of votersPublished by Association for Computing Machinery (ACM) ,1986
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A robust and verifiable cryptographically secure election schemePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985