Steganography FAQ
Steganography is a subject which is rarely touched upon by most IT Security Enthusiasts. Most people don't see Steganography has a potential threat, some people don't even know what Steganography is. With this FAQ I hope to answer any questions anyone may want to ask about Steganography, and to educate people so they can understand what exactly Steganography is. Is Steganography a potential threat? Well your about to find out.
Read the Article
|
Covert channels in TCP/IP: attack and defence42 min 35 sec
Creation and detection of IP steganography for covert channels and device fingerprinting. This talk will show how idiosyncrasies in TCP/IP implementations can be used to reveal the use of several steganography schemes, and how they can be fixed. The analysis can even be extended to remotely identify the physical machine being used.
Watch the Video
|
Hide and Seek: An Introduction to Steganography
This article discusses existing steganographic systems and presents recent research in detecting them via statistical steganalysis. Here, we present recent research and discuss the practical application of detection algorithms and the mechanisms for getting around them.
Read the Article
|
On Steganographic Chosen Covertext Security
At TCC 2005, Backes and Cachin proposed a new and very strong notion of security for public key steganography: secrecy against adaptive chosen covertext attack (SS-CCA); and posed the question of whether SS-CCA security was achievable for any covertext channel. We resolve this question in the affirmative: SS-CCA security is possible for any channel that admits a secure stegosystem against the standard and weaker "chosen hidden text attack" in the standard model of computation. Our construction requires a public-key encryption scheme with ciphertexts that remain indistinguishable from random bits under adaptive chosen-ciphertext attack. We show that a scheme with this property can be constructed under the Decisional Diffie-Hellman assumption. This encryption scheme, which modifies a scheme proposed by Kurosawa and Desmedt, also resolves an open question posed by von Ahn and Hopper at Eurocrypt 2004.
Read the Article
|
Selectively Traceable Anonymity
Anonymous communication can, by its very nature, facilitate socially unacceptable behavior. In this paper we present one approach to dealing with abuse: selective traceability. A system for anonymous communication is said to be selectively traceable if it allows the tracing of a message's sender after a set of sensible conditions have been met (e.g., both the FBI and the ACLU have agreed to trace the message, or 90% of the users agree that the message should be traced, etc.). We introduce general techniques to transform a large class of anonymous communication protocols (including most of those that have been proposed so far, such as DC-Nets, Mix-Nets, and their derivatives) into selectively traceable anonymous communication protocols. We also present more efficient modifications to two existing anonymous communication protocols that do not affect the asymptotic efficiency of the underlying schemes. Our resulting protocols are provably secure against malicious adversaries.
Read the Article
|
Public-Key Steganography
In this work we introduce computational security conditions for public-key steganography similar to those introduced by Hopper, Langford and von Ahn for the private-key setting. We also give the first protocols for public-key steganography and steganographic key exchange that are provably secure under standard cryptographic assumptions. Additionally, in the random oracle model, we present a protocol that is secure against adversaries that have access to a decoding oracle (the steganographic equivalent of CCA-2 adversaries).
Read the Article
|
An Evaluation of Image Based Steganography Methods
The initial aim of this study was to investigate steganography and how it is implemented. Based on this work a number of common methods of steganography could then be implemented and evaluated. The strengths and weaknesses of the chosen methods can then be analyzed. To provide a common frame of reference all of the steganography methods implemented and analyzed used GIF images. Seven steganography methods were implemented. The methods were chosen for their different strengths in terms of resistance to different types of steganalysis or their ability to maximize the size of the message they could store.
Read the Article
|
Active Steganalysis of Sequential Steganography
Steganalysis of sequential steganography is presented in this paper. Abrupt change in statistics due to sequential embedding is exploited by the proposed technique. Analytical derivations are presented for several cases along with experimental results. Experiments show that the proposed method can be used quite effectively to detect locations and length of messages embedded using spread spectrum steganography.
Read the Article
|
A Technique for Image Data Hiding and Reconstruction without Host Image
This paper addresses specifically the problem of image data hiding and recovery in the absence of host image data. Compared to related work, the proposed technique can embed significantly larger amount of signature data into the host - upto 25% of the host data, with little or no perceptual distortion.
Read the Article
|
A Robust Data Hiding Technique using Multidimensional Lattices
This paper proposes a robust data hiding technique using channel codes derived from a finite subset of general n-dimensional lattices. In the proposed approach, a gray-scale image is embedded by perturbing the host wavelet coefficients.
Read the Article
|
