Crytosystem for Computer security using Iris patterns and Hetro correlators

Transcription

1 Crytosystem for Computer security usig Iris patters ad Hetro correlators R. Bremaath Iformatio Systems ad Techology Departmet, Sur Uiversity College, Sur, Oma. Ahmad Sharieh Iformatio Systems & Techology Departmet, Sur Uiversity College, Sur, Oma. Abstract Biometric based cryptography system provides a efficiet ad secure data trasmissio as compare to the traditioal ecryptio system. However, it is a computatioally challege task to solve the issues to icorporate biometric ad cryptography. I coectio with our previous works, this paper reveals a robust cryptosystem usig iris biometric patter as a crypto-key to resolve the issues i the ecryptio. A error correctio egie based o hetro-correlators has bee used to evoke the partially tarished data fashioed by the decryptio process. This process determies the o-repudiatio ad key maagemet problems. The experimetal results show that the suggestio algorithm ca implemet i the real-life cryptosystem. Keywords-Auto-correlators; Biometric; crytosystem; Hetrocorrelators. I. INTRODUCTION Cryptography provides a secure proliferatio of iformatio exchage across the isecure data commuicatio [1]. It autheticates messages based o the mathematical key but ot based o the real-life user those who are the geuie ower. Traditioal cryptosystem requires a legthy key to ecrypt ad decrypt i sedig ad receivig the messages, respectively. But these keys ca be guessed or cracked. Moreover, maitaiig ad sharig legthy, radom keys i ecipherig ad decipherig process is the critical problem i the cryptography system. A ew approach is described for geeratig a crypto key, which is acquired from iris patters. I the biometric field, template created by the biometric algorithm ca oly be autheticated with the same perso. Amog the biometric templates, iris features ca efficietly be distiguished with idividuals ad produces less false positives i a large populatio. This type of iris code distributio provides merely less itra-class variability that aids the cryptosystem to cofidetly decrypt messages with a exact matchig of iris patter. I traditioal cryptography system, key maagemet is a cumbersome process that is, key must be geerated each time with a extesive computatioal process ad the dissemiatio of keys is also a very difficult process at the o-secure chaels [1]. It cosumes lot of system time ad produces overburde to the applicatio domais. I additio, o-repudiatio caot easily be hadled i the traditioal cryptosystem. The Biometric key cryptography (BKC) is a emergig reliable alterative that ca be used to resolve key maagemet, large key computatioal process ad address the orepudiatio problems [2]. I the cryptography system, data will be secured usig a symmetric cipher system ad i public-key system digital sigatures are used for secure key exchage betwee users. However, i both systems the dimesio of security accuracy is depedet o the cryptography strog keys. They are required to remember ad eter the large key wheever eeded. Istead of rememberig large keys, the user may opt to give password to ecrypt ad decrypt the cryptography keys. There is o direct tie up betwee user ad password that is, the system ruig the cryptography algorithm is uable to differetiate the geuie user ad impostors who are uauthorized to work with the system. Thus, a reliable alterative to the password security is the biometric guard for the cryptography keys. Wheever user wishes to access through a secured key, biometric sample is captured, autheticated by the classifiers ad the key is released to ecipher / decipher the desired data. I geeral biometric cryptosystem has bee classified by three categories. The first method is to release the cryptography key from secure area i accordace with biometric matchig algorithm. It requires the secured commuicatio lie to avoid eavesdropper s attacks. Furthermore, if the user may store the biometric templates or crypto keys i workstatio machies the the system becomes a isecure oe. I the ext method, the crypto key is embedded as a part of biometric template i a specific locatio. However, if impostors may determie the locatio of the keys, agai it becomes catastrophic to the system. The third method is based o usig biometric features as cryptography keys, which gives more secure maer of proliferatio of iformatio exchage. The proposed approach is broadly classified ito three phases. The first phase is related with compact way to obtai iris feature codes from the huma irises. The secod oe describes the algorithm to ecrypt ad decrypt the messages usig iris bits. I the third phase, the error correctio egie is employed to recall the partially corrupted bits geerated i the decryptio usig associative memories. The issue of biometric patter is the partially varied features produced i the feature extractio process, which subsequetly makes partially corrupted data i the decryptio process. This dissimilarity may occur due to eviromets, illumiatios, distace variatio ad other artifacts. However more stable patter produced by the iris is secured i the perso s lifetime ad produces limited 1 P a g e

