Characterizing linear size circuits in terms of privacy

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 541-550

  Kushilevitz, Eyal ^a   Ostrovsky, Rafail ^b,c   Rosen, Adi ^d,e  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c TELCORDIA TECHNOLOGIES   (United States)

^d UNIVERSITY OF TORONTO   (Canada)

^e TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; TIMING CIRCUITS; DISTRIBUTED COMPUTER SYSTEMS; LINEAR NETWORKS; NETWORK PROTOCOLS; RANDOM PROCESSES; THEOREM PROVING;

COMPLEXITY CLASS; COMPLEXITY THEORY; PRIVATE PROTOCOLS; RANDOM BITS; LINEAR SIZE CIRCUITS; PARTY PRIVATE PROTOCOL; PRIVACY;

LINEAR NETWORKS; COMPUTATIONAL COMPLEXITY;

EID: 0029712050     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.238002     Document Type: Conference Paper

References (20)

1. J. Bar-Ilan, and D. Beaver, "Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds", Proc. of 8th PODC, pp. 201-209, 1989.
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", Theoretical Computer Science, Vol. 28, pp. 337-345, 1984.
4. R. B. Boppana, and M. Sipser, "The Complexity of Boolean Functions", in Handbook of Theoretical Computer Science, Vol. A, Chapter 14, pp. 757-804, 1990.
5. M. Ben-or, S. Goldwasser, and A. Wigderson, "Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation", Proc. of 20th STOC, pp. 1-10, 1988.
6. C. Blundo, A. De-Santis, G. Persiano, and U. Vaccaro, "On the Number of Random Bits in Totally Private Computations", Proc. of 22nd ICALP, 1995.
7. D. Chaum, C. Crepeau, and I. Damgard, "Multiparty Unconditionally Secure Protocols", Proc. of 20th STOC, pp. 11-19, 1988.
8. B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", STOC 89 and SIAM J. Disc. Math. Vol. 4, 36-47, 1991.
9. B. Chor, M. Gereb-Graus, and E. Kushilevitz, "Private Computations Over the Integers", FOCS 90 and SIAM Jour, on Computing, Vol. 24, No. 2, pp. 376-386, 1995.
10. U. Feige, J. Kilian, and M. Naor, "A Minimal Model for Secure Computation", Proc. of 26th STOC, pp. 554-563, 1994.
11. M. Franklin, and M. Yung, "Communication Complexity of Secure Computation", Proc. of 24th STOC, pp. 699-710, 1992.
12. O. Goldreich, S. Micali, and A. Wigderson, "How to Play Any Mental Game", Proc. of 19th STOC, pp. 218-229, 1987.
13. E. Kushilevitz, and Y. Mansour, "Randomness in Private Computations", Proc. of 15th PODC, 1996.
14. E. Kushilevitz, S. Micali, and R. Ostrovsky, "Reducibility and Completeness in Multi-Party Private Computations", Proc. of 35th FOCS, pp. 478-489, 1994.
15. E. Kushilevitz, "Privacy and Communication Complexity", FOCS 89, and SIAM Jour, on Disc. Math., Vol. 5, No. 2, pp. 273-284, 1992.
16. E. Kushilevitz, and A. Rosen, "A Randomness-Rounds Tradeoff in Private Computation", Advances in Cryptology, Proceedings of Crypto'94, Y. Desmedt, ed., Springer-Verlag, Lecture Notes in Computer Science, Vol. 839, pp. 397-410, 1994.
17. W. J. Paul, "A 2.5n Lower Bound on the Combinatorial Complexity of Boolean Functions", SIAM Jour, on Computing, Vol. 6, No. 3, pp. 427-443, 1977.
18. C. E. Shannon, "A Mathematical Theory of Communication", Bell System Tech. Jour., Vol. 27, pp. 379-423, 623-656, 1948.
19. A. C. Yao, "How to Generate and Exchange Secrets", Proc. of 27th FOCS, pp. 162-167, 1986.
20. U. Zwick, "A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions", SIAM Jour, on Computing, Vol. 20, 1991.