DEPARTMENT OF TELECOMMUNICATION ENGINEERING

Dr. AMBEDKAR INSTITUTE OF TECHNOLOGY

(An Autonomous Institute Affiliated to VTU)
Near Jnana Bharathi Campus, Bengaluru – 560056

Project Review [LDNP43] on:

Remote Authentication using Biometrics

Presented By:
Chaitra.P (1DA17LDN01)

Under the Guidance of :

​ Sudha.H.Thimmaiah
Assoc.Prof
Dr.AIT
 COMPANY /
GUIDES JOB TITLE INSTITUTION
Guide
Dr. Ambedkar Institute of
Sudha.H.Thimmaiah Assoc. Professor
Technology

Co-Guide and Usharani M.A. Asst. Professor Dr. Ambedkar Institute of

Examiner Technology

Dr.AIT ,Department of TCE ,MTECH,DCN

2
 In t rod u ctio n :

Wha t i s R emote Us er Authe ntic ation?

•Remote user authentication is a mechanism in which the remote server verifies the

legitimacy of a user over an insecure communication channel.

•An ideal password authentication schemes should satisfy and achieve all of these.

Dr.AIT ,Department of TCE ,MTECH,DCN

2
 Three Factors of Authentication

• Something you know: Knowledge Factors (such as a password)

• Something you have: Ownership Factors (such as a smart card)

• Something you are: Inherence Factors (such as a fingerprint or other biometric method)

• The authentication must happen in person (i.e..

account holder, laptop user, desktop, mobile phone
user etc..) which is more secured than any other
factors mentioned above.

Dr.AIT ,Department of TCE ,MTECH,DCN 4

 Literature survey
1. Title: An Introduction to Biometric Recognition
Method:
• By using biometrics it is possible to confirm or establish an individual’s identity based on “who she is”,
rather than by “what she possesses” (e.g., an ID card) or “what she remembers” (e.g., a password).
• The author (Anil K. Jain, Arun Ross and Salil Prabhakar) gives a brief overview of the field of
biometrics and summarizes some of its advantages, disadvantages, strengths, limitations, and related
privacy concerns.

2. Title: Cryptanalysis and improvement of a biometrics-based multi-server authentication with key

agreement scheme
Method:
• A robust biometrics based multi-server authentication with key agreement scheme for smart cards on
elliptic curve cryptosystem.
• The author,(Hakhyun Kim, Woongryul Jeon, Yunho Lee and Dongho Won ) however, show that Yoon
et al.’s scheme is vulnerable to off-line password guessing attack and propose an improved scheme to
prevent the attack.

Dr.AIT ,Department of TCE ,MTECH,DCN 5

 Literature survey
3. Title: Dynamic ID-based remote user password authentication schemes using smart cards
Method:
• Until now, there have been ample of remote user authentication schemes published in the literature and
each published scheme has its own merits and demerits.
• The author (R.K Madhusudhan ) provides a scheme which allows the users to choose and change their
passwords freely, and do not maintain any verifier table. The scheme is secure against ID-theft, and can
resist the reply attacks, forgery attacks, guessing attacks, insider attacks and stolen verifier attacks.

4. Title: Password secured systems and negative authentication

Method:
• Today’s industry, government, and critical infrastructure and independent on software systems. In their
absence, our modern world would come to a stop. Given the dependence, the mounting cyber threat is of
critical concern.
• The author,(Hakhyun Kim, Woongryul Jeon, Yunho Lee and Dongho Won ) scheme presents the state
of the practice in password systems and introduces work in negative authentication and implementations.

Dr.AIT ,Department of TCE ,MTECH,DCN 6

 Literature survey
5. Title: Robust authentication based multi-server key agreement scheme for smart cards on elliptic curve
cryptosystem
Method:
• It is extremely tedious for users to register numerous servers. In order to resolve this problem, various multi-
server authentication schemes recently have been proposed. However, these schemes are insecure against some
cryptographic attacks or inefficiently designed because of high computation costs.
• The author (E.J. Yoon and K.Y. Yoo) a new efficient and secure biometrics-based multi-server authentication
with key agreement scheme for smart cards on elliptic curve cryptosystem(ECC) without verification table to
minimize the complexity of hash operation among all users and fit multi-server communication environments.
• By adopting the biometrics technique, the proposed scheme can provide more strong user authentication
function.

