Topics
mincutFood
Abstract—We study the problem of secure message multicast-ing over graphs in the presence of a passive (node) adversary who tries to eavesdrop in the network. We show that use of feedback, facilitated through the existence of cycles or undirected edges, enables higher rates than possible in directed acyclic graphs of the same mincut. We demonstrate this using code constructions for canonical combination networks (CCNs). We also provide general outer bounds as well as schemes for node adversaries over CCNs. I
Abstract—Consider a communication network represented by a directed graph G = (V, E), where V is the...
Existing multicast control algorithms typically assume trust and free sharing of information among r...
This work considers the multiple-access multicast error-correction scenario over a packetized networ...
In the model of Secure Network Coding, a sender is connected to several receivers by a network, i.e....
In the model of Secure Network Coding, a sender is connected to several receivers by a network, i.e....
In this work we consider a graph G where a common source sends two messages W1 and W2 to several rec...
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...
While the use of a communication network facilitates the development of cooperative control for netw...
Abstract. This paper studies reliability and security of information transmission in networks. We co...
Abstract—1 We consider the problem of secure unicast trans-mission between two nodes in a directed g...
Abstract. This paper studies reliability and security of information transmission in networks. We co...
A sender wishes to transmit a secret to a receiver through a communication network, where some nodes...
In order to be able to devise successful strategies for destabilizing covert organizations it is vit...
Abstract—In this paper we consider the problem of local-izability of attacks in continuous-time cons...
Abstract—Consider a communication network represented by a directed graph G = (V, E), where V is the...
Existing multicast control algorithms typically assume trust and free sharing of information among r...
This work considers the multiple-access multicast error-correction scenario over a packetized networ...
In the model of Secure Network Coding, a sender is connected to several receivers by a network, i.e....
In the model of Secure Network Coding, a sender is connected to several receivers by a network, i.e....
In this work we consider a graph G where a common source sends two messages W1 and W2 to several rec...
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...
While the use of a communication network facilitates the development of cooperative control for netw...
Abstract. This paper studies reliability and security of information transmission in networks. We co...
Abstract—1 We consider the problem of secure unicast trans-mission between two nodes in a directed g...
Abstract. This paper studies reliability and security of information transmission in networks. We co...
A sender wishes to transmit a secret to a receiver through a communication network, where some nodes...
In order to be able to devise successful strategies for destabilizing covert organizations it is vit...
Abstract—In this paper we consider the problem of local-izability of attacks in continuous-time cons...
Abstract—Consider a communication network represented by a directed graph G = (V, E), where V is the...
Existing multicast control algorithms typically assume trust and free sharing of information among r...
This work considers the multiple-access multicast error-correction scenario over a packetized networ...
Add to ORKG