2 umber of bits variatios i the features, which assists to decrypt the messages i massive maer. I additio, reerolmet of iris keys is required to preserve the system security more cosistetly. I the curret literature several studies were proposed related with biometric cryptosystem but most of them dealt with figerprits ad few of them were cocered with iris features. Albert Bodo proposed a method of directly usig biometric as cryptography key i the patet of Germa [1]. I (Davida et al. [2][3]), 2048-bit iris code was used for ecipherig ad decipherig process. Key geeratio is ivoked based o the error bits of the iris codes. This system stored the error correctio bits alog with iris keys iside the database. Thus, impostors may eavesdrop key iformatio ad a cout of error correctio bits from the local database. I (Liartz et al. [4], Clacy et al. [5], Morose et al. [6]), the key geeratio was based o biometrics such as figerprits [18] ad voices, but they required more calculatios to release the key tha the traditioal cryptography system. The problem of geeratig cryptograph key from face biometric features had bee studied by Yao-Je Chag et al. [7]. The survey of multibiometric cryptosystems was discussed by Uludag et al. [8]. A method of iris compressio for cryptography documetatio o off-lie verificatio was proposed by Daiel et al. [9]. I this study, a modified Fourier-Melli trasformatio was employed to create iris template for represetig EyeCert system, which cosists of two compoets. The first oe is details of persoal data related with the subjects, ad the secod oe is the iris feature ecoded i the form of barcodes. I aother study of iris biometric cryptosystem, Feg Hao et al. [10] proposed a method based o error-free iris key that was devised usig a two-layer error correctio techique icorporated with Hadamard ad Reed-Solomo codes. The extracted code was saved i a tamper-resistat toke such as a smart card. I our previous work, (Bremaath et al. [11]) proposed autocorrelator to recoup the corrupted bio-metric crypto key. I this paper, a robust hetro-correlator has bee proposed to regai the data. The block diagram of the proposed iris cryptosystem is illustrated i Fig. 1. It suggests a compact way to extract feature from the iris patters ad these features are treated as crypto key for the o-lie cryptography system. This system outperforms other traditioal approaches ad provides a efficiet solutio for o-repudiatio approach as well. It employs 135-bit iris code which is extracted by wavelet aalysis[12][13][14] ad applyig these codes i ecipherig ad decipherig of the iput stream of biary data which might be origiatig from voice, text, video, image or other sources. Next, the auto-correlators ad hetero-correlators are used to recall origial bits from the partially corrupted data produced i the decryptio process. It iteds to resolve the repudiatio ad key maagemet problems. However, the performace of error correctio model depedets o the correlators used i the system. Hece the guaratee issues of these methods were verified ad the experimetal results were aalyzed i both symmetric iris cryptosystem (SIC) ad o-repudiatio iris cryptosystem (NRIC). It shows that this ew approach provides cosiderably high autheticatio i ecipherig ad decipherig processes. The remaider of the paper has bee orgaized as follows. Sectio II describes the symmetric iris cryptosystem. No-repudiatio cryptosystem is described i Sectio III. Error correctio egies ad their fuctioalities are give i Sectio IV. Sectio V describes the experimetal results of the bio-metric cryptosystem ad cocludig remarks are give i Sectio VI. Figure 1. A proposed block diagram of the iris cryptography system. II. SYMMETRIC IRIS CRYPTOSYSTEM Iris patters are used for fabricatig a key to ecipher ad decipher the plai text i betwee seder ad receiver over isecure chaels [2][11]. The advatages of iris cryptosystem are to reduce the system processig time to make a complex key for stadard cryptography algorithm ad to geerate cipher keys without gettig back from complex key geeratio sequeces. The idetical iris code is used i both eds to ecrypt ad decrypt the message i the SIC system. I order to decrypt a message, the recipiet eeds a idetical copy of the iris code. Figure 2 shows the iris based symmetric cryptography system. The trasmissio of erolled iris code over the chael is vulerable to eavesdroppig. Hece, the copy of the erolled iris code is eeded i the recipiet side, which is beig used by the decryptio process. I this approach, XOR operatio is used to ecrypt ad decrypt the message. The sigificat steps of SIC ecryptio algorithm is described as follows: Step 1: Let K be the key sequece I1,I2,..., I p produced by iris feature ecodig algorithm for the ecryptio trasformatio. I the experimet 136-bit key sequece (135-bit iris code ad oe paddig bit) is used i the ecryptio process. Step 2: Let S be a source alphabet of N symbols S 1,S 2,...,S N. Each alphabet i S is coverted to its equivalet 8-bit biary strigs. The bits of messages udergo XORig with iris key sequece ad geerate a o-breakable cipher-bit described as Ci Ecy( S1,S2,...,SN I1,I2,...,I p ) (1) 2 P a g e

