# Information Security and Cryptography Research Group

## Global Broadcast by Broadcasts Among Subsets of Players

### Matthias Fitzi and Ueli Maurer

IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 267, Jun 2000.

In the standard model with only pairwise communication channels, unconditionally secure broadcast among $n$ players is achievable if and only if the number $t$ of corrupted players satisfies $t<\frac{n}{3}$. We show that, when additionally given broadcast among each subset of three players then global broadcast is achievable if $t<\frac{n}{2}$.

## BibTeX Citation

@inproceedings{FitMau00b,
author       = {Matthias Fitzi and Ueli Maurer},
title        = {Global Broadcast by Broadcasts Among Subsets of Players},
booktitle    = {IEEE International Symposium on Information Theory --- ISIT 2000},
pages        = {267},
year         = {2000},
month        = {6},
publisher    = {IEEE},
}