Probabilistic reliability and privacy of communication using multicast in general neighbor networks

J. Renault, T. TOMALA

Journal of Cryptology

April 2008, vol. 21, n°2

Departments: Economics & Decision Sciences, GREGHEC (CNRS)

Keywords: Communication networks, Graphs, Security, Multicast, Repeated games, Incomplete information

This paper studies reliability and security of information transmission in networks. We consider the framework of Franklin and Wright (J. Cryptol. 13(1):9'30, 2000): multicast communication and byzantine adversary. Franklin and Wright studied particular neighbor 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 neighbor graph allowing reliable and secure information transmission. Keywords Communication networks - Graphs - Security - Multicast - Repeated games - Incomplete information