Two Party RSA Key Generation (Extended Abstract)
暂无分享,去创建一个
[1] de Ng Dick Bruijn. On the number of uncancelled elements in the sieve of Eratosthenes , 1950 .
[2] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[3] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[4] Andrew Chi-Chih Yao,et al. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[5] Yuval Ishai,et al. Protecting data privacy in private information retrieval schemes , 1998, STOC '98.
[6] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[7] Moti Yung,et al. Robust efficient distributed RSA-key generation , 1998, STOC '98.
[8] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[9] Eyal Kushilevitz,et al. Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[10] Clifford C. Cocks. Split Knowledge Generation of RSA Parameters , 1997, IMACC.
[11] Silvio Micali,et al. Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.
[12] János Komlós,et al. Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[13] Julien P. Stern. A new and efficient all-or-nothing disclosure of secrets protocol , 1998 .
[14] Jacques Stern,et al. Generation of Shared RSA Keys by Two Parties , 1998, ASIACRYPT.