| [1] |
KIAYIAS A , YUNG M . Self-tallying elections and perfect ballot secrecy[A]. Proceedings of PKC'02[C]. Paris,France, 2002. 141-158.
|
| [2] |
DAMARD I , JURIK M . A length-flexible threshold cryptosystem with applications[A]. Proceedings of ACISP'03[C]. Wollongong,Australia, 2003. 350-364.
|
| [3] |
GROTH J . Efficient maximal privacy in boardroom voting and anonymous broadcast[A]. Proceedings of Financial Cryptography 2004[C]. Florida,USA, 2004. 90-104.
|
| [4] |
FENG HAO , PETER R , PIOTR Z . Anonymous voting by 2-round public discussion[J]. IET Information Security, 2010,4(2): 62-67.
|
| [5] |
CHAUM D . The dining cryptographers problem:unconditional sender and recipient untraceability[J]. Journal of Cryptology, 1988,1(1): 65-75.
|
| [6] |
CRAMER R , FRANKLIN M , SCHOENMACKERS B , YUNG M . Multi-Authority secret-ballot elections with linear work[A]. Advances in Cryptology–Eurocrypt’96[C]. Zaragoza,Spain, 1996. 72-83.
|
| [7] |
CRAMER R , FRANKLIN M , SCHOENMACKERS B . A secure and optimally efficient multi-authority election scheme[A]. Advances in Cryptology–Eurocrypt’97[C]. Konstanz,Germany, 1997. 113-118.
|
| [8] |
CHAUM D . Untraceable electronic mail,return addresses,and digital pseudonyms[J]. Communications of the ACM, 1981,24(2): 84-88.
|
| [9] |
FUJIOKA A , OKAMOTO T , OHTA K . A practical secret voting scheme for large scale elections[A]. Advances in CryptologyAsiacrypt’92[C]. Queensland,Australia, 1992. 244-251.
|
| [10] |
NEFF A . A verifiable secret shuffle and its application to E-voting[A]. Proceedings of ACM CCS’01[C]. New York,USA, 2001. 116-125.
|
| [11] |
OKAMOTO T . An electronic voting scheme[A]. Proceedings of IFIP’96[C]. 1996. 21-30.
|
| [12] |
OHKUBO M , MIURA F , ABE M ,et al. An improvement on a practical secret voting scheme[A]. Proceedings of ISW’99[C]. Lumpur,Malaysia, 1999. 255-234.
|
| [13] |
CHAUM D . Elections with unconditionally secret ballots and disruption equivalent to breaking RSA[A]. Proceedings of Eurocrypt’ 88[C]. Davos,Switzerland, 1988. 177-182.
|
| [14] |
PFITZMANN B , WAIDNER M . Unconditionally untraceable and fault-tolerant broadcast and secret ballot election[J]. Communications of the ACM, 1992,21(21): 7-18.
|
| [15] |
DOLEV D , STRONG H . Authenticated alogorithms for byzantine agreement[J]. SIAM Journal on Computing, 1983,12(4): 656-666.
|
| [16] |
CACHIN C , KURSAWE K , SHOUP V . Random oracles in constantinople:practical asynchronous byzantine agreement using cryptography[J]. Journal of Cryptology, 2005,18(3): 219-246.
|
| [17] |
PEDERSEN P . Non-interactive and information theoretic secure verifiable secret sharing[A]. Advances in Cryptology-Crypto'91[C]. Santa Barbara,California,USA, 1991. 129-140.
|
| [18] |
CRAMER R , DAMGARD I , SCHOENMAKERS B . Proofs of partial knowledge and simplified design of witness hiding orotocols[A]. Advances in Cryptology-Crypto ’94[C]. Santa Barbara,California,USA, 1994. 174-187.
|
| [19] |
FIAR A , SHAMIR A . How to prove yourself:practical solutions to identification and signature problems[A]. Advances in Cryptology-Crypto ’86[C]. Santa Barbara,California,USA, 1986. 186-194.
|
| [20] |
BELLARE M , ROGAWAY P . Random oracles are practical:a paradigm for designing efficient protocols[A]. Proceedings of ACM CCS’93[C]. Fairfax,Virginia,USA, 1993. 62-73.
|
| [21] |
HAO F , ZIELINSKI P . The power of anonymous veto in public discussion[J]. Trans on Computational Science, 2009,4: 41-52.
|
