Reducibility and Completeness in Private Computations
暂无分享,去创建一个
Rafail Ostrovsky | Eyal Kushilevitz | Silvio Micali | Joe Kilian | S. Micali | R. Ostrovsky | E. Kushilevitz | J. Kilian
[1] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[2] Rafail Ostrovsky,et al. Characterizing linear size circuits in terms of privacy , 1996, STOC '96.
[3] Ueli Maurer,et al. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) , 1997, PODC '97.
[4] Stephen Wiesner,et al. Conjugate coding , 1983, SIGA.
[5] Joe Kilian,et al. Achieving oblivious transfer using weakened security assumptions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[6] Rafail Ostrovsky,et al. Fair Games against an All-Powerful Adversary , 1990, Advances In Computational Complexity Theory.
[7] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[8] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[9] Donald Beaver,et al. Quorum-Based Secure Multi-party Computation , 1998, EUROCRYPT.
[10] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.
[11] Rafail Ostrovsky,et al. Amortizing randomness in private multiparty computations , 1998, PODC '98.
[12] Moti Yung,et al. Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model , 1987, CRYPTO.
[13] Oded Goldreich,et al. How to Solve any Protocol Problem - An Efficiency Improvement , 1987, CRYPTO.
[14] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[15] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[16] Eyal Kushilevitz. Privacy and Communication Complexity , 1992, SIAM J. Discret. Math..
[17] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[18] Eyal Kushilevitz,et al. A Zero-One Law for Boolean Privacy , 1991, SIAM J. Discret. Math..
[19] Eyal Kushilevitz,et al. A zero-one law for Boolean privacy , 1989, STOC '89.
[20] Rafail Ostrovsky,et al. Reducibility and completeness in multi-party private computations , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[21] Eyal Kushilevitz,et al. Private Computations over the Integers , 1995, SIAM J. Comput..
[22] Gilles Brassard,et al. Information theoretic reductions among disclosure problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[23] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[24] Rafail Ostrovsky,et al. Characterizing Linear Size Circuits in Terms of Pricacy , 1999, J. Comput. Syst. Sci..
[25] Eyal Kushilevitz,et al. A Randomness-Rounds Tradeoff in Private Computation , 1994, SIAM J. Discret. Math..
[26] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[27] Moni Naor,et al. A Minimal Model for Secure Computation , 2002 .
[28] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[29] Judit Bar-Ilan,et al. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.
[30] Donald Beaver,et al. Multiparty computation with faulty majority , 1989, 30th Annual Symposium on Foundations of Computer Science.
[31] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[32] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[33] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..