Two-threshold broadcast and detectable multi-party computation

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

Volumn 2656, Issue , 2003, Pages 51-67

  Fitzi, Matthias ^a   Hirt, Martin ^b   Holenstein, Thomas ^b   Wullschleger, Jürg ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

DISTRIBUTED PROTOCOLS; FOLLOWING PROBLEM; MULTIPARTY COMPUTATION; SECURE COMPUTATION;

COMPUTATION THEORY;

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

References (31)

1. D. Beaver. Multiparty protocols tolerating half faulty processors. In CRYPTO '89, vol. 435 of LNCS, pp. 560-572. Springer-Verlag, 1989.
2. D. Beaver and S. Goldwasser. Multiparty computation with faulty majority. In Proc. 30th FOCS, pp. 468-473. IEEE 1989.
3. P. Berman and J. Garay. Asymptotically optimal distributed consensus. In Proc. 16th International Colloquium on Automata, Languages and Programming, vol. 372 of LNCS, pp. 80-94. Springer-Verlag, 1989.
4. P. Berman, J. A. Garay, and K. J. Perry. Towards optimal distributed consensus. In Proc. 30th FOCS, pp. 410-415. IEEE, 1989.
5. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th STOC, pp. 1-10. ACM, 1988.
6. B. Baum-Waidner, B. Pfitzmann, and M. Waidner. Unconditional Byzantine agreement with good majority. In Proc. 8th Theoretical Aspects of Computer Science, vol. 480 of LNCS, pp. 285-295. Springer-Verlag, 1991.
7. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In Proc. 20th STOC, pp. 11-19. ACM, 1988.
8. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In EUROCRYPT '99, vol. 1592 of LNCS, pp. 311-326. Springer-Verlag, 1999.
9. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. Journal of the ACM, 40(1):17-47, 1993.
10. D. Dolev, M. J. Fischer, R. Fowler, N. A. Lynch, and H. R. Strong. An efficient algorithm for Byzantine agreement without authentication. Information and Control, 52(3):257-274, 1982.
11. D. Dolev and H. R. Strong. Polynomial algorithms for multiple processor agreement. In Proc. 14th STOC, pp. 401-407. ACM, 1982.
12. M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein, and A. Smith. Byzantine agreement secure against faulty majorities from scratch. In Proc. 21st PODC, ACM, 2002.
13. M. Fitzi, N. Gisin, and U. Maurer. Quantum solution to the Byzantine agreement problem. Physical Review Letters, 87(21), 2001.
14. 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, vol. 2332 of LNCS. Springer-Verlag, 2002.
15. M. J. Fischer, N. A. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1:26-39, 1986.
16. P. Feldman and S. Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM Journal on Computing, 26(4):873-933, 1997.
17. Matthias Fitzi and Ueli Maurer. Efficient Byzantine agreement secure against general adversaries. In Proc. 12th DISC, vol. 1499 of LNCS, pp. 134-148. Springer-Verlag, 1998.
18. S. Goldwasser and Y. Lindell. Secure computation without agreement. In Proc. 16th DISC'02, vol. 2508 of LNCS, pp. 17-32. Springer-Verlag, 2002.
19. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. 19th STOC, pp. 218-229, ACM, 1987.
20. O. Goldreich. Secure multi-party computation, working draft, version 1.3, June 2001.
21. Martin Hirt and Ueli Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. In Proc. 16th PODC, pp. 25-34. ACM 1997.
22. Full version in Journal of Cryptology, 13(1):31-60, 2000.
23. T. Holenstein. Hybrid broadcast protocols. Master's Thesis, ETH Zurich, October 2001.
24. A. Karlin and A. C. Yao. Manuscript, 1984.
25. L. Lamport. The weak Byzantine generals problem. Journal of the ACM, 30(3):668-676, 1983.
26. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. Transactions on Programming Languages and Systems, 4(3):382-401. ACM, 1982.
27. B. Pfitzmann and M. Waidner. Information-theoretic pseudosignatures and Byzantine agreement for t ≥ n/3. Research Report RZ 2882 (#90830), IBM Research, 1996.
28. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st STOC, pp. 73-85. ACM, 1989.
29. R. Turpin and B. A. Coan. Extending binary Byzantine Agreement to multivalued Byzantine Agreement. Information Processing Letters, 18(2):73-76, 1984.
30. N. H. Vaidya and D. K. Pradhan. Degradable agreement in the presence of Byzantine faults. In Proc. 13th International Conference on Distributed Computing Systems, pp. 237-245. IEEE, 1993.
31. A. C. Yao. Protocols for secure computations. In Proc. 23rd FOCS, pp. 160-164. IEEE, 1982.