A Survey On Reversible Data Hiding Techniques: MR P. S. Nalwade Ms Pooja Prabhakar Petkar

ISSN:2229-6093
Pooja Prabhakar Petkar et al, Int.J.Computer Technology & Applications,Vol 5 (3),897-903
A Survey on Reversible Data Hiding Techniques
Mr P. S. Nalwade
CSE Department, SGGSIE & T, Nanded
psnalwade@sggs.ac.in
Ms Pooja Prabhakar Petkar

CSE Department, SGGSIE & T, Nanded
pooja.petkar1@gmail.com
Abstract
Recently, there are so many research is progressing on
the field such as internet security, steganography,
cryptography. This study describes the concept of
reversible data hiding technique which is established
on steganography and internet security. When to send
the confidential/important/secure data over an insecure
and bandwidth-constrained channel it is habitual to
encrypt as well as compress the cover data and then
embed the confidential data into cover media. For
attaining
this
facility
there
are
various
encryption/decryption
techniques,
compression
techniques, and data hiding techniques available. It is
also important the data hiding should be reversible in
nature, should be suitable for encryption/decryption
domain. Here we are analyzing the data hiding
technique which is reversible in nature by using the
encrypted image as a cover data in which the data is
embedded. Thus, it is termed as a Reversible data
hiding (RDH) technique in encrypted image. In
reversible data hiding technique initially a content
owner encrypts the original uncompressed image, then
a data hider compress the image to create space to
provide some additional data. At the receiver side,
receivers extract the embedded data and recover the
covering image.
1. Introduction
With the recent advances in signal processing
technology produce the possibility of a large variety of
new applications ranging from multimedia content
production and distribution, e.g., advanced health care
systems for continuous health monitoring, confidential
transmissions, video surveillance and military
applications. These developments raise several
important issues concerning the security of the digital
contents (images) to be processed, including
IJCTA | May-June 2014

Available online@www.ijcta.com
intellectual property rights management, authenticity,

privacy, and conditional access.
Currently available solution for transmission of
images is a daily routine and it is essential to find an
effective way to transmit them over networks. To
decrease the transmission time, the data compression is
essential. The protection of this multimedia information
can be done with encryption or data hiding algorithms.
For a few years, a problem is to try to combine
compression, encryption and data hiding in a single
step. Two main groups of technologies have been
developed for this purpose. The first one is based on
content protection through encryption. There are
various methods to encrypt binary images or gray level
images. In this group, suitable decryption of data
requires a key. The second group bases the protection
data hiding, intended at mystically inserting a message
into the data.
1.1. General Cryptography and Encryption

Cryptography that is a technique for living message
secure and free from attacks. Cryptography provides
encryption techniques for all kinds of data, such as
textual data, Image data or multimedia data for secured
communication over a network. In cryptography secret
message is scuffled. Cryptography is the study of
mathematical techniques related to facts of information
security such as confidentiality, data integrity, entity
authentication, and data origin authentication.
1.1.1. Types of Encryption

1. Hashing Encryption Produce a unique, fixedlength signature for a message or data set. Hashes are
created with hash function, and people commonly use
them to examine sets of data.
2. Symmetric Encryption An encryption system in
which the sender and receiver of a message share a
single, common key that is used to encrypt and decrypt
the message, its sometimes called secret-key
897
ISSN:2229-6093
cryptography. These systems are simpler and faster, but

the two parties must exchange the key in a secure way.
3. Asymmetric Encryption A cryptographic
system that uses two keys - a public key known to
everyone and a private or secret key known only to the
recipient of the message. These public and private keys
are related in such a way that only the public key can
be used to encrypt messages and only the
corresponding private key can be used to decrypt them.
It is virtually impossible to deduce the private key
without knowing public key.
In this paper, we focus on Image encryption is
different from the simple data encryption. So in general
the data hiding in image comes four steps.
1.
2.
3.
4.
Select the secret media where the data will be

hidden.
The unrevealed message or information that is
needed to be protected in the cover image.
A function that will be used to hide the data in the
cover media and its reverse to recover the hidden
data.
An alternative key or the password to authenticate
or to hide and show the data.
1.1.2. Types of Image Encryption

