M. Abadi and J. Feigenbaum, Secure circuit evaluation, Journal of Cryptology, vol.18, issue.1, pp.1-12, 1990.
DOI : 10.1007/BF02252866

O. Baudron, P. A. Fouque, D. Pointcheval, G. Poupard, and J. Stern, Practical multi-candidate election system, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing , PODC '01, 2001.
DOI : 10.1145/383962.384044

URL : https://hal.archives-ouvertes.fr/inria-00565273

O. Baudron and J. Stern, Non-interactive Private Auctions, Financial Crypto '01, 2001.
DOI : 10.1007/3-540-46088-8_28

J. Benaloh, Verifiable Secret-Ballot Elections, 1987.

D. Boneh and R. Lipton, Searching for Elements in Black-Box Fields and Applications, Crypto '96, pp.283-297, 1996.

H. Cohen, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, vol.138, 1993.
DOI : 10.1007/978-3-662-02945-9

J. Cohen and M. Fisher, A robust and verifiable cryptographically secure election scheme, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.
DOI : 10.1109/SFCS.1985.2

R. Cramer, I. Damgård, and J. B. Nielsen, Multiparty computation from threshold homomorphic encryption, Eurocrypt '01, pp.280-300, 2001.

I. Damgård and M. Jurik, Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes, PKC '01, pp.119-136, 1992.
DOI : 10.7146/brics.v7i5.20133

H. Daudé, B. Flajolet, and . Vallée, An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction, Combinatorics, Probability and Computing, vol.6, issue.4, pp.397-433, 1997.
DOI : 10.1017/S0963548397003258

J. Feigenbaum and M. Merritt, Open Questions, Talks Abstracts, and Summary of Discussions, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.2, pp.1-45, 1991.

P. A. Fouque, G. Poupard, and J. Stern, Sharing Decryption in the Context of Voting or Lotteries, Financial Crypto '00, 2000.
DOI : 10.1007/3-540-45472-1_7

URL : https://hal.archives-ouvertes.fr/inria-00565275

S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Sciences, vol.28, issue.2, 1984.
DOI : 10.1016/0022-0000(84)90070-9

A. Joux, La Réduction des Réseaux en Cryptographie, 1993.

D. Naccache and J. Stern, A new public key cryptosystem based on higher residues, Proceedings of the 5th ACM conference on Computer and communications security , CCS '98, pp.59-66, 1998.
DOI : 10.1145/288090.288106

T. Okamoto and S. Uchiyama, A new public-key cryptosystem as secure as factoring, Eurocrypt '98, LNCS 1403, pp.308-318, 1998.
DOI : 10.1007/BFb0054135

P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, Eurocrypt '99, pp.223-238, 1999.
DOI : 10.1007/3-540-48910-X_16

G. Poupard and J. Stern, Fair Encryption of RSA Keys, Proceedings of Eurocrypt, pp.172-189, 2000.
DOI : 10.1007/3-540-45539-6_13

R. Rivest, L. Adleman, and M. L. Dertouzos, On Data Banks and Privacy Homomorphisms, Foundations of Secure Computation, pp.169-179, 1978.

T. Sander, A. Young, and M. Yung, Non-Interactive CryptoComputing for N C 1, Proc. of the 31st STOC. ACM, 1999.

V. Shoup, Number Theory Library (NTL) Can be obtained at http

B. Vallée, Gauss' algorithm revisited, Journal of Algorithms, vol.12, issue.4, pp.556-572, 1991.
DOI : 10.1016/0196-6774(91)90033-U

S. Vanstone and R. Zuccherato, Elliptic Curve Cryptosystem Using Curves of Smooth Order Over the Ring Zn, IEEE Transaction on Information Theory, p.43, 1997.