Lower bounds on the amount of randomness in private computation

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 659-666

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

^a University of Texas at Austin   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Lower bounds; Private computation; Randomness

Indexed keywords

FORMAL LOGIC; FUNCTIONS; MATHEMATICAL MODELS;

PRIVATE COMPUTATION;

NETWORK PROTOCOLS;

EID: 0037769916     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780637.780638     Document Type: Conference Paper

References (26)

1. N. Alon, J. H. Spencer, The Probabilistic Method (second edition), John Willey & Sons, 2000.
2. 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.
3. D. Beaver, "Perfect Privacy for Two-Party Protocols", TR-11-89, Harvard University, 1989.
4. 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.
5. G. Blundo, A. De Santis, G. Persiano, and U. Vaccaro, "On the Number of Random Bits in Totally Private Computations", Proc. of 22nd ICALP, 1995.
6. C. Blundo, A. De Santis, G. Persiano, U. Vaccaro, "Randomness Complexity of Private Computation". Computational Complexity, Vol. 8, pp. 145-168, 1999.
7. C. Blundo, C. Galdi, P. Persiano, "Randomness Recycling in Constant-Round Private Computations". DISC 1999. pp. 138-150.
8. C. Blundo, C. Galdi, P. Persiano, "Low-Randomness Constant-Round Private Computations". Manuscript, 2003.
9. R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosén, "Randomness vs. Fault-Tolerance", Journal of Cryptology, Vol. 13, pp. 107-142, 2000.
10. D. Chaum, C. Crepeau, and I. Damgard, "Multiparty Unconditionally Secure Protocols", Proc. of 20th STOC, pp. 11-19, 1988.
11. B. Chor, J. Friedmann, O. Goldreich, J. Hastad, S. Rudich, and R. Smolensky, "The bit extraction problem and t-resilient functions" in Proc. of 26th FOCS, 1985, pp. 396-407.
12. B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", STOC 89 and SIAM J. Disc. Math. Vol. 4, 36-47, 1991.
13. B. Chor, M. Geréb-Graus, and E. Kushilevitz, "Private Computations Over the Integers", FOCS 90 and SIAM Jour. on Computing, Vol. 24, No. 2, pp. 376-386, 1995.
14. U. Feige, J. Kilian, and M. Naor, "A Minimal Model for Secure Computation", Proc. of 26th STOC, pp. 554-563, 1994.
15. M. Franklin, and M. Yung, "Communication Complexity of Secure Computation", Proc. of 24th STOC, pp. 699-710, 1992.
16. A. Gál, and A. Rosén, "A Theorem on Sensitivity and Applications in Private Computation". SIAM Jour, on Computing, Vol. 31, No. 5, pp. 1424-1437, 2002.
17. O. Goldreich, "Modern Cryptography, Probabilistic Proofs and Pseudorandomness", Springer-Verlag, Algorithms and Combinatorics, Vol 17, 1998.
18. O. Goldreich, S. Micali, and A. Wigderson, "How to Play Any Mental Game", Proc. of 19th STOC, 1987, pp. 218-229.
19. E. Kushilevitz, and Y. Mansour, "Randomness in Private Computations", SIAM Jour. on Disc. Math., Vol. 10, No. 4, pp. 647-661, 1997.
20. E. Kushilevitz, S. Micali, and R. Ostrovsky, "Reducibility and Completeness in Multi-Party Private Computations", Proc. of 35th FOCS, pp. 478-489, 1994.
21. E. Kushilevitz, "Privacy and Communication Complexity", FOCS 89, and SIAM Jour. on Disc. Math., Vol. 5, No. 2, pp. 273-284, 1992.
22. E. Kushilevitz, R. Ostrovsky, and A. Rosén, "Characterizing Linear Size Circuits in Terms of Privacy", Proc. of STOC 96, and JCSS, Vol. 58 pp. 129-136, 1999.
23. E. Kushilevitz, R. Ostrovsky, and A. Rosén, "Amortizing Randomness in Private Multiparty Computations". PODC 1998, pp. 81-90.
24. E. Kushilevitz, and A. Rosén, "A Randomness-Rounds Tradeoff in Private Computation", SIAM Journal on Discrete Mathematics, Vol. 27, pp. 1531-1549, 1998.
25. N. Nisan, A. Ta-Shma, "Extracting Randomness: A Survey and New Constructions" JCSS, Vol.58, No. 1, Feb. 1999, pp. 148-173.
26. A. Yao, "Protocols for Secure Computation", Proc. of 23rd FOCS, 1982, pp. 160-164.