Generation of Encryption Key The encryption key
is a 128 bit value. It is generated randomly by using the
random function. The random function generates the
random key in a supply distributed function.
Generation of pseudo-random sequence Pseudo
random sequence corresponds of random bits generated
using the encryption key. In the RC-4 algorithm, used
to generate the pseudo-random sequence using the 128bit encryption key. It is represented as a sequence of
bytes (An array of bytes) [19]. The number of bytes
generated should be equal to the number of pixels in
the input image supplied the pixels are represented as
8-bit values. If the pixels are represented as 16-bit
values then the number bytes in pseudo-random
sequence should be double the number of pixels.
1.2. General Steganography

Technique
for
secured
communication.
Steganography postulates hiding information so it
seems that no information is hidden at all. If a person or
persons views the object that the information is hidden
inside of he or she will have no idea that there is any
hidden information, therefore the person will not
attempt to decrypt the information. Steganography is
the process of hiding a secret message within cover

medium such as image, video, text, audio. Image

steganography has many applications, especially in
todays modern, high-tech world. Privacy and secrecy
is a refer for most people on the internet. Image
steganography allows for two parties to communicate
secretly and covertly.
There are two types of domains in which
steganography is implemented i.e. spatial domain and
frequency domain [18]. In spatial domain, processing is
applied directly on the pixel values of the image
whereas in frequency domain, pixel values are
transformed and then processing is applied on the
transformed coefficients.
LSB technique is implemented in spatial domain, in
which each pixel of an image transformed into the
binary value and data is hidden into the least significant
position of the binary value of the pixels of the image
in such a manner that, it doesnt destruct the integrity
of the cover image but this scheme is spiritualist to a
variety of image processing attacks like compression,
cropping etc.
DCT & DWT technique are implemented in
frequency domain, the mathematical function which
transforms digital image data from the spatial to the
frequency domain. In DCT, after transforming the
image in frequency domain, the data is embedded in the
least significant bits of the medium frequency
components and is specialised for lossy compression
while In DWT, secret messages are embedded in the
high frequency coefficients resulted from Discrete
Wavelet Transform and provide maximum robustness.
These two technologies can be used complementary
and mutually commutative. Valuable secret information
is vulnerable while in storage and during transmission
over a network from unauthorized access. In this age of
universal electronic connectivity, of viruses and
hackers, of electronic eavesdropping and electronic
fraud, there is indeed a need to protect information
from passing before peculiar eyes or, more
significantly, from falling into the wrong hands. Thus,
multimedia security is much to consider in
broadcasting digital information safety. One such
technique is reversible data hinging in encrypted image,
the combination of cryptography and steganography
techniques.
2. Reversible Data Hiding

The data hiding process links two sets of data, a set
of the embedded data and another set of the cover
media data. In most cases of data hiding, the cover
media become distorted due to data hiding and cannot
be reversed back to the original media. That is, cover
media has permanent distortion even after the hidden
898
ISSN:2229-6093
Figure 1. Non-separable Reversible Data Hiding in Encrypted Image

data have been removed. For instance, in covert
communications, the hidden data may often be
irrelevant to the cover media. During authentication,
however, the embedded data are closely associated with
the cover media. In these two types of applications, the
invisibility of hidden data is a significant demand. In
some applications, such as medical diagnosis and law
enforcement, it is critical to reverse the marked media
back to the original cover media after the hidden data
are recovered for some legal considerations. In other
applications, such as remote sensing and high-energy
particle physical experimental investigation, it is also
coveted that the original cover media can be recovered
because of the required high-exactitude nature.
Reversible data hiding alleviates huge possibility of
applications to link two sets of data in such a way that
the cover media can be losslessly recovered after the
hidden data have been extracted out, thus providing an
additional street of handling two different sets of data.
As is well known, Encryption is an effective means
of privacy protection. To share a secret image with
another person, a content owner may encrypt the image
before transmission. In some cases, a channel
administrator needs to add some additional message,
such as the origin information, image notation or
authentication data, within the encrypted image
however he does not know the original image content.
It may be also expected that the original content can be
recovered without any error after decryption and
recover of additional message at the receiver side. That
means a reversible data hiding scheme for encrypted
image is suitable. Reference [15] presents a practical

scheme providing the above-mentioned requirements

