On the number of random bits in totally private computation

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

Volumn 944, Issue , 1995, Pages 171-182

  Blundo, Carlo ^a   De Santis, Alfredo ^a   Persiano, Giuseppe ^a   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

BIT INTEGERS; COMPUTATIONAL RESOURCES; LOWER BOUNDS; MODULO 2; POINT-TO-POINT COMMUNICATION CHANNELS; PRIVATE COMPUTATION; PRIVATE PROTOCOLS; RANDOM BITS;

AUTOMATA THEORY;

EID: 84958034013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60084-1_72     Document Type: Conference Paper

References (20)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non- Cryptographic Fault-Tolerant Distributed Computation, STOC 1988, pp. 1-10.
2. C. Blundo, A. De Santis, and U. Vaccaro, Randomness in Distribution Protocols, ICALP 1994, Vol. 820 of LNCS, 1994, pp. 568-579.
3. R. Canetti and O. Goldreich, Bounds on Tradeoffs Between Randomness and Communication Complexity, Computational Complexity 3, pp. 141-167, 1993.
4. S. Chari, P. Rohatgi, and A. Srinivasan, Randomness-Optimal Unique Element Isolation, with Application to Perfect Matching and Related Problems, STOC 1993, pp. 458-467.
5. D. Chaum, C. Crépeau, and I. Damgård, Multiparty Unconditionally Secure Protocols, STOC 1988, pp. 11-19.
6. B. Chor, M. Gereb-Graus, and E. Kushilevitz, On The Structure of the Privacy Hierarchy, J. of Cryptology 7, 1994, pp. 53-60.
7. B. Chor and E. Kushilevitz, A Zero-One Law for Boolean Privacy, SIAM J. Discrete Math., 4, 1991, pp. 36-47.
8. B. Chor and E. Kushilevitz, A Communication-Privacy Tradeoff for Modular Addition, Information Processing Letters, Vol. 45, 1993, pp. 205-210.
9. B. Chor and N. Shani, The Privacy of Dense Symmetric Functions, to appear in Computational Complexity.
10. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 1991.
11. R. Fleischer, H. Jung, and K. Melhorn, A Time-Randomness Tradeoff for Communication Complexity, 4th International Workshop on Distributed Algorithms, Vol. 486 of LNCS, 1991, pp. 390-401.
12. R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, FOCS 1989 pp. 248-255.
13. D.E. Knuth and A.C. Yao, The Complexity of Nonuniform Random Number Generation, in “Algorithms and Complexity”, Academic Press, 1976, pp. 357-428.
14. D. Krizanc, D. Peleg, and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, STOC 1988, pp. 93-102.
15. E. Kushilevitz, Privacy and Communication Complexity, SIAM J. Discrete Math., 5, pp. 273-284.
16. E. Kushilevitz, S. Micali, and R. Ostrowsky, Universal Boolean Judges and their Characterization, FOCS 1994, pp. 478-489.
17. E. Kushilevitz and Y. Mansour, Small Sample Spaces and Privacy, manuscript.
18. E. Kushilevitz and A. Rosen, A Randomness-Rounds Tradeoff in Private Computation, CRYPTO 94, Vol. 839 of LNCS, 1994, pp. 397-410.
19. P. Raghavan and M. Snir, Memory Versus Randomization in On-line Algorithms, ICALP 1989, LNCS, 1989, pp. 687-703.
20. D. Zuckerman, Simulating BPP Using a General Weak Random Source, FOCS 1991, pp. 79-89.