6. Title: An anonymous multi-server authenticated key agreement scheme based on trust computing using
smart cards and biometrics
Method:
• The authentication schemes are designed for a single server environment and result in users needing to register
many times when they want to access different application servers.
• To solve this problem, the author (Ming-Chin Chuang)propose an anonymous multi-server authenticating key
agreement scheme based on trust computing using smart cards, password, and biometrics.

Dr.AIT ,Department of TCE ,MTECH,DCN 7

 Problem Statement

• In wireless communications, sensitive information is frequently exchanged,

requiring remote authentication.

• In order to investigate their full potentiality and provide complete security,

biometrics can be incorporated in hybrid Crypto-Steganographic schemes.

• In particular, cryptographic algorithms can scramble biometric signals so that they

cannot be understood, while steganographic methods can hide the encrypted
biometric signals so that they cannot be seen.

Dr.AIT ,Department of TCE ,MTECH,DCN 7

 Objective

Authentication is the act of confirming the truth of an attribute of a datum or entity. This might
involve confirming the identity of a person or software program, tracing the origins of an artifact, or
ensuring that a product is what its packaging and labelling claims to be.

The proposed remote human authentication scheme over wireless channels under loss tolerant
transmission protocols, aims to ensure:

(A) Robustness against Deciphering, Noise and Compression,

(B) Good Encryption Capacity, And
(C) Ease Of Implementation.

For This Purpose We:

• Employ Wavelet-Based Steganography, TELECONFERENCE

• Encrypt Biometric Signals To Allow For Natural Authentication,
• Involve A Chaotic Pseudo-Random Bit Generator (C-Prbg) to create the keys that trigger the
whole encryption to increase security, and
• The Encrypted Biometric Signal is hidden in a Vo, which can reliably be detected in modern
applications that involve Teleconferencing .
Dr.AIT ,Department of TCE ,MTECH,DCN
8
 Hardware/Software
• Hardware requirement:

1. PC
2. RAM minimum 2GB
3. HDD minimum 100GB

• Software requirement:

1. MATLAB 7.0/ 2018

Dr.AIT ,Department of TCE ,MTECH,DCN

10
 Proposed Method

The two main directions in the authentication field are positive and negative authentication.

• Positive authentication is well-established and it is applied by the majority of existing

authentication systems.
• Negative authentication has been invented to reduce cyber attacks.

• The proposed scheme is a Positive Authentication System and for security reasons
elements from at least two, and preferably all three, factors like (Ownership,
Knowledge, Inherence ) should be verified.

Dr.AIT ,Department of TCE ,MTECH,DCN

10
 Block Diagram

Dr.AIT ,Department of TCE ,MTECH,DCN

11
 Algorithm
Sender side Algorithm:

Step1: Input the video and frames separation.

Step2: Video object is extracted from the video.
Step3: Select the secret frame from video object in which data is to be hidden.
Step4: Apply Hiding module
• Take biometric signal
• Encrypt biometric signal using secret key(Chaos Encryption)
• Vectorize encrypted biometric signal
• Apply DWT and sub band decomposition
Step 5: Create video using stego-object and Compress using (DCT)
 

Dr.AIT ,Department of TCE ,MTECH,DCN

10
 Algorithm
Receiver side Algorithm:

 Step 1: Load encrypted video with hidden data and convert it into frames
Step 2: The video is De-compressed using IDCT
Step 3: Apply DWT Watermarking detection module
Step 4: Enter the decryption password and decrypt biometric signal(Chaos Decryption)
Step 5: Extract original biometric signal

 Initially the biometric signal is encrypted by incorporating a chaotic pseudo-random bit

generator and a chaos driven cipher, based on mixed feedback and time variant S-boxes.
 
The use of such an encryption mechanism is justified since,
1) Chaos presents sensitivity to initial conditions,
2) A C-PRBG statistically works very well as a one-time pad generator.

Dr.AIT ,Department of TCE ,MTECH,DCN

10
Key Techniques used:
– Biometric Hiding:
• Biometric security devices measure unique characteristics of a person, such as voice pattern,
the iris or retina pattern of the eye, or fingerprint patterns. With biometrics, it can be extremely
difficult for someone to break into a system.
• In this proposed method, a biometric is hidden in another biometry of the same person to
provide double Authentication.

– Steganographic system:
• The art and science of hiding information by embedding messages within other, seemingly
harmless messages. Steganography works by replacing bits of useless or unused data in
regular computer files (such as graphics, sound, text, HTML, or even floppy disks ) with bits of
different, invisible information.
• The System that works with Steganographic techniques is said to be Steganographic System.