3 where Ci is set of cipher bits. The decryptio algorithm is described as follows: Step 1: The testig iris patter is extracted ad iris codes are formed. The iris-matchig algorithm verifies the test ad the erol iris codes. If weighted distace (WD) is 0 WD 0.19, the the matched erolled iris code is used for decipherig the messages, otherwise rejected. Step 2: Let I1,I 2,...,I p K be a erolled iris code ad C 1, C2,..., C is a set of cipher text produced by the ecryptio process. Erolled iris codes are XORed with set of cipher bits ad geerate the origial messages usig Equatio (2). Ecryptio Bit Stream + Ecrypted Bit Sequeces Iris Ecodig Iris key 136-bit Reject Decryptio No Iris Matchig algorithm Is geuie Iris Key 136-bit Figure 2. The process of SIC system. + Yes Iris code (O-lie) Origial Bit stream Si Decy( C1,C2,...,C I1,I2,...,I p ) (2) where Si is set of source alphabet bits ad I = 1,2, 3, N. I the SIC system, key dissemiatio problem is completely avoided. However, the system eeds iris database ad irismatchig algorithm i the decryptio process to get back the origial messages. I order to resolve repudiatio problem, the iris database ad iris-matchig algorithm are elimiated from the SIC system. The detailed descriptio of this process is discussed i the ext sectio. III. NON-REPUDIATION IRIS CRYPTOSYSTEM Ulike SIC system, the NRIC system bypasses the irismatchig process ad do ot access iris database i the decryptio process. The testig iris code ca directly be XORed with cipher bits trasmitted by the ecryptio process as illustrated i Fig. 3. Iris codes are chaged from sessio to sessio with miimum variatio (WD<=0.19) for the same subject eye. Hece the decryptio process may produce the probability of partially corrupted cipher bits ragig from 0 to Perhaps, if itruder may tap the cipher bits at the osecure chaels the the probability of decryptig the message is complicated from 0.2 to 1 partially corrupted bit i every 135-bit iris code. Thus, it produces more complexity to the itruder to get back the origial messages. But the cipher bits accessed by the geuie subjects have probability of error rate at most 0.19, so that, less complexity have bee created i the decryptio process. Ecryptio Bit Stream + Ecrypted Bit Sequeces Iris Ecodig Iris key 136-bit Origial Bit stream Decryptio Iris Ecodig (Olie) Iris Key 136-bit Partially corrupted bit sequeces Error bits correctio usig auto/hetero correlators Figure 3. A sequece sketch of No-repudiatio cryptosystem. I this method cipher bits are directly XORed with the test iris key ad produce the partially corrupted bits. These are very close to the origial message if the test iris key is actually extracted from the geuie subject; otherwise the partially corrupted bits are larger tha the threshold maitaied i the system. Thus impostors ca be restricted to access the origial scripts. The error bit correctio module subsequetly corrects these bits by usig the two differet correctio egies such as either auto-correlators or hetero-correlators that perform the probability of error correctio based o iris-weighted distace. Thus this process overcomes repudiatio problem ad reduces the key maagemet issues. However, the performace of the NRIC fully depeds o the guaratee of the error correctio egies because recallig the origial bits is a difficult process i the real time processig of ecryptio ad decryptio. IV. + ERROR CORRECTION ENGINES I the process of biometric cryptosystem, the major limitatio is a way to get back the origial bits from the partially corrupted bits geerated by the decryptio. I the literature, several studies had bee performed to recall the traied patters from the partially corrupted patters. Bart Kosko et al. [15] ehaced the bidirectioal associative memories (BAM), which behaves as a hetero-associative cotet addressable memory (CAM) storig ad recallig the vector pairs. The bidirectioal associative memory with multiple traiig ca be guarateed to recall a sigle traied pair uder suitable iitial coditios of data. Sufficiet coditio for a correlatio matrix to make the eergies of the traiig pairs was described by Yeou-Fag et al. [16]. A essetial coditio for geeralizatio of correlatio matrix of BAM which guaratees the recall of all the traiig pairs was discussed by Yeou-Fag et al. [17]. This paper adopts two differet methods to recall the corrupted patters. The first oe is related to auto-associative ad the other oe is cocered with hetero-associative. 3 P a g e

