D. Bernhard, V. Cortier, O. Pereira, B. Smyth, and B. Warinschi, Adapting Helios for Provable Ballot Privacy, ESORICS'11, pp.335-354
DOI : 10.1007/978-3-642-23822-2_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.259.266

D. Bernhard, O. Pereira, and B. Warinschi, How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios, ASIACRYPT, pp.626-643, 2012.
DOI : 10.1007/978-3-642-34961-4_38

R. Buckland and R. Wen, The Future of E-voting in Australia, IEEE Security & Privacy, vol.10, issue.5, pp.25-32, 2012.
DOI : 10.1109/MSP.2012.59

C. Burton, C. Culnane, J. Heather, T. Peacock, P. Y. Ryan et al., A supervised verifiable voting protocol for the victorian electoral commission, E-Voting'12, pp.81-94

C. Burton, C. Culnane, J. Heather, T. Peacock, P. Y. Ryan et al., Using prêtprêt`prêtà voter in victorian state elections, EVT/WOTE'12. USENIX, 2012.

D. Chaum and T. P. Pedersen, Wallet Databases with Observers, CRYPTO'92, pp.89-105
DOI : 10.1007/3-540-48071-4_7

J. Groth and S. Lu, A Non-interactive Shuffle with Pairing Based Verifiability, ASIACRYPT, LNCS series, pp.51-67, 2007.
DOI : 10.1007/978-3-540-76900-2_4

M. Jakobsson, R. Juels, and . Rivest, Making mix nets robust for electronic voting by randomized partial checking, EVT/WOTE. USENIX, 2002.

D. Khader and P. Y. Ryan, Receipt freeness of prêtprêt`prêtà voter provably secure, IACR Cryptology ePrint Archive, p.594, 2011.

S. Khazaei and D. Wikström, Randomized Partial Checking Revisited, CT-RSA, pp.115-128, 2013.
DOI : 10.1007/978-3-642-36095-4_8

. Koblitz, A course in number theory and cryptography, 1987.

H. Lipmaa and B. Zhang, A more efficient computationally sound non-interactive zero-knowledge shuffle argument, Security and Cryptography for Networks, pp.477-502, 2012.

J. Loftus, A. May, N. P. Smart, and F. Vercauteren, On CCA-Secure Somewhat Homomorphic Encryption, SAC'11, pp.55-72
DOI : 10.1007/978-3-642-13013-7_25

H. Martin and K. Sako, Efficient receipt-free voting based on homomorphic encryption, EUROCRYPT'00, pp.539-556

T. P. Pedersen, A Threshold Cryptosystem without a Trusted Party, EURO- CRYPT, number 547 in LNCS, pp.522-526, 1991.
DOI : 10.1007/3-540-46416-6_47

P. Y. Ryan, A variant of the Chaum voter-verifiable scheme, Proceedings of the 2005 workshop on Issues in the theory of security , WITS '05, pp.81-88, 2005.
DOI : 10.1145/1045405.1045414

P. Y. Ryan and T. Peacock, Threat analysis of cryptographic election schemes, 2006.

P. Y. Ryan, D. Bismark, J. Heather, S. Schneider, and Z. Xia, <emphasis emphasistype="italic">Pr&#x00CA;t &#x00C0; Voter:</emphasis> a Voter-Verifiable Voting System, IEEE Transactions on Information Forensics and Security, vol.4, issue.4, pp.662-673, 2009.
DOI : 10.1109/TIFS.2009.2033233

P. Y. Ryan and T. Peacock, PrêtPrêtà voter: a systems perspective, CS, 2005.

D. Wikström, A Universally Composable Mix-Net, TCC, pp.317-335, 2004.
DOI : 10.1007/978-3-540-24638-1_18

Z. Xia, C. Culnane, J. Heather, H. Jonker, P. Y. Ryan et al., Versatile PrêtPrêt`Prêtà Voter : Handling Multiple Election Methods with a Unified Interface, INDOCRYPT, pp.98-114, 2010.