and Figure 1 gives the sketch. This work proposes a
reversible data hiding scheme for encrypted image,
which is made up of image encryption, data embedding
and data extraction/ image-recovery phases. The data of
original cover are entirely encrypted, and the additional
message is embedded by modifying a part of the
encrypted data. At the receiver side, with the aid of
spatial correlation in natural image, the embedded data
are successfully extracted while the original image is
perfectly recovered. With an encrypted image
containing additional data a receiver may firstly decrypt
it to the original image. According to the data-hiding
key, she can further extract the embedded data and
recover the original image from the decrypted version.
But if someone has the data-hiding key, but not the
encryption key, she cannot extract any information
from the encrypted image containing additional data.
How the performance of a reversible dataembedding algorithm can be measured?
Reversible data embedding, which is also called
lossless data embedding, embeds invisible data (which
is called a payload) into a digital image in a reversible
fashion. As a basic requirement, the quality humiliation
of the image after data embedding should be low. An
exciting feature of reversible data embedding is the
reversibility, that is, one can dispatch the embedded
data to restore the original image. Reversible data
embedding hides some information in a digital image in
such a way that an authorized party could decode the
hidden information and also restore the image to its
899
ISSN:2229-6093
original state. The performance of a reversible dataembedding algorithm can be measured by the
following.
Payload capacity limit: what is the maximal
amount of information can be embedded?
Visual quality: how is the visual quality of the
embedded image?
Complexity:
what
is
the
algorithm
complexity?
The distortion-free data embedding is the motivation
of reversible data embedding. Data will certainly
change the original content by embedding some data
into it. Even a very tenuous change in pixel values may
not be suitable, particular in sensible imagery, such as
military data and medical data. In such an assumption,
every bit of information is important.
From the application point of view, Since the
difference between the embedded image and the
original image is almost unobtrusive from human eyes,
reversible data embedding could be thought as a secret
communication channel since reversible data
embedding can be used as an information carrier.
3. Compression Methods for Encrypted Data

Compression of encrypted data has become
considerable research interest in recent years. The
traditional way of securely and efficiently transmitting
redundant data is to first compress the data to reduce
the redundancy, and then encrypt the compressed data
to mask its meaning. At the receiver side, the
decryption and decompression operations are orderly
performed to retrieve the original data. However, in
some application assumptions, a sender needs to
transmit some data to a receiver and wishes to keep the
information confidential to a network operator who
provides the channel resource for the transmission.
That means the sender should use the encryption key,
and the decrypted version is similarly encrypt the
original data and the network provider tend to compress
the encrypted data without any knowledge of the
cryptographic key and the original data. There are
several techniques for compressing/decompressing
encrypted data have been developed.
When it is desired to transmit redundant data over
an unsafe and bandwidth-restricted channel, it is
customary to first compress the data and then encrypt
it. Mark Johnson et al. proposed the originality of
reversing the order of these steps, i.e., first encrypting
and then compressing, without compromising either the
compression effective or the information-theoretic
security [1]. In this method first data encryption is used
and then the encrypted source is compressed but the
compressor does not have access to the cryptographic

key, so it must be able to compress the encrypted data

without any knowledge of the original source. At first
look, it happens that only a minimal compression gain,
if any, can be succeed, since the output of an
encryption or will look very random. However, at the
receiver, there is a decoder in which both
decompression and decryption are performed in a joint
step. In a wide spectrum in this approach, the encrypted
data can be compressed using distributed source-coding
principles as the key will be available at the decoder,
but in some cases the possibility of first encrypting a
data stream and then compressing where compressor
does not have knowledge of the encryption key.
Wei Liu et. al proposed a lossless compression
method for encrypted gray image using progressive
decomposition and rate-compatible punctured turbo
codes. In this method they developed resolution
progressive compression, which has been shown to
have much better coding efficiency and less
computational complexity than existing approaches [2].
He mentioned that lossless compression of encrypted
sources can be accomplished through Slepian-Wolf
coding. For encrypted real-world sources such as
images, they are trying to modify the compression
efficiency. He suggested a resolution progressive
compression scheme is used which compresses an
encrypted image progressively in the resolution, such
that the decoder can detect a low-resolution version of
the image, study local statistics based on it, and use the
statistics to decode the next resolution level [2]. The
encoder starts by sending a down sampled version of
the cipher text. At the decoder, the corresponding lowresolution image is decoded and decrypted, from which
a higher-resolution image is obtained by intra-frame
anticipation. The anticipated image, together with the
secret encryption key, is used as the side information
(SI) to decode the next resolution level. This process is
repeated until the whole image is decoded. So this
multi-resolution approach makes it possible to have
access to part of the spatial source data to generate
more authentic spatial and semantic side information.
But there is need to increase the efficiency of overall
data compression to avoid the loss of any kind of data.
Xinpeng Zhang presented lossy compression
method in which a pseudorandom modification is used
to encrypt an original binary image can be effectively
compressed by fling the inordinately rough and fine
information of coefficients generated from orthogonal
transform [3]. After receiving the compressed data,
with the support of spatial correlation in natural image,
a receiver can reconstruct the principal content of the
original image by repeatedly modifying the values of
the coefficients. This way, the higher the compression
ratio and the suave the original image, the better the
900
ISSN:2229-6093
quality of the regenerated image. The compression ratio

