Reach Us
+44-1522-440391

^{1}Research Scholar, Jain University, Bangalore, 560004, India

^{2}Professor, Jain University, Bangalore, 560004, India

- *Corresponding Author:
- Supriya VG

Jain University, India

**E-mail:**[email protected]

**Received date:** October 27, 2014; **Accepted date:** January 31, 2015; **Published date:** February 16, 2015

**Citation:** Supriya VG, Manjunatha R (2015) Chaotic Maps for Biometric Template Protection-A Proposal. J Biom Biostat 6:216. doi: 10.4172/2155-6180.1000216

**Copyright:** © 2015 Supriya VG, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited

**Visit for more related articles at** Journal of Biometrics & Biostatistics

Modern biometric technologies claim to provide alternative solution to traditional authentication processes. Even though there are various advantages of biometric process, it is vulnerable to attacks which can decline its security. Towards addressing these concerns and improving public confidence, Biometric Cryptosystems and Cancelable Biometrics represent emerging technologies. This paper presents a comprehensive survey of Biometric Cryptosystems and Cancelable Biometrics along with the open issues and challenges. A new approach is proposed to address these open issues and challenges based on Cancellable Biometrics using chaotic maps, which are known to posses desirable properties of pseudo randomness, high sensitivity to initial conditions and very large key space.

Biometrics; Biometric cryptosystems; Cancelable biometrics; Chaotic maps

Biometrics identify/verify an individual using his/her physiological or behavioral characteristics. Several physiological as well as behavioral biometric characteristics have been extracted such as fingerprints, iris, face, hand, voice, etc., by applying adequate sensors and distinctive features to form a biometric template in an enrollment process. During verification (authentication process) or identification (identification can be handled as a sequence of verifications and screenings) the system processes another biometric measurement which is compared against the stored template(s) yielding acceptance or rejection [1]. Nevertheless, a biometric is enduringly connected with a user and cannot be altered. Thus when a biometric identifier is compromised, it is lost everlastingly and probably for every application where that particular biometric is employed. Standard encryption algorithms do not support a comparison of biometric templates in encrypted domain and thus leave biometric templates exposed during every authentication attempt [2]. In Conventional Biometric Process there are chances of exposure to attacks, even though there are various advantages, which compromise its security [3-8]. Ratha et al. [9] analyzed these attacks and grouped them into eight classes. Biometric template protection schemes are commonly categorized as Biometric Cryptosystems referred as helper data-based schemes and Cancelable Biometrics referred as feature transformation which are designed to meet two major requirements of biometric information protection (ISO/IEC FCD 24745): [1].

• **Irreversibility**: It should be computationally hard to determine any information about the original biometric template from the stored reference data, while it should be easy to generate the protected biometric template.

• **Unlinkability**: The unique biometric data (renewability) can be used to generate different versions of protected biometric templates, while not allowing their cross-matching (diversity).

"Biometric Cryptosystems (BCSs) are designed to securely bind a digital key to a biometric or generate a digital key from a biometric" [6]. BCSs offer solutions to biometric-dependent key-release and biometric template protection [10]. It replaces the password-based key-release and brings about substantial security benefits. It is significantly more difficult to forge, copy, share and distribute biometrics compared to passwords [1]. BCSs are designed to output stable keys which are required to match a 100% at authentication. Original biometric templates are replaced by biometric-dependent public information which assists the key-release process.

"Cancelable Biometrics (CB) consists of intentional, systematically repeatable distortions of biometric signals based on transforms which provide a comparison of biometric templates in the transformed domain" [9]. Biometrics cannot be revoked when spoofed. Therefore, instead of storing the biometrics, transformed templates are stored. The inversion of such transformed biometric templates must not be feasible for potential imposters. In contrast to templates protected by standard encryption algorithms, transformed templates are never decrypted since the comparison of biometric templates is performed in transformed space which is the very essence of CB. The application of transforms provides irreversibility and unlinkability of biometric templates [6], which prevents the use of same captured template for other applications.

In this paper, systematic classification and in depth discussion of approaches to BCS and CB Systems are discussed in detail. The open issues and challenges concerned to BCS and CB Systems are listed and discussed. To address some of these issues and challenges, we proposed a new method for biometric template protection based on chaotic functions. The very high key sensitivity and large key space properties of chaotic stream ciphers are useful in addressing problems in BCS and CB Systems.

Chaos theory is a field of study in mathematics discovered by Edward Lorenz. Chaos theory studies the behavior of dynamical systems that are highly sensitive to initial conditions. Its response is popularly referred to as the butterfly effect. Chaos is a deterministic and random-like process. Because of its random-like behavior, sensitivity to initial conditions and parameter values and confusion & diffusion properties, chaotic cryptography has become an important branch of modern cryptography. Small differences in initial conditions yield extensively diverging outcomes for such dynamical systems, rendering long-term prediction impossible in general.

The properties of chaotic systems are:

• **Deterministic** i.e. they have some determining mathematical equations controlling their behavior.

• **Unpredictable** **and** **non**-**linear** i.e. they are highly sensitive to initial conditions. Even a very slight change in the starting point can lead to entirely different outcomes.

