Randomness in private computations

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 4, 1997, Pages 647-661

  Kushilevitz, Eyal ^a   Mansour, Yishay ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Privacy; Randomness; Small probability spaces; Xor function

Indexed keywords

EID: 0011180890     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480196306130     Document Type: Article

References (41)

1. N. ALON, O. GOLDREICH, J. HÅSTAD, AND R. PERALTA, Simple constructions of almost κ-wise independent random variables, Random Structures Algorithms, 3 (1992), pp. 289-304. (Addendum: 4 (1993), pp. 119-120.)
2. N. ALON AND J. SPENCER, The Probabilistic Method, John Wiley, New York, 1992.
3. J. BAR-ILAN AND D. BEAVER, Non-cryptographic fault-tolerant computing in a constant number of rounds, in Proc. of 8th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1989, pp. 201-209.
4. D. BEAVER, Perfect Privacy for Two-Party Protocols, Technical Report TR-11-89, Harvard University, Cambridge, MA, 1989.
5. M. BELLARE, O. GOLDREICH, AND S. GOLDWASSER, Randomness in interactive proofs, in Proc. of 31st Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 563-571.
6. M. BEN-OR, S. GOLDWASSER, AND A. WIGDERSON, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in Proc. of 20th Annual ACM Symposium on Theory of Computing, ACM, New York, 1988, pp. 1-10.
7. M. BLUM AND S. MICALI, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Comput., 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, in Proc. of EuroCrypt94, Lecture Notes in Comput. Sci. 950, 1995, Springer-Verlag, New York, pp. 35-46.
9. C. BLUNDO, A. DE-SANTIS, AND U. VACCARO, Randomness in distribution protocols, in Proc. of 21st International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 820, 1994, Springer-Verlag, New York, pp. 568-579.
10. C. BLUNDO, A. DE-SANTIS, G. PERSIANO, AND U. VACCARO, On the number of random bits in totally private computations, in Proc. of 22nd International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 944, Springer-Verlag, New York, 1995, pp. 171-182.
11. R. CANETTI, U. FEIGE, O. GOLDREICH, AND M. NAOR, Adaptively secure multi-party computation, in Proc. of 28th Annual ACM Symposium on Theory of Computing, ACM, New York, 1996, pp. 639-648.
12. R. CANETTI AND O. GOLDREICH, Bounds on tradeoffs between randomness and communication complexity, Comput. Complexity, 3 (1993), pp. 141-167.
13. D. CHAUM, C. CREPEAU, AND I. DAMGARD, Multiparty unconditionally secure protocols, in Proc. of 20th Annual ACM Symposium on Theory of Computing, ACM, New York, 1988, pp. 11-19.
14. B. CHOR AND E. KUSHILEVITZ, A zero-one law for boolean privacy, SIAM J. Discrete Math., 4 (1991), pp. 36-47.
15. B. CHOR AND E. KUSHILEVITZ, A communication-privacy tradeoff for modular addition, Inform. Process. Lett., 45 (1993), pp. 205-210.
16. B. CHOR, M. GERÉB-GRAUS, AND E. KUSHILEVITZ, Private computations over the integers, SIAM J. Comput., 24 (1995), pp. 376-386.
17. B. CHOR, M. GERÉB-GRAUS, AND E. KUSHILEVITZ, On the structure of the privacy hierarchy, J. Cryptology, 7 (1994), pp. 53-60.
18. B. CHOR AND O. GOLDREICH, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput., 17 (1988), pp. 230-261.
19. A. COHEN AND A. WIGDERSON, Dispersers, deterministic amplification, and weak random sources, in Proc. of 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 14-19.
20. M. FRANKLIN AND M. YUNG, Communication complexity of secure computation, in Proc. of 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 699-710.
21. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, How to play any mental game, in Proc. of 19th Annual ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 218-229.
22. R. IMPAGLIAZZO AND D. ZUCKERMAN, How to recycle random bits, in Proc. of 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 248-253.
23. D. KARGER AND D. KOLLER, (De)randomized construction of small samples spaces in NC, in Proc. of 35th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 252-263.
24. D. KARGER AND R. MOTWANI, Derandomization through approximation: An NC algorithm for minimum cuts, in Proc. of 26th Annual ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 497-506.
25. H. KARLOFF AND Y. MANSOUR, On construction of κ-wise independent random variables, in Proc. of 26th Annual ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 564-573.
26. D. E. KNUTH AND A. C. YAO, The complexity of non-uniform random number generation, in Algorithms and Complexity, J. Traub, ed., Academic Press, New York, 1976, pp. 357-428.
27. D. KOLLER AND N. MEGIDDO, Constructing small sample spaces satisfying given constraints, SIAM J. Discrete Math., 7 (1994), pp. 260-274.
28. D. KRIZANC, D. PELEG, AND E. UPFAL, A time-randomness tradeoff for oblivious routing, in Proc. of 20th Annual ACM Symposium on Theory of Computing, ACM, New York, 1988, pp. 93-102.
29. E. KUSHILEVITZ, S. MICALI, AND R. OSTROVSKY, Reducibility and completeness in multi-party private computations, in Proc. of 35th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 478-489.
30. E. KUSHILEVITZ, R. OSTROVSKY, AND A. ROSÉN, Characterizing linear size circuits in terms of privacy, in Proc. of 28th Annual ACM Symposium on Theory of Computing, ACM, New York, 1996, pp. 541-550.
31. E. KUSHILEVITZ, Privacy and communication complexity, SIAM J. Discrete Math., 5 (1992), pp. 273-284.
32. E. KUSHILEVITZ AND A. ROSÉN, A randomness-rounds tradeoff in private computation, advances in cryptology, in Proc. of Crypto '94, Y. Desmedt, ed., Lecture Notes in Comput. Sci. 839, Springer-Verlag, New York, 1994, pp. 397-410; SIAM J. Discrete Math., 11 (1998), to appear.
33. E. KUSHILEVITZ AND A. ROSÉN, A randomness-rounds tradeoff in private computation, advances in cryptology, in Proc. of Crypto '94, Y. Desmedt, ed., Lecture Notes in Comput. Sci. 839, Springer-Verlag, New York, 1994, pp. 397-410; SIAM J. Discrete Math., 11 (1998), to appear.
34. J. NAOR AND M. NAOR, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22 (1993), pp. 838-856.
35. N. NISAN, Pseudorandom generator for space bounded computation, in Proc. of 22nd Annual ACM Symposium on Theory of Computing, ACM, New York, 1990, pp. 204-212.
36. P. RAGHAVAN AND M. SNIR, Memory vs. randomization in on-line algorithms, in Proc. of 16th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 372, Springer-Verlag, New York, 1989, pp. 687-703.
37. L. J. SCHULMAN, Sample spaces uniform on neighborhoods, in Proc. of 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 17-25.
38. U. VAZIRANI AND V. VAZIRANI, Random polynomial time is equal to slightly-random polynomial time, in Proc. of 26th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1985, pp. 417-428.
39. A. C. YAO, Theory and applications of trapdoor functions, in Proc. of 23rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1982, pp. 80-91.
40. A. C. YAO, How to generate and exchange secrets, in Proc. of 27th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1986, pp. 162-167.
41. D. ZUCKERMAN, Simulating BPP using a general weak random source, in Proc. of 32nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 79-89.