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

Tristan Tomala

Post-Print from HAL

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.

Keywords: Communication networks; Graphs; Security; Multicast; Repeated games; Incomplete information (search for similar items in EconPapers)
Date: 2008-04-01
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Published in Journal of Cryptology, 2008, Vol.21,n°2, pp.250-279. ⟨10.1007/s00145-007-9018-2⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00464542

DOI: 10.1007/s00145-007-9018-2

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().