They appear to be random and disorderly but in actual they are not. Beneath the random behavior there is a sense of order and pattern. The highly unpredictable and random nature of chaotic output is the most attractive feature of deterministic chaotic system that makes it suitable to use in image transformation techniques.

Logistic Map is a one-dimensional chaotic map proposed by R.M.May. It represents an idealized conservation model for describing yearly variation in the population of an insect specie. The population at (n+1)th year is related to that at the (n)th year by the following mathematical equation:

X_{n+1} = r * x_{n} [1+ x_{n}] 0<x<1 (1)

Here x_{n} represents the chaotic sequence which lies between zero and one. When the system parameter r is varied over the interval [0,4] different scenarios of evolutionary behavior are established. The iterates are confined to [0,1]. Depending on the value of r equation (1) has got several properties. With r between 0 and 1, the population will eventually die, independent of the initial population x_{n}. When r is between 3 and 3.45 the value of x_{n} will oscillate between two values. With slightly bigger r values the value of x_{n} will oscillate between 4 values, then 8,16,32 etc. Like a period doubling cascade. When the value of r is 3.57 it will start exhibiting chaotic behavior.

The rest of this paper is organized as follows:

Section 2 and 3 categorizes BCS and CB systems. Concerning literature is reviewed in detail.

Section 4 presents security risks, privacy aspects, open issues and challenges.

Section 5 proposes a novel chaos based cancellable biometric template protection scheme.

Section 6 theoretical analyzes and discusses the performance of the proposed scheme to address the listed challenges.

Finally, conclusions are given in Section 7.

The majority of BCSs require the storage of biometric-dependent public information, which is applied to retrieve or generate keys, also referred to as helper data [2]. Helper data must not reveal significant information about original biometric templates, which assists in reconstructing keys. Biometric comparisons are performed indirectly by verifying key validities, where the output of an authentication process is either a key or a failure message. Based on how helper data are derived, BCSs are classified as key-binding and key-generation systems.

**Key-binding schemes**

In this scheme helper data are obtained by binding a chosen key to a biometric template. By applying an appropriate key retrieval algorithm, keys are obtained from the helper data at authentication [5].

In 1999 Juels and Wattenberg [11], techniques from the area of error correcting codes and cryptography are combined to achieve a new type of cryptographic primitive. This cryptographic primitive is referred to as Fuzzy Commitment Scheme.

Rathgeb and Uhl [12,13] provide a systematic approach to the construction of Iris-based Fuzzy Commitment Schemes. After analyzing the error distributions between the iris-codes of different iris recognition algorithms, Reed-Solomon and Hardamard codes are applied. In [14] the authors apply context-based reliable component selection in order to extract keys from iris-codes, which are then bound to Hadamard codewords. Different techniques to improve the performance of Iiris-based Fuzzy Commitment Schemes have been proposed in [15-17]. Nandakumar [18-20] applies a binary fixedlength minutiae representation, obtained by quantizing the Fourier phase spectrum of a minutia set in a fuzzy commitment scheme, where alignment is achieved through focal point of high curvature regions.

A method based on user adaptive error correction codes proposed by Maiorana et al. [21] adaptively selects the error correction information based on the intra-variability of a user's biometric data. Applying online signatures seems to be the first approach of using behavioral biometrics in a fuzzy commitment scheme. In [22] another fuzzy commitment scheme based on online signatures is presented.

The first practical and most apparent implementation of the fuzzy vault scheme proposed by Clancy et al. [23,24], locks minutiae points in a "fingerprint vault". A set of minutiae points, A, are mapped onto a polynom p and chaff points are randomly added to construct the vault. Reed-Solomon codes are applied to reconstruct the polynom p, out of which a 128-bit key is recreated during authentication. A pre-alignment of fingerprints is assumed where feature alignment represents a fundamental step in conventional fingerprint recognition systems. To overcome the assumption of pre-alignment, Nandakumar et al. [25] suggest to utilize high curvature points derived from the orientation field of a fingerprint as helper data to assist the process of alignment. In their fingerprint fuzzy vault, 128-bit keys are bound and retrieved. Moon et al. [26] suggest to use an adaptive degree of the polynomial. Nagar and Chaudhury [27] arrange encoded keys and biometric data of fingerprints in the same order in separate grids, which form the vault. Chaff values are inserted into these grids in appropriate range to hide information. Additionally, the authors propose another syndromebased key-generating scheme which they refer to as PinSketch. This scheme is based on polynomial interpolation like the fuzzy vault, but requires less storage space. Arakala [28,29] provides an implementation of the PinSketch scheme based on fingerprints. Kumar and Kumar [30,31] present a fuzzy vault based on palmprints by employing realvalued DCT coefficients of palmprint images binding and retrieving 307 bit keys.

**Key-generation schemes**

In this schemes helper data are derived only from the biometric template. Keys are directly generated from the helper data and a given biometric sample [2].

A technique applied to face biometrics called "BioHashing" was introduced by Teoh et al. [18,32,33]. Basically, the BioHashing approach operates as key-binding scheme, however, to generate biometric hashes secret user-specific tokens have to be presented at authentication. Prior to the key-binding step, secret tokens are blended with biometric data to derive a distorted biometric template, thus, BioHashing can be seen as an instance of "Biometric Salting".

