Universally Verifiable Mix-net with Verification Work Indendent of the Number of Mix-servers
暂无分享,去创建一个
[1] Josh Benaloh,et al. Receipt-free secret-ballot elections (extended abstract) , 1994, STOC '94.
[2] Kazue Sako,et al. Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth , 1995, EUROCRYPT.
[3] Patrick Horster,et al. On the Risk of Disruption in Several Multiparty Signature Schemes , 1996, ASIACRYPT.
[4] Ronald Cramer,et al. A Secure and Optimally Efficient Multi-Authority Election Scheme ( 1 ) , 2000 .
[5] Stefan Brands,et al. Rapid Demonstration of Linear Relations Connected by Boolean Operators , 1997, EUROCRYPT.
[6] Birgit Pfitzmann,et al. Breaking Efficient Anonymous Channel , 1994, EUROCRYPT.
[7] Markus Jakobsson,et al. A Practical Mix , 1998, EUROCRYPT.
[8] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[9] David Chaum,et al. Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA , 1988, EUROCRYPT.
[10] Michael J. Fischer,et al. A robust and verifiable cryptographically secure election scheme , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[11] Kaoru Kurosawa,et al. Efficient Anonymous Channel and All/Nothing Election Scheme , 1994, EUROCRYPT.
[12] Josh Benaloh,et al. Receipt-Free Secret-Ballot Elections , 1994, STOC 1994.
[13] Patrick Horster,et al. Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme , 1996, ASIACRYPT.
[14] C. Boyd,et al. Multisignatures based on zero knowledge schemes , 1991 .
[15] Matthew K. Franklin,et al. Multi-Autority Secret-Ballot Elections with Linear Work , 1996, EUROCRYPT.
[16] Atsushi Fujioka,et al. A Practical Secret Voting Scheme for Large Scale Elections , 1992, AUSCRYPT.
[17] Kazue Sako,et al. Fault tolerant anonymous channel , 1997, ICICS.