– Video Object:
• Video shows what object means. A thing that has physical existence.. The goal, end or purpose
of something.

Dr.AIT ,Department of TCE ,MTECH,DCN 15

 What is Discrete Wavelet Transform?

• In numerical analysis and functional analysis, a discrete wavelet transform (DWT) is any
wavelet transform for which the wavelets are discretely sampled.
• As with other wavelet transforms, a key advantage it has over Fourier transforms is temporal resolution: it
captures both frequency and location information (location in time).

•An example of the 2D discrete wavelet transform that is

used in JPEG2000 The original image is high-pass filtered,
yielding the three large images, each describing local
changes in brightness (details) in the original image.

•It is then low-pass filtered and downscaled, yielding an

approximation image; this image is high-pass filtered to
produce the three smaller detail images, and low-pass filtered
to produce the final approximation image in the upper-left.

Fig.1:Discrete Wavelet Transform

Dr.AIT ,Department of TCE ,MTECH,DCN
2
 How Discrete Wavelet Transform works?
• DWT is used to separate the image into a pixel. DWT is used in signal and image processing
especially for lossless image compression. DWT is also used for Lossy compression.
• The Lossless image compression is mostly used in DWT Lossless image compression give the
good quality of the image and also the compression ratio of the image also good. The PSNR
(Peak Signal to Noise Ratio) ratio of the image is also good in the Lossless compression.
• In the DWT transformation, the image is taking into HL, LH, HH, LL Ratios. Then the image is
moved into DWT transforms, and then DWT Quantization is processed. After that the process is
move to DPCM encoder. (Differential Pulse Code Modulation)
• This technique first decomposes an image into coefficients called sub-bands and then the
resulting coefficients are compared with a threshold. Coefficients below the threshold are set to
zero. Finally, the coefficients above the threshold value are encoded with a loss less
compression technique.

Fig.2: Flow of Discrete Wavelet Transform 17

Dr.AIT ,Department of TCE ,MTECH,DCN
 What is Wavelets?
• Wavelet is a “small wave”. It is a special kind of function which exhibits oscillatory behaviour for a short period
of time and then dies out.

• In signal processing using Fourier transform, the signal is decomposed into a series of sines or cosines. It is
impossible to know simultaneously the exact frequency and the exact time of occurrence of that particular
frequency in a signal.

• In order to know the frequency, the signal must be spread in time, or vice versa. A solution is to split the signal up
into components that are not sine or cosine waves.

• A single function and its dilations and translations may be used to generate a set of ortho-normal basis functions
to represent a signal. This would help to condense the information in both the time and frequency domains. This
idea led to the introduction of wavelets.

(An Ortho-normal basis for an inner product space V with finite dimension is a basis for V whose

vectors are ortho-normal, that is, they are all unit vectors and orthogonal to each other.)

Dr.AIT ,Department of TCE ,MTECH,DCN 18

 What is Wavelets?
• Wavelet transform decomposes a signal into a set of basis functions. These basis functions are
called Wavelets.
• The DWT decomposes a digital signal into different sub-bands so that the lower frequency sub-
bands have finer frequency resolution and coarser time resolution compared to the higher
frequency sub-bands. DWT is the basis of the new JPEG2000 image compression standard.

Fig.2: Image Compression levels

Fig.3: Three level decomposition for 2D – DWT

Dr.AIT ,Department of TCE ,MTECH,DCN 19

 What is Wavelets?
Wavelets can be manipulated in two ways – by translation and by
scaling. In translation, the central position of the wavelet is changed
along the time axis. In scaling, its frequency is changed.

Morlet Wavelet
Translation of a Wavelet Scaling of a Wavelet

 Haar Wavelet Function

Haar wavelet function, denoted by , is given by:

Haar Wavelet Function

Haar Wavelet Function and its Translates Scaled Versions of Haar Wavelet Function
20
Dr.AIT ,Department of TCE ,MTECH,DCN
 Why Haar DWT?
• Due to its low computing requirements, the Haar transform has been mainly used for image
processing and pattern recognition.
• From this reason two dimensional signal processing is an area of efficient applications of Haar
transforms due to their wavelet– like structure.
• Modern cameras are capable of producing images with resolutions in the range of tens of
megapixels. These images need to be compressed before storage and transfer.
• The Haar transform can be used for image compression. The basic idea is to transfer the image
into a matrix in which each element of the matrix represents a pixel in the image. For example, a
256×256 matrix is saved for a 256×256 image. JPEG image compression involves cutting the
original image into 8×8 sub-images. Each sub-image is an 8×8 matrix.
• The 2-D Haar transform is required. The equation of the Haar transform is
where  is a  n × n matrix and   is n-point Haar transform. The inverse Haar transform is

