Topology Construction of Near-Optimal Covert Communications Networks

被引:2
|
作者
Nix, Timothy [1 ]
Bettati, Riccardo [1 ]
机构
[1] Texas A&M Univ, Dept Comp Sci & Engn, College Stn, TX 77843 USA
关键词
privacy; anonymity; networks; covert; topology; resiliency; peer-to-peer;
D O I
10.1109/I-SPAN.2012.26
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:135 / 142
页数:8
相关论文
共 50 条
  • [41] On the Construction of Covert Networks
    Waniek, Marcin
    Michalak, Tomasz P.
    Rahwan, Talal
    Wooldridge, Michael
    AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 1341 - 1349
  • [42] Near-Optimal Frame Synchronization for Free-Space Optical Packet Communications
    Hammons, A. Roger, Jr.
    Davidson, Frederic
    MILITARY COMMUNICATIONS CONFERENCE, 2010 (MILCOM 2010), 2010, : 797 - 801
  • [43] Is Gaussian Signalling Optimal for Covert Communications?
    Yan, Shihao
    Cong, Yirui
    Hanly, Stephen V.
    Zhou, Xiangyun
    ICC 2019 - 2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2019,
  • [44] A NEW OPTIMAL ALGORITHM FOR BACKBONE TOPOLOGY DESIGN IN COMMUNICATIONS NETWORKS
    BOGDANOWICZ, ZR
    MATHEMATICAL AND COMPUTER MODELLING, 1993, 17 (08) : 49 - 61
  • [45] Universal Near-Optimal Feedbacks
    S. Nobakhtian
    R. J. Stern
    Journal of Optimization Theory and Applications, 2000, 107 : 89 - 122
  • [46] Barriers to Near-Optimal Equilibria
    Roughgarden, Tim
    2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 71 - 80
  • [47] Computing optimal or near-optimal trees for minimum-energy broadcasting in wireless networks
    Yuan, D
    PROCEEDINGS OF THE THIRD INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS, 2005, : 323 - 331
  • [48] Universal near-optimal feedbacks
    Nobakhtian, S
    Stern, RJ
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 107 (01) : 89 - 122
  • [49] NEAR-OPTIMAL DECODING ALGORITHM
    KOROGODI.AM
    TELECOMMUNICATIONS AND RADIO ENGINEERING, 1972, 26 (09) : 130 - 132
  • [50] THE NEAR-OPTIMAL INSTRUCTION SET
    SMITH, T
    IEEE MICRO, 1982, 2 (03) : 5 - 6