Round efficiency of multi-party computation with a dishonest majority

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

Volumn 2656, Issue , 2003, Pages 578-595

  Katz, Jonathan ^a   Ostrovsky, Rafail ^b   Smith, Adam ^c  

^a University of Maryland ^*  (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BROADCAST CHANNELS; MULTIPARTY COMPUTATION; NON BLACK BOXES; ROUND COMPLEXITY; SCHEDULING TECHNIQUES; TRAPDOOR PERMUTATIONS;

CRYPTOGRAPHY;

EID: 33749018100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_36     Document Type: Article

References (34)

1. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In Eighth ACM Symposium on Principles of Distributed Computing, pages 201-209, 1989.
2. B. Barak. Constant-round coin-tossing with a man in the middle. In 43rd IEEE Symposium on the Foundations of Computer Science, 2002. References are to the preliminary full version, available from the author's web page.
3. B. Barak and O. Goldreich. Universal arguments of knowledge. In 17th IEEE Conference on Computational Complexity, pages 194-203, 2002.
4. D. Beaver. Foundations of secure interactive computing. In Advances in Cryptology - CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 377-391. IACR, Springer-Verlag, Aug. 1991.
5. D. Beaver and S. Goldwasser. Multiparty computation with faulty majority. In Advances in Cryptology - CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 589-590. IACR, Springer-Verlag, Aug. 1989.
6. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In 22nd ACM Symposium on the Theory of Computing, pages 503-513, 1990.
7. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In 20th ACM Symposium on the Theory of Computing, pages 1-10, May 1988.
8. R. Canetti. Security and composition of multiparty cryptographic protocols. J. Cryptology, 13(1):143-202, 2000.
9. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd IEEE Symposium on the Foundations of Computer Science, pages 136-147, Las Vegas, Nevada, Oct. 2001. IEEE.
10. R. Canetti and M. Fischlin. Universally composable commitments. In Advances in Cryptology - CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 19-40. IACR, Springer, 2001.
11. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable two-party and multi-party secure computation. In 34th ACM Symposium on the Theory of Computing, pages 494-503, Montréal, Québec, May 2002. ACM.
12. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In 20th ACM Symposium on the Theory of Computing, May 1988.
13. B. Chor and M. Rabin. Achieving independence in logarithmic number of rounds. In 6th ACM Symposium on Principles of Distributed Computing, 1987.
14. R. Cleve. Limits on the security of coin flips when half the processors are faulty. In 18th ACM Symposium on the Theory of Computing, pages 364-369, 1986.
15. R. Cramer and I. Damgård. Secure distributed linear algebra in a constant number of rounds. In Advances in Cryptology - CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science. IACR, Springer, 2001.
16. A. De Santis and G. Persiano. Zero-knowledge proofs of knowledge without interaction. In 33rd IEEE Symposium on the Foundations of Computer Science, pages 427-436. IEEE, 1992.
17. D. Dolev, C. Dwork, and M. Naor. Nonmalleable cryptography. SIAM J. Computing, 30(2):391-437, 2000.
18. D. Dolev and H. Strong. Authenticated algorithms for byzantine agreement. SIAM J. Computing, 12(4):656-666, 1983.
19. U. Feige and A. Shamir. Zero knowledge proofs of knowledge in two rounds. In Advances in Cryptology - CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 526-544. IACR, Springer-Verlag, Aug. 1989.
20. M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein, and A. Smith. Detectable Byzantine agreement secure against faulty majorities. In 21st ACM Symposium on Principles of Distributed Computing, pages 118-126, 2002.
21. R. Gennaro. Achieving independence efficiently and securely. In ACM Symposium on Principles of Distributed Computing, pages 130-136, 1995.
22. R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The round complexity of verifiable secret sharing and secure multicast. In 33rd ACM Symposium on the Theory of Computing, June 2001.
23. O. Goldreich. Secure multi-party computation. Electronic working draft, 2001.
24. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In 19th ACM Symposium on the Theory of Computing, pages 218-229. ACM, May 1987.
25. O. Goldreich and Y. Oren. Definitions and properties of zero-knowledge proof systems. J. Cryptology, 7(1):1-32, 1994.
26. S. Goldwasser and L. A. Levin. Fair computation of general functions in presence of immoral majority. In Advances in Cryptology - CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 77-93. Springer-Verlag, Aug. 1990.
27. S. Goldwasser and Y. Lindell. Secure computation without a broadcast channel. In 16th International Symposium on Distributed Computing (DISC), 2002.
28. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In 41nd IEEE Symposium on the Foundations of Computer Science, Redondo Beach, CA, Nov. 2000. IEEE.
29. J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in private computations. SIAM J. Computing, 29(4), 2000.
30. Y. Lindell. Parallel coin-tossing and constant-round secure two-party computation. In Advances in Cryptology - CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 171-189. IACR, Springer, 2001.
31. S. Micali and P. Rogaway. Secure computation. In Advances in Cryptology - CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 392-404. IACR, Springer-Verlag, Aug. 1991.
32. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for np using any one-way permutation. J. Cryptology, 11(2), 1998.
33. P. Rogaway. The Round Complexity of Secure Protocols. PhD thesis, MIT, 1991.
34. A. C.-C. Yao. How to generate and exchange secrets. In 27th IEEE Symposium on the Foundations of Computer Science, pages 162-167, 1986.