Kong et al. [34] presented an implementation of Face Hashing and gave an explanation for the zero EER, reported in the first works on BioHashing. Zero EER were achieved due to the tokenized random numbers, which were assumed to be unique across subjects. Teoh et al. [35] address the so-called "stolen-token" issue evaluating a variant of BioHashing, known as Multistage Random Projection (MRP). By applying a multi-state discretization the feature element space is divided into 2N segments by adjusting the user-dependent standard deviation. By using this method, elements of the extracted feature vector can render multiple bits instead of 1 bit in the original BioHash. As a result, the extracted bit streams exhibit higher entropy and recognition performance is increased even if impostors are in possession of valid tokens. However, zero EERs were not achieved under the stolen-token scenario. Different improvements to the BioHashing algorithm have been suggested [36,37].

Nandakumar and Jain [38] proposed the best performing multibiometric cryptosystem in a fuzzy vault based on fingerprint and iris. It is confirmed that a combination of biometric modalities leads to increased accuracy and higher security. A FRR of 1.8% at a FAR of ~0.01% is obtained, while the corresponding FRR values of the iris and fingerprint fuzzy vaults are 12 and 21.2%, respectively. Numerous ideas of using a set of multiple biometric characteristics within BCSs have been proposed [39-44].

Nagar et al. [12,28] proposed a hybrid fingerprint-based BCS. Local minutiae descriptors, which comprise ridge orientations and frequency information, are bound to ordinate values of a fuzzy vault applying a fuzzy commitment scheme. In experiments FRR of 5% and a FAR of 0.01% is obtained, without minutiae descriptors the FAR increased to 0.7%. A similar scheme has been suggested in [45].

Chen et al. [46] extract keys from fingerprints and bind these to coefficients of n-variant linear equations. Any n (n<m) elements of an m-dimensional feature vector can retrieve a hidden key where the template consists of true data, the solution space of the equation, and chaff data (false solutions of the equation). A FRR of 7.2% and zero FAR are reported. Bui et al. [47] propose a key-binding scheme based on face applying quantization index modulation which is originally targeted for watermarking applications.

Cancelable biometric transforms are designed in a way that it should be computationally hard to recover the original biometric data. The intrinsic strength (individuality) of biometric characteristics should not be reduced applying transforms (constraint on FAR) while on the other hand transforms should be tolerant to intra-class variation (constraint on FRR) [9]. In addition, correlation of several transformed templates must not reveal any information about the original biometrics (unlinkability). Two main categories of CB are distinguished [2].

**Non-invertible transforms**

In this approach, biometric data is transformed by applying a noninvertible function. The advantage of applying non-invertible transforms is that potential impostors are not able to reconstruct the entire biometric data even if transforms are compromised. Whereas applying non-invertible transforms may cause loss of accuracy. Difficulty in aligning the transformed biometric templates to perform a comparison has caused reduced performance and in addition information is also reduced. These effects have been observed for various approaches [48-51].

**Invertible transforms or Biometric salting**

Biometric salting usually denotes transforms of biometric templates which are selected to be invertible. In any invertible transform of biometric feature, vector elements represents an approach to biometric salting even if biometric templates have been extracted in a way that it is not feasible to reconstruct the original biometric signal [52]. Finally, the parameters of the transform have to be kept secret. In case user-specific transforms are applied, the parameters of the transform, which can be seen as a secret seed [35] have to be presented at each authentication. If underlying biometric algorithms do not provide high accuracy with secret transforms, compromised transform parameters will enable Impostors to recover the original biometric template, causing a potential performance decrease of the system. While approaches to biometric salting may maintain the recognition performance of biometric systems, non-invertible transforms provide higher security [2].

In this technique, the authors first extract the most discriminative projections of the face template using fisher discriminant analysis [17] and then project the obtained vectors on a randomly selected set of orthogonal directions. This random projection defines the mechanism for the scheme called salting.

Ratha et al. [9] were the first to introduce the concept of CB applying noninvertible transforms. During enrollment, non-invertible transforms are applied to biometric inputs by selecting applicationdependent parameters. Whereas at the time of authentication, biometric inputs are transformed and a comparison of transformed templates is performed.

Boult et al. [53-59] proposed cryptographically secure biotokens which they applied to face and fingerprints. In order to enhance security in biometric systems, biotokens, which they refer to as Biotope, are adopted to existing recognition schemes.

Savvides et al. [52] generate cancelable face biometrics by applying so-called minimum average correlation filters which provide noninvertibility. User-specific secret personal identification numbers (PINs) serve as seed for a random basis for the filters. Ouda et al. [60,61] propose a technique to obtain cancelable iris-codes. i.e. Key dependent feature extract a vector of consistent bits (Bio Code) and their respective positions from several enrollment templates. Revocability is provided by encoding the BioCode according to a selected random seed. Pillai et al. [62] achieve cancelable iris templates by applying sector random projection to iris images. Recognition performance is only maintained if user-specific random matrices are applied.

