Secure multi-party computation without agreement

Journal of Cryptology

Volumn 18, Issue 3, 2005, Pages 247-287

  Goldwasser, Shafi ^a   Lindell, Yehuda ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Broadcast; Protocol composition; Secure multi party computation

Indexed keywords

BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); ERROR CORRECTION; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS; SECURITY OF DATA;

BYZANTINE AGREEMENT; DATA CORRUPTION; MULTI-PARTY COMPUTATION; POINT-TO-POINT NETWORK;

COMPUTATIONAL METHODS;

EID: 22344432877     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-005-0319-z     Document Type: Article

References (38)

1. D. Beaver. Foundations of Secure Interactive Computing. In CRYPTO '91 (LNCS 576), pages 377-391, Springer-Verlag, Berlin, 1991.
2. D. Beaver and S. Goldwasser. Multiparty Computation with Faulty Majority. In Proc. 30th FOCS, pages 468-473, 1989.
3. D. Beaver and S. Haber. Cryptographic Protocols Provably Secure Against Dynamic Adversaries. In EUROCRYPT '92 (LNCS 658), pages 307-323, Springer-Verlag, Berlin, 1992.
4. D. Beaver, S. Micali and P. Rogaway. The Round Complexity of Secure Protocols. In Proc. 22nd STOC, pages 503-513, 1990.
5. M. Ben-Or and R. El-Yaniv. Optimally-Resilient Interactive Consistency in Constant Time. Distributed Computing, 16(4):249-262, 2003.
6. M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In Proc. 20th STOC, pages 1-10, 1988.
7. M. Blum. How to Prove a Theorem so No One Else Can Claim It. Proceedings of the International Congress of Mathematicians, Berkeley, California, pp. 1444-1451, 1986.
8. G. Bracha. An Asynchronous [(n - 1)/3]-Resilient Consensus Protocol. In Proc. 3rd PODC, pages 154-162, 1984.
9. R. Canetti. Security and Composition of Multi-Party Cryptographic Protocols. Journal of Cryptology, 13(1): 143-202, 2000.
10. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proc. 42nd FOCS, pages 136-145, 2001.
11. R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-Party Computation. In Proc. 28th STOC, pages 639-648, 1996.
12. R. Canetti and M. Fischlin. Universally Composable Commitments. In CRYPTO 2001 (LNCS 2139), pages 19-40, Springer-Verlag, Berlin, 2001.
13. R. Canetti and H. Krawczyk. Universally Composable Notions of Key-Exchange and Secure Channels. In EUROCRYPT 2002 (LNCS 2332), pages 337-351, Springer-Verlag, Berlin, 2002.
14. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Secure Computation. In Proc. 34th STOC, pages 494-503, 2002.
15. R. Canetti and T. Rabin. Fast Asynchronous Byzantine Agreement with Optimal Resilience. In. Proc. 25th STOC, pages 42-51, 1993.
16. D. Chaum, C. Crepeau and I. Damgard. Multi-Party Unconditionally Secure Protocols. In Proc. 20th STOC, pages 11-19, 1988.
17. D. Dolev. The Byzantine Generals Strike Again. Journal of Algorithms, 3(1):14-30, 1982.
18. U. Feige and A. Shamir. Zero-Knowledge Proofs of Knowledge in Two Rounds. In CRYPTO '89 (LNCS 435), pages 526-544, Springer-Verlag, Berlin, 1989.
19. P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine agreement. SIAM Journal of Computing, 26(2):873-933, 1997.
20. M. Fitzi, N. Gisin, U. Maurer and O. Von Rotz. Unconditional Byzantine Agreement and Multi-Party Computation Secure Against Dishonest Minorities from Scratch. In EUROCRYPT 2002 (LNCS 2332), pages 482-501, Springer-Verlag, Berlin, 2002.
21. M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein and A. Smith. Byzantine Agreement Secure Against Faulty Majorities From Scratch. In Proc. 21st PODC, pages 118-126, 2002.
22. Z. Galil, S. Haber and M. Yung. Cryptographic Computation: Secure Fault Tolerant Protocols and the Public Key Model. In CRYPTO '87 (LNCS 293), pages 135-155, Springer-Verlag, Berlin, 1987.
23. O. Goldreich. Secure Multi-Party Computation. Manuscript, version 1.4, 2002. Available from http://www.wisdom.weizmann.ac.il/~oded/pp.html.
24. O. Goldreich. Concurrent Zero-Knowledge with Timing Revisited. In Proc. 34th STOC, pages 332-340, 2002.
25. O. Goldreich, S. Micali and A. Wigderson. How to Play Any Mental Game-A Completeness Theorem for Protocols with Honest Majority. In Proc. 19th STOC, pages 218-229, 1987. For details see [23].
26. O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM, 38(1):691-729, 1991.
27. S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO '90 (LNCS 537), pages 77-93, Spring-Verlag, Berlin, 1990.
28. J.Kilian, Founding Cryptography on Oblivious Transfer. In Proc. 20th STOC, pages 20-31, 1988.
29. J. Kilian, A General Completeness Theorem for Two-Party Games. In Proc. 23rd STOC, pages 553-560, 1991.
30. L. Lamport. The Weak Byzantine Generals Problem. Journal of the ACM, 30(3):668-676, 1983.
31. L. Lamport, R. Shostack and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982.
32. Y. Lindell, A. Lysyanskaya and T. Rabin. On the Composition of Authenticated Byzantine Agreement. In Proc. 34th STOC, pages 514-523, 2002.
33. Y. Lindell. Lower Bounds for Concurrent Self Composition. In Proceedings of the 1st Theory of Cryptography Conference (TCC) (LNCS 2951), pages 203-222, Springer-Verlag, Berlin, 2004.
34. S. Micali and P. Rogaway. Secure Computation. Unpublished manuscript, 1992. Preliminary version in CRYPTO '91 (LNCS 576), pages 392-404, Springer-Verlag, Berlin, 1991.
35. M. Pease, R. Shostak and L. Lamport. Reaching Agreement in the Presence of Faults. Journal of the ACM, 27(2):228-234, 1980.
36. B. Pfitzmann and M. Waidner. Information-Theoretic Pseudosignatures and Byzantine Agreement for t >= n/3. Technical Report RZ 2882 (#90830), IBM Research, 1996.
37. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proc. 21st STOC, pages 73-85, 1989.
38. A. Yao. How to Generate and Exchange Secrets. In Proc. 27th FOCS, pages 162-167, 1986.