Neighbourhood failures in covert communication network topologies Online publication date: Fri, 19-Aug-2016
by Timothy Nix; Riccardo Bettati
International Journal of Computational Science and Engineering (IJCSE), Vol. 13, No. 2, 2016
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook