Neighbourhood failures in covert communication network topologies Academic Article

abstract

• Copyright 2016 Inderscience Enterprises Ltd. A covert communications network (CCN) is a connected, overlay, peer-to-peer network to support communications within a group in which the survival of the group depends on: a) confidentiality and anonymity of the communications; b) concealment of participation in the network to both other members of the group and external eavesdroppers; c) resilience against disconnection. Anonymity is protected using source rewriting in which the network addresses are changed at each hop along the network path. Network membership is concealed through topology restrictions where each participant has limited knowledge of the network addresses of other participants. Resilience requires increased connectivity to protect against disconnection due to neighbourhood failure. In this paper, we propose measures for determining the suitability of both deterministic and random topologies for use in covert communication networks, and use these measures to analyse the suitability of various types of graphs.

authors

• Bettati, Riccardo

published proceedings

• INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING

author list (cited authors)

• Nix, T., & Bettati, R.

citation count

• 1

complete list of authors

• Nix, Timothy||Bettati, Riccardo

publication date

• January 2016

publisher

• Inderscience Publishers  Publisher

keywords

• Anonymity Networks
• Barabasi-albert Graphs
• Ccns
• Covert Communication Networks
• Erdos-renyi Graphs
• Membership Concealment
• Network Topology
• Peer-to-peer Networks
• Random Graphs

Digital Object Identifier (DOI)

• 10.1504/IJCSE.2016.078442

start page

• 132

end page

• 146

volume

• 13

issue

• 2

URL

• http://dx.doi.org/10.1504/ijcse.2016.078442