Subversion Impedance in Covert Communication Networks

Nix, Timothy; Bettati, Riccardo

doi:10.1109/trustcom.2012.267

Cited by 4 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the 'courier' graphs, Co k , k cliques are connected in the same way with the remaining node connected to separate node that is not a member of a clique. Both Cl k and Co k graphs are k-connected and k-neighbor connected and have an order n = k 2 + k. In [7], we also showed that Gunther-Hartnell graphs are optimal covert communications networks. Figure 3 shows the Gunther-Hartnell construction, Cl 3 , on 12 nodes, each connected to exactly 3 neighbors.…”

Section: Gunther-hartnell Graphsmentioning

confidence: 62%

“…Second, the network is resilient against disconnection through the removal of multiple neighborhoods of nodes. In [7], we developed a measure for quantifying the suitability of topologies to achieve these two criteria. This measure examines the effect on the topology from the removal of a subverted node and its compromised neighbors.…”

Section: Quantifying Topologies In Covert Communications Networkmentioning

confidence: 99%

“…The optimal subversion impedance is the global subversion impedance of such a topology. In [7], we found the upper-bound for the optimal subversion impedance which grows as a function of the size of the network. Thus for a given topology, if the calculated subversion impedance corresponds to the calculated upper-bound, we know that no other topology can have a higher subversion impedance.…”

Section: Quantifying Topologies In Covert Communications Networkmentioning

confidence: 99%

“…Even with our ability to measure the suitability of topologies for use within covert communications networks, finding an optimal topology is still difficult. However, in [7], we have identified two families of graphs that produce optimal topologies.…”

Section: Quantifying Topologies In Covert Communications Networkmentioning

confidence: 99%

“…A (k; girth)-cage is a (k; girth)-graph with the smallest possible order (i.e., number of nodes). In [7], we showed that the known cage graphs having a girth = 5 are optimal covert communications networks. Figure 1 shows both the Peterson graph which is the (3; 5)-cage and its worst-case survivor graph resulting from the removal of the closed neighborhood of a subverted node.…”

Section: B Cage Graphsmentioning

confidence: 99%

See 4 more Smart Citations

Topology Construction of Near-Optimal Covert Communications Networks

Nix

Bettati

2012

2012 12th International Symposium on Pervasive Systems, Algorithms and Networks

Self Cite

View full text Add to dashboard Cite

A covert communications network is an overlay peer-to-peer network used to support communication within a group in which the survival of the group depends on both anonymity of communication and concealment of network membership to other members of the group and to external eavesdroppers. These requirements are much more stringent than for typical privacy and anonymity systems. Whereas anonymity systems often reply on a series of intermediate network participants to forward messages in a way that de-links the sender from the receiver, membership concealment relies on the topology of the network. In this paper, we consider the topologies of resilient covert communications networks that minimize the impact on the network in the event of a subverted node and maximize the connectivity of the survivor network with the removal of the subverted node and its closed neighborhood. We briefly describe necessary considerations for the generation of covert communications networks, and then develop general methods for constructing arbitrary-sized near-optimal network topologies.

show abstract

Section: Gunther-hartnell Graphsmentioning

confidence: 62%

Section: Quantifying Topologies In Covert Communications Networkmentioning

confidence: 99%

Section: Quantifying Topologies In Covert Communications Networkmentioning

confidence: 99%

Section: Quantifying Topologies In Covert Communications Networkmentioning

confidence: 99%

Section: B Cage Graphsmentioning

confidence: 99%

See 3 more Smart Citations