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, D. Pointcheval, and J. Stern, Extended Notions of Security for Multicast Public Key Cryptosystems, Proc. of the 27th ICALP, pp.499-511, 2000.
DOI : 10.1007/3-540-45022-X_42

M. Bellare, A. Boldyreva, and S. Micali, Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements, Eurocrypt '2000, pp.259-274, 2000.
DOI : 10.1007/3-540-45539-6_18

M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, Relations among notions of security for public-key encryption schemes, Crypto '98, pp.26-45, 1998.
DOI : 10.1007/BFb0055718

M. Bellare, M. Fischlin, S. Goldwasser, and S. Micali, Identification Protocols Secure against Reset Attacks, Eurocrypt '2001, pp.495-511, 2001.
DOI : 10.1007/3-540-44987-6_30

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

M. Bellare and P. Rogaway, Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993.
DOI : 10.1145/168588.168596

M. Bellare and P. Rogaway, Optimal Asymmetric Encryption ? How to Encrypt with RSA, Eurocrypt '94, pp.92-111, 1995.
DOI : 10.1007/bfb0053428

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

M. Blum, P. Feldman, and S. Micali, Non-interactive zero-knowledge and its applications, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.103-112, 1988.
DOI : 10.1145/62212.62222

M. Blum, P. Feldman, and S. Micali, Proving Security Against Chosen Ciphertext Attacks, Crypto '88, pp.256-268, 1989.
DOI : 10.1007/0-387-34799-2_20

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

R. Canetti, I. Damgård, S. Dziembowski, Y. Ishai, and T. Malkin, On Adaptive vs. Non-adaptive Security of Multiparty Protocols, Eurocrypt '2001, pp.262-279, 2001.
DOI : 10.1007/3-540-44987-6_17

R. Canetti and S. Goldwasser, An Efficient Threshold PKC Secure Against Adaptive CCA, Eurocrypt '99, pp.90-106, 1999.

D. Catalano, R. Gennaro, N. Howgrave-graham, and P. Q. Nguyen, Paillier's cryptosystem revisited, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, 2001.
DOI : 10.1145/501983.502012

R. Cramer and V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, Crypto '98, pp.13-25, 1998.
DOI : 10.1007/BFb0055717

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

D. Dolev, C. Dwork, and M. Naor, Non-malleable cryptography, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.391-437, 2000.
DOI : 10.1145/103418.103474

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Crypto '86, pp.186-194, 1987.
DOI : 10.1007/3-540-47721-7_12

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

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

P. A. Fouque and J. Stern, Fully Distributed Threshold RSA under Standard Assumptions, Asiacrypt '2001, 2001.
DOI : 10.1007/3-540-45682-1_19

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

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

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

Y. Frankel, P. Gemmel, . Ph, M. Mackenzie, and . 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. Gemmell, and M. Yung, Witness-based cryptographic program checking and robust function sharing, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.499-508, 1996.
DOI : 10.1145/237814.237998

Y. Frankel, P. Mackenzie, and M. Yung, Robust Efficient Distributed RSA Key Generation, Proc. of the 30th STOC, pp.663-672, 1998.

E. Fujisaki and T. Okamoto, Secure Integration of Asymmetric and Symmetric Encryption Schemes, Crypto '99, pp.537-554, 1999.

E. Fujisaki and T. Okamoto, How to Enhance the Security of Public-Key Encryption at Minimum Cost, IEICE Transaction of Fundamentals of Electronic Communications and Computer Science, issue.1, pp.83-107, 2000.
DOI : 10.1007/3-540-49162-7_5

E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern, RSA?OAEP is Secure under the RSA Assumption, Crypto '2001, 2001.

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.

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

URL : http://doi.org/10.1016/0022-0000(84)90070-9

C. H. Lim and P. J. Lee, Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks, Crypto '93, pp.287-296, 1994.
DOI : 10.1007/3-540-48329-2_36

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

M. Naor and M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, Proceedings of the twenty-second annual ACM symposium on Theory of computing , STOC '90, pp.427-437, 1990.
DOI : 10.1145/100216.100273

T. Okamoto and D. Pointcheval, REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform, CT ? RSA '2001, pp.159-175
DOI : 10.1007/3-540-45353-9_13

P. Paillier, Public-Key Cryptosystems Based on Discrete Logarithms Residues, Eurocrypt '99, pp.223-238, 1999.

P. Paillier and D. Pointcheval, Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries, Asiacrypt '99, pp.165-179, 1999.
DOI : 10.1007/978-3-540-48000-6_14

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

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

D. Pointcheval and J. Stern, Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology, vol.13, issue.3, pp.361-396, 2000.
DOI : 10.1007/s001450010003

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

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

C. Rackoff and D. R. Simon, Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack, Crypto '91, pp.433-444, 1992.
DOI : 10.1007/3-540-46766-1_35

A. Sahai, Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999.
DOI : 10.1109/SFFCS.1999.814628

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

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-523, 1994.
DOI : 10.1145/195058.195405

C. P. Schnorr, Efficient Identification and Signatures for Smart Cards, Crypto '89, pp.235-251, 1990.

C. P. Schnorr and M. Jakobsson, Security of Signed ElGamal Encryption, Asiacrypt '2000, pp.458-469, 2000.
DOI : 10.1007/3-540-44448-3_7

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 '2000, pp.207-220, 2000.
DOI : 10.1007/3-540-45539-6_15

V. Shoup and R. Gennaro, Securing Threshold Cryptosystems against Chosen Ciphertext Attack, Eurocrypt '98, pp.1-16, 1998.

Y. Tsiounis and M. Yung, On the Security of El Gamal based Encryption, PKC '98, 1998.