The Byzantine Generals Problem in Generic and Wireless Networks

DOI10.1007/978-3-319-04720-1_25zbMath1308.68023OpenAlexW2183585731MaRDI QIDQ2926152

Aris Pagourtzis, Dimitris Sakavalas, Chris Litsas

Publication date: 30 October 2014

Published in: Applications of Mathematics and Informatics in Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04720-1_25

Mathematics Subject Classification ID

Network protocols (68M12)

Cites Work

• Unnamed Item
• Broadcasting with locally bounded byzantine faults
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Discovering Network Topology in the Presence of Byzantine Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Perfectly secure message transmission
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• Reliable broadcast in radio networks

This page was built for publication: The Byzantine Generals Problem in Generic and Wireless Networks