Yang et al. [63] apply random projections to minutiae quadruples to obtain cancelable fingerprint templates. In further work [64] the authors address the stolen-token scenario by selecting random projection matrices based on biometric features. Hirata and Takahashi [65] propose CB for finger-vain patterns where images are transformed applying a Fourier-like transform. The result is then multiplied with a random filter where the client stores the inverse filter on some token. At authentication the inverse filter is applied to regenerate the transformed enrollment data and correlation-based comparison is performed. A similar scheme is applied to fingerprints in [66]. Bringer et al. [67] presented an idea of generating time-dependent CB to achieve untraceability among different identities across time. Several types of transforms for constructing multiple CB from pre-aligned fingerprints and face biometrics have been introduced in [9,54] including cartesian transform and functional transform. In further work [51], different techniques to create cancelable iris biometrics have been proposed. The authors suggest four different transforms applied in image and feature domain where only small performance drops are reported. Hammerle-Uhl et al. [53] applied classic transformations suggested in [9] to iris biometrics. Furthermore, in [55] it is shown that applying both transforms to rectangular iris images, prior to preprocessing, does not work. Similar to [51] Rathgeb and Uhl [56] suggest to apply row permutations to iris-codes. Maiorana et al. [57] apply non-invertible transforms to obtain cancelable templates from online signatures. In their approach, biometric templates, which represent a set of temporal sequences, are split into non-overlapping sequences of signature features according to a random vector which provides revocability. Subsequently, the transformed template is generated through linear convolution of sequences. The complexity of reconstructing the original data from the transformed template is computationally as hard as random guessing [68].

Most BCS provide reliable biometric authentication at an high security level by aiming at binding or generating keys, here keys should be long enough in a generic cryptographic system (e.g., 128-bit keys for AES). To prevent biometric keys from being guessed, it is necessary to exhibit sufficient size and entropy. BCS performance is mostly reported in terms of FRR and FAR, since both metrics and key entropy depend on the tolerance levels allowed at comparison, these three quantities are highly inter-related.

Buhan et al. [23,48] have shown direct relation between the maximum length k of cryptographic keys and the error rates of the biometric system as k ≤ - log2(FAR), which has established as one of the most common matrices used to estimate the entropy of biometric keys. Obviously, key lengths have to be maximized in order to minimize the guessing of secret keys [49].

The other factor which affects the security of biometric cryptosystems is privacy leakage, i.e., the information that the helper data contain about biometric data [50]. To avoid identity fraud, for a given key length biometric system should not leak any information. The requirements on key size and privacy leakage define a fundamental trade-off within approaches to BCS, which is hardly ever estimated. However, in order to be able to generate or convey large secret keys reliably, we have to send some data (helper data) to provide unlinkability.

While in majority of approaches, security is put on a level with obtained recognition accuracy, analysis with respect to irreversibility and unlinkability is not addressed. According to irreversibility, applied feature transformations have to be analyzed in detail.

In order to provide renewability of protected biometric templates, applied feature transformations are performed based on distinct parameters, i.e., employed parameters define a finite key space. In general, protected templates differ more as the respective transformation parameters are more distant [57]. To satisfy the property of unlinkability, different transformed templates, generated from a single biometric template applying different parameters, have to appear random to themselves.

With respect to the design goals, BCS and CB systems offer significant advantages to enhance the privacy and security of biometric systems, providing reliable biometric authentication at an high security level. Additionally, several new issues and challenges arise deploying these technologies [1,7] are listed below.

One fundamental challenge, regarding both technologies, represents the issue of alignment, which significantly effects recognition performance.

To satisfy the property of unlinkability, different transformed templates, generated from a single biometric template applying different parameters, have to appear random to themselves.

To prevent biometric keys from being guessed, these need to exhibit sufficient size and entropy.

In this paper, a novel chaos based cancellable biometric template protection scheme using Chaotic Signals is proposed to address the above challenges. The chaotic maps give excellent pseudorandom sequences [64] and very simple operations as compared to conventional transformation algorithm like AES [69] which involves large number of operations and consumes more time for transformation.

In this section, a novel chaos based cancellable biometric template protection scheme using Chaotic functions is proposed to address the above challenges. The chaotic functions give excellent pseudorandom sequences [64]. Conventional transformation algorithm like AES [69] involves large number of operations which will consume more time for transformation. Chaotic functions are deterministic and sensitive to the initial values. According to this feature, it has complex active action, which can be used to protect data content. For example, the random sequence produced by chaotic phenomenon can be used to encrypt data in secret communication. This property makes the initial value suitable for the key that controls the data encryption or decryption.

The model described in **Figure 1** captures user biometric characteristics by capturing device and processes as template during enrollment. The sample is then transformed using chaotic key streams derived from chaotic function and suitable cryptographic algorithm into a transformed biometric template. The transformed biometric template will provide a normalized, efficient and highly discriminating representation of the feature, which can then be compared with query template.

During verification, query biometric image is captured, processed as template and then transformed using same chaotic key streams derived during enrollment process and cryptographic algorithm. The transformed query template is matched with transformed template stored during enrollment in order to determine identity.

Suitability of Ccbt System as Biometric Template Protection Scheme to Address the Challenges

Chaotic functions are known to posses desirable properties to address the issues and challenges of CB and BC systems discussed in section 4.

A chaotic system is a non-linear deterministic system so sensitive to initial conditions that it appears random.

**Deterministic, means that they have some determining mathematical equations controlling their behavior**

To explain this property, let us consider one of the chaotic map equation, the logistic map as an reference which is represented in equation 2.

X_{n+1}=r * x_{n}[1+x_{n}] (2)