4 A. Autocorrelators Associative memories are oe of the key models of eural etwork ad they ca act as a huma brai to recall the associated patters perfectly from the corrupted patters. If the associated pair (x, y) is the idetical patter, the the model of associative memory is called as auto-associative memory. For the recall operatio, auto-associatives require the correlatio memory or coectio matrix, which aids to retrieve origial patters from the partially corrupted patter. It is called as autocorrelators ad is adopted i the error correctio process of NRIC. The algorithm of error bits correctio process is described as follows [11]: Step 1: The partially corrupted data obtaied i the decryptio process is take for further processig. This data is trasformed to bipolar patters ( c ). Let M be the umber of stored bipolar patters ad i th patters is p 1, p 2,..., p m ( pi1, pi2,, pi ) where is the umber of bits i the stored patter. The coectio matrix CM is derived as T p p for i 1..., for j 1 (3) CM ij i 1 i i.. Step 2: The auto-correlator recalls the origial patters () usig (4) j g(( cj CM ), p j ) for j 1.. m 1 if 0 g (, ) if 0 (5) 1 if 0 where j is the recalled origial patter, c is a partially corrupted data ad g(, ) is the threshold fuctio. Step 3: Repeat Step 2 util vigilace parameter. i1 i i, where is a The parameter provides miimum error bit correctio i betwee the geuie subject iris code ad partially corrupted cipher bits. This parameter gives more complexity to the itruder to get back the origial messages. For example, if the patters are p , p , (IJACSA) Iteratioal Joural of Advaced Computer Sciece ad Applicatios, p the the coectio matrix (CM) is: If partially corrupted data produced i the decryptio process is p the the computatio with CM produce the threshold coditios: g(-3,-1),g(-1,1) ad g(1,1). It O gives the origial patter B. Heterocorrelators I this approach, oisy variatio of differet types of iris codes are ot explicitly estimated ad stored i the verificatio database [17]. If they may explicitly be estimated, the it leads to leak of security iformatio to the adversary. Hece, heterocorrelatios are directly used to recall the origial patters from the corrupted patters that eed ot have ay additioal iformatio such as oisy variatios. This is othig but a associative memory, which is a imitatio model of huma brai s ability to recall associate patters. I the orepudiatio cryptosystem, the decryptio produces oise bits which should be corrected properly ad coverted to its real bit sequeces. If the associated patter pairs (x, y) are differet, the this model recalls y. If x is give, the y ca be called. This is referred as hetero-associative memory. This memory is used to recall the origial patters from the corrupted patters. For the recall operatio, hetero-associative requires a correlatio memory or coectio matrix, which aids to retrieve origial patters. This is so-called hetero-correlators. The algorithm of error bits correctio process is described as follows: Step 1: The partially corrupted data obtaied i the decryptio process is take for further processig. This data is trasformed ito its bipolar patters ( ). Let M be the umber of stored bipolar pairs give as { 1, Q 1 },{ P 2, Q 2 },...,{ P m, Q m } P (6) where Pi { pi1, pi2,... pi}, Qi { qi1, qi2,... qio}, P ad Q represet stored ad exemplar patters of distorted bipolar data, respectively. The coectio matrix (CM) is derived as P T i Qi for i 1..., for j.. o CMij i i 1 1 (7) 4 P a g e

