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

Authors:
Jérôme Renault;Tristan Tomala
Affiliations:
Université Paris Dauphine, CEREMADE, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16, France;HEC, Place du Maréchal de Lattre de Tassigny, 78351, Jouy-en-Josas Cedex, France
Venue:
Journal of Cryptology
Year:
2008

Citing 0
Cited 3

Secure communication: a mechanism design approach

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

International Journal of Applied Cryptography
Fault Reporting in Partially Known Networks and Folk Theorems

Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.