Characterizing Linear Size Circuits in Terms of Pricacy
暂无分享,去创建一个
[1] Wolfgang J. Paul. A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions , 1977, SIAM J. Comput..
[2] Judit Bar-Ilan,et al. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.
[3] Rafail Ostrovsky,et al. Randomness vs. fault-tolerance , 1997, PODC '97.
[4] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[5] Eyal Kushilevitz. Privacy and Communication Complexity , 1992, SIAM J. Discret. Math..
[6] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[7] Alfredo De Santis,et al. On the Number of Random Bits in Totally Private Computation , 1995, ICALP.
[8] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[9] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[10] Rafail Ostrovsky,et al. Reducibility and completeness in multi-party private computations , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[12] Eyal Kushilevitz,et al. A Zero-One Law for Boolean Privacy , 1991, SIAM J. Discret. Math..
[13] Eyal Kushilevitz,et al. Private Computations over the Integers , 1995, SIAM J. Comput..
[14] Norbert Blum. A Boolean Function Requiring 3n Network Size , 1984, Theor. Comput. Sci..
[15] Eyal Kushilevitz,et al. A Randomness-Rounds Tradeoff in Private Computation , 1994, SIAM J. Discret. Math..
[16] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[17] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .
[18] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.