Graphstega: Graph Steganography Methodology
Authors:
- 12 March 2008
- journal article
- research article
- Published by Taylor & Francis in Journal of Digital Forensic Practice
- Vol. 2 (1) , 27-36
Abstract
The Graph Steganography Methodology (Graphstega) is the art and science of avoiding the arousal of suspicion in covert communications by concealing a message in a graph-cover. Unlike other approaches, Graphstega does not embed a message as a noise in a cover. Instead the message is camouflaged as plotted data. Graphstega is keyless and the hidden message is anti-distortion. The popular usage of graphs in business, education, news, etc. and the availability of tremendous amount of graphs in electronic and non-electronic format make the investigation and detection of a hidden message extremely difficult. In addition, Graphstega is resilient to contemporary attacks, such as traffic analysis, contrast, and comparison attack, even when launched by an adversary who is familiar with Graphstega.Keywords
This publication has 13 references indexed in Scilit:
- Text Steganography in SMS2007
- Is image steganography natural?IEEE Transactions on Image Processing, 2005
- Investigator's Guide to Steganography2003
- Basic Mimicry2002
- Hiding the hidden: A software system for concealing ciphertext as innocuous textLecture Notes in Computer Science, 1997
- Techniques for data hidingIBM Systems Journal, 1996
- A Course in Number Theory and Cryptography1994
- Two-level grammars are more expressive than Type 0 grammarsACM SIGPLAN Notices, 1993
- MIMIC FUNCTIONSCryptologia, 1992
- Revised report on the algorithmic language ALGOL 68Acta Informatica, 1975