Dr.AIT ,Department of TCE ,MTECH,DCN 21

 Image compression

• Image compression is minimizing the size in bytes of a graphics file without degrading the
quality of the image to an unacceptable level.

• The reduction in file size allows more images to be stored in a given amount of disk or
memory space. It also reduces the time required for images to be sent over the Internet or
downloaded from Web pages.

— Image Processing refers to processing an image into digital image. Image Compression is
reducing the amount of data necessary to denote the digital image. Image Compression techniques
to reduce redundancy in raw Image.

Fig5:Image Compression
Dr.AIT ,Department of TCE ,MTECH,DCN
22
 Discrete Cosine Transform (DCT)

• The discrete cosine transform (DCT) represents an image as a sum of sinusoids of

varying magnitudes and frequencies. The dct2 function computes the two-
dimensional discrete cosine transform (DCT) of an image.
• The DCT has the property that, for a typical image, most of the visually significant
information about the image is concentrated in just a few coefficients of the DCT. 
For this reason, the DCT is often used in image compression applications

How to compress an image using the Discrete Cosine Transform (DCT)?

The DCT is computed by considering the two-dimensional DCT of 8-by-8 blocks in an input image,
discards (sets to zero) all but 10 of the 64 DCT coefficients in each block, and then reconstructs the
image using the two-dimensional inverse DCT of each block. The example uses the transform matrix
computation method.

Dr.AIT ,Department of TCE ,MTECH,DCN

23
 Correlations

• A correlation matrix is a table showing correlation coefficients between variables. Each pixel in
the matrix shows the correlation between two Images.
• A correlation matrix is used as a way to summarize data, as an input into a more advanced
analysis, and as a diagnostic for advanced analyses.

• Correlation quantifies the strength of a linear relationship between two Images.

• When there is no correlation between two Images then, two Images are considered to be different
• Here in this Analysis, Vertical, Horizontal, Diagonal Correlations are considered.

Histogram
• An image histogram is a chart that shows the distribution of intensities in an indexed or grayscale image.

• The information in a histogram can be used to choose an appropriate enhancement operation.

For example, if an image histogram shows that the range of intensity values is small, you can use an
intensity adjustment function to spread the values across a wider range.

Dr.AIT ,Department of TCE ,MTECH,DCN

24
 RESULT ANALYSIS
TRANSMITTER
• The parameters Correlation, Histogram, MSE, PSNR, BER, and Bandwidth Efficiency are considered
to analyse the efficiency of the proposed method.

• Initially, a cover image is taken from the webcam which

has background other than head and shoulder of the user.

• A Video Host Image is obtained by semantic

segmentation method (where the unwanted background
pixels are removed.)

• Due to the segmentation of the image, bandwidth

usage efficiency of transmission increases.

• A Biometric Image is considered as a secret image and is

encrypted using Chaos Encryption.

The Correlation of the Original Biometric Image and

Encrypted Image is considered to understand the similarity
between original and encrypted image.

Dr.AIT ,Department of TCE ,MTECH,DCN

2
• Additionally, to quantify and compare the correlations of adjacent pixels, the correlation
coefficient rxy of all selected adjacent pairs (x,y) is calculated for the plain and encrypted images
using the following formulas, where xi and yi are the gray values of two adjacent pixels in the
image.

• For the above mentioned biometric image, the similarity between encrypted and original images is
3.581% which means, the encrypted Secret image is difficult to retrieve by the intruders or
attackers.

• The Stego Image is obtained by DWT Watermarking Steganographic technique and the Vectorized
Encrypted Biometric Image is hidden in the Cover Image obtained by webcam.

• Before transmission the Stego Image is compressed by DCT Compression to efficiently utilize the
Bandwidth.

Dr.AIT ,Department of TCE ,MTECH,DCN 26

• For the Stego Image , the MSE (Mean Squared Error), PSNR (Peak Signal to Noise Ratio) and BER (Bit
Error Rate) are calculated.

TABLE 1: Parameters that analyse the quality of transmitted Image

• MSE measures the average of the squares of the errors, which is, the average of the squared difference
between the estimated values and what is estimated.

