Abstract : 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.
https://hal-hec.archives-ouvertes.fr/hal-00464542
Contributor : Antoine Haldemann <>
Submitted on : Wednesday, March 17, 2010 - 2:10:02 PM Last modification on : Thursday, January 11, 2018 - 6:19:31 AM
Tristan Tomala. Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks. Journal of Cryptology, Springer Verlag, 2008, Vol.21,n°2, pp.250-279. ⟨10.1007/s00145-007-9018-2⟩. ⟨hal-00464542⟩