and the quality of regenerated image vary with different
values of compression factor. In the encryption phase
of the Zhangs system, only the pixel positions are
shambled and the pixel values are not masked. With the
values of flexible pixels, the coefficients can be
generated to produce the compressed data.
4. Data Hiding in the Encrypted Domain

Nasir Memon and Ping Wah Wong worked on a
buyer-seller watermarking protocol, which is the
concept of digital watermarking [4]. In this protocol
they declared that the seller does not get to know the
exact watermarked copy that the buyer receives. Hence
the seller cannot create copies of the original content
containing the buyer's watermark. However, in case the
seller finds an unauthorized copy, he can identify the
buyer from whom this unauthorized copy has
originated and furthermore also prove this fact to a
third party by means of conflict resolution protocol.
Hence, the buyer cannot postulate that an unauthorized
copy may have originated from the seller. The
watermark embedding protocol is based on public key
cryptography and has little smash in terms of the total
data communicated between the buyer and the seller.
They declared the idea of hiding the data in encrypted
form of the data. Here seller is doing data
(fingerprint/Watermark in this case.) embedding while
he does not know the original data content. The data are
in the encrypted form.
Mina
Deng
et.al
proposed
Buyer-seller
watermarking protocol based on homomorphic
cryptosystem and composite signal representation in
the encrypted domain. He developed the composite
signal representation which allows us to decrease both
the computational overhead and the large
communication bandwidth which are mostly due to the
use of homomorphic public-key encryption schemes.
Complexity assessments show that the most
computational requiring part of the protocol is the
encryption of the content and the embedding of the
watermark in the encrypted domain. In order to
measure the feasibility of this part, a practical
implementation of an encrypted domain watermark
embedding method, based on different watermarking
algorithms, has been implemented and tested on
different images. The results show that the version
using composite signal representation can run in less
than two minutes with a performance in terms of
robustness almost identical from that of the
corresponding plaintext embedding algorithms. Both
complexity analysis and representation results in the
verification of the efficiency of the M.Deng's system
[6].

Shiguo Lian and et.al propose a different scheme

represented of joint data-hiding and encryption
schemes. In this system a part of cover data is used to
carry the additional message and another rest of the
data are encrypted, so that both the copyright and the
privacy can be protected. Here motion vector difference
and signs of DCT coefficients are encrypted, while a
watermark is embedded into the amplitudes of DCT
coefficients. Thus, the watermark can be extracted from
the encrypted videos, and the encrypted videos can be
rewatermarked [7].
5. Reversible Data Hiding Techniques

Reversible data hiding (RDH) in images is a
technique, by which the original cover can be losslessly
recovered after the embedded message is extracted.
This important technique is used for many applications,
e.g., confidential transmission, video surveillance,
military and medical applications.
In theoretically, Kalker and Willems demonstrate a
rate-distortion model for RDH, through which they
proved the rate-distortion bounds of RDH for memory
less covers and proposed a recursive code construction
which, however, does not access the bound [8]. Zhang
et al. modified the recursive code construction for
binary covers and proved that this construction can
succeed the rate-distortion bound as long as the
compression algorithm reaches information, which
constitutes the equivalence between data compression
and RDH for binary covers [9], [10].
In practically, many RDH techniques have
developed in recent years. Fridrich et al. constructed a
general framework for RDH [11]. By first extracting
compressible features of the original cover and then
compressing them losslessly, spare space can be saved
for embedding ancillary data. Jun Tian et al. suggested
reversible data embedding which embeds invisible data
into a digital image in a reversible fashion [12]. As a
basic requirement, the quality humiliation of the image
after data embedding should be low. An enchanting
feature of reversible data embedding is the reversibility
i.e. one can extract the embedded data to restore the
original image.
A common approach of high capacity reversible
data embedding is to select an embedding area for
space, the least significant bits of some pixels in an
image and embed both the payload and the original
values in this area needed for exact recovery of the
original image into such area. Here DE (difference
expansion) technique which discovers extra storage
space by exploring the redundancy in the image content
as well, DE technique employed to reversibly embed a
payload into digital images. The main substance of this
method is the payload capacity limit and the visual
901
ISSN:2229-6093
Figure 2. Separable Reversible Data Hiding in Encrypted Image

