Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks

Thumbnail
Ouvrir
Date
2008
Indexation documentaire
Probabilités et mathématiques appliquées
Subject
Communication networks; Graphs; Security; Multicast; Repeated games; Incomplete information
Nom de la revue
Journal of Cryptology
Volume
21
Numéro
2
Date de publication
2008
Pages article
250-279
Nom de l'éditeur
Springer
DOI
http://dx.doi.org/10.1007/s00145-007-9018-2
URI
https://basepub.dauphine.fr/handle/123456789/6821
Collections
Métadonnées
Afficher la notice complète
Auteur
Renault, Jérôme
Tomala, Tristan
Type
Article accepté pour publication ou publié
Résumé en anglais
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.