A randomness-rounds tradeoff in private computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 839 LNCS, Issue , 1994, Pages 397-410

  Kushilevitz, Eyal ^a   Rosén, Adi ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CRYPTOGRAPHY;

PRIVATE COMPUTATION; RANDOM BITS;

RANDOM PROCESSES;

EID: 0040655150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48658-5_36     Document Type: Conference Paper

References (29)

1. N. Alou, O. Goldreich, J. Hastad, and R. Peralta, “Simple constructions of almost k-wise independent random variables”, Proc. of 31st FOCS, 1990, pp. 544–553.
2. J. Bar-Ilan, and D. Beaver, “Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds”, Proc. of 8th PODC, 1989, pp. 201–209.
3. D. Beaver, “Perfect Privacy for Two-Party Protocols”, TR-11-89, Harvard University, 1989.
4. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, “Security with Low Communication Overhead”, 1991.
5. M. Bellare, O. Goldreich, and S. Goldwasser, “Randomness in Interactive Proofs”, Proc. of 31st FOCS, 1990, pp. 563–571.
6. M. Ben-or, S. Goldwasser, and A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation”, Proc. of 20th STOC, 1988, pp. 1–10.
7. M. Blum, and S. Micali “How to Generate Cryptographically Strong Sequences Of Pseudo-Random Bits”, FOCS 82 and SIAM J. on Computing, Vol 13, 1984, pp. 850–864.
8. C. Blundo, A. Giorgio Gaggia, and D. R. Stinson, “On the Dealer’s Randomness Required in Secret Sharing Schemes”, Proc. of Euro Crypt 94.
9. C. Blundo, A. De-Santis, and U. Vaccaro, “Randomness in Distribution Protocols”, To appear in Proc. of 21st ICALP, 1994.
10. R. Canetti, and O. Goldreich, “Bounds on Tradeoffs between Randomness and Communication Complexity”, FOCS 90 and Computational Complexity Vol. 3, (1993), 141–167.
11. D. Chaum, C. Crepeau, and I. Damgard, “Multiparty Unconditionally Secure Protocols”, Proc. of 20th STOC, 1988, pp. 11–19.
12. B. Chor, and E. Kushilevitz, “A Zero-One Law for Boolean Privacy”, STOC 89 and SIAM J. Disc. Math. Vol. 4, (1991), 36–47.
13. B. Chor, and E. Kushilevitz, “A Communication-Privacy Tradeoff for Modular Addition”, Information Processing Letters, Vol. 45, 1993, pp. 205–210.
14. B. Chor, M. Geréb-Graus, and E. Kushilevitz, “Private Computations Over the Integers”, Proc. of 31st FOCS, 1990, pp. 335–344.
15. B. Chor, M. Geréb-Graus, and E. Kushilevitz, “On the Structure of the Privacy Hierarchy”, Journal of Cryptology, Vol. 7, No. 1, 1994, pp. 53–60.
16. B. Chor, and O. Goldreich, “Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity”, FOCS 85 and SIAM J. Computing Vol. 17, (1988), 230–261.
17. A. Cohen, and A. Wigderson, “Dispersers, Deterministic Amplification, and Weak Random Sources”, Proc. of 30th FOCS, 1989, pp. 14–19.
18. M. Franklin, and M. Yung, “Communication complexity of secure computation”, Proc. of 24th STOC, 1992, pp. 699–710.
19. R. Impagliazzo, and D. Zuckerman, “How to Recycle Random Bits”, Proc. of 30th FOCS, 1989, pp. 248–253.
20. D. Koller, and N. Megiddo, “Constructing Small Sample Spaces Satisfying Given Constraints”, Proc. of 25th STOC, 1993, pp. 268–277.
21. D. Krizanc, D. Peleg, and E. Upfal, “A Time-Randomness Tradeoff for Oblivious Routing”, Proc. of 20th STOC, 1988, pp. 93–102.
22. E. Kushilevitz, “Privacy and Communication Complexity”, FOCS 89, and SIAM Jour. on Disc. Math., Vol. 5, No. 2, May 1992, pp. 273–284.
23. J. Naor, and M. Naor, “Small-Bias Probability Spaces: Efficient Constructions and Applications”, STOC 90, and SIAM J. on Computing, Vol 22, No. 4, 1993, pp. 838–856.
24. N. Nisan, “Pseudorandom Generator for Space Bounded Computation”, Proc. of 22nd STOC, 1990, pp. 204–212.
25. P. Raghavan, and M. Snir, “Memory vs. Randomization in On-Line Algorithms”, Proc. of 16th ICALP, 1989, pp. 687–703.
26. L. J. Schulman, “Sample Spaces Uniform on Neighborhoods”, Proc. of 24th STOC, 1992, pp. 17–25.
27. U. Vazirani, and V. Vazirani, “Random Polynomial Time is Equal to Slightly-Random Polynomial Time”, Proc. of 26th FOCS, 1985, pp. 417–428.
28. A. C. Yao, “Theory and Applications of Trapdoor Functions” Proc. of 23rd FOCS, 1982, pp. 80–91.
29. D. Zuckerman, “Simulating BPP Using a General Weak Random Source” Proc. of 32nd FOCS, 1991, pp. 79–89.