Add to ORKGAbstract. 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
In this paper, we formulate a new theoretical problem, namely the reliable broadcast problem in unkn...
Problems of secure communication and computation have been studied extensively in network models. In...
Assume that there are players and an eavesdrop-per Eve of unlimited computational power and that sev...
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...
Cahier de recherche du CEREMADE, n° 521This paper studies reliability and security of information tr...
Cahier de recherche du CEREMADE, n° 521This paper studies reliability and security of information tr...
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-...
Problems of secure communication and computation have been studied extensively in network models. Go...
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...
AbstractA covert communications network is a connected, overlay, peer-to-peer network being used to ...
In this paper, we formulate a new theoretical problem, namely the reliable broadcast problem in unkn...
Problems of secure communication and computation have been studied extensively in network models. In...
Assume that there are players and an eavesdrop-per Eve of unlimited computational power and that sev...
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...
Cahier de recherche du CEREMADE, n° 521This paper studies reliability and security of information tr...
Cahier de recherche du CEREMADE, n° 521This paper studies reliability and security of information tr...
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-...
Problems of secure communication and computation have been studied extensively in network models. Go...
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...
AbstractA covert communications network is a connected, overlay, peer-to-peer network being used to ...
In this paper, we formulate a new theoretical problem, namely the reliable broadcast problem in unkn...
Problems of secure communication and computation have been studied extensively in network models. In...
Assume that there are players and an eavesdrop-per Eve of unlimited computational power and that sev...