On the price of equivocation in byzantine agreement

DOI10.1145/2332432.2332491zbMath1301.68068OpenAlexW2053796248MaRDI QIDQ2933806

Siddhartha Sen, Alexander Jaffe, Thomas Moscibroda

Publication date: 5 December 2014

Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2332432.2332491

zbMATH Keywords

expander graphsByzantine agreementhypergraph coloringpartial broadcast

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (12)

On perfection and imperfection of one-realizations of a given set ⋮ More result on the smallest one-realization of a given set ⋮ Broadcast from Minicast Secure Against General Adversaries ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ On the structure of uniform one-realizations of a given set ⋮ More results on the smallest one-realization of a given set. II ⋮ Zero-free intervals of chromatic polynomials of hypergraphs ⋮ Constrained colouring and \(\sigma\)-hypergraphs ⋮ The smallest one-realization of a given set. IV ⋮ ℱ-WORM colorings of some 2-trees: partition vectors ⋮ Strong Separations Between Broadcast and Authenticated Channels

This page was built for publication: On the price of equivocation in byzantine agreement