Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks
Renault, Jérôme; Tomala, Tristan (2008), Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks, Journal of Cryptology, 21, 2, p. 250-279. http://dx.doi.org/10.1007/s00145-007-9018-2
TypeArticle accepté pour publication ou publié
Journal nameJournal of Cryptology
MetadataShow full item record
Abstract (EN)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.
Subjects / KeywordsCommunication networks; Graphs; Security; Multicast; Repeated games; Incomplete information
Showing items related by title and author.