A Graph-theoretic Model to Steganography on Social Networks

12/11/2017
by   Hanzhou Wu, et al.
0

Steganography aims to conceal the very fact that the communication takes place, by embedding a message into a digit object such as image without introducing noticeable artifacts. A number of steganographic systems have been developed in past years, most of which, however, are confined to the laboratory conditions where the real-world use of steganography are rarely concerned. In this paper, we introduce an alternative perspective to steganography. A graph-theoretic model to steganography on social networks is presented to analyze real-world steganographic scenarios. In the graph, steganographic participants are corresponding to the vertices with meaningless unique identifiers. Each edge allows the two vertices to communicate with each other by any steganographic algorithm. Meanwhile, the edges are associated with weights to quantize the corresponding communication risk (or say cost). The optimization task is to minimize the overall risk, which is modeled as additive over the social network. We analyze different scenarios on a social network, and provide the suited solutions to the corresponding optimization tasks. We prove that a multiplicative probabilistic graph is equivalent to an additive weighted graph. From the viewpoint of an attacker, he may hope to detect suspicious communication channels, the data encoder(s) and the data decoder(s). We present limited detection analysis to steganographic communication on a network.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2017

A Simply Study to Steganography on Social Networks

Steganography aims to conceal the very fact that the communication takes...
research
03/20/2023

An Error-Correction Model for Information Transmissions of Social Networks

We study the error-correction problem of the communication between two v...
research
12/11/2020

Selfish Creation of Social Networks

Understanding real-world networks has been a core research endeavor thro...
research
02/20/2018

The Cut and Dominating Set Problem in A Steganographer Network

A steganographer network corresponds to a graphic structure that the inv...
research
11/02/2017

Scalable Approximation Algorithm for Network Immunization

The problem of identifying important players in a given network is of pi...
research
08/05/2023

Multi-topic belief formation through bifurcations over signed social networks

We propose and analyze a nonlinear dynamic model of continuous-time mult...
research
05/03/2023

Discovering Communication Pattern Shifts in Large-Scale Networks using Encoder Embedding and Vertex Dynamics

The analysis of large-scale time-series network data, such as social med...

Please sign up or login with your details

Forgot password? Click here to reset