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

M. Ben-or, S. Goldwasser, and A. Widgerson, Completeness theorems for noncryptographic fault-tolerant distributed computing, Proceedings of the 20th STOC, pp.1-10, 1988.

S. Blackburn, S. Blake-wilson, S. Galbraith, and M. Burmester, Shared Generation of Shared RSA Keys, Canada, 1998.

D. Boneh and M. Franklin, Efficient Generation of Shared RSA keys, Crypto '97, pp.425-439, 1997.

D. Boneh, M. Malkin, and T. Wu, Experimenting with Shared Generation of RSA keys, Internet Society's 1999 Symposium on Network and Distributed System Security (SNDSS), pp.43-56, 1999.

R. Canetti, R. Gennaro, A. Herzberg, and D. Naor, Proactive Security : Long-term Protection Against Break-ins, CryptoBytes, vol.3, issue.1, 1997.

R. Canetti and S. Goldwasser, An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract), Eurorypt '99, pp.90-106, 1999.
DOI : 10.1007/3-540-48910-X_7

D. Catalano, R. Gennaro, and S. Halevi, Computing Inverses over a Shared Secret Modulus, Eurocrypt '00, pp.190-207, 2000.
DOI : 10.1007/3-540-45539-6_14

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

C. Cocks, Split knowledge generation of RSA parameters, Cryptography and Coding : 6th IMA Conference, pp.89-95, 1997.
DOI : 10.1007/BFb0024452

C. Cocks, Split Generation of RSA Parameters with Multiple Participants, 1998.

I. Damgård and M. Jurik, A Generalisation, a Simplification and some Applications of Paillier???s Probabilistic Public-Key System, PKC '01, pp.119-136, 1992.
DOI : 10.7146/brics.v7i45.20212

I. Damgård and M. Koprowski, Practical Threshold RSA Signatures Without a Trusted Dealer, Eurocrypt '01, pp.152-165, 2001.

Y. Desmedt and Y. Frankel, Shared generation of authenticators and signatures, Crypto '91, pp.457-469, 1991.
DOI : 10.1007/3-540-46766-1_37

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

P. A. Fouque and J. Stern, One Round Threshold Discrete-Log Key Generation without Private Channels, PKC '01, 1992.
DOI : 10.1007/3-540-44586-2_22

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

Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung, Optimal-resilience proactive public-key cryptosystems, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.384-393, 1997.
DOI : 10.1109/SFCS.1997.646127

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

Y. Frankel, P. Mackenzie, and M. Yung, Robust Efficient Distributed RSA Key Generation, STOC '98, pp.663-672, 1995.
DOI : 10.1145/277697.277779

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust and Efficient Sharing of RSA Functions, Crypto '96, pp.157-172, 1996.

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust Threshold DSS Signatures, Eurocrypt '96, pp.425-438, 1996.

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Eurocrypt '99, pp.295-310, 1999.

R. Gennaro, D. Micciancio, and T. Rabin, An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products, Proceedings of the 5th ACM conference on Computer and communications security , CCS '98, 1998.
DOI : 10.1145/288090.288108

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

N. Gilboa, Two Party RSA Key Generation, Crypto '99, 1999.
DOI : 10.1007/3-540-48405-1_8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. C. Guillou and J. Quisquater, A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory, Eurocrypt '88, pp.123-128, 1988.
DOI : 10.1007/3-540-45961-8_11

B. King, Improved Methods to Perform Threshold RSA, Asiacrypt '00, pp.359-372, 1976.
DOI : 10.1007/3-540-44448-3_27

S. Miyazaki, K. Sakurai, and M. Yung, On Threshold RSA-Signing with no Dealer, ICICS '99, 1999.
DOI : 10.1007/10719994_16

T. P. Pedersen, A Threshold Cryptosystem without a Trusted Party, Euro- crypt'91, pp.522-526, 1991.
DOI : 10.1007/3-540-46416-6_47

C. Pomerance, On the distribution of pseudoprimes, Mathematics of Computation, pp.587-593, 1981.
DOI : 10.1090/S0025-5718-1981-0628717-0

C. Pomerance, Two methods in elementary analytic number theory, pp.135-161, 1989.

G. Poupard and J. Stern, Generation of Shared RSA Keys by Two Parties, Asiacrypt '98, pp.11-24, 1998.
DOI : 10.1007/3-540-49649-1_2

G. Poupard and J. Stern, Short Proofs of Knowledge for Factoring, PKC '00, pp.147-166, 2000.
DOI : 10.1007/978-3-540-46588-1_11

T. Rabin, A simplified approach to threshold and proactive RSA, Crypto '98, pp.89-104, 1998.
DOI : 10.1007/BFb0055722

R. Rivest, Finding Four Million Large Random Primes, Crypto '90, pp.625-626, 1991.
DOI : 10.1007/3-540-38424-3_45

R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.
DOI : 10.1145/359340.359342

A. De-santis, Y. Desmedt, Y. Frankel, and M. Yung, How to share a function securely, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , STOC '94, pp.522-533, 1994.
DOI : 10.1145/195058.195405

A. Shamir, How to share a secret, Communications of the ACM, vol.22, issue.11, pp.612-613, 1979.
DOI : 10.1145/359168.359176

V. Shoup, Practical Threshold Signatures, Eurocrypt '00, p.207, 2000.
DOI : 10.1007/3-540-45539-6_15

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

V. Shoup and R. Gennaro, Securing Threshold Cryptosystems against Chosen Ciphertext Attack, Eurocrypt '98 cf. the extended version for the Journal of Cryptology, pp.1-16, 1998.

R. D. Silverman, Fast Generation of Random, Strong RSA Primes, RSA Laboratories, 1997.