A new parameter for a broadcast algorithm with locally bounded Byzantine faults

DOI10.1016/J.IPL.2010.04.003zbMATH Open1233.68102OpenAlexW2093808378MaRDI QIDQ763544FDOQ763544

Akira Ichimura, Maiko Shigeno

Publication date: 12 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://tsukuba.repo.nii.ac.jp/?action=repository_action_common_download&item_id=19876&item_no=1&attribute_id=17&file_no=1

zbMATH Keywords

graph algorithmbroadcastingfault toleranceByzantine faultsMA ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Title not available (Why is that?)
• Algorithmic Aspects of Graph Connectivity
• Fault-tolerant broadcasting and gossiping in communication networks
• Broadcast in radio networks tolerating byzantine adversarial behavior
• Broadcasting with locally bounded byzantine faults

Cited In (6)

• Broadcast using certified propagation algorithm in presence of Byzantine faults
• Consensus of second-order multi-agent systems in the presence of locally bounded faults
• Resilient distributed averaging: adversary detection and topological insights
• Consensus of discrete-time multi-agent systems with adversaries and time delays
• Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
• Reliable broadcast with respect to topology knowledge

This page was built for publication: A new parameter for a broadcast algorithm with locally bounded Byzantine faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763544)