quality of embedded images, but if there are reversible
data embedding, then it is a delicate technique because
when the embedded image is fudged and/or lossy
compressed the decoder will find out it is not authentic
and thus there will be no original content renovation.
Another dedicating strategy for RDH is histogram
shift (HS), in which space is saved for data embedding
by shifting the bins of the histogram of gray values
[13]. Kyung-su Kim proposes a RDH method that
improves the difference histogram between subsampled images. It achieves the high spatial correlation
inbuilt in neighboring pixels to achieve high capacity
and imperceptible embedding. And C. Lin and W. Tai
suggested a multilevel reversible data hiding scheme
based on the difference image histogram modification
that uses the peak point to hide messages. They showed
the scheme achieve large hiding capacity and low
distortion.
Hwang et al. counselled a reputation-based trustmanagement scheme improved with data coloring (a
way of embedding data into the covers) and software
watermarking, in which data encryption and coloring
offer possibilities for preserving the content owners
privacy and data integrity [14]. Obviously, the cloud
service provider has no right to introduce permanent
distortion during data coloring into encrypted data.
Thus, a reversible data coloring technique based on
encrypted data is promoted. Suppose a medical image
database is stored in a data center, and a server in the
data center can embed notations into an encrypted

version of a medical image through a RDH technique.

With the notations, the server can manage the image or
verify its integrity without having the knowledge of the
original content, and thus the patients privacy is
protected. On the other hand, a doctor, having the
cryptographic key, can decrypt and restore the image in
a reverse mode for the purpose of further identification.
Zhang divided the encrypted image into several
blocks. By flipping 3 LSBs of the half of pixels in each
block, room can be reserved for the embedded bit [15].
The data extraction and image recovery proceed by
finding which part has been flipped in one block. This
process can be accomplished with the help of spatial
correlation in decrypted image. Hong et al. improved
Zhangs method at the decoder side by further utilizing
the spatial correlation using a different computation
equation and the side match technique to succeed much
lower error rate [16]. These two methods referred
above the believe on spatial correlation of original
image to extract data. That is, the encrypted image
should be decrypted first before data extraction.
To separate the data extraction from image
decryption, Zhang vacated out space for data
embedding applying the technique of compressing
encrypted images [1], [2]. Compression of encrypted
data can be explicated as source coding with side
information at the decoder [1], in which the typical
method is to generate the compressed data in a lossless
manner by applying the symptoms of parity-check
matrix of channel codes. In this method compressed the
902
ISSN:2229-6093
encrypted LSBs to leave room for additional data by

finding symptoms of a parity-check matrix, and the
side information used on the receiver side is also the
spatial correlation of decrypted images, Figure 2
represents the sketch of above mentioned method [17].
6. Conclusion
Reversible data hiding is a new topic hiding
attention
because
of
the
privacy-preserving
requirements of cloud data management. In this survey
report I presented how the researcher encrypted image
(theoretically), which consists of image encryption,
data embedding and data-extraction/image-recovery
phases. Also, I studied the literature review of different
compression methods, and give the detailed analysis of
data hiding using image encryption based on image.
Previous methods implement RDH in encrypted images
by vacating room after encryption and it is suitable for
small amounts of additional data, which may be subject
to some errors on data extraction and/or image
restoration. Hence there is need of some easy and large
payload capacity method of RDH which we would be
trying in the future course of our dissertation work.
7. References
[1] M. Johnson, P. Ishwar, V. M. Prabhakaran, D.
Schonberg, and K. Ramchandran, On compressing
encrypted data, IEEE Trans. Signal Process., vol. 52,
no. 10, pp. 29923006, Oct. 2004.
[2] W. Liu, W. Zeng, L. Dong, and Q. Yao, Efficient
compression of encrypted grayscale images, IEEE
Trans. Image Process., vol. 19, no. 4, pp. 10971102,
Apr. 2010.
[3] X. Zhang, Lossy compression and iterative
reconstruction for encrypted image, IEEE Trans.
Inform. Forensics Security, vol. 6, no. 1, pp. 5358, Feb.
2011.
[4] N. Memon and P. W. Wong, A buyer-seller
watermarking protocol, IEEE Trans. Image Process.,
vol. 10, no. 4, pp. 643649, Apr. 2001.
[5] M. Kuribayashi and H. Tanaka, Fingerprinting protocol
for images based on additive homomorphic property,
IEEE Trans. Image Process., vol. 14, no.
[6] M. Deng, T. Bianchi, A. Piva, and B. Preneel, An
efficient buyer-seller watermarking protocol based on
composite signal representation, in Proc. 11th ACM
Workshop Multimedia and Security, 2009, pp. 918.

