A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
暂无分享,去创建一个
[1] Jean-Jacques Quisquater,et al. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory , 1988, EUROCRYPT.
[2] Judit Bar-Ilan,et al. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.
[3] Ronald Cramer,et al. A secure and optimally efficient multi-authority election scheme , 1997, Eur. Trans. Telecommun..
[4] Moti Yung,et al. Robust efficient distributed RSA-key generation , 1998, STOC '98.
[5] Moti Yung,et al. Robust efficient distributed RSA-key generation , 1998, STOC '98.
[6] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[7] Bernd Grobauer,et al. The Second Futamura Projection for Type-Directed Partial Evaluation , 1999, PEPM '00.
[8] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[9] Jacques Stern,et al. Sharing Decryption in the Context of Voting or Lotteries , 2000, Financial Cryptography.
[10] Kazue Sako,et al. Efficient Receipt-Free Voting Based on Homomorphic Encryption , 2000, EUROCRYPT.
[11] Victor Shoup,et al. Practical Threshold Signatures , 2000, EUROCRYPT.
[12] I. Damgård,et al. A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System , 2000 .
[13] Nils Klarlund,et al. The DSD Schema Language and its Applications , 2000 .
[14] Michael I. Schwartzbach,et al. The pointer assertion logic engine , 2000, PLDI '01.
[15] Jacques Stern,et al. Practical multi-candidate election system , 2001, PODC '01.
[16] Nils Klarlund,et al. MONA Implementation Secrets , 2000, Int. J. Found. Comput. Sci..