Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks - HEC Paris - École des hautes études commerciales de Paris Access content directly
Journal Articles Journal of Cryptology Year : 2008

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

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.

Dates and versions

hal-00464542 , version 1 (17-03-2010)

Identifiers

Cite

Tristan Tomala. Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks. Journal of Cryptology, 2008, Vol.21,n°2, pp.250-279. ⟨10.1007/s00145-007-9018-2⟩. ⟨hal-00464542⟩

Collections

HEC CNRS
48 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More