5 where CM is a correctio matrix used i the heterocorrelatio process ad is a set of eergy costats i.e., R, R is a set of real umbers. Calculate ad from Equatios (8) ad (9) ad assig to ad, respectively. Step 2: The hetero-correlator recalls the origial bit sequeces ( ) usig ( CM ) (8) ( CM T ) (9) ( ) 1, 2,..., (10) { 1, 2,..., } (11) 1 if i 0 i i if i 0 1 if i 0 (12) where is a set of partially corrupted bipolar bits geerated by the decryptio process, is a threshold fuctio of hetero-correlatio, represets multiplicatio result of the correctio matrix for the give distortio bit patters, is set of the recalled bits, represets result of exemplars ad is a sequece of corrected bits. Step 3: After performig error correctio process, fid out the weighted distace betwee corrupted ad corrected exemplar as (13) i i i1 If 0 the distace becomes zero ad egie decides that the equilibrium poit is reached, i.e., corrupted bits i decryptio process are safely recalled by hetero-correlators. If, the assig corrected bits to ad perform step 2 util, i. e.,( ),( ) distace of exemplar becomes zero. If, the the egie cofirms that adversary does the correctio process, therefore system has bee termiated. The is a vigilace parameter ad it is calculated as ( mod(,2)) i.e., 0 ( mod(,2)) ad represets umber of bits i a exemplar. The parameter provides miimum eergy for the bits correctio betwee geuie subject ad partially corrupted cipher bits ad also it prevets local miima of the system. This parameter also gives more complexity to the impostor to get back the origial messages. Fially, recalled bipolar bits are coverted to its equivalet biary bits. These sequeces of corrected bits represet the origial bits. The umber of error bit recovery is based o ad parameters. If 7-bit exemplar is used, the the parameters 6 ad {2,3,2 } provide a better result i the error correctio process. V. EXPERIMENTAL RESULTS The proposed approach has bee implemeted ad results were aalysed. Efficacies of SIC ad NRIC have bee evaluated. The NRIC system s time complexity was measured, i that there were o recallig processes ivolved sice the ecrypted bits were decrypted by the erolled iris key. Hece its ecipherig ad decipherig process depeds o the time complexity of iris-matchig algorithm. Next, the performace of the NRIC system was measured by computig the time complexity of auto ad heterocorrelators recallig ad ecryptio/decryptio processes. I the ext experimet iris key eergy complexities was calculated i the case of crackig the messages by the impostors. Fially, the guaratee issues of gettig back origial bits were evaluated with respect to the eergy variatio of auto ad hetero-correlators. The detailed descriptio of each experimet is discussed i the followig sectios. A. Speed performace Time complexities of ecryptio ad decryptio process have bee evaluated for the SIC system. I that decryptio process required more time tha ecryptio process, sice the decryptio was performed after extractig ad matchig the iris features at oe time. The complexity of iris matchig algorithm was depedet o the size of the iris keys preset i the system. The complexity of searchig iris keys iris key matchig system with liear search is O(N) ad with biary search is O(log N). The NRIC system required slightly more time tha the SIC approach because of its error correctio egies require more time to predict the origial patters from the partially corrupted patters. The search time of ecryptio ad decryptio processes of SIC ad NRIC are illustrated i Fig P a g e

