Reliability and security of multicast communication in general networks
Abstract
This paper studies reliability and security of information transmission in networks. We consider the framework of Franklin and Wright [FW]: multicast communication and byzantine adversary. Franklin and Wright studied particular graphs with neighbor-disjoint paths. The aim of the present work is to drop this assumption and to give necessary and sufficient conditions on the graph allowing reliable and secure information transmission.