The Cut and Dominating Set Problem in A Steganographer Network

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.

[1]  Guanshuo Xu,et al.  Deep Convolutional Neural Network to Detect J-UNIWARD , 2017, IH&MMSec.

[2]  Yun Q. Shi,et al.  Structural Design of Convolutional Neural Networks for Steganalysis , 2016, IEEE Signal Processing Letters.

[3]  Éva Tardos,et al.  Network games , 2004, STOC '04.

[4]  Jessica J. Fridrich,et al.  Universal distortion function for steganography in an arbitrary domain , 2014, EURASIP Journal on Information Security.

[5]  Jing Dong,et al.  A Simply Study to Steganography on Social Networks , 2017, ArXiv.

[6]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[7]  Minghao Yin,et al.  Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function , 2017, J. Artif. Intell. Res..

[8]  Jiangqun Ni,et al.  Deep Learning Hierarchical Representations for Image Steganalysis , 2017, IEEE Transactions on Information Forensics and Security.

[9]  Ingemar J. Cox,et al.  Digital Watermarking and Steganography , 2014 .

[10]  Hongxia Wang,et al.  A Graph-theoretic Model to Steganography on Social Networks , 2017 .

[11]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[12]  Bin Li,et al.  A Strategy of Clustering Modification Directions in Spatial Image Steganography , 2015, IEEE Transactions on Information Forensics and Security.

[13]  Leeat Yariv,et al.  Network Games , 2007 .

[14]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[15]  Hong Zhao,et al.  Multi-layer assignment steganography using graph-theoretic approach , 2014, Multimedia Tools and Applications.

[16]  Hongxia Wang,et al.  Multibit Color-Mapping Steganography Using Depth-First Search , 2013, 2013 International Symposium on Biometrics and Security Technologies.

[17]  Jessica J. Fridrich,et al.  Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes , 2011, IEEE Transactions on Information Forensics and Security.

[18]  Yun Q. Shi,et al.  Ensemble of CNNs for Steganalysis: An Empirical Study , 2016, IH&MMSec.

[19]  Miroslav Chleb ´ õk,et al.  The Steiner tree problem on graphs: inapproximability results , 2008 .

[20]  Bin Li,et al.  Automatic Steganographic Distortion Learning Using a Generative Adversarial Network , 2017, IEEE Signal Processing Letters.

[21]  Yun Q. Shi,et al.  Using Statistical Image Model for JPEG Steganography: Uniform Embedding Revisited , 2015, IEEE Transactions on Information Forensics and Security.

[22]  Xianfeng Zhao,et al.  The A Priori Knowledge Based Secure Payload Estimation for Additive Model , 2017, Media Watermarking, Security, and Forensics.

[23]  Weiming Zhang,et al.  A New Rule for Cost Reassignment in Adaptive Steganography , 2017, IEEE Transactions on Information Forensics and Security.

[24]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.