MSE is the mean of the squares of errors in two images I1, I2 Where M and N
represents the dimensions of two images of same size.

In the result obtained, the value of the MSE is 0.82806 which is small value and hence,
this image is better for transmission.

Dr.AIT ,Department of TCE ,MTECH,DCN 27

• PSNR is used to measure the quality of reconstruction of lossy and lossless compression.

• In the PSNR formula, the format of the image decides the value of R. If the format of the image is 8 bit,
R = 255. If the format of the image is expressed using floating point numbers then, R = 1.

• Acceptable values for the PSNR in lossy image and video compression ranges from 30 and 50 dB,
provided the bit depth is 8 bits, where higher is better. For 16-bit data values the PSNR range from
60 and 80 dB. Usually, the acceptable values for wireless transmission with minimum quality loss
are considered, which lies in the range of 20 dB to 25 dB.

• In the result obtained, the value of the PSNR is 43.808 dB which provides better lossy compression at
transmitting end.

• BER is the ratio of (number of bit errors) to (total number of transferred bits) during a studied
time interval. BER is expressed in negative power.

• In the above result obtained, the BER is (-14250.00000) where BER is 10 to the minus 4, this means that
out of (around 10,000) bits transmitted, 1 had an error. This value is good for transmitting the information
with less error.
• Same parameters are considered, at receiving end and compared for the analysis of proposed method

Dr.AIT ,Department of TCE ,MTECH,DCN 28

 RECEIVER TABLE 2: Parameters that analyse the quality of
Retrieved Image

Retrieved biometric Image at the receiving end

• As the Image is transmitted through the noisy channel the MSE value increased and PSNR value
decreased. But the bit error rate remains almost the same.
• At the receiving end, the values of the parameters are much better compared to the transmitting end.

BANDWIDTH USAGE EFFICIENCY

(a) A secondary complementary authentication mechanism by capturing with a camera the person under
authentication,

(b) Efficient bandwidth usage, since most of the used bandwidth transmits information relevant to the
authentication process, and

(c) Efficient rate control, since in case of traffic congestion/reduction of QoS, the rate control mechanism could
discard blocks from the body region that do not also contain hidden information, instead of discarding face
blocks. This is the content-awareness merit of the proposed bandwidth-friendly scheme .
Dr.AIT ,Department of TCE ,MTECH,DCN 29
 CONCLUSION

• Biometric Authentication has become a common security procedure in our everyday

lives. Even governments and other reputed organizations prefer biometric authentication
• Thus there is a demand for further.
to manage access for both physical and digital resources such as building, rooms and
computing devices.

• Thus there is a demand for further development and integration of biometric

authentication techniques into practical applications. Towards this direction in this paper
the domain of biometrics authentication over error-prone networks has been examined.

• Result analysis and its detailed theoretical explanation illustrate the performance of the
proposed system in terms of security. The system is also able to recover the hidden
encrypted biometric signal under different losses. and all these merits are accompanied
by efficient bandwidth usage.

Dr.AIT ,Department of TCE ,MTECH,DCN 12

 Advantages

This method provides a robust authentication mechanism based on semantic

segmentation, chaotic encryption, and data hiding.

• It is one of the most efficient algorithms of literature that facilitates robust

hiding of visually recognizable patterns.

• The embedded information is hard to detect by the human visual system.

• Biometrics is inherently more reliable.
• Biometric traits cannot be lost or forgotten.
• They are more difficult to forge.

Dr.AIT ,Department of TCE ,MTECH,DCN 12

 Applications
• Authentication is the act of conforming the truth of an attribute of a datum or entity.
In this method a robust and more accurate authentication mechanism based on
semantic segmentation, chaotic encryption, and data hiding.

• Biometric signals enter more and more into our everyday lives, since governments,
as well as other organizations, resort to their use in accomplishing crucial
procedures (e.g. citizen authentication). Thus there is an urgent need to further
develop and integrate biometric authentication techniques into practical
applications.

Dr.AIT ,Department of TCE ,MTECH,DCN 32

 Why this method?

• This method provides a high security and easy way to encrypt, embedding and decrypt
secret image without effecting the quality of images(secret or cover).

• The use of DWT Watermarking and DCT Compression provides high levels of

robustness, keeping at the same time the ease of implementation and the compatibility
to well-known and widely used Image and Video compression

• All these merits are accompanied by efficient bandwidth usage

Dr.AIT ,Department of TCE ,MTECH,DCN 33

Thank you