Where x_{0} (n=0) is the initial value, r is the bifurcation parameter and depending on the value of r, x_{0} the dynamics of the generated chaotic sequence can change dramatically. The [1-x_{n}] term serves to inhibit growth because as x approaches 1, [1-x_{n}] approaches 0. Plot of x_{n}+1 verses x_{n} with r = 3 is as shown in **Figure 2**, we can see that we have a non linear relation.

The complete behaviour of the model can be seen by iterating equation 2.

Suppose r = 3, and x_{1} = 0.1, Then we get

X_{2} = r * x_{1}[1-x_{1}] = 3 * (.1) * (.9) = 0.27

X_{3} = r * x_{2}[1-x_{2}] = 3 * (.27) * (.73) = 0.591

X_{4} = r * x_{3}[1-x_{3}] = 3 * (.591) * (.409) = 0.725

From the plot in **Figures 3 and 4**, it turns out that the logistic map is a very different function, depending on its control parameter r. To analyze this, it is examined for the time series produced at different values of r, starting near 0 and ending at r=4. Along the way it can be seen very different results, revealing and introducing major features of a chaotic system.

The **Figure 5** shows the bifurcation diagram of the logistic map, r along the x-axis. A bifurcation diagram is a visual summary of the succession of period-doubling produced as r increases. For each value of r the system is first allowed to settle down and then the successive values of x are plotted for a few hundred iterations.It can be observed from bifurcation diagram that for r less than one, all the points are plotted at zero. Zero is the one point attractor for r less than one. For r between 1 and 3, we still have one-point attractors, but the 'attracted' value of x increases as r increases, at least to r=3. Bifurcations occur at r=3, r=3.45, 3.54, 3.564, 3.569 (approximately), etc., until just beyond 3.57, where the system is chaotic. It can be observed, between 3.57 and 4 there is a rich interleaving of chaos and order. From this theoreticalanalysis it shows that, a small change in r can make a stable system chaotic, and vice versa.

In the proposed scheme, the bifurcation property of chaotic function for bifurcation factor r between 3 and 3.5 can be used to generate random, unpredictable key streams for biometric template transformation which addresses the challenge of preventing guessing of biometric keys.

**Unpredictable and non-linear, means they are highly sensitive to initial conditions. Even a very slight change in the initial value can lead to entirely different outcomes**

Another important feature emerges in the chaotic region. To observe it, we compared the time series for x1=0.3 (in black) with that for x1=.3000001 (in blue) in **Figures 6 and 7** provides scatter plots for the two series before and after 24 iterations which shows that correlation after 24 iterations (right side), is essentially zero.

**Figures 6 and 7** illustrates that, a chaotic system, even one determined by a simple rule, is in principle unpredictable. It is unpredictable, "in principle" because in order to predict its behavior into the future we must know its current value precisely. It is explained here with an example where a slight difference, in the sixth decimal place of initial value, resulted in prediction failure after 24 iterations. And six decimal places far exceeds the kind of measuring accuracy we typically achieve with natural biological systems.

This very high sensitivity to initial condition property of chaotic maps can be used in the proposed scheme to generate different transformed templates from same biometric data by very slight change in initial condition to generate key stream, so that different applications with different transformed templates appear random to themselves which addresses the challenge of unlinkability.

**Very large key space and high entropy addresses the revocability of transformed templates**

In the proposed method, considering most commonly used 16 bit PC platform as an example and key streams={k1, k2, k3} three different keys, with each key consisting of key=(x0, r0) (x0=initial value and r0=bifurcation factor), the expected key space size is (10^{16})^{6}≈2^{319}, which is larger than the acknowledged most secured AES algorithm. With this key space, it is possible to generate very large number of keys which addresses the challenge of revocability. Also in the proposed scheme the expected entropy of transformed biometric template stored using chaotic maps is about 0.9991 [67-76], which is close to the theoretical value (=1). This property provides privacy and security by providing it impossible to guess the keys.

In this paper, chaotic maps are proposed to generate renewable and privacy preserving transformed biometric templates. The theoretical analysis shows that, very high key sensitivity and large key space properties of chaotic maps can be used to efficiently address the challenges in BCS and CB Systems. The proposed scheme can provide high-confidence cancelable biometric verification performance with very large renewability and Irreversibility properties .

