1[1]Cramer R, Gennaro R, Schoenmakers B. A Secure and Optimally Eifficient Multi-authority Election Scheme.In European Transactions on Telecommunications ,1997, 8(5):481-490
2[2]Radwin M J. An Untraceable, Universally Verifiable Voting Scheme. Seminar in Cryptology Professor Philip Klein, 1995-12
3[3]A Verifiable Multi-authroties Secret Election Allowing Abstaining from Voting. 1998
4[4]Hevia A, Kivi M. Electronic Jury Voting Protocols. http:// cite- seer.nj. nec.com/hevia01electronic.html, 2001
5[6]Cramer R. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In Advances in Cryptology-CRYPTO94, Springer-Verlag. 1994
1Fujioka A , Okamoto T, Ohta K. A Practical Secret Voting Scheme for Lage Scale Elections[C]. AUS- CRYPT'92. LNCS 718, Berlin, Springer-verlag, 1993.-244-251.
2Benaloh J, Tuinstra D. Receipt-free Secret-ballot E1- lections[-C]. In Proceeding of the 26th Symposium on The Theory of Computing (STOC" 94), Montreal, 1994:544-553.
3Martin H, Sako K. Efficient Receipt-free Voting Based on Homomorphic Encryption [C]. EURO-CRYPT'00. LNCS 921, Berlin, Springer-verlag, 2000:393-403.
4Lee B, Kim K. Receiptfree Electronic Voting through Collaboration of Voter and Honest Verifier[C]. In: Proceeding of JWISC2000, Okinawa, Japan, 2000 : 101 -108.
5J. Camenisch. Efficient and Generalized Group Signa- tures[C]. In W. Fumy, eds. Advances in Cryptolo- gy-EUROCRYPT'97, LNCS 1233, Springer- Verlag, 1997:465-479.
6G. Ateniese, J. Camenisch, M. Joye, G. Tsudik. A Practical and Provably Secure Coalition-resistant Group Signature Scheme[C]. In: Advances in Cryp- tology-CRYPTO'00, LNCS 1880, Springer-verlag, 2000:255-270.
