Skip to main content
Conference ProceedingsOPEN ACCESS

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) (2002) 2332 482-501
DOI: 10.1007/3-540-46035-7_32
35Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

It is well-known that n players, connected only by pairwise secure channels, can achieve unconditional broadcast if and only if the number t of cheaters satisfies t

Author supplied keywords

Cite

CITATION STYLE

APA

Fitzi, M., Gisin, N., Maurer, U., & Von Rotz, O. (2002). Unconditional byzantine agreement and multi-party computation secure against dishonest minorities from scratch. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2332, pp. 482–501). Springer Verlag. https://doi.org/10.1007/3-540-46035-7_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free