6 Figure 4. Ecryptio ad decryptio time complexity of SIC ad NRIC. possessios such as acquisitio time users co-operatio, oiris fractios occurrig o iris ad artifacts emergig i the core area of iris. The guaratee issues of error correctio process for auto ad hetero correlators are based o umber of patters ad bits per patters used i the error correctio process. The guaratee performace of recallig process was evaluated based o the Hammig distace betwee the corrected bits ad traied pairs. Multiple traiig was used to recall several patters. I this traiig, if patter was ot recalled by the coectio matrix by satisfyig vigilace parameter the trai the patters agai by chagig eergy costats, form a ew coectio matrix ad performig recallig process. This process was repeated util recallig etire patters by checkig vigilace parameter. However, traied patters require sufficiet umber of bits to icrease the percetage of accuracy. Figure 6 shows the accuracy of recallig patters usig auto ad hetero correlators. B. Recallig time The recallig time of auto ad hetero correlatios were depedet o size of the coectio matrix i the error correctio process. The coectio matrix was formed based o the umber of bits processed by the cipher text. I accordace with the umber of patters ad bits per exemplar, the recallig time of auto ad hetero correlators were evaluated ad show i Fig. 5. Figure 6 Accuracy of recallig patters usig auto ad hetero correlators. Figure 5. Auto ad hetero correlators recallig time. C. Performace issues The guaratee issue of recallig process for correlators was associated with two factors such as coectio matrix of the error correctio egie ad artifacts occurrig o the iris patters. It provides early 97% of recallig etire pair of traied patters because of its local miimum of the eergy surface. However, i this paper, vigilace parameter was used to put off local miimum attaied by the system, i.e., eergy for the bits correctio i betwee geuie subject ad partially corrupted cipher bits were computed to prevet the local miima of the system. This parameter also produced more complexity to the impostor to get back the origial messages. The factors of artifacts are fully cocered with three D. Impostor complexity The probability of the presece of errors i the orepudiatio process was assessed based o the umber of bits variatio. These variatios occur due to the eviromet, illumiatio, occlusio of eyelids/eyelashes ad other artifacts. I this experimet, the umber of bits corrupted i differet sessios was studied ad verified i which situatios brute force search by a itruder ca crack the iris crypto key. For the experimet, differet eye images were captured at differet sessios from the same subjects ad their chages measured. Figure 7 illustrates the error bit variatio i differet criterio. The chages i bits may ot be stable for all kid of capturig because due to diverse chages the radom alteratio of bits was assorted. The efficiecy of the iris cryptosystem was evaluated i accordace with key stability ad stregth. The stregth of the key ca be evaluated based o etropy priciples. If message source alphabet was A {a1, a2} ad the symbol probability P (a 1 ) = ad P (a 2 ) = the the etropy of the source symbol was bits/symbol. If a itruder ca tap the message, the probability of retrievig the origial message was raged from 0.2 to 1 based o the error 6 P a g e

