Three decades ago, Pease et al. introduced the problem of Byzantine Agreement [PSL 80] where nodes need to maintain a consistent view of the world in spite of the challenge posed by Byzantine faults. Subsequently, it is well known that Byzantine agreement over a completely connected synchronous network of n nodes tolerating up to t faults is (efficiently) possible if and only if t < n. (which is a huge improvement over the bound of t
CITATION STYLE
Bansal, P., Gopal, P., Gupta, A., Srinathan, K., & Vasishta, P. K. (2011). Byzantine agreement using partial authentication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6950 LNCS, pp. 389–403). https://doi.org/10.1007/978-3-642-24100-0_38
Mendeley helps you to discover research relevant for your work.