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 < n/3. In this paper, we show that this bound can be improved - at the sole price that the adversary can prevent successful completion of the protocol, but in which case all players will have agreement about this fact. Moreover, a first time slot during which the adversary forgets to cheat can be reliably detected and exploited in order to allow for future broadcasts with t < n/2. This even allows for secure multi-party computation with t < n/2 after the first detection of such a time slot.
Chapter PDF
Similar content being viewed by others
References
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.
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.
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.
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.
D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 11–19, 1988.
[CDD+99]_R. Cramer, I. Damgård, 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.
V. Chvátal. The tail of the hypergeometric distribution. Discrete Mathematics, 25:285–287, 1979.
[DFF+82]_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.
M. Fitzi, N. Gisin, and U. Maurer. Quantum solution to the byzantine agreement problem. To appear at Physical Review Letters, 87(21). Preliminary version: Quantum Physics, abstract quant-ph/0107127, 2001.
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.
M. J. Fischer, N. A. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1:26–39, 1986.
M. Fitzi and U. Maurer. From partial consistency to global broadcast. In Proceedings of STOC’ 00, pp. 494–503, Portland, Oregon, 2000. ACM.
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game — a completeness theorem for protocols with honest majority. In Proceedings of STOC’ 87, pp. 218–229, 1987.
W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13–30, 1963.
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.
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.
T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of STOC’ 89, pp. 73–85, 1989.
R. Turpin and B. A. Coan. Extending binary Byzantine Agreement to multivalued Byzantine Agreement. Information Processing Letters, 18(2):73–76, Feb. 1984.
A. C. Yao. Protocols for secure computations. In Proceedings of FOCS’ 82, pp. 160–164, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fitzi, M., Gisin, N., Maurer, U., von Rotz, O. (2002). Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch. In: Knudsen, L.R. (eds) Advances in Cryptology — EUROCRYPT 2002. EUROCRYPT 2002. Lecture Notes in Computer Science, vol 2332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46035-7_32
Download citation
DOI: https://doi.org/10.1007/3-540-46035-7_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43553-2
Online ISBN: 978-3-540-46035-0
eBook Packages: Springer Book Archive