Randomness versus fault-tolerance

Journal of Cryptology

Volumn 13, Issue 1, 2000, Pages 107-142

  Canetti, Ran ^a   Kushilevitz, Eyal ^b   Ostrovsky, Rafail ^c   Rosén, Adi ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c TELCORDIA TECHNOLOGIES   (United States)

^d UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011213598     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459910005     Document Type: Article

References (62)

1. [AGHP] N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple Constructions of Almost Jt-Wise Independent Random Variables, FOCS 90 and Random Structures Algorithms, Vol. 3, 1992, pp. 289-304. (Addendum: Vol. 4,1993, pp. 119-120)
2. [B1 ] D. Beaver, Perfect Privacy for Two-Party Protocols, TR-11 -89, Harvard University, 1989.
3. [B2] D. Beaver, Foundations of Secure Interactive Computing, Proc. CRYPTO, 1991, pp. 377-391.
4. [B3] D. Beaver, Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Fault Minority, J. Cryptology, Vol. 4, 1991, pp. 75-122.
5. [BB] J. Bar-IIan and D. Beaver, Non-Cryptographic Fault-Tolerant Computing in a Constant Number o Rounds, Proc. Sth PODC, 1989, pp. 201-209.
6. [BCG] M. Ben-Or, R. Canetti, and O. Goldreich, Asynchronous Secure Computations, Proc. 15th STOC 1993, pp. 52-61.
7. [BDPVJ C. Blundo, A. De-Santis, G. Persiano, and U. Vaccaro, On the Number of Random Bits in Totall Private Computations, Proc. ICALP, LNCS 944, Springer-Verlag, Berlin, 1995, pp. 171-182.
8. [BDV] C. Blundo, A. De-Santis, and U. Vaccaro, Randomness in Distribution Protocols, Proc. ICALP LNCS 820, Springer-Verlag, Berlin, 1994, pp. 568-579.
9. [BGG] M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in Interactive Proofs, Proc. FOCS, 1990 pp. 563-571
10. [BGS] C. Blundo, A. Giorgio Gaggia, and D. R. Stinson, On the Dealer's Randomness Required in Secret Sharing Schemes, EuroCrypt94 and Designs Codes Cryptography, Vol. 11, No. 2,1997, pp. 235- 259
11. [BOW] M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. STOC, 1988, pp. 1-10.
12. [BM] M. Blum and S. Micali, How to Generate Cryptographically Strong Sequences of Pseudo-Rando Bits, FOCS 82 and SIAMJ. Comput., Vol. 13,1984, pp. 850-864
13. [Cl] R. Canetti, Studies in Secure Multi-Party Computation and Applications, Ph.D. Thesis, Departmen of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, June 1995
14. [C2] R. Canetti, Security and Composition of Multiparty Cryptographic Protocols, J. Cryptology, thi issue.
15. [CCD] D. Chaum, C. Crepeau, and I. Damgard, Multiparty Unconditionally Secure Protocols, Proc. STOC 1988, pp. 11-19.
16. [CD] B. Chor and C. Dwork, Randomization in Byzantine Agreement, Adv. Comput. Res., Vol. 5,1989 pp. 443-4197.
17. [CFGN] R. Canetti, U. Feige, O. Goldreich, and M. Naor, Adaptively Secure Multi-Party Computation, Proc 2Sih STOC, 1996, pp. 639-648.
18. [CG1] B. Chor and O. Goldreich, Unbiased Bits from Sources of Weak Randomness and Probabilisti Communication Complexity, FOCS 85 and SICOMP, Vol. 17,1988, pp. 230-261.
19. [CG2] R. Canetti and O. Goldreich, Bounds on Tradeoffs between Randomness and Communicatio Complexity, FOCS 90 and Comput. Complexity, Vol. 3,1993, pp. 141-167.
20. [COMA] B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Verifiable Secret Sharing and Achievin Simultaneity in the Presence of Faults, Proc. FO'CS, 1985, pp. 383-395.
21. [CK1] B. Chor and E. Kushilevitz, A Zero-One Law for Boolean Privacy, STOC 89 and SIDMA, Vol. 4 1991, pp. 36-47.
22. [CK2] B. Chor and E. Kushilevitz, A Communication-Privacy Tradeoff for Modular Addition, Inform Process. Lett., Vol. 45, 1993, pp. 205-210.
23. [CRS] S. Chari, P. Rohatgi, and A. Srinivasan, Randomness-Optimal Unique Element Isolation, wit Application to Perfect Matching and Related Problems, Proc. STOC, 1993, pp. 458-467.
24. [FKN] U. Feige, J. Kilian, and M. Naor, A Minimal Model for Secure Computation, Proc. STOC, 1994 pp. 554-563. .,
25. [FL] M. Fischer and N. Lynch, A Lower Bound for the Time to Assure Interactive Consistency, IPL Vol. 14, No. 4,1982, pp. 183-186.
26. [FLP] M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of Distributed Consensus with On Faulty Process, J. Assoc. Comput. Mach., Vol. 32, No. 2,1985, pp. 374-382.
27. [FM] P. Feldman and S. Micali, An Optimal Algorithm for Synchronous Byzantine Agreement, STO 88 and SIAM J. Comput., Vol. 26, No. 4,1997, pp. 873-933.
28. [FY] M. Franklin, and M. Yung, Communication Complexity of Secure Computation, Proc. STOC, 1992 pp. 699-710.
29. [G] O. Goldreich, Foundations of Cryptography (Fragments of a Book), Weizmann Institute of Science 1995. (Available at http://philby.ucsd.edu.)
30. [GMW] O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game, Proc. 19th STOC 1987, pp. 218-229.
31. [GL] S. Goldwasser and L. Levin, Fair Computation of General Functions in Presence of Immora Majority, Proc. CRYPTO, 1990.
32. [GMR] S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems SIAMJ. Comput., Vol. 18, No. 1,1989, pp. 186-208
33. [GO] O. Goldreich and Y. Oren, On the Cunning Power of Cheating Verifiers: Some Observations abou Zero-Knowledge Proofs, in preparation. Preliminary version by Y. Oren in Proc. 28;/i FOCS, 1987
34. [GRR] R. Gennaro, T. Rabin, and M. Rabin, Simplified VSS and Fact-Track Multiparty Computations wit Applications to Threshold Cryptography, Proc. PODC, 1998, pp. 101-111.
35. [H] J. Hastad, Pseudo-Random Generators under Uniform Assumptions, Proc. STOC 90.
36. [ILL] R. Impagliazzo, R., L. Levin, and M. Luby, Pseudo-Random Generation from One-Way Functions Proc. STOC 89.
37. [IZ] R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, Proc. 30th FOCS, 1989, pp. 248 253.
38. [K] E. Kushilevitz, Privacy and Communication Complexity, FOCS 89, and SIAM J. Discrete Math. Vol. 5, No. 2,1992, pp. 273-284
39. [KK] D. Karger and D. Koller, (De)randomized Construction of Small Sample Spaces in NC, FOCS 94 and J. Comput. System Sci., Vol. 55, No. 3,1997, pp. 402-413.
40. [KM1] D. Koller and N. Megiddo, Constructing Small Sample Spaces Satisfying Given Constraints, STO 93 and SIAM J. Discrete Math., Vol. 7, No. 2,1994, pp. 260-274
41. [KM2] D. Karger and R. Motwani, Derandomization through Approximation: An WC Algorithm for Minimum Cuts, Proc. 26th STOC, 1994, pp. 497-506
42. [KM3] H. Karloff and Y. Mansour, On Construction of it-wise Independent Random Variables, STOC 94 and Combinatorial, Vol. 17, No. 1,1997, pp. 91-107
43. [KM4] E. Kushilevitz and Y. Mansour, Randomness in Private Computations, PODC 1996 and SIAM J. Discrete Math., Vol. 10, No. 4,1997, pp. 647-661
44. [KMO] E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and Completeness in Multi-Party Privat Computations, Proc. 35th FOCS, 1994, pp. 478-4189.
45. [KOR1] E. Kushilevitz, R. Ostrovsky, and A. Rosén, Characterizing Linear Size Circuits in Terms of Privacy STOC 96 and J. Comput. System Sci., Vol. 58,1999, pp. 129-136
46. [KOR2] E. Kushilevitz, R. Ostrovsky, and A. Rosén, Amortizing Randomness in Private Multiparty Computations, Proc. 17th PODC, 1998, pp. 81-90
47. [KPU] D. Krizanc, D. Peleg, and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, Proc STOC, 1988, pp. 93-102.
48. [KR] E. Kushilevitz and A. Rosén, A Randomness-Rounds Tradeoff in Private Computation, CRYPT 94 and SIAMJ. Discrete Math., Vol. 11, No. 1, 1998, pp. 61-80.
49. [KY] D. E. Knuth and A. C. Yao, The Complexity of Non-Uniform Random Number Generation, I Algorithms and Complexity, ed. J. Traub, 1976, pp. 357-428.
50. [MS] F. J. Macwiliams and N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland Amsterdam, 1977
51. [MR] S. Micali and P. Rogaway, Secure Computation, manuscript, 1992 (updated version, 1998). Preliminary version in P we. CRYPTO 91, pp. 392-4104.
52. [N] N. Nisan, Pseudorandom Generator for Space Bounded Computation, Proc. 22nd STOC, 1990 pp. 204-212.
53. [NN] J. Naor and M. Naor, Small-Bias Probability Spaces: Efficient Constructions and Applications STOC 90 and SIAM J. Comput., Vol. 22, No. 4,1993, pp. 838-856.
54. [RB] T. Rabin and M. Ben-Or, Verifiable Secret Sharing and Multiparty Protocols with Honest Majority Proc. 2lst STOC, 1989, pp. 73-85.
55. [RS] P. Raghavan and M. Snir, Memory vs. Randomization in On-Line Algorithms, Proc. ICALP, 1989 pp. 687-703
56. [SI] A. Shamir, How to Share a Secret, Comm. ACM, Vol. 22,1979, pp. 612-613.
57. [S2] L. J. Schulman, Sample Spaces Uniform on Neighborhoods, Proc. 24th STOC, 1992, pp. 17-25.
58. [S3] M. Sudan, Algorithmic Issues in Coding Theory, Proc. Ylth Conf. on Foundations of Software Technology and Theoretical Computer Science, Kharapur, India, 1997. Available on-line at theory.Ics.mit.edurmadhu/
59. [vLW] J. H. van Lint and R. M. Wilson, A Course in Combinatorics, Cambridge University Press Cambridge, 1992
60. [Yl] A. C. Yao, Theory and Applications of Trapdoor Functions, Proc. 23rd FOCS, 1982, pp. 80-91.
61. [Y2] A. Yao, Protocols for Secure Computation, Proc. 23rd FOCS, 1982, pp. 160-164.
62. [Z] D. Zuckerman, Simulating BPP Using a General Weak Random Source, FOCS 91 zndAlgorithinica, Vol. 16,1996, pp. 367-391.