| Autor: |
Desoky, Abdelrahman, Younis, Mohamed |
| Předmět: |
|
| Zdroj: |
Journal of Digital Forensic Practice; Mar2008, Vol. 2 Issue 1, p27-36, 10p, 1 Diagram, 2 Charts, 3 Graphs |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
