J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky: Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Cryptography from Anonymity - Yuval Ishai Eyal Self-citation (Kushilevitz) (Correct)
No context found.
J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky: Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000).
Cryptography from Anonymity - Ishai, Kushilevitz, Ostrovsky, Sahai (2006) Self-citation (Kushilevitz) (Correct)
No context found.
J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky: Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000). 20
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (7 citations) (Correct)
No context found.
J.. Kilian, E. Kushilevitz, S. Micali, R. Ostrovsky: Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC