A theorem on sensitivity and applications in private computation

SIAM Journal on Computing

Volumn 31, Issue 5, 2002, Pages 1424-1437

  Gál, Anna ^a   Rosén, Adi ^a  

^a University of Texas at Austin   (United States)

Author keywords

Lower bounds; Private computation; Randomness; Sensitivity

Indexed keywords

BOOLEAN FUNCTIONS; RANDOM PROCESSES; SENSITIVITY ANALYSIS; VECTORS;

PRIVATE COMPUTATION;

THEOREM PROVING;

EID: 0036588723     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701385296     Document Type: Article

References (36)

1. J. Bar-Ilan and D. Beaver, Non-cryptographic fault-tolerant computing in a constant number of rounds, in Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, 1989, pp. 201-209.
2. D. Beaver, Perfect Privacy for Two-Party Protocols, Technical Report-11-89, Harvard University, Cambridge, MA, 1989.
3. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, Security with Low Communication Overhead, in Advances in Cryptology - CRYPTO '90, Lecture Notes in Comput. Sci. 537, Springer-Verlag, Berlin, 1991, pp. 62-76.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in Proceedings of the 20th ACM Symposium on the Theory of Computing, 1988, pp. 1-10.
5. C. Blundo, A. De Santis, G. Persiano, and U. Vaccaro, On the number of random bits in totally private computations, in Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 944, Springer-Verlag, Berlin, 1995, pp. 171-182.
6. R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosén, Randomness vs. fault-tolerance, J. Cryptology, 13 (2000), pp. 107-142.
7. D. Chaum, C. Crepeau, and I. Damgard, Multiparty unconditionally secure protocols, in Proceedings of the 20th ACM Symposium on the Theory of Computing, 1988, pp. 11-19.
8. B. Chor and E. Kushilevitz, A zero-one law for Boolean privacy, SIAM J. Discrete Math., 4 (1991), pp. 36-47.
9. B. Chor, M. Geréb-Graus, and E. Kushilevltz, Private computations over the integers, SIAM J. Comput., 24 (1995), pp. 376-386.
10. S. Cook, C. Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput., 15 (1986), pp. 87-97.
11. R.L. Dobrushin and S.I. Ortyukov, Lower bound for the redundancy of self-correcting arrangements of unreliable functional elements, Probl. Inf. Transm., 13 (1977), pp. 59-65.
12. U. Feige, J. Kilian, and M. Naor, A minimal model for secure computation, in Proceedings of the 26th ACM Symposium on the Theory of Computing, 1994, pp. 554-563.
13. M. Franklin and M. Yung, Communication complexity of secure computation, in Proceedings of the 24th ACM Symposium on the Theory of Computing, 1992, pp. 699-710.
14. P. Gács and A. Gál, Lower bounds for the complexity of reliable Boolean circuits with noisy gates, IEEE Trans. Inform. Theory, 40 (1994), pp. 579-583.
15. A. Gál, Lower bounds for the complexity of reliable Boolean circuits with noisy gates, in Proceedings of the 32nd Annual Symposium on Foundation of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 594-601.
16. O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game, in Proceedings of the 19th ACM Symposium on the Theory of Computing, 1987, pp. 218-229.
17. C. Gotsman and N. Linial, The equivalence of two problems on the cube, J. Combinatorial Theory Ser. A, 61 (1992), pp. 142-146.
18. Y. Ishai and E. Kushilevitz, Private simultaneous messages protocols with applications, in Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, Ramat-Gan, Israel, 1997, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 174-184.
19. J. Kahn, G. Kalai, and N. Linial, The influence of variables of Boolean functions, in Proceedings of the 29th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 68-80.
20. C. Kenyon, Sensitivity vs. Block Sensitivity of Boolean Functions, DIMACS Technical Report 90-18, Rutgers University, Piscataway, NJ, 1990.
21. J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and completeness in private computations, SIAM J. Comput., 29 (2000), pp. 1189-1208.
22. E. Kushilevitz and Y. Mansour, Randomness in private computations, SIAM J. Discrete Math., 10 (1997), pp. 647-661.
23. E. Kushilevitz, Privacy and communication complexity, SIAM J. Discrete Math., 5 (1992), pp. 273-284.
24. E. Kushilevitz, R. Ostrovsky, and A. Rosén, Characterizing linear size circuits in terms of privacy, J. Comput. System Sci., 58 (1999), pp. 129-136.
25. E. Kushilevitz and A. Rosén, A randomness-rounds tradeoff in private computation, SIAM J. Discrete Math., 11 (1998), pp. 61-80.
26. N. Linial, Y. Mansour, and N. Nisan, Constant depth circuits, Fourier transform, and learnability, J. ACM, 40 (1993), pp. 607-620.
27. J.H. Van Lint and R.M. Wilson, A Course in Combinatorics, Cambridge University Press, Cambridge, UK, 1992.
28. N. Nisan, CREW PRAMs and decision trees, SIAM J. Comput., 20 (1991), pp. 999-1007.
29. N. Nisan and M. Szegedy, On the degree of Boolean functions as real polynomials, Comput. Complexity, 4 (1994), pp. 301-313.
30. N. Pippenger, G.D. Stamoulis, and J.N. Tsitsiklis, On a lower bound for the redundancy of reliable networks with noisy gates, IEEE Trans. Inform. Theory, 37 (1991), pp. 639-643.
31. R. Reischuk and B. Schmeltz, Reliable computation with noisy circuits and decision trees - A general n log n lower bound, in Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 602-611.
32. D. Rubinstein, Sensitivity vs. block sensitivity of Boolean functions, Combinatorica, 15 (1995), pp. 297-299.
33. H.U. Simon, A tight Ω(log log n) bound on the time for parallel RAM's to compute nondegenerate Boolean functions, in Proceedings of the 1983 International Foundations of Computation Theory Conference, Lecture Notes in Comput. Sci. 158, Springer-Verlag, Berlin, 1983, pp. 439-444.
34. G. Turán, The critical complexity of graph properties, Inform. Process. Lett., 18 (1984), pp. 151-153.
35. I. Wegener, The critical complexity of all (monotone) Boolean functions and monotone graph properties, Inform. and Control, 67 (1985), pp. 212-222.
36. A.C. Yao, Protocols for secure computations, in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, IEEE, New York, 1982, pp. 160-164.