Fault-tolerant computation in the full information model

SIAM Journal on Computing

Volumn 27, Issue 2, 1998, Pages 506-544

  Goldreich, Oded ^a   Goldwasser, Shaft ^b   Linial, Nathan ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Fault tolerant multiparty protocols; Influences in general two party computations; Sampling with weak sources of randomness

Indexed keywords

EID: 1542674248     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793246689     Document Type: Article

References (26)

1. N. ALON AND M. NAOR, Coin-flipping games immune against linear-sized coalitions, SIAM J. Comput., 22 (1993), pp. 403-417.
2. D. BEAVER AND S. GOLDWASSER, Distributed computation with faulty majority, in Proc. 30th Annual IEEE Symp. on Foundations of Computing, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 468-473.
3. M. BEN-OR, S. GOLDWASSER, AND A. WIGDERSON, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in Proc. 20th Annual ACM Symp. on Theory of Computing, ACM, New York, 1988, pp. 1-10.
4. M. BEN-OR AND N. LINIAL, Collective coin flipping, in Randomness and Computation, S. Micali, ed., JAI Press, Greenwich, CT, 1989, pp. 91-115.
5. M. BEN-OR, N. LINIAL, AND M. SAKS, Collective coin flipping and other models of imperfect randomness, Colloq, Math Soc. János Bolyai 52, Combinatorics Eger 1987, pp. 75-112.
6. B. CHOR AND O. GOLDREICH, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput., 17 (1988), pp. 230-261.
7. D. CHAUM, C. CREPEAU, AND I. DAMGÅRD, Multiparty unconditionally secure protocols, in Proc. of 20th Annual ACM Symp. on Theory of Computing, ACM, New York, 1988, pp. 11-19.
8. B. CHOR AND E. KUSHILEVITZ, A zero-one law for boolean privacy, SIAM J. Discrete Math., 4 (1991), pp. 36-47.
9. J. COOPER AND N. LINIAL, Fast perfect-information leader election protocol with linear immunity, in 25th Annual ACM Symposium on the Theory of Computing, San Diego, ACM, New York, 1993, pp. 662-671; Combinatorica, to appear.
10. I. DAMGÅRD, Interactive hashing can simplify zero-knowledge protocol design without computational assumptions, in Advances in Cryptology, Proceedings of Crypto93, Lecture Notes in Computer Science 773, Springer-Verlag, New York, 1983, pp. 100-109.
11. Z. GALIL, S. HABER, AND M. YUNG, Cryptographic computation: Secure faulty-tolerant protocols and the public key model, in Advances in Cryptology, Proceedings of Crypto87, Lecture Notes in Computer Science 293, Springer-Verlag, New York, 1987, pp. 135-155.
12. O. GOLDREICH, S. GOLDWASSER, AND N. LINIAL, Fault-tolerant Computation in the Full Information Model, Tech. report TR-682, Computer Science Dept., Technion, Haifa, Israel, July 1991.
13. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, Proofs that yield nothing but their validity and a methodology for cryptographic protocol design, J. Assoc. Comput. Mach., 38 (1991), pp. 691-729.
14. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, How to play any mental game, in Proc. 19th Annual ACM Symp. on Theory of Computing, ACM, New York, 1987, pp. 218-229.
15. S. GOLDWASSER AND L. A. LEVIN, Fair computation of general functions in presence of immoral majority, in Advances in Cryptology, Proceedings of Crypto90, Lecture Notes in Computer Science 537, Springer-Verlag, New York, 1990, pp. 77-93.
16. J. KAHN, G. KALAI, AND N. LINIAL, The influence of variables on boolean functions, in 29th Annual IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 68-80.
17. J. KILIAN, Founding cryptography on oblivious transfer, in Proc. of 20th Annual ACM Symp. on Theory of Computing, ACM, New York, pp. 20-29, 1988.
18. M. NAOR, R. OSTROVSKY, R. VENKATESAN, AND M. YUNG, Perfect zero-knowledge arguments for NP can be based on general complexity assumptions, in Advances in Cryptology, Proceedings of Crypto92, Lecture Notes in Computer Science 740, Springer-Verlag, New York, 1992; J. Cryptology, to appear.
19. M. NAOR, R. OSTROVSKY, R. VENKATESAN, AND M. YUNG, Perfect zero-knowledge arguments for NP can be based on general complexity assumptions, in Advances in Cryptology, Proceedings of Crypto92, Lecture Notes in Computer Science 740, Springer-Verlag, New York, 1992; J. Cryptology, to appear.
20. R. OSTROVSKY, S. RAJAGOPALAN, AND U. VAZIRANI, Simple and efficient leader election in the full information model, in Proc. 26th Annual ACM Symp. on Theory of Computing, ACM, New York, 1994, pp. 234-242.
21. R. OSTROVSKY, R. VENKATESAN, AND M. YUNG, Fair games against an all-powerful adversary, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 13, Jin-Yi Cai ed., AMS, Providence, RI, 1993, pp. 155-169.
22. R. OSTROVSKY, R. VENKATESAN, AND M. YUNG, Interactive hashing simplifies zero-knowledge protocol design, in Proc. Eurocrypt93, Lecture Notes in Computer Science 765, Springer-Verlag, New York, 1983, pp. 267-273.
23. M. SANTHA AND U. V. VAZIRANI, Generating quasi-random sequences from slightly-random sources, in 25th Annual IEEE Symp. on Foundation of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1984, pp. 434-440.
24. U. V. VAZIRANI AND V. V. VAZIRANI, Random polynomial time is equal to slightly-random polynomial time, in 26th Annual IEEE Symp. on Foundation of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1985, pp. 417-428.
25. A. C. YAO, Protocols for secure computations, in 23rd Annual IEEE Symp. on Foundations of Computer Science, 1982, pp. 160-164.
26. A. C. YAO, How to generate and exchange secrets, in 27th Annual IEEE Symp. on Foundations of Computer Science, 1986, pp. 162-167.