An Efficient E2E Verifiable E-voting System without Setup Assumptions
暂无分享,去创建一个
[1] Jeremy Clark,et al. Scantegrity: End-to-End Voter-Verifiable Optical- Scan Voting , 2008, IEEE Security & Privacy.
[2] Ben Adida,et al. Helios: Web-based Open-Audit Voting , 2008, USENIX Security Symposium.
[3] Josh Benaloh,et al. Simple Verifiable Elections , 2006, EVT.
[4] Ivan Damgård,et al. Publicly Auditable Secure Multi-Party Computation , 2014, SCN.
[5] Michael J. Fischer,et al. A robust and verifiable cryptographically secure election scheme , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[6] Jeremy Clark,et al. Scantegrity II: End-to-End Verifiability by Voters of Optical Scan Elections Through Confirmation Codes , 2009, IEEE Transactions on Information Forensics and Security.
[7] Yehuda Lindell,et al. Secure Computation Without Authentication , 2005, Journal of Cryptology.
[8] Aggelos Kiayias,et al. End-to-End Verifiable Elections in the Standard Model , 2015, EUROCRYPT.
[9] Jeremy Clark,et al. Remotegrity: Design and Use of an End-to-End Verifiable Remote Voting System , 2013, ACNS.
[10] Ralf Küsters,et al. Clash Attacks on the Verifiability of E-Voting Systems , 2012, 2012 IEEE Symposium on Security and Privacy.
[11] Josh Benaloh,et al. Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.
[12] David Chaum,et al. Wallet Databases with Observers , 1992, CRYPTO.
[13] Josh Benaloh,et al. Secret sharing homomorphisms: keeping shares of a secret secret , 1987, CRYPTO 1987.
[14] Ronald Cramer,et al. A secure and optimally efficient multi-authority election scheme , 1997, Eur. Trans. Telecommun..