隐写网络中的割集和支配集问题
The Cut and Dominating Set Problem in A Steganographer Network
摘要：
隐写器网络对应于这样的图形结构，其中所涉及的顶点（或称为节点）表示诸如数据编码器和数据解码器的社交实体，并且相关联的边表示可以用于隐写的任何真实的可通信信道或其他社交链接。与传统的隐写算法不同，隐写网络通过抽象的方式对隐写通信进行建模，将隐写通信的相关特征量化为网络中的可分析参数。在本文中，我们将分析隐写网络中的两个问题。第一个问题是对隐写网络的被动攻击，其中网络监视器已经收集了与数据编码器或解码器相对应的可疑顶点的列表。网络监控者期望在保持尽可能低的代价的同时，中断（断开）可疑顶点之间的隐写通信。第二个涉及确定对应于数据编码器（CODEC）的顶点集合，使得所有顶点可以通过邻居共享消息。指出这两个问题等价于最小割问题和最小权支配集问题。
英文摘要：
A steganographer network corresponds to a graphic structure that the involved vertices (or called nodes) denote social entities such as the data encoders and data decoders, and the associated edges represent any real communicable channels or other social links that could be utilized for steganography. Unlike traditional steganographic algorithms, a steganographer network models steganographic communication by an abstract way such that the concerned underlying characteristics of steganography are quantized as analyzable parameters in the network. In this paper, we will analyze two problems in a steganographer network. The first problem is a passive attack to a steganographer network where a network monitor has collected a list of suspicious vertices corresponding to the data encoders or decoders. The network monitor expects to break (disconnect) the steganographic communication down between the suspicious vertices while keeping the cost as low as possible. The second one relates to determining a set of vertices corresponding to the data encoders (senders) such that all vertices can share a message by neighbors. We point that, the two problems are equivalent to the minimum cut problem and the minimum-weight dominating set problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