- RathgebUhi (2011) A survey on biometric cryposystemsand cancellable biometrics. EURASIPJournal on Information Security 2011:3.
- Jain AK, Ross A, Prabhakar S(2004) An introduction tobiometric recognition. IEEE Trans CircSystVideoTechnol 14:4-20.
- JainAK, Nandakumar K, Nagar A(2008) Biometric template security. EURASIP J AdvSignalProcess.
- Luo Y,Cheung SS,Ye S(2009) Anonymous biometric access control based onhomomorphic encryption. ICME'09: Proc ofthe 2009 IEEE IntConf on Multimedia and Expo.
- Uludag U, Pankanti S, Prabhakar S, Jain AK (2004)Biometric cryptosystems: issues and challenges.Proc IEEE 92:948-960.
- Cavoukian A, Stoianov A (2009) Biometric encryption.Encyclopedia of Biometrics.
- Cavoukian A, Stoianov A (2009) Biometric encryption: the newbreed of untraceable biometrics. Biometrics: Fundamentals, Theory, and Systems.
- Jain AK, Ross A, Uludag U (2005) Biometric templatesecurity: Challenges and solutions. Proc of European Signal Processing Conf(EUSIPCO).
- Ratha NK, Connell JH, Bolle RM (2011) Enhancingsecurity and privacy in biometrics-based authentication systems. IBM Syst J40:614-634.
- Verbitskiy EA, Tuyls P, Obi C, Schoenmakers B, SkoricB (2010) Key extraction from general nondiscrete signals. IEEE Trans InfForensic Secur 5:269-279.
- Juels A, Wattenberg M(2013) A fuzzy commitment scheme.6th ACM Conf on Computer and Communications Security 28-36.
- Nagar A, Nandakumar K, Jain A (2010) A hybridbiometric cryptosystem for securing fingerprint minutiae templates. PatternRecognLett 31:733-741.
- Rathgeb C, Uhl A(2009) Systematic construction ofiris-based fuzzy commitment schemes.Advances in Biometrics 5558:940-949.
- Rathgeb C, Uhl A (2009) Context-based texture analysisfor secure revocable iris-biometric key generation. Proc of the 3rd IntConf onImaging for Crime Detection and Prevention, ICDP '09,London.
- Zhang L, Sun Z, Tan T, Hu S(2009)Robust biometric keyextraction based on iris cryptosystem. Proc of the 3rd IntConf on Biometrics5558:1060-1070.
- Ignatenko T, Willems F(2009) Achieving secure fuzzycommitment scheme for optical pufs. IntConf on Intelligent Information Hidingand Multimedia Signal Processing 1185-1188.
- Rathgeb C, UhlA (2010) Adaptive fuzzy commitmentscheme based on iris-code error analysis. Proc of the 2nd European Workshop onVisual Information Processing (EUVIP'10) Paris.
- Goh A, Ngo DCL (2003) Computation of cryptographickeys from face biometrics. Communications and Multimedia Security 2828:1-13.
- Ao M, Li SZ (2009)Near infrared face based biometrickey binding. Proc of the 3rd IntConf on Biometrics 5558:376-385.
- Nandakumar K (2010)A fingerprint cryptosystem based onminutiae phase spectrum. Proc of IEEE Workshop on Information Forensics and Security,SeattleWA.
- Lu H, Martin K, Bui F, Plataniotis K, Hatzinakos D(2009) Face recognition with biometric encryption for privacy-enhancing selfexclusion. Proc of the 16th IntConf on Digital Signal Processing,Santorini-Hellas.
- Maiorana E, Campisi P, Neri A (2008) User adaptivefuzzy commitment for signature templates protection and renewability. SPIE JElec Imaging Spec Sect Biomet AdvSecur Usability Interoper 17:1-12.
- Buhan IR, Doumen JM, Hartel PH, Veldhuis RNJConstructing practical fuzzy extractors using QIM, Centre for Telematics and InformationTechnology, University of Twente, Enschede, Technical Report TR-CTIT-07-52
- Clancy TC, Kiyavash N, Lin D (2003)Securesmartcard-based fingerprint authentication. Proc ACM SIGMM Multimedia,Biometrics Methods and Applications Workshop.
- Nandakumar K, Jain AK, PankantiS(2007)Fingerprint-based fuzzy vault: implementation and performance. IEEE Trans InfForensicSecur 2:744-757.
- Moon D, Choi WY, Moon K, Chung Y(2009) Fuzzyfingerprint vault using multiple polynomials. IEEE 13th Int Symposium on ConsumerElectronics, ISCE 9: 290-293.
- Nagar A,Chaudhury S (2006) Biometrics based AsymmetricCryptosystem Design Using Modified Fuzzy Vault Scheme. 18th IntConf on PatternRecognition (ICPR'06) ICPR 4:537-540.
- Nagar A, Nandakumar K, Jain AK(2008) Securingfingerprint template: Fuzzy vault with minutiae descriptors. IntConf on PatternRecognition (ICPR'08) Tampa, FL.
- Arakala A(2009) Secure and private fingerprint-basedauthentication. Bull Aust Math Soc 80: 347-349.
- Kumar A, KumarA(2008) A palmprint based cryptosystem using double encryption. Proc SPIE ConfBiometric Technology for human identification,India.
- Kumar A, Kumar A(2009)Development of a newcryptographic construct using palmprint-based fuzzy vault. EURASIP J Adv SignalProcess.
- Goh A, Teoh ABJ, Ngo DCL(2006) Random multispacequantization as an analytic mechanism for biohashing of biometric and randomidentity inputs. IEEE Trans Pattern Anal MachIntell 28:1892-1901
- Kong A, Cheunga KH, Zhanga D, Kamelb M, Youa J(2006)An analysis of BioHashing and its variants. Pattern Recogn 39:1359-1368.
- Teoh ABJ, Kuan YW, Lee S (2008) Cancellable biometricsand annotations on biohash. Pattern Recogn 41:2034-2044.
- Lumini A, Nanni L (2007)An improved biohashing forhuman authentication. Pattern Recogn 40: 1057-1065.
- Nanni L, Lumini A (2008) Random subspace for animproved biohashing for face authentication. Pattern RecognLett 29:295-300.
- Nandakumar K, Jain AK(2008)Multibiometric templatesecurity using fuzzy vault. IEEE 2nd IntConf on Biometrics: Theory,Applications, and Systems, BTAS.
- Voderhobli K,Pattinson C, Donelan H(2006) A schema for cryptographic key generation usinghybrid biometrics. 7th annual postgraduate symp.: The convergence oftelecommunications, networking and broadcasting, Liverpool.
- Kanade S, Petrovska-Delacretaz D, Dorizzi B (2009)Multi-biometrics based cryptographic key regeneration scheme. IEEE 3rd IntConfon Biometrics: Theory, Applications, and Systems, BTAS '09.
- Kanade S, Camara D, Petrovska-Delacrtaz D, Dorizzi(2009)Application of biometrics to obtain high entropy cryptographic keys.Proceedings of World Academy on Science, Engineering, and Technology, Hong Kong.
- Meenakshi VS, Padmavathi G (2009) Security analysis ofpassword hardened multimodal biometric fuzzy vault. Proceedings of WorldAcademy of Science, Engineering and Technology,India.
- Jagadeesan A, Thillaikkaras T, Duraiswamy K (2010)Cryptographic key generation from multiple biometric modalities: Fusingminutiae with iris feature. Int J ComputAppl 2:16-26.
- Zhang M, Yang B,Zhang W, Takagi T(2011)Multibiometricbased secure encryption and authentication scheme with fuzzy extractor. Int JNetwSecur 12:50-57.
- Chafia F, Salim C, Farid B (2010)A biometriccrypto-system for authentication. Proc of IntConf on Machine and Web Intelligence,Algiers.
- Chen H, Sun H, Lam KY(2007) Key managementusing biometrics. Int Symposium on Data, Privacy, and E-Commerce 1:321-326.
- BuiFm, Martin K, Lu H, Plataniotis KN, HatzinakosD(2010) Fuzzy key binding strategies based on quantization index modulation(QIM) for biometric encryption (BE) applications. Trans InfForensic Secur 5:118-132.
- BuhanIR, Doumen JM, Hartel PH, Veldhuis RNJ (2007) Fuzzy extractors for continuousdistributions. University ofTwente, Technical Report.
- Kelkboom EJC, Breebaart J, Buhan I, Veldhuis (2010)RNJ Analytical template protection performance and maximum key size given aGaussian modeled biometric source. Proc of SPIE defense, Bellingham.
- Ignatenko T, Willems FMJ(2010) Information leakage infuzzy commitment schemes. Trans Inf Forensic Secur 5:337-348.
- Zuo J, Ratha NK, Connel JH(2008) Cancelable irisbiometric. Proc of the 19th IntConf on Pattern Recognition,Tampa,FL.
- Savvides M, Kumar B, Khosla P(2004) Cancelablebiometric filters for face recognition. ICPR '04: Proc of the PatternRecognition, 17th IntConf on 3:922-925.
- Hämmerle-Uhlr J,Pschernig E, Uhl A (2009) Cancelable iris biometrics using blockre-mapping and image warping. Poc of the Information Security Conf 2009(ISC'09) LNCS 5735: 135-142.
- Ratha NK, Connell JH, Chikkerur S (2007) Generatingcancelable fingerprint templates. IEEE Trans Pattern Anal Mach Intell 29:561-572.
- Färberböck P, Hämmerle-Uhl J, Kaaser D, Pschernig E, UhlA (2010) Transforming rectangular and polar iris images to enable cancelablebiometrics. Proc of the IntConf on Image Analysis and Recognition (ICIAR'10)6112:276-386.
- RathgebC, Uhl S(2010)Secure iris recognition based on local intensity variations. Procof the IntConf on Image Analysis and Recognition (ICIAR'10) 6112:266-275.
- Maiorana E, Campisi P, Fierrez J, Ortega-Garcia J, NeriA (2010)Cancelable templates for sequence-based biometrics with application toon-line signature recognition. Trans Syst Man CybernetA Syst Hum 40:525-538.
- Boult T(2006)Robust distance measures forface-recognition supporting revocable biometric tokens. FGR '06: Proc of the7th IntConf on Automatic Face and Gesture Recognition, Southampton.
- Boult T, Scheirer W (2008) Bio-cryptographic protocolswith bipartite biotokens. Proc of the IEEE Biometric Symposium, BSYM '08,Tampa,FL.
- Ouda O, Tsumura N, Nakaguchi T(2010)Bioencoding: areliable tokenless cancelable biometrics scheme for protecting iris codes.IEICE Trans InfSyst E93.D.
- Ouda O, Tsumura N, NakaguchiT(2010)Tokenlesscancelable biometrics scheme for protecting iris codes. Proc of the 20th Int.Conf. on Pattern Recognition (ICPR'10) Istanbul.
- Pillai JK, Patel VM, Chellappa R, Ratha NK (2010)Sectored random projections for cancelable iris biometrics. Proc of the IEEEInt Conf. on Acoustics Speech and Signal Processing (ICASSP) Dallas, TX.
- Yang B, Busch C, Gafurov D, Bours P(2010) Renewableminutiae templates with tunable size and security. Proc of the 20th IntConf onPattern Recognition (ICPR'10) Istanbul.
- Yang B, Hartung D, Simoens K, Busch C (2010) Dynamicrandom projection for biometric template protection. Proc of the 4th IEEEIntConf on Biometrics: Theory, applications and systems (BTAS'10) Washington,DC.
- Hirata S, Takahashi K(2009) Cancellable biometricswith perfect secrecy for correlation-based matching. Proc of the 3rd IntConf onBiometrics.
- Takahashi K, Hirata S(2009) Generating provably securecancelable fingerprint templates based on correlation-invariant randomfiltering. IEEE 3rd IntConf on Biometrics: Theory, Applications, and Systems,BTAS '09 Washington, DC.
- Bringer J, Chabanne H, Kindarji B(2009) Anonymousidentification with cancelable biometrics. Proc of the 6th Int Symposium onImage and Signal Processing and Analysis, ISPA '09 Salzburg.
- Kelkboom EJC, Molina GG, Breebaart J, Veldhuis RNJ, etal. Binary biometrics: an analytic 22 framework to estimate the performancecurves under Gaussian assumption. Trans Syst Man
- . Juels A, Sudan M (2002) A Fuzzy Vault Scheme. In IEEE International Symposium InformationTheory.
- Jiancheng Zou, ChangZhen Xiong, Dongxu Qi, Rabab K.Ward (2005)The Application of Chaotic Maps in Image Transformation.Proc.IEEE 2005.
- Chong C Fu,Zhiliang Zhu(2008) A Chaotic Imagetransformation scheme based on circular bit space shift method. The 9thInternational Conference for Young Computer Scientists.IEEE Computer Society Hunan.
- SupriyaVG, Malini M Patil, DileepDharmappa(2010) Chaos Based Biometric Template ProtectionScheme,2010 3rd International Conference on Machine Vision,IEE.
- Jain A, Uludag U (2003) Hiding biometric data.IEEETrans. Pattern Anal. Mach. Intell 25:1494-1498.
- Monoth T,Babu AP (2007) Recursive Visual CryptographyUsing Random Basis Column Pixel Expansion,.in Proceedings of IEEEInternationalConference on Information Technology, Orissa.
- Reena Mary George (2013) Facial Template ProtectionUsing Extended Visual Cryptography and Chaotic Encryption.International journalof technology enhancements and emerging engineering research 1:4.
- . Ameer A. Mohammed Baqer,Suhas H. Patil (2013)Efficient Iris Biometrics Technique for Secure Distributed Systems, IJCSNSInternational Journal of Computer Science and Network Security
- Maithili Arjunwadkar, Kulkarni RV(2010) InternationalJournal of Computer Applications (0975 – 8887)3:6.

Select your language of interest to view the total content in your interested language

- Adomian Decomposition Method
- Algebra
- Algebraic Geometry
- Algorithm
- Analytical Geometry
- Applied Mathematics
- Artificial Intelligence Studies
- Axioms
- Balance Law
- Behaviometrics
- Big Data Analytics
- Big data
- Binary and Non-normal Continuous Data
- Binomial Regression
- Bioinformatics Modeling
- Biometrics
- Biostatistics methods
- Biostatistics: Current Trends
- Clinical Trail
- Cloud Computation
- Combinatorics
- Complex Analysis
- Computational Model
- Computational Sciences
- Computer Science
- Computer-aided design (CAD)
- Convection Diffusion Equations
- Cross-Covariance and Cross-Correlation
- Data Mining Current Research
- Deformations Theory
- Differential Equations
- Differential Transform Method
- Findings on Machine Learning
- Fourier Analysis
- Fuzzy Boundary Value
- Fuzzy Environments
- Fuzzy Quasi-Metric Space
- Genetic Linkage
- Geometry
- Hamilton Mechanics
- Harmonic Analysis
- Homological Algebra
- Homotopical Algebra
- Hypothesis Testing
- Integrated Analysis
- Integration
- Large-scale Survey Data
- Latin Squares
- Lie Algebra
- Lie Superalgebra
- Lie Theory
- Lie Triple Systems
- Loop Algebra
- Mathematical Modeling
- Matrix
- Microarray Studies
- Mixed Initial-boundary Value
- Molecular Modelling
- Multivariate-Normal Model
- Neural Network
- Noether's theorem
- Non rigid Image Registration
- Nonlinear Differential Equations
- Number Theory
- Numerical Solutions
- Operad Theory
- Physical Mathematics
- Quantum Group
- Quantum Mechanics
- Quantum electrodynamics
- Quasi-Group
- Quasilinear Hyperbolic Systems
- Regressions
- Relativity
- Representation theory
- Riemannian Geometry
- Robotics Research
- Robust Method
- Semi Analytical-Solution
- Sensitivity Analysis
- Smooth Complexities
- Soft Computing
- Soft biometrics
- Spatial Gaussian Markov Random Fields
- Statistical Methods
- Studies on Computational Biology
- Super Algebras
- Symmetric Spaces
- Systems Biology
- Theoretical Physics
- Theory of Mathematical Modeling
- Three Dimensional Steady State
- Topologies
- Topology
- mirror symmetry
- vector bundle

- Total views:
**12521** - [From(publication date):

April-2015 - Nov 12, 2019] - Breakdown by view type
- HTML page views :
**8685** - PDF downloads :
**3836**

**Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals**

International Conferences 2019-20