Show simple item record

dc.contributor.authorRenault, Jérôme
dc.contributor.authorTomala, Tristan
dc.date.accessioned2011-07-27T15:11:29Z
dc.date.available2011-07-27T15:11:29Z
dc.date.issued2008
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/6821
dc.language.isoenen
dc.subjectCommunication networksen
dc.subjectGraphsen
dc.subjectSecurityen
dc.subjectMulticasten
dc.subjectRepeated gamesen
dc.subjectIncomplete informationen
dc.subject.ddc519en
dc.titleProbabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networksen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenThis 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.en
dc.relation.isversionofjnlnameJournal of Cryptology
dc.relation.isversionofjnlvol21en
dc.relation.isversionofjnlissue2en
dc.relation.isversionofjnldate2008
dc.relation.isversionofjnlpages250-279en
dc.relation.isversionofdoihttp://dx.doi.org/10.1007/s00145-007-9018-2en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherSpringeren
dc.subject.ddclabelProbabilités et mathématiques appliquéesen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record