Unconditional byzantine agreement and multi-party computation secure against dishonest minorities from scratch

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

Volumn 2332, Issue , 2002, Pages 482-501

  Fitzi, Matthias ^a   Gisin, Nicolas ^b   Maurer, Ueli ^a   Von Rotz, Oliver ^a  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

Byzantine agreement; Multi party computation; Unconditional security

Indexed keywords

CRYPTOGRAPHY;

BYZANTINE AGREEMENT; MULTIPARTY COMPUTATION; SECURE CHANNELS; SECURE MULTI-PARTY COMPUTATION; TIME SLOTS; UNCONDITIONAL SECURITY;

COMPUTATION THEORY;

EID: 84947209216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_32     Document Type: Conference Paper

References (19)

1. C. H. Bennett and G. Brassard. An update on quantum cryptography. In Proceedings of CRYPTO 84, volume 196 of Lecture Notes in Computer Science, pp. 475–480. Springer-Verlag, 1985, 19–22 Aug. 1984.
2. D. Beaver. Multiparty protocols tolerating half faulty processors. In Proceedings of CRYPTO ’89, volume 435 of Lecture Notes in Computer Science, pp. 560–572. Springer-Verlag, 1990, 20–24 Aug. 1989.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 1–10, 1988.
4. B. Baum-Waidner, B. Pfitzmann, and M. Waidner. Unconditional byzantine agreement with good majority. In Proceedings of STACS ’91, volume 480 of LNCS, pp. 285–295, Hamburg, Germany, 14–16 Feb. 1991. Springer.
5. D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20thA CM Symposium on the Theory of Computing (STOC), pp. 11–19, 1988.
6. R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In Proceedings of EUROCRYPT ’99, Lecture Notes in Computer Science, 1999.
7. V. Chvatal. The tail of the hypergeometric distribution. Discrete Mathematics, 25:285–287, 1979.
8. 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, Mar. 1982.
9. M. Fitzi, N. Gisin, and U. Maurer. Quantum solution to the byzantine agreement problem. To appear at Physical ReviewLetters, 87(21). Preliminary version: Quantum Physics, abstract quant-ph/0107127, 2001.
10. M. Fitzi, J. A. Garay, U. Maurer, and R. Ostrovsky. Minimal complete primitives for unconditional multi-party computation. In Proceedings of CRYPTO ’01, Lecture Notes in Computer Science, 2001.
11. M. J. Fischer, N. A. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1:26–39, 1986.
12. M. Fitzi and U. Maurer. From partial consistency to global broadcast. In Proceedings of STOC ’00, pp. 494–503, Portland, Oregon, 2000. ACM.
13. O. Goldreich, S. Micali, and A. Wigderson. Howto play any mental game—a completeness theorem for protocols with honest majority. In Proceedings of STOC ’87, pp. 218–229, 1987.
14. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13–30, 1963.
15. A. Karlin and A. C. Yao. Manuscript. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228–234, Apr. 1980.
16. B. Pfitzmann and M. Waidner. Unconditional byzantine agreement for any number of faulty processors. In Proceedings of STACS ’92, volume 577 of LNCS, pp. 339–350. Springer, 1992.
17. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of STOC ’89, pp. 73–85, 1989.
18. R. Turpin and B. A. Coan. Extending binary Byzantine Agreement to multivalued Byzantine Agreement. Information Processing Letters, 18(2):73–76, Feb. 1984.
19. A. C. Yao. Protocols for secure computations. In Proceedings of FOCS ’82, pp. 160–164, 1982.