Characterizing linear size circuits in terms of privacy

Size Circuits in Rafail Ostrovslcy~ Terms of Privacy

[1]  Eyal Kushilevitz,et al.  Privacy and communication complexity , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  Eyal Kushilevitz,et al.  A Randomness-Rounds Tradeoff in Private Computation , 1994, SIAM J. Discret. Math..

[3]  Donald Beaver.  Perfect Privacy For Two-Party Protocols , 1989, Distributed Computing And Cryptography.

[4]  Moni Naor,et al.  A minimal model for secure computation (extended abstract) , 1994, STOC '94.

[5]  A. Yao.  How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[7]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[8]  Matthew K. Franklin,et al.  Communication complexity of secure computation (extended abstract) , 1992, STOC '92.

[9]  Wolfgang J. Paul.  A 2.5 n-lower bound on the combinational complexity of Boolean functions , 1975, STOC '75.

[10]  Eyal Kushilevitz,et al.  Private Computations over the Integers , 1995, SIAM J. Comput..

[11]  Eyal Kushilevitz,et al.  A zero-one law for Boolean privacy , 1989, STOC '89.

[12]  Wolfgang J. Paul.  A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions , 1977, SIAM J. Comput..

[13]  Eyal Kushilevitz,et al.  A Randomnesss-Rounds Tradeoff in Private Computation , 1994, CRYPTO.

[14]  Judit Bar-Ilan,et al.  Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.

[15]  Norbert Blum.  A Boolean Function Requiring 3n Network Size , 1984, Theor. Comput. Sci..

[16]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[17]  Rafail Ostrovsky,et al.  Reducibility and completeness in multi-party private computations , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[18]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[19]  Uri Zwick.  A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions , 1991, SIAM J. Comput..

[20]  Eyal Kushilevitz,et al.  A Zero-One Law for Boolean Privacy , 1991, SIAM J. Discret. Math..

[21]  D SIAMJ..  RANDOMNESS IN PRIVATE COMPUTATIONS , 1997 .

[22]  Alfredo De Santis,et al.  On the Number of Random Bits in Totally Private Computation , 1995, ICALP.