Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters
暂无分享,去创建一个
[1] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[2] David Chaum,et al. Evaluation of voting systems , 2004, CACM.
[3] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[4] Omer Reingold,et al. Statistically-hiding commitment from any one-way function , 2007, STOC '07.
[5] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[6] David Chaum,et al. Secret Ballot Elections with Unconditional Integrity , 2007, IACR Cryptol. ePrint Arch..
[7] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[8] Ben Adida,et al. Advances in cryptographic voting systems , 2006 .
[9] 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.
[10] Zhe Xia,et al. PrÊt À Voter: a Voter-Verifiable Voting System , 2009, IEEE Transactions on Information Forensics and Security.
[11] Alain Tapp,et al. Information-Theoretic Security Without an Honest Majority , 2007, ASIACRYPT.
[12] Alain Tapp,et al. Information-Theoretically Secure Voting Without an Honest Majority , 2008, IACR Cryptol. ePrint Arch..
[13] Jeremy Clark,et al. Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes , 2009, IEEE Trans. Inf. Forensics Secur..
[14] Warren D. Smith. Three Voting Protocols: ThreeBallot, VAV, and Twin , 2007, EVT.
[15] Adrian Kent,et al. Unconditionally Secure Bit Commitment , 1998, quant-ph/9810068.
[16] Daniele Micciancio,et al. Simultaneous broadcast revisited , 2005, PODC '05.
[17] Michael R. Clarkson,et al. Civitas: Toward a Secure Voting System , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).
[18] Baruch Awerbuch,et al. Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[19] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[20] Matthias Fitzi,et al. Detectable byzantine agreement secure against faulty majorities , 2002, PODC '02.
[21] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.