SECURED TRANSMISSION

OF MPEG VIDEO BIT–STREAMS

IN
WIRELESS APPLICATIONS
Under the Guidance of
Mrs. R.Kayalvizhi
By
Priyanka.R(20084851)
Suvetha.R(20080808)
Vennila.I.S.R(20084879)
 OBJECTIVE
To ensure secured transmission of
MPEG video bit streams in wireless
application using steganography and
MPEG-4 standards.
 TRANSMITER SECTION
 Basic secured transmission involves the
following techniques.
Encryption
Steganography
Authentication-implemented by
hash algorithm
Compression –using MPEG4
standards
 Advanced Encryption Standard(AES)
 The AES algorithm is asymmetric block cipher
that can encrypt (encipher) and decrypt
(decipher) information.
 Encryption converts data to an unintelligible
form called ciphertext; decrypting the
ciphertext converts the data back into its
original form, called plaintext.
 The AES algorithm is capable of using
cryptographic keys of 128, 192, and 256 bits to
encrypt and decrypt data in blocks of 128 bits.
 The AES cipher is specified as a number of
repetitions of transformation rounds that
convert the input plaintext into the final
output of ciphertext.
 Each round consists of several processing
steps, including one that depends on the
encryption key.
 A set of reverse rounds are applied to
transform ciphertext back into the original
plaintext using the same encryption key.
 AUTHENTICATION
 Authentication provides a way to ensure
message integrity and a way to verify who
sent the message.
 Any adversary can inject messages during
transmission, so the receiver needs to
make sure that the data arise from the
correct source.
 So, the sender and the receiver share a
secret key to compute a message
authentication code.
 Message Authentication Code(MAC)
 MAC is a short piece of information
used to authenticate the message.
 The purpose of a MAC is to authenticate
both the source of a message and its
integrity without the use of any
additional mechanisms.
 MACs based on cryptographic hash
functions are known as HMACs.
FUNCTIONAL BLOCK OF MAC
 HASH ALGORITHM
 Hash algorithm enables the determination
of the message’s integrity i.e,any change to
the message will with a very high
probability result in a different message
digest.
 It is used to translate an indefinite length of
data into a fixed length unique hash.
 The condensed representation' is of fixed
length and is known as a 'message digest'
or 'fingerprint'.
 STEGANOGRAPHY
 It is the method of hiding data within data
such a way that no one apart from sender
and receiver suspects the existence of the
message.
 A basic model of steganography consists of
carrier, message, embedding algorithm and
stego-key.
 The embedding and retrieval of the
message from the video is based on the
stego-key.
STEGANOGRAPHY MODEL
 MPEG-4
 MPEG-4 is a collection of methods defining
compression of audio and visual (AV) digital
data and is aimed primarily at low bit-rate video
communications.
 This standard uses a motion compensated,
DCT based coding scheme.
 It consists of the following procedures..

divide the picture into 8*8 blocks

determine relevant picture information
discard redundant information
encode relevant picture information with
least no.of bits.
 MPEG IMPLEMENTATION
 The image is fragmented to blocks of pixels
called macroblocks.
 It is compared to neighboring blocks of
previous frame and used to compute a motion
compensated prediction error.
 Motion compensation is a technique for
describing a picture in terms of transformation
of a reference picture to the current picture.
 After predicting the frames, the coder finds the
error which is then compressed using the DCT
and then transmitted.
 The quantized DCT coefficients undergo zig
zag scanning and are coded using Variable
Length Codes(VLC).
 VLC is to assign shorter codes for the most
common coefficients.

Bit stream DCT Quantization Zig-Zag scan

Variable
Length
Coding
 RECEIVER SECTION
 Finally the receiver part consists of
Decode the compressed message.
Authentication of received message on
giving the secret key.
Retrieval of data from video using
stego key.
Decrypting using AES Decryption.
THANK YOU
 RECEIVER BLOCK

AUTHENTICATION
RECEIVED IMAGE EXTRACT
USING COMBINED
AND SIGNATURE TEXT
SHA 512

VERIFY DES
SIGNATURE DECRYPTION

DISCARD
 ‑I frames are the least compressible but
don't require other video frames to
decode.
 P‑frames can use data from previous
frames to decompress and are more
compressible than I‑frames.
 B‑frames can use both previous and
forward frames for data reference to get
the highest amount of data compression.
  An I‑frame is an 'Intra-coded picture', in effect a fully-specified
picture, like a conventional static image file. P‑frames and
B‑frames hold only part of the image information, so they need
less space to store than an I‑frame, and thus improve video
compression rates.
 A P‑frame ('Predicted picture') holds only the changes in the
image from the previous frame. For example, in a scene where
a car moves across a stationary background, only the car's
movements need to be encoded. The encoder does not need
to store the unchanging background pixels in the P‑frame,
thus saving space. P‑frames are also known as delta‑frames.
A B‑frame ('Bi-predictive picture') saves even more space by
using differences between the current frame and both the
preceding and following frames to specify its content.