Characterizing linear size circuits in terms of privacy

Journal of Computer and System Sciences

Volumn 58, Issue 1, 1999, Pages 129-136

  Kushilevitz, Eyal ^a   Ostrovsky, Rafail ^b   Rosén, Adi ^c,d  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TELCORDIA TECHNOLOGIES   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; LINEAR NETWORK ANALYSIS; NETWORK PROTOCOLS; RANDOM PROCESSES;

LINEAR SIZE CIRCUITS; PRIVATE PROTOCOLS;

LINEAR INTEGRATED CIRCUITS;

EID: 0033075133     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1544     Document Type: Article

References (21)

1. J. Bar-Ilan and D. Beaver, Non-cryptographic fault-tolerant computing in a constant number of Rounds, in "Proc. of 8th POD, 1989," pp. 201-209.
2. D. Beaver, "Perfect Privacy for Two-Party Protocols," TR-11-89, Harvard University, 1989.
3. N. Blum, A Boolean function requiring 3n network size, Theoret. Comput. Sci. 28 (1984), 337-345.
4. R. B. Boppana and M. Sipser, The complexity of Boolean functions, in "Handbook of Theoretical Computer Science," Vol. A., Chap. 14, pp. 757-804, MIT Press, Cambridge, MA, 1990.
5. M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in "Proc. of 20th STOC, 1988," pp. 1-10.
6. C. Blundo, A. De-Santis, G. Persiano, and U. Vaccaro, On the number of random bits in totally private computations, in "Proc. of 22nd ICALP, Berlin, 1995," pp. 171-182. Lectures Notes in Comput. Sci., Vol. 944.
7. R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosén, Randomness vs. fault-tolerance, in "Proc. of 16th PODC, 1997," pp. 35-44.
8. D. Chaum, C. Crepeau, and I. Damgard, Multiple unconditionally secure protocols, in "Proc. of 20th STOC, 1988," pp. 11-19.
9. B. Chor and E. Kushilevitz, A zero-one law for Boolean privacy, SIAM J. Disc. Math. 4 (1991), 36-47; STOC 89.
10. B. Chor, M. Geréb-Graus, and E. Kushilevitz, Private computations over the integers, SIAM J. Comput. 24, No. 2 (1995), 376-386; FOCS 90.
11. U. Feige, J. Kilian, and M. Naor, A minimal model for secure computation, in "Proc. of 26th STOC, 1994," pp. 554-563.
12. M. Franklin and M. Yung, Communication complexity of secure computation, "Proc. of 24th STOC, 1992," pp. 699-710.
13. O. Goldreich, S. Micali, and A. Widgerson, How to play any mental game, in "Proc. of 19th STOC, 1987," pp. 218-229.
14. E. Kushilevitz and Y. Mansour, Randomness in Private Computations, in "Proc. of 15th PODC, 1996," pp. 181-190.
15. E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and completeness in multi-party private computations, in "Proc. of 35th FOCS, 1994," pp. 478-489.
16. E. Kushilevitz, Privacy and communication complexity, SIAM J. Disc. Math. 5, No. 2 (1992), 273-284; FOCS 89.
17. E. Kushilevitz and A. Rosén, A randomness-rounds tradeoff in private computation, SIAM J. Disc. Math., to appear; Crypto 94.
18. W. J. Paul, A 2.5n lower bound on the combinatorial complexity of Boolean functions, SIAM Comput. 5, No. 3 (1977), 427-443.
19. C. E. Shannon, A mathematical theory of communication, Bell System Tech. Jour. 27 (1948), 379-423, 623-656.
20. A. C. Yao, How to generate and exchange secrets, in "Proc. of 27th FOCS, 1986," pp. 162-167.
21. U. Zwick, A 4n lowerbound on the combinational complexity of certain symmetric Boolean functions over the basis of unate dyadic Boolean functions, SIAM J. Comput. 20 (1991).