7 bits of iris code. That is, if bits were error the 2-26 times of complicatio for brute force search was made to a itruder. Thus the retrievig of the origial messages has bee made complicated to the impostors. It provided a high key stregth for ay cryptography system. This key caot be stole or missed ad gave more stability to the cryptosystem. These types of bio keys ca be produced every time the users wat to commuicate secretly at o-secure chaels. I additio, experimetal results show that this approach could easily be adopted i the o-lie cryptography systems as well. E. Re-erolmets Aother desig issue of itegratig biometrics with cryptography is the re-erolmets because biometric cryptosystem is a reliable alterative for password protectio while releasig or direct usage of biometric key as a cryptography key. VI. CONCLUSION This research paper suggests a ovel approach for iris based cryptography system. The crypto keys have bee geerated usig iris patters, which is stable throughout a perso s lifetime as well. Its iter-class variability for a perso is very large sice it creates more complexity to crack or guess the crypto keys. This approach has reduced a complicated sequece required to geerate keys as i the traditioal cryptography system. It ca also geerate more complex iris keys with miimum amout of time complexity, which is aptly suited for ay real time cryptography system. This resolves the key repudiatio problem occurrig i the traditioal system. The hetero-correlators ca predict the umber of bits corrupted i the decryptio process with the help of vigilace parameter. The performace of the proposed approach is foud to be satisfactory. I ear-future, multi-modal cryptosystem will be suggested to itegrate biometric template to icrease degree-ofsecurity i the o-secure data trasmissio. Figure 7. Error bit variatio for the same subject i differet criterio. Hece ecryptio algorithm eeds efficiet solutios, which are periodically updated biometric templates. Thus user ca register their patters oce i a moth or other period of time maitaied i the system. Sice some of the system exploits biometric key for safeguardig mathematical cryptographic keys or others may utilize as a part of the biometric template. Nevertheless if biometric databases are permaetly stored i the local workstatio for a period of time, which is ot secure, a system should employ the recetly erolled iris keys for ecryptio process that icreases the system security ad avoids eavesdropper attacks tha the lifelog biometric templates. Thus the iris-based cryptosystem performs better accuracy by usig re-erolmets. I this paper, subjects iris patters were periodically erolled oce i a week i order to measure the stability of the iris keys. However the keys variatio weighted distace was ragig from 0.0 to This rage was fixed by statistical measures of iris recogitio algorithm. Thus these radom variatios were due to artifacts or other o-iris sources. However the periodic amedmet of geuie subjects iris key produced more brute force search to the impostors tha the ordiary system. REFERENCES [1] Albert Bodo, Method For Producig a Digital Sigature with Aid of a Biometric Features, Germa patet DE A1, [2] Davida G.I., Frakel Y. ad Matt B.J., O eablig secure applicatios through off-lie biometric idetificatio, Proc. of IEEE Symposium Privacy ad Security, Oaklad, Califoria, USA, pp , [3] Davida G.I., Frakel Y., Matt B.J. ad Peralta R., O the relatio of error correctio ad cryptography to a offlie biometric based idetificatio scheme, Proc. Workshop Codig ad Cryptography (WCC 99), PARIS (Frace), pp , [4] Liartz M.G. ad Tuyls P., New Shieldig Fuctios to Ehace Privacy ad Prevet Misuse of Biometric Templates, AVBPA 2003, Guildford, UK, pp , [5] Clacy T., Kiyavash N. ad Li D.J., Secure Smartcard-Based Figerprit Autheticatio, Proc. of ACM SIGMM workshop o Multimedia, Biometric Methods ad Applicatios, New York, USA, pp , [6] Morose F., Reiter M., Li Q. ad Wetzel S., Cryptographic key geeratio from voice, Proceedigs IEEE Symposium o Security ad Privacy, Oaklad, Califoria, pp , [7] Yao-Je Chag, Wede Zhag ad Tsuha Che, Biometrics-Based Cryptographic Key Geeratio, IEEE Iteratioal Coferece o Multimedia ad Expo, Taipei, Taiwa, ( /04), pp , [8] Uludag U., Sharath Pakati, Salil Prabhakar, Ail K. Jai, Biometric Cryptosystems: Issues ad Challeges, Proceedigs of the IEEE, Vol. 92, No. 6, pp , [9] Daeil Schoberg ad Darko Kirovski, Iris compressio for Cryptographically Secure Perso Idetificatio, Proceedigs of IEEE Data Compressio Coferece (DCC 2004), Sowbird, UT, USA, pp , [10] Feg Hao, Ross Aderso ad Joh Daugma, Combiig cryptography with biometrics effectively, Techical report of Uiversity of Cambridge, No. 640, pp. 3-17, [11] Bremaath R ad Chitra A, A efficiet biometric cryptosystem usig autocorrelators Iteratioal Joural of Sigal Processig 2;3, pp , [12] R.Bremaath ad A.Chitra, A ovel approach for high autheticatio based o Iris keys, World Scietific ad Egieerig Academic Society Trasactio o Iformatio sciece ad applicatios, Issue 9, Vol. 2, pp , P a g e

