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
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
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
Relations among notions of security for public-key encryption schemes, Crypto '98, pp.26-45, 1998. ,
DOI : 10.1007/BFb0055718
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=10.1.1.108.9266
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
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=10.1.1.14.1562
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
Proving Security Against Chosen Ciphertext Attacks, Crypto '88, pp.256-268, 1989. ,
DOI : 10.1007/0-387-34799-2_20
Efficient Generation of Shared RSA Keys, Crypto '97, pp.425-439, 1997. ,
On Adaptive vs. Non-adaptive Security of Multiparty Protocols, Eurocrypt '2001, pp.262-279, 2001. ,
DOI : 10.1007/3-540-44987-6_17
An Efficient Threshold PKC Secure Against Adaptive CCA, Eurocrypt '99, pp.90-106, 1999. ,
Paillier's cryptosystem revisited, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, 2001. ,
DOI : 10.1145/501983.502012
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, Crypto '98, pp.13-25, 1998. ,
DOI : 10.1007/BFb0055717
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
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
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
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
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
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
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=10.1.1.46.6651
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
Robust Efficient Distributed RSA Key Generation, Proc. of the 30th STOC, pp.663-672, 1998. ,
Secure Integration of Asymmetric and Symmetric Encryption Schemes, Crypto '99, pp.537-554, 1999. ,
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
RSA?OAEP is Secure under the RSA Assumption, Crypto '2001, 2001. ,
Robust and Efficient Sharing of RSA Functions, Crypto '96, pp.157-172, 1996. ,
Robust Threshold DSS Signatures, Eurocrypt '96, pp.425-438, 1996. ,
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Eurocrypt '99, pp.295-310, 1999. ,
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
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=10.1.1.24.3227
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
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform, CT ? RSA '2001, pp.159-175 ,
DOI : 10.1007/3-540-45353-9_13
Public-Key Cryptosystems Based on Discrete Logarithms Residues, Eurocrypt '99, pp.223-238, 1999. ,
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=10.1.1.1.6291
A Threshold Cryptosystem without a Trusted Party, Eurocrypt '91, pp.522-526, 1992. ,
DOI : 10.1007/3-540-46416-6_47
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=10.1.1.11.8213
A simplified approach to threshold and proactive RSA, Crypto '98, pp.89-104, 1998. ,
DOI : 10.1007/BFb0055722
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
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=10.1.1.43.4689
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
Efficient Identification and Signatures for Smart Cards, Crypto '89, pp.235-251, 1990. ,
Security of Signed ElGamal Encryption, Asiacrypt '2000, pp.458-469, 2000. ,
DOI : 10.1007/3-540-44448-3_7
How to share a secret, Communications of the ACM, vol.22, issue.11, pp.612-613, 1979. ,
DOI : 10.1145/359168.359176
Practical Threshold Signatures, Eurocrypt '2000, pp.207-220, 2000. ,
DOI : 10.1007/3-540-45539-6_15
Securing Threshold Cryptosystems against Chosen Ciphertext Attack, Eurocrypt '98, pp.1-16, 1998. ,
On the Security of El Gamal based Encryption, PKC '98, 1998. ,