[7] S. Lian, Z. Liu, Z. Ren, and H. Wang, Commutative

encryption and watermarking in video compression,
IEEE Trans. Circuits Syst. Video Technol., vol. 17, no.
6, pp. 774778, Jun. 2007.
[8] T. Kalker and F.M.Willems, Capacity bounds and code
constructions for reversible data-hiding, in Proc. 14th
Int. Conf. Digital Signal Processing (DSP2002), 2002,
pp. 7176.
[9] W. Zhang, B. Chen, and N. Yu, Capacity-approaching
codes for reversible data hiding, in Proc 13th
Information Hiding (IH2011), LNCS 6958, 2011, pp.
255269, Springer-Verlag.
[10] W. Zhang, B. Chen, and N. Yu, Improving various
reversible data hiding schemes via optimal codes for
binary covers, IEEE Trans. Image Process., vol. 21, no.
6, pp. 29913003, Jun. 2012.
[11] J. Fridrich and M. Goljan, Lossless data embedding for
all image formats, in Proc. SPIE Proc. Photonics West,
Electronic Imaging, Security and Watermarking of
Multimedia Contents, San Jose, CA, USA, Jan. 2002,
vol. 4675, pp. 572583.
[12] J. Tian, Reversible data embedding using a difference
expansion, IEEE Trans. Circuits Syst. Video Technol.,
vol. 13, no. 8, pp. 890896, Aug. 2003.
[13] Z. Ni, Y. Shi, N. Ansari, and S. Wei, Reversible data
hiding, IEEE Trans. Circuits Syst. Video Technol., vol.
16, no. 3, pp. 354362, Mar. 2006.
[14] K. Hwang and D. Li, Trusted cloud computing with
secure resources and data coloring, IEEE Internet
Comput., vol. 14, no. 5, pp. 1422, Sep./Oct. 2010.
[15] X. Zhang, Reversible data hiding in encrypted image,
IEEE Signal Process. Lett., vol. 18, no. 4, pp. 255258,
Apr. 2011.
[16] W. Hong, T. Chen, and H.Wu, An improved reversible
data hiding in encrypted images using side match, IEEE
Signal Process. Lett., vol. 19, no. 4, pp. 199202, Apr.
2012.
[17] X. Zhang, Separable reversible data hiding in encrypted
image, IEEE Trans. Inf. Forensics Security, vol. 7, no.
2, pp. 826832, Apr. 2012.
[18] Aneesh Jain, Indranil Sen. Gupta, A JPEG
Compression Resistant Steganography Scheme for
Raster
Graphics
Images,
IEEE-1-4244-12722/07/$25.002007.
[19] T. Bianchi, A. Piva, and M. Barni, Composite signal
representation for fast and storage-efficient processing of
encrypted signals, IEEE Trans. Inform. Forensics
Security, vol. 5, no. 1, pp. 180187, Feb. 2010.
903

A Survey On Reversible Data Hiding Techniques: MR P. S. Nalwade Ms Pooja Prabhakar Petkar

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

A Survey On Reversible Data Hiding Techniques: MR P. S. Nalwade Ms Pooja Prabhakar Petkar

Hochgeladen von

Copyright:

Verfügbare Formate

ISSN:2229-6093

Pooja Prabhakar Petkar et al, Int.J.Computer Technology & Applications,Vol 5 (3),897-903