8 [13] R.Bremaath, A.Chitra, A ew methodology for perso idetificatio system, Sadhaa, Idia academy of Scieces, Vol.31, Part 3, pp , [14] R.Bremaath, A.Chitra, Rotatio Ivariat Recogitio of Iris, Joural of Systems Sciece ad Egieerig, Vol.17, No.1, pp.69-78, [15] Bart Kosko, Bidirectioal Associative Memories, IEEE Trasactios o systems, Ma, ad Cyberetics, Vol. 18, No. 1, pp , [16] Yeou-Fag Wag, Jose B. Cruz ad James H. Mulliga, Two codig strategies for bidirectioal associative memory, IEEE Trasactios o Neural etworks, Vol. 1, No. 1, pp ,1990. [17] Yeou-Fag Wag, Jose B. Cruz ad James H. Mulliga, Guarateed recall of all traiig pair for bi-directioal associative memory, IEEE Trasactios o Neural Networks, Vol. 2, No. 6, pp ,1991. [18] P.Arul, A.Shamugam, Geerate a Key for AES usig Biometric for VOIP Network Security, Joural of Theoretical ad appllied Iformatio Techology, Vol.5, No. 2, pp , ( AUTHORS PROFILE Bremaath R received the B.Sc ad M.Sc. degrees i Computer Sciece from Madurai Kamaraj ad Bharathidsa Uiversity i 1991 ad 1993, respectively. He obtaied M.Phil. degree i Computer Sciece ad Egieerig from GCT, Bharathiar Uiversity, i He received his Ph.D. degree i 2008 from Departmet of Computer Sciece ad Egieerig, PSG College of Techology, Aa Uiversity, Cheai, Idia. He has completed his Post-doctoral Research Fellowship (PDF) from the School of Electrical ad Electroic Egieerig, Iformatio Egieerig (Div.) at Nayag Techological Uiversity, Sigapore, i He has 18+ years of experiece i teachig, research ad software developmet. Curretly, He is a Assistat Professor i the Iformatio Techology departmet, Sur Uiversity College, Sur, Oma, affiliated to Bod Uiversity Australia. He received the M N Saha Memorial award for the best applicatio orieted paper i 2006 by Istitute of Electroics ad Telecommuicatio Egieers (IETE). His fields of research are acoustic holography, patter recogitio, computer visio, image processig, biometrics, multimedia ad soft computig. Dr. Bremaath is a member of Idia society of techical educatio (ISTE), advaced computig society (ACS), Iteratioal Associatio of Computer Sciece ad Iformatio Techology (IACIT) ad IETE. He ca be reached at [email protected]. Ahmad Sharieh had two bachelor degrees: oe i Mathematics ad oe i Computer Scieces. He had master degree i Computer Sciece ad High Diploma i Teachig i Higher Educatio. He had PhD i Computer ad Iformatio Scieces from Florida State Uiversity Sharieh worked as Assistat Professor i Fort Valley College / USA ad The Uiversity of Jorda (UJ) / Jorda. He worked as Associate Professor with Amma Arab Uiversity for Graduate Studies (AAUGS) / Jorda ad The Uiversity of Jorda. He worked as Dea of Kig Adbullah School for Iformatio Techology/Jorda. Curretly, he is a professor of Computer Scieces ad Dea at Sur Uiversity College (SUC), Oma. He published articles i jourals (27), i cofereces (22), ad authored ad prepared books (14). He gaied grat for eight research projects from UJ ad Europe. He developed several software systems such as: Teachig Sig Laguage, e-learig Modelig ad Simulatio, ad Olie (Automated) Exams. He is o the editorial board of several jourals ad cofereces ad a referee of several others. His research areas are Distributig Systems, Expert Systems, E-Govermet, E-Learig, Parallel Processig, Patter Recogitio, Software Egieerig, Wire/Wireless Commuicatio, Modelig ad Simulatio. 8 P a g e