2014 IEEE Projects for BE and M TECH
Students.
List of Papers which are under
Implementation.
- An Empirical Analysis of RS Steganalysis
Abstract—Steganography is the
science of hiding messages within some cover media. The intent is usually
covert communication, but steganography is equally used for digital
watermarking of media. Messages can be hidden in any media. Typical media include
digital images, sound, and video. Steganalysis is the science of detecting the
presence of hidden messages in media.Most steganalysis techniques search for
artifacts created by the message hiding process.
A simple and commonly-used
steganograpy technique is LSB steganography where the least-significant bits
(LSB) of data values in a media file are altered to hide a message. There are
also a number of published steganalysis techniques for LSB steganography.
This paper presents an empirical
analysis of an LSB steganalysis technique called the RS steganlysis.
2. A
Steganographic method based on Integer Wavelet Transform and Genetic
Algorithm
Abstract: This paper proposes a
novel steganography scheme based on Integer Wavelet Transform and Genetic
Algorithm. The novel scheme embeds data in integer wavelet transform
coefficients by using a mapping function based on Genetic Algorithm in an 8x8
block on the cover image. The optimal pixel adjustment process is applied after
embedding the message. We employed frequency domain to increase the robustness
of our steganography method. Integer wavelet transform avoids the floating
point precision problems of the wavelet filter. We use GA and Optimal Pixel
Adjustment
Process to obtain an optimal mapping
function to reduce the difference error between the cover and the stego-image
and to increase the hiding capacity with low distortions respectively.
Simulation results show that the
novel scheme outperforms adaptive steganography technique based on integer
wavelet transform in term of peak signal to noise ratio and capacity, 35.17 dB
and 50% respectively.
3. AN
EXTENDED VISUAL CRYPTOGRAPHY SCHEME WITHOUT PIXEL EXPANSION FOR HALFTONE IMAGES
Visual cryptography is a secret
sharing scheme which uses images distributed as shares such that, when
the shares are superimposed, a hidden secret image is revealed. In extended
visual cryptography, the share images are constructed to contain meaningful
cover images, thereby providing opportunities for integrating visual
cryptography and biometric security techniques. In this paper, we propose a
method for processing halftone images that improves the quality of the share
images and the recovered secret image in an extended visual cryptography scheme
for which the size of the share images and the recovered image is the same as
for the original halftone secret image. The resulting scheme maintains the
perfect security of the original extended visual cryptography approach.
4. Information
Hiding in Gray Scale Images using Pseudo - Randomized Visual Cryptography
Algorithm for Visual Information Security.
Abstract—Security has gained a lot
of importance as information technology is widely used. Cryptography refers to
the study of mathematical techniques and related aspects of Information
Security like data confidentiality,
data Integrity, and of data authentication. Visual cryptography (VC) is a
process where a secret image is encrypted into shares which refuse to divulge
information about the original secret image. Its strength is a fact that the
decryption of the secret image is through human visual system without
computation. A basic model for visual cryptography for natural images was
proposed by Naor and Shamir. In this paper, a novel method of VC is presented
for halftone images which represent the resultant image in the same size as the
original secret image. Hiding of the visual information based on pseudo
randomization and pixel reversal is also proposed.
5.
Image Size Invariant Visual Cryptography for General Access Structures Subject
to Display
Quality Constraints.
Abstract—Conventional visual
cryptography (VC) suffers from a pixel-expansion problem, or an uncontrollable
display quality problem for recovered images, and lacks a general approach to
construct visual secret sharing schemes for general access structures. We
propose a general and systematic approach to address these issues without
sophisticated codebook design. This approach can be used for binary secret
images in non-computeraided decryption environments. To avoid pixel expansion,
we design a set of column vectors to encrypt secret pixels rather than using
the conventional VC-based approach. We begin by formulating a mathematic model
for the VC construction problem to find the column vectors for the optimal VC
construction, after which we develop a simulated-annealing-based algorithm to
solve the problem. The experimental results show that the display quality of
the recovered image is superior to that of previous papers.
