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 条
  • [21] Near-Optimal Metastability-Containing Sorting Networks
    Bund, Johannes
    Lenzen, Christoph
    Medina, Moti
    PROCEEDINGS OF THE 2017 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2017, : 226 - 231
  • [22] Optimal and Near-Optimal Energy-Efficient Broadcasting in Wireless Networks
    Papageorgiou, Christos A.
    Kokkinos, Panagiotis C.
    Varvarigos, Emmanouel A.
    EURO-PAR 2009: PARALLEL PROCESSING, PROCEEDINGS, 2009, 5704 : 1104 - 1115
  • [23] Efficient Construction of Near-Optimal Binary and Multiway Search Trees
    Bose, Prosenjit
    Douieb, Karim
    ALGORITHMS AND DATA STRUCTURES, 2009, 5664 : 230 - 241
  • [24] Near-optimal quantum circuit construction via Cartan decomposition
    Mansky, Maximilian Balthasar
    Castillo, Santiago Londono
    Puigvert, Victor Ramos
    Linnhoff-Popien, Claudia
    PHYSICAL REVIEW A, 2023, 108 (05)
  • [25] Graph neural networks and implicit neural representation for near-optimal topology prediction over irregular design domains
    Seo, Minsik
    Min, Seungjae
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 123
  • [26] Near-optimal blacklisting
    Dimitrakakis, Christos
    Mitrokotsa, Aikaterini
    COMPUTERS & SECURITY, 2017, 64 : 110 - 121
  • [27] Near-optimal delay constrained routing in virtual circuit networks
    Yen, HH
    Lin, FYS
    IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY, 2001, : 750 - 756
  • [28] Near-Optimal Quantization and Linear Network Coding for Relay Networks
    Muralidhar, Anand
    Kumar, P. R.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (05) : 2777 - 2793
  • [29] Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks
    Sharma, Gokarna
    Busch, Costas
    2014 IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING IN SENSOR SYSTEMS (IEEE DCOSS 2014), 2014, : 201 - 208
  • [30] Near-Optimal Routing for Contour Detection in Wireless Sensor Networks
    Pulimi, Venkat
    Paul, Tuhin
    Stanley, Kevin G.
    Eager, Derek
    37TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2012), 2012, : 462 - 469