Add to ORKGCahier de recherche du CEREMADE, n° 521This paper studies reliability and security of information transmission in networks. We consider the framework of Franklin and Wright [FW]: multicast communication and byzantine adversary. Franklin and Wright studied particular 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 graph allowing reliable and secure information transmission
We consider the problem of transmitting information reliably from a source node to a sink node in a ...
We consider the problem of reliably broadcasting information in a multihop asynchronous network in t...
Assume that there are players and an eavesdrop-per Eve of unlimited computational power and that sev...
Cahier de recherche du CEREMADE, n° 521This paper studies reliability and security of information tr...
Abstract. This paper studies reliability and security of information transmission in networks. We co...
This paper studies reliability and security of information transmission in networks. We consider the...
This paper studies reliability and security of information transmission in networks. We consider the...
This paper studies reliability and security of information transmission in networks. We consider the...
Abstract. This paper studies reliability and security of information transmission in networks. We co...
AbstractReliable communication between parties in a network is a basic requirement for executing any...
Reliable communication between parties in a network is a basic requirement for executing any protoco...
Problems of secure communication and computation have been studied extensively in network models. In...
Abstract. Problems of secure communication and computation have been studied extensively in network ...
We consider the problem of probabilistic reliable communication (PRC) over synchronous networks mod-...
AbstractReliable communication between parties in a network is a basic requirement for executing any...
We consider the problem of transmitting information reliably from a source node to a sink node in a ...
We consider the problem of reliably broadcasting information in a multihop asynchronous network in t...
Assume that there are players and an eavesdrop-per Eve of unlimited computational power and that sev...
Cahier de recherche du CEREMADE, n° 521This paper studies reliability and security of information tr...
Abstract. This paper studies reliability and security of information transmission in networks. We co...
This paper studies reliability and security of information transmission in networks. We consider the...
This paper studies reliability and security of information transmission in networks. We consider the...
This paper studies reliability and security of information transmission in networks. We consider the...
Abstract. This paper studies reliability and security of information transmission in networks. We co...
AbstractReliable communication between parties in a network is a basic requirement for executing any...
Reliable communication between parties in a network is a basic requirement for executing any protoco...
Problems of secure communication and computation have been studied extensively in network models. In...
Abstract. Problems of secure communication and computation have been studied extensively in network ...
We consider the problem of probabilistic reliable communication (PRC) over synchronous networks mod-...
AbstractReliable communication between parties in a network is a basic requirement for executing any...
We consider the problem of transmitting information reliably from a source node to a sink node in a ...
We consider the problem of reliably broadcasting information in a multihop asynchronous network in t...
Assume that there are players and an eavesdrop-per Eve of unlimited computational power and that sev...