\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Integrated Biometric Template Security using Random Rectangular Hashing},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{Integrated Biometric Template Security using Random Rectangular Hashing}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Madhavi  Gudavalli}

             \author[2]{Dr. D.Srinivasa  Kumar}

             \author[3]{Dr. D.Srinivasa  Kumar}

             \affil[1]{  JNTU KAKINADA}

\renewcommand\Authands{ and }

\date{\small \em Received: 11 December 2013 Accepted: 5 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


Large centralized biometric databases, accessible over networks in real time are especially used for identification purposes. Multimodal biometric systems which are more robust and accurate in human identification require multiple templates storage of the same user analogous to individual biometric sources. This may raises concern about their usage and security when these stored templates are compromised since each person is believed to have a unique biometric trait. Unlike passwords, the biometric templates cannot be revoked and switch to another set of uncompromised identifiers when compromised. Therefore, fool-proof techniques satisfying the requirements of diversity, revocability, security and performance are required to protect stored templates such that both the security of the application and the users? privacy are not compromised by the impostor attacks. Thus, this paper proposes a template protection scheme coined as random rectangular hashing to strengthen the multimodal biometric system. The performance of the proposed template protection scheme is measured using the fingerprint FVC2004 and PolyU palmprint databases

\end{abstract}


\keywords{biometric cryptosystems, cancellable biometrics, feature level fusion, multimodal biometric systems, random rectangular hashing, template protection.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
biometric system automatically recognizes the person based on his/her physiological or behaviour characteristics \hyperref[b0]{[1]}. As the biometric features are distinct to each person, it establishes direct connection between users and their identity. These systems are more ease and secure as they are not needed to remember any password or carry any token to gain access to the applications. The biometric systems which rely on the evidence of a single source of information for authentication (e.g., single fingerprint, iris, palm-print, retina, voice, ear or face) are known as Unimodal biometric systems. They often suffer from enrolment problems due to non-universal biometric traits, susceptibility to biometric spoofing or insufficient accuracy caused by noisy data. One of the methods to overcome these problems is to make use of multimodal biometric systems, which combines information from multiple inputs of one or more modalities to arrive at a decision \hyperref[b1]{[2]}. Depending on the level of information that is fused, the fusion scheme can be classified as sensor level, feature level, match score level and decision level fusion. The sensor level and the feature level are referred to as pre-mapping fusion while the matching score level and the decision level are referred to as post-mapping fusion \hyperref[b2]{[3]}. The acquisition and processing sequence of these systems can be either serial or parallel. In the serial or cascade or sequential architecture, the acquisition and processing of the different sources take place sequentially and the outcome of one matcher may affect the processing of the subsequent sources. In the parallel design, different sources are processed independently and their results are combined using an appropriate fusion scheme \hyperref[b3]{[4]}.\par
The security of the system will be determined by the integrity of the biometric database. The conventional biometric systems elevate privacy and protective problems to the users \hyperref[b5]{[6]}. A stolen template yields ruinous issues to the biometric system i.e an attacker recapitulates the seized template to the matching module to get admitted or the snatched template can be misused across other biometric systems for crossmatching that uses the same biometric modality \hyperref[b4]{[5]}. Therefore, if the stored template is compromised, it becomes useless forever. A compromised template cannot be revoked because of the significant link between a biometric trait and its template. Thus, template protection has come into existence due to the intrinsic weaknesses of traditional biometric systems.\par
In general, a template protection scheme must fulfil the following requirements \hyperref[b4]{[5]} In literature, Cancellable Biometrics \hyperref[b16]{[17]} known as Transformation-based Approach and Biometric Cryptosystems \hyperref[b6]{[7]} known as Helper Data Methods are the two approaches to secure stored single biometric template. Cancellable Biometrics facilitates the template to operate like a password which can be cancelled and reinstated if required. This approach assures the privacy and security of the actual biometric template by employing an irreversible transformation. Thus, the transformed biometric data is stored in the database instead of original template. This approach is furthermore organized as biometric salting and noninvertible transform. In \hyperref[b7]{[8]} Soutar et al. suggested biometric encryption method. Three non-invertible transformation functions were proposed for cancellable fingerprint template generation by Ratha et. al. in \hyperref[b8]{[9]} namely Cartesian transformation, surface folding transformation and polar transformation. In \hyperref[b9]{[10]}, Teoh et. al. proposed Bio-Hashing technique to produce cancellable fingerprint templates. A new token will be reissued in the case of compromised template. Biometric Cryptosystems circumscribe the template protection design by including biometric data into cryptographic bounds. This method stringent the template security by employing the biometrics data to determine an encrypted template. In \hyperref[b12]{[13]} Dodis et al. introduced secure sketch and fuzzy extractor concepts in key generation from biometrics. A two-level quantization method was introduced by Li and Chang in \hyperref[b13]{[14]} to obtain secure sketches. The practical issues in secure sketch construction and secure sketch quantization for face biometric were discussed by Sutcu et al. \hyperref[b14]{[15]}. Buhan et al. in \hyperref[b10]{[11]} addressed the problem of generating fuzzy extractors from continuous distributions.\par
The secure sketch construction is proposed for fingerprints in \hyperref[b11]{[12]} and for multimodal systems (face and fingerprint) in \hyperref[b15]{[16]}.\par
This paper proposes a well-defined key-based transformation technique for integrated template of fingerprint and palmprint obtained by combining their respective feature vectors at feature level. In the proposed scheme, it is difficult to reconstruct the original template form the transformed template without submitting the distinctive secret key. A different key can be assigned to the biometric template for the generation of new one if the transformed template is compromised. 
\section[{II.}]{II.} 
\section[{Proposed System}]{Proposed System}\par
The proposed scheme analyses the performance of multimodal biometric system that integrates extracted feature vectors of fingerprint and palmprint at feature level. This fusion level is preferred as it contains much richer information on the source data. The acquisition and processing sequence employed for this system is serial i.e each biometric source is obtained and processed independently with a short time interval between their successive acquisitions and processing. 
\section[{a) Methodology}]{a) Methodology}\par
The following steps show the process of proposed template protection scheme.\par
Step 1: The user U i with identity ID i inputs fingerprint and palmprint data to get registered in the system.\par
Step 2: Feature Extraction-The acquired fingerprint and palmprint data are pre-processed and enhanced by adopting a two dimensional discrete wavelet transform (2D-DWT). The mutual attributes such as ridges of fingerprint and palmprint images are preserved using 2D Gabor filter.G(x, y, f, ?) = exp?? x? 2 +y? 2 2? 2 ?cos(2?fx?)\par
Where x?=xcos?+ysin? and y?=-xcos?+ysin?, f is the frequency of the sinusoidal plane wave along the direction ? from the x-axis, ? 2 is the standard deviation of the Gaussian envelope. The values considered for experiment are f= 10, ? 2 =16, and ?=?/8.\par
Step 3: Normalization-As the intensity domains of filtered palmprint and fingerprint are different, they are normalized to the same domain by employing Gaussian normalization. 
\section[{G(x, y) =}]{G(x, y) =}\par
??(??, ??) ? µ I ? I\par
Where I(x, y) denotes the pixel intensity at coordinate (x, y), µ I denotes the intensity mean, and ? I denotes the intensity standard deviation.\par
Step 4: Feature Level Fusion-The normalized LL subband images are combined at feature level using Daubechies Wavelet.\par
Step 5: Random Tiling-A set of rectangles with random characteristics of the user U i are generated from the fused feature using random tiling. The magnitude of each rectangle is obtained by computing the standard deviation. These magnitudes are concatenated to generate a feature vector. The random tiling is a function 'f' which accepts two parameters and returns a feature vector 'V'. V = f (I fused , K ), Where I fused represents the fused feature, and 'K' is the user specific key to obtain the rectangles' characteristics. A set of random numbers r w , r h ? [-1,1] are generated using 'K' as the seed. A new set of features can be extracted from the fused feature in the case of a compromise using newly generated key 'K'. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XIV Issue VII Version I Step 6: Cryptographic Key Generation-The biometric secret key 'k' is generated using AES algorithm which is the variableness origin to select the random rectangular regions. Thus, every user has a distinct fused template depending on the different unique keys generated.\par
Step 7: Helper Data Generation-Cancellable biometric features are generated through Bio-hashing using MD5 (Message Digest) from the random rectangle region. This hashing is a transformation function which represents the ridges in the form of a decimal vector.\par
The number of ridges falling within the rectangle region is counted. The numbers in the decimal vector form the basis for generating template bit-string. The same process is repeated for remaining rectangular regions. The hash vector is obtained by combining all the 8-digit fixed-length vectors produced from each rectangular region. This hash vector acts as the helper data and is stored in the database. The bit-string representing the biometric features is generated by utilising the hash vector. The process of cryptographic key, 'k' is formulated from the encoded Bio-hash is as follows.?????? ?????????????? ? ?? ?? ? ?????? ?????????????????? ? ?? ? ??? ?? = k ?\par
where ? is called Biokey, b c and b 'c refer to the encoded Bio-hash and decoded Bio-hash respectively, while ? denotes bitwise XOR operation.\par
Step 8: Bit-String Generation-The integer hash vector produced is insecure and occupies much of the database. The integer values are transformed to binary bit-string using the bit-block coding technique. This technique first initializes a fixed binary block with zeros. This block values will be reset to ones corresponding to the integer in the hash vector. This process is iterated for the remaining blocks of the hash vector to generate the binary bit-string. 
\section[{III.}]{III.} 
\section[{Experimental Results}]{Experimental Results}\par
The databases fingerprint FVC2004 \hyperref[b17]{[18]} and PolyU palmprint  {\ref [19]} are used for performance analysis of the proposed integrated template security approach. The experiments were conducted on the randomly selected 10 samples of fingerprint and palmprint images of respective databases. The present work assumes that each user is allotted with a secret key which is stored in the database and these keys are lost by no means. The enrolled and query binary vectors are produced based on the secret keys and the scores for identification between the enrolled bit-strings (e) and query bit-strings (q') were computed using the formula:??????????(??, ??) = ? ( ?? ??=1\par
?? ?? ,?? ? ?? ??,?? ) ?? where ? represents the XOR operation, while e j,r , and q i,r corresponds to the r-th bit in e j and q i ,. L denotes the length of e j and q i . The collation between the enrolled and query binary templates is shown in Figure \hyperref[fig_1]{2}. The performance in terms of equal error rate (EER) with various random rectangles is listed in Table \hyperref[tab_1]{1}. It is observed that the rise in random rectangles lowers the EER. The root cause is that more features can be extracted with more number of random rectangles there by features more distinct.\par
The recognition rate obtained is lower than 1\% when tested on public databases of FVC2004 \hyperref[b17]{[18]}    
\section[{IV. Conclusions}]{IV. Conclusions}\par
A novel scheme based on key based hashing with randomized rectangle is presented in this paper that produces short hash strings for integrated templates. These hashes cannot reproduce the original template without knowledge of the unique key. Further, the use of Bio-hash as the mixing process provides the one-way transformation and deters exact recovery of the biometric features when compromised. When the template is compromised, it is difficult to construct the original hash vector because the impostors cannot figure out the exact location of each ridge as the count of number of ridges is only contained in the random rectangle. In the current work, the performance attained is lower than 1\%. The diversity property of proposed scheme is examined by evaluating the correlation of the bit-strings obtained by using different user specific keys as seed in random tiling process. In this case, a high positive correlation indicates that the old bit-string falls into the region of acceptance of the refreshed bit-string. Thus, the proposed scheme satisfies all the four requirements of template protection scheme namely, revocability, security, performance and diversity. The future work signifies the stolen-token scheme, where the attacker grabs the secret key to get access to the system.\par
V. 
\begin{quote}
36\end{quote}
\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.6831775700934579\textwidth}P{0.16682242990654206\textwidth}}
Number of Random\tabcellsep EER\\
Rectangles\tabcellsep \\
10 Random Rectangles\tabcellsep 2.81\%\\
15 Random Rectangles\tabcellsep 0.32\%\\
20 Random Rectangles\tabcellsep 0.20\%\end{longtable} \par
 
\caption{\label{tab_1}Table 1 :}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 		 		\backmatter   			 
\subsection[{Acknowledgement}]{Acknowledgement}\par
We would like to express our gratitude to all the referees' authors of the papers who have helped directly or indirectly the possibility to complete this research work. 			  			  				\begin{bibitemlist}{1}
\bibitem[Gudavalli et al. ()]{b5}\label{b5} 	 		‘A Template Protection Scheme for Multimodal Biometric System with Fingerprint, Palmprint, Iris and Retinal Traits’.  		 			Madhavi Gudavalli 		,  		 			S Dr 		,  		 			Viswanadha Raju 		.  		 ACM 978-1-4503-1185-4/12/09.  	 	 		\textit{CUBE 2012 International IT Conference},  				 (Pune, Maharashtra, India)  		September 3-5, 2012. p. .  	 
\bibitem[Teoh et al. ()]{b9}\label{b9} 	 		‘BioHashing: Two factor authentication featuring fingerprint data and tokenised random number’.  		 			A B J Teoh 		,  		 			D C L Ngo 		,  		 			A Goh 		.  	 	 		\textit{Pattern Recognition}  		2004. 37 p. .  	 
\bibitem[Uludag et al. ()]{b6}\label{b6} 	 		‘Biometric Cryptosystems: Issues and Challenges’.  		 			U Uludag 		,  		 			S Pankanti 		,  		 			S Prabhakar 		,  		 			K Anil 		.  	 	 		\textit{Proceedings of the IEEE}  		2004. 92  (6)  p. .  	 
\bibitem[Roberge et al. ()]{b7}\label{b7} 	 		\textit{Biometric encryption. ICSA Guide to Cryptography},  		 			C S D Roberge 		,  		 			A Stoianov 		,  		 			R Gilroy 		,  		 			B V Kumar 		.  		1999.  	 
\bibitem[Anil et al. ()]{b4}\label{b4} 	 		‘Biometric Template Security’.  		 			K Anil 		,  		 			Karthik Jain 		,  		 			Abhishek Nandakumar 		,  		 			Nagar 		.  	 	 		\textit{EURASIP Journal on Advances in Signal Processing}  		2008. 2008. p. 17.  	 
\bibitem[Buhan et al. (2007)]{b10}\label{b10} 	 		‘Fuzzy Extractors for Continuous Distributions’.  		 			I R Buhan 		,  		 			J M Doumen 		,  		 			P H Hartel 		,  		 			R N J Veldhuis 		.  	 	 		\textit{Proceedings of ACM Symposium on Information, Computer and Communications Security},  				 (ACM Symposium on Information, Computer and Communications SecuritySingapore)  		March 2007. p. .  	 
\bibitem[Arakala et al. (2007)]{b11}\label{b11} 	 		‘Fuzzy Extractors for Minutiae-Based Fingerprint Authentication’.  		 			A Arakala 		,  		 			J Jeffers 		,  		 			K J Horadam 		.  	 	 		\textit{Proceedings of Second International Conference on Biometrics},  				 (Second International Conference on BiometricsSeoul, South Korea)  		August 2007. p. .  	 
\bibitem[Dodis et al. ()]{b12}\label{b12} 	 		‘Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data’.  		 			Y Dodis 		,  		 			R Ostrovsky 		,  		 			L Reyzin 		,  		 			A Smith 		.  	 	 		\textit{Cryptology ePrint Archive}  		February 2006. 2004.  	 	 (Technical Report) 	 (A preliminary version of this work appeared in EUROCRYPT) 
\bibitem[FVC2004 Fingerprint Database]{b17}\label{b17} 	 		 \url{http://bias.csr.unibo.it/fvc2004/}  		\textit{FVC2004 Fingerprint Database},  				 	 
\bibitem[Ratha et al. ()]{b8}\label{b8} 	 		‘Generating Cancelable Fingerprint Templates’.  		 			N K Ratha 		,  		 			S Chikkerur 		,  		 			J H Connell 		.  	 	 		\textit{IEEE Pattern Analysis and Machine Intelligence},  				2007. 29 p. .  	 
\bibitem[Ratha et al. ()]{b16}\label{b16} 	 		‘Generating Cancelable Fingerprint Templates’.  		 			N K Ratha 		,  		 			S Chikkerur 		,  		 			J H Connell 		,  		 			R Bolle 		.  	 	 		\textit{IEEE Transactions on Pattern Analysis and Machine Intelligence, Special Issue on Biometrics}  		2007. 29  (4)  p. .  	 
\bibitem[Anil et al. ()]{b0}\label{b0} 	 		\textit{Handbook of Biometrics},  		 			K Anil 		,  		 			Patrick Jain 		,  		 			Arun A Flynn 		,  		 			Ross 		.  		2007. Secaucus, NJ, USA: Springer-Verlag New York, Inc.  	 
\bibitem[Sanderson and Paliwal ()]{b2}\label{b2} 	 		\textit{Information Fusion and Person Verification Using Speech and Face Information},  		 			C Sanderson 		,  		 			K K Paliwal 		.  		 IDIAP-RR 02-33.  		2003.  	 
\bibitem[Madhavi Gudavalli et al. ()]{b1}\label{b1} 	 		 			Madhavi Gudavalli 		,  		 			. S Dr 		,  		 			Dr A Viswanadha Raju 		,  		 			Dr D Vinaya Babu 		,  		 			Kumar 		.  		 \xref{http://dx.doi.org/10.1109/ISBAST.2012.24}{10.1109/ISBAST.2012.24}.  		\textit{IEEE-International Symposium on Biometrics and Security Technologies (ISBAST'12)},  				 (Taipei, Taiwan)  		March 26-29, 2012. p. .  	 	 (MultiModal Biometrics-Sources, Architecture \& Fusion Techniques: An Overview) 
\bibitem[Nandakumar ()]{b3}\label{b3} 	 		 			Karthik Nandakumar 		.  		\textit{Multibiometric Systems: Fusion Strategies and Template Security},  				2008.  	 	 (Ph.D Thesis) 
\bibitem[Sutcu et al. (2007)]{b14}\label{b14} 	 		‘Protecting Biometric Templates with Sketch: Theory and Practice’.  		 			Y Sutcu 		,  		 			Q Li 		,  		 			N Memon 		.  	 	 		\textit{IEEE Transactions on Information Forensics and Security}  		September 2007. 2  (3)  p. .  	 
\bibitem[Li and Chang (2006)]{b13}\label{b13} 	 		‘Robust, Short and Sensitive Authentication Tags Using Secure Sketch’.  		 			Q Li 		,  		 			E C Chang 		.  	 	 		\textit{Proceedings of ACM Multimedia and Security Workshop},  				 (ACM Multimedia and Security WorkshopGeneva, Switzerland)  		September 2006. p. .  	 
\bibitem[Sutcu et al. (2007)]{b15}\label{b15} 	 		‘Secure Biometric Templates from Fingerprint-Face Features’.  		 			Y Sutcu 		,  		 			Q Li 		,  		 			N Memon 		.  	 	 		\textit{Proceedings of CVPR Workshop on Biometrics},  				 (CVPR Workshop on BiometricsMinneapolis, USA)  		June 2007.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
