Back to articles
Volume: 31 | Article ID: art00013
New Graph-Theoretic Approach to Social Steganography
  DOI :  10.2352/ISSN.2470-1173.2019.5.MWSF-539  Published OnlineJanuary 2019

In this paper, we introduce a new and novel graph-theoretic steganographic approach applicable to online social networking services (SNSs). The proposed approach translates a secret message to be embedded as an undirected graph called messagegraph, the structural information of which is concealed within a new directed graph. The new directed graph is released in a SNS platform by producing a sequence of ordered multiple-user interaction events. To secure communication, we propose to split a specific vertex to multiple copies and insert new vertices and edges to the directed graph. A receiver is able to reconstruct the directed graph from observations. Both the message-graph and the secret message can be orderly retrieved without error. It is probably the first work deeply focusing on the practical design of interaction based steganography using graph-theoretic approach.

Subject Areas :
Views 34
Downloads 5
 articleview.views 34
 articleview.downloads 5
  Cite this article 

Hanzhou Wu, Wei Wang, Jing Dong, Hongxia Wang, "New Graph-Theoretic Approach to Social Steganographyin Proc. IS&T Int’l. Symp. on Electronic Imaging: Media Watermarking, Security, and Forensics,  2019,  pp 539-1 - 539-7,

 Copy citation
  Copyright statement 
Copyright © Society for Imaging Science and Technology 2019
Electronic Imaging
Society for Imaging Science and Technology
7003 Kilworth Lane, Springfield, VA 22151 USA