WO2017183830A1 - Security enhancement method and apparatus for iris recognition, using distributed iris template storage and matching - Google Patents

Abstract

The present invention relates to a security enhancement method and apparatus for iris recognition, using distributed iris template storage and matching. More particularly, the present invention relates to a security enhancement method and apparatus for iris recognition, using distributed storage and matching of an iris template, the method comprising the steps of: generating an iris template from an iris image obtained through iris recognition; dividing the generated iris template into n element templates; separately storing or registering the n divided element templates in previously designated element template databases (DBs); and measuring the distance between a stored pre-registered element template and an element template for authentication so as to authenticate an iris template (one-to-one comparison), or measuring distances between a plurality of stored pre-registered element templates and an element template for identification so as to identify an iris template (one-to-many comparison).

Description

Method and device for strengthening iris recognition security using iris template distributed storage and matching

The present invention relates to an iris recognition security strengthening method and apparatus using iris template distributed storage and matching. More specifically, generating an iris template from an iris image acquired through iris recognition, dividing the generated iris template into n element templates, and dividing the n divided element templates into a predetermined element template database (DB). And storing or registering the iris template by measuring the distance between the stored pre-registered element template and the element template for authentication, and verifying the iris template (one-to-one comparison), or the distance between the stored plurality of pre-registered element templates and the element element for identification. The present invention relates to an iris recognition security strengthening method and apparatus using iris template distributed storage and matching, which includes measuring and identifying an iris template (one-to-many comparison).

In addition to security devices such as CCTV, access-related devices such as door locks, cameras, videos and camcorders, various mobile devices such as smartphones, tablets, PDAs, PCs, laptops, etc. : Internet of Things) In particular, the demand and application of biometrics are increasing rapidly in various services such as mobile payment and smart keys.

In addition, recently, researches are being rapidly applied to one of the important information protection techniques in internet banking, financial services, and non-face-to-face transactions through the Internet, or to apply them to actual reality.

In order to perform such biometrics, the most important thing is to obtain biometric data such as a part of the body such as a fingerprint or a face, or an individual's behavioral characteristics such as a signature or a gait, which is widely used in recent years. Due to its shortcomings, iris recognition using iris information has been rapidly applied in various smartphones and financial settlement systems in recent years.

The iris recognition has higher accuracy than other recognitions, and the iris has 266 identification features, compared to about 40 fingerprint recognition features. In addition, it is known that there are a lot of people who do not recognize fingerprints in the project for issuing e-residential cards in India, etc., and the technical environment that can be widely used worldwide is provided because Daugman's method patent, which is most widely used in iris recognition, has expired. to be.

However, since the iris information cannot be changed unlike a password or a PIN, a serious problem may occur if the iris information stored for user authentication is stolen by others. Specifically, when the raw vegetables information is lost or stolen by others, it has a fatal disadvantage that it is difficult to easily change it if the user wants it, such as a password or ID.

In fact, a study can be used to generate an original image by using a biometric template extracted from an original image such as a fingerprint image (Arun Ross, Jidnya Shah, Anil K. Jain, "From template to image: Reconstucting fingerprints from minutiae points" , IEEE Tr. On Pattern Analysis and Machine Intelligence, "Vol. 29, No. 4, 2007).

Therefore, protection research on biometric templates including iris templates has been actively conducted, and various methods have been applied.

First, a watermarking technique was applied to a biometric template or a method based on feature transformation or a biometric cryptosystem was used. In addition, in Biometric Cryptosystem), the key generation method directly generates the encryption key from the bio information (Key Generation) and the key to bind the encryption key with the biometric information and store it, and to extract it again if necessary using the biometric information. It is known to use the Binding method.

  Alternatively, a changeable biometric template or a cancelable biometric template technique can be used to issue a new template by adding new modifications to the original biometric information even if the biometric template is leaked. (Jain, Anil K., Karthik Nandakumar, and Abhishek Nagar. "Biometric template security." EURASIP Journal on Advances in Signal Processing 2008).

Despite these various methods, the leakage of the iris template may occur in the process of storing, registering, and authenticating the iris template. Therefore, recently, KFTC stores iris templates in two places in order to apply iris recognition to financial transactions, and then merges the two iris templates into two iris templates each time an authentication request is received. It is known that a system is considered.

However, according to data released by the Korean Mathematical Society in April 2015, even if half of the iris templates were leaked, the risk of obtaining iris certification may be high.

Therefore, in consideration of the case where the original iris template itself is exposed, after the iris template is separated and stored, a security-enhanced safe operation method capable of accurate authentication without combining the separated iris templates is required.

In the related art of the present invention, Korean Patent Publication No. 10-1275590 provides a fuzzy bolting method based on a real-type error correcting code for protecting a biometric information template, and divides an iris template to enhance iris recognition security. It is not related to the invention.

Another related art related to the present invention is US 2008 / 022496A1, which provides a method for sequentially extracting feature elements from an iris template for personal authentication, wherein the iris template is divided to enhance biometric security. It is not related to the invention. In addition, US 2015 / 0078630A1 relates to a method for protecting an iris template based on an obfuscating data point, which is related to the present invention for enhancing iris recognition by dividing an iris template. none.

The problem to be solved by the present invention is to prevent the iris template from leaking during the process of performing the iris recognition, after separating the iris template into a plurality of pieces, and stores the separated iris template in different physical places, respectively, The present invention also provides a security-enhanced iris recognition method and apparatus for authenticating or identifying pieces in separate state without combining the pieces into a single template for identification.

Another problem to be solved by the present invention is to provide an iris recognition security strengthening method and apparatus that security is enhanced so that false iris recognition is not performed due to the leaked iris template even when some iris templates are leaked.

The problem solving means of the present invention Generating an iris template from an iris image obtained through iris recognition, dividing the generated iris template into n element templates, and separating the n divided element templates into a previously promised element template database (DB) Method for strengthening iris recognition security using distributed storage and matching of iris templates, including storing or registering, and certifying the iris template (one-to-one comparison) by measuring the distance between the separately stored pre-registered element template and the element template for authentication To provide.

According to another aspect of the present invention, there is provided a method for generating an iris template from an iris image obtained through iris recognition, dividing the generated iris template into n element templates, and arranging n element templates divided in advance. Separating and storing or registering the separated element template database (DB), and identifying (one-to-many comparison) the iris template by measuring a distance between the plurality of previously stored element templates and the identification element template. The present invention provides a method for reinforcing iris recognition security using iris template distributed storage and matching.

Another solution of the present invention is to provide an iris recognition security enhancement method using iris template distributed storage and matching, including the existing authentication and intruder enhanced authentication when calculating the hamming distance between two separate iris templates. .

According to another aspect of the present invention, there is provided a means for generating an iris template from an iris image obtained through iris recognition, a means for dividing the generated iris template into n element templates, and an element template divided into n elements in advance. An iris including a means for separately storing or registering the element template database promised in the DB and a means for measuring the distance between the previously stored element template and the element template for authentication by comparing the iris templates with one-to-one authentication. An object of the present invention is to provide an iris recognition security strengthening apparatus using template distributed storage and matching.

According to another aspect of the present invention, there is provided a means for generating an iris template from an iris image obtained through iris recognition, a means for dividing the generated iris template into n element templates, and an element template divided into n elements in advance. Means for separately storing or registering the element template database (DB) as promised in the DB, and measuring the distance between the plurality of previously stored element templates and the element elements for identification to compare and identify the iris templates in a one-to-many manner. An iris recognition security strengthening apparatus using iris template distributed storage and matching comprising means.

The present invention provides a method of generating an iris template from an iris image obtained through iris recognition, dividing the generated iris template into n element templates, and dividing the n divided element templates into a previously promised element template database (DB). After separating and storing the iris template, by providing a step of authenticating the iris template (one-to-one comparison) by measuring the distance between the previously stored element template and the element template for authentication separately separated, the iris template is separated, There is an advantageous effect of performing security-enhanced authentication that performs iris recognition while preventing the iris template from leaking without re-joining the template.

Another effect of the present invention is the step of generating an iris template from the iris image obtained through iris recognition, dividing into n element templates from the generated iris template, the element template divided into n element elements in advance promised The iris template may be provided by separately storing or registering the iris template by measuring the distance between the plurality of previously stored element templates and the identification element template. After separation, there is an advantageous effect of performing security-enhanced identification of performing iris recognition while preventing the iris template from leaking without merging the separated iris templates again.

Another effect of the present invention is that when calculating the hamming distance between two separate iris templates, even if some iris templates are leaked by providing basic authentication and intruder prevention authentication, the wrong iris recognition is not performed due to the leaked iris templates This has a beneficial effect.

Another effect of the present invention is a means for generating an iris template from an iris image obtained through iris recognition, a means for dividing into n element templates from the generated iris template, and an element template divided into n elements in advance Iris template distributed storage including a means for separately storing or registering the element template database (DB) and a means for measuring the distance between the separately stored previously registered element template and the element template for authentication by comparing the iris templates in a one-to-one manner And by providing an iris recognition security strengthening device using a matching, after separating the iris template, it is possible to perform security-enhanced authentication to perform the iris recognition while preventing the iris template from leaking without merging the separated iris templates again. That has a beneficial effect.

Another effect of the present invention is a means for generating an iris template from an iris image obtained through iris recognition, a means for dividing into n element templates from the generated iris template, and an element template divided into n elements in advance Means for separately storing or registering the element template database (DB); and means for comparing the iris templates by one-to-many by measuring the distance between the plurality of separately stored element templates and the element elements for identification. Iris template security enhancement device using distributed storage and matching of iris template to separate the iris template, and then perform iris recognition while preventing the iris template from leaking without re-merging the separated iris templates. There is an advantageous effect that can be carried out.

1 illustrates an example for describing a concept of an iris recognition process using a divided iris template according to an embodiment of the present invention.

2 illustrates an example for describing a process of generating an iris template from an iris image according to an embodiment of the present invention.

3 illustrates an example of an iris template generated from data that can be processed by a computer according to an exemplary embodiment.

4 is a flowchart illustrating a method of security-enhanced iris authentication by dividing an iris template into element templates according to an embodiment of the present invention.

5 is a flowchart illustrating a method of dividing an iris template into element templates according to an embodiment of the present invention.

FIG. 6 is an example for explaining a method of collecting pixel attribute values, masking information, pixel position information, and rotation information of an iris template constituting an iris template of a pixel size according to an embodiment of the present invention; FIG. to be.

7 is an illustration for explaining a method of separating an element template by position selection according to an embodiment of the present invention.

8 is an illustration for explaining a method of separating an element template by attribute selection according to an embodiment of the present invention.

9 is a flowchart illustrating a method of storing and registering an iris template as an element template according to an embodiment of the present invention.

10 is an example for describing in detail a method of storing an element template according to an embodiment of the present invention.

11 is a flowchart illustrating a method of authenticating (one-to-one comparison) of an iris template using an element template according to an embodiment of the present invention.

12 is an example for explaining in detail an iris template authentication method using an element template according to an embodiment of the present invention.

FIG. 13 illustrates a type of an element template generated in consideration of iris template rotation information according to an embodiment of the present invention.

FIG. 14 is an illustration for describing a method of obtaining a matching distance in consideration of rotation according to an embodiment of the present invention.

15 is an illustration for explaining a method of comparing a rotated iris template according to an embodiment of the present invention.

FIG. 16 is an example for explaining a method of authenticating an iris template by basic authentication when a masking part is present according to an embodiment of the present invention.

FIG. 17 is an example for explaining a method of authenticating an iris template with enhanced intruder prevention authentication when there is a masking part according to an embodiment of the present invention.

It looks at the specific content for the practice of the present invention.

Hereinafter, the configuration and operation of the embodiments of the present invention will be described with reference to the accompanying drawings, and the configuration and operation of the present invention shown and described in the drawings are described as at least one or more embodiments, whereby the technical features of the present invention are described. Ideas and their core composition and action are not limited.

Therefore, those of ordinary skill in the art to which an embodiment of the present invention belongs should be a key component of an iris recognition security strengthening method and apparatus using iris template distributed storage and matching without departing from the essential characteristics of an embodiment of the present invention. Various modifications and variations may be applicable to the present invention, and technical configurations to which such modifications and variations are applied also fall within the protection scope of the present invention.

In addition, in describing the component of this invention, terms, such as A, B, (a), (b), can be used. These terms are only for distinguishing the components from other components, and the nature, order or order of the components are not limited by the terms. If a component is described as being "connected", "contained" or "configured" to another component, that component may be directly connected to or connected to that other component, but there is another configuration between each component. It is to be understood that an element may be "connected", "contained" or "configured".

In addition, in the present invention, different reference numerals are assigned to the same components for easy understanding in different drawings.

In the present invention, first, an iris image is obtained, and iris recognition is performed using an iris feature extracted from the iris image, registered, stored, or encoded (hereinafter, referred to as an iris template).

In the present invention, Daugman's method is most widely used in iris recognition. This is because most of Daugman's methods are used for iris recognition, and patents have expired and are used around the world.

Therefore, even if the example of the method and apparatus for strengthening iris recognition security using iris template distributed storage and matching in Daugman's method, it should be understood that the same application is possible because it is sufficiently applicable to other iris recognition.

[Example]

It looks at the specific content for the practice of the present invention.

In the present invention, Verification is used for one-to-one (1: 1) matching, and Identification or Searching is used for one-to-many (1: N) matching.

1 illustrates an example for describing a concept of an iris recognition process using a divided iris template according to an embodiment of the present invention.

As shown in FIG. 1, first, an iris template is generated from an iris image. At this time, the iris template is mainly generated as data that can be processed by a computer. A data storage (hereinafter referred to as 'element template') that divides the generated iris template into n pieces (hereinafter, n represents a natural number of 2 or more) and separately stores the divided iris templates (hereinafter, 'element templates'). DB ') to save and register. After that, the element template separated from the iris template generated for authentication (hereinafter, 'authentication iris template') (hereinafter, 'authentication element template') is an element template registered in a predetermined element template database (DB). In the following, the comparison is made with the 'registered element template'. That is, the divided authentication element template and the existing registered element template are compared, and each element template is not merged into one iris template before the division again during the authentication and identification process.

2 illustrates an example for describing a process of generating an iris template from an iris image according to an embodiment of the present invention.

As shown in FIG. 2, first, the human eye is photographed using infrared rays, and the boundary between the pupil and the iris is found from the photographed image, thereby separating the area corresponding to the iris. The separated centrifugal area is unfolded into a rectangular image, and then the iris template is extracted from the rectangular image. Daugman's method creates an iris template that consists of a real part and an imaginary part.

3 illustrates an example of an iris template generated from data that can be processed by a computer according to an exemplary embodiment.

In most of the extraction process, the iris template is generated as data that can be processed by a computer. As illustrated in FIG. 3, the encoded template is also called a code and is composed of values of 0 and 1. In general, the size of the iris template is recommended by the company or organization according to the type of iris information (hereinafter, the iris template is coded that can be processed by computer unless otherwise noted).

In the case of iris templates, 4 * 64, 4 * 128, 4 * 256, 8 * 64, 8 * 128, and 8 * 256 pixel size templates are mainly used.

4 is a flowchart illustrating a method of security-enhanced iris authentication by dividing an iris template into element templates according to an embodiment of the present invention.

As shown in FIG. 4, first, an iris template is generated from iris information obtained through an iris recognition device (S401). The generated iris template is divided into n element templates (S402). The n-part divided element templates are separately stored or registered in the element template database DB promised to be stored in advance (S403).

If authentication or identification is performed, by comparing the iris template with one-to-one (1: 1) by measuring the distance between the pre-registered element template stored in the registration step (S403) and the element for the authentication (S404), The iris template is measured by measuring a distance from a plurality of stored element templates stored therein and an element template separated from an iris template generated for identification (hereinafter, 'identification element template'). One-to-many (1: N) comparison and identification step (S405).

The method may further include encrypting the registered element template, the element template for authentication, and the element template for identification using a watermarking technique, biohashing, robust hashing, encryption key, and the like (S406). can do.

 In FIG. 4, steps S401 to S406 are described as being sequentially executed. However, this is merely illustrative of the technical idea of an embodiment of the present invention, and the general knowledge in the technical field to which an embodiment of the present invention belongs. Those having a variety of modifications and variations will be applicable by changing the order described in Figure 4 or by executing one or more steps of steps S401 to S406 in parallel without departing from the essential characteristics of an embodiment of the present invention. 4 is not limited to the time series order.

5 is a flowchart illustrating a method of dividing an iris template into element templates according to an embodiment of the present invention.

As shown in FIG. 5, in order to generate n element templates, each pixel attribute value and masking information constituting the iris template, position information (hereinafter, referred to as 'pixel position information') in the iris template of the selected pixel, and the iris Collecting rotation information of the template (S501), based on the collected pixel attribute values, masking information, pixel position information, rotation information of the iris template, n element templates In step S502, the separated n element templates are transmitted (S503).

In addition, additional information (storage time, conversion time, log information, etc.) generated in the process of collecting and separating each pixel attribute value, masking information, pixel position information, and rotation information of the iris template constituting the iris template ) Can be configured by adding step (S504).

In FIG. 5, steps S501 to S504 are described as being sequentially executed. However, this is merely illustrative of the technical spirit of an embodiment of the present invention, and the general knowledge in the technical field to which an embodiment of the present invention belongs. Those having a variety of modifications and variations will be applicable by changing the order described in Figure 5 or by executing one or more steps of steps S501 to S504 in parallel without departing from the essential characteristics of one embodiment of the present invention 5 is not limited to the time series order.

Next, a method of collecting pixel attribute values, masking information, pixel position information, and rotation information of the iris template will be described in detail to generate n element templates from the iris template.

When the iris template is generated by the Daugman method, each pixel constituting the iris template has a value of 0 or 1. It also has masking information representing pixels that are difficult to recognize due to occlusion or light reflection of the iris area. In general, if the masking information is 1, the property value of the corresponding pixel is used. If the masking information is 0, it is not used. In general, the iris template includes a matrix representing attribute values of pixels of the iris template and a matrix representing masking information and the like.

 FIG. 6 is an example for explaining a method of collecting pixel attribute values, masking information, pixel position information, and rotation information of an iris template constituting an iris template of a pixel size according to an embodiment of the present invention; FIG. to be.

As illustrated in FIG. 6, pixel attribute values, masking information, pixel position information, rotation information of the iris template, and the like, which form an iris template having a 3 * 8 pixel size, are collected.

Therefore, the collected information is expressed in the form of a matrix, an ordered pair or a vector such as [pixel attribute value, masking information, pixel position information, iris template rotation information], and is mainly stored in a header file format.

Specifically, when the pixels in the second and the third positions in the horizontal direction are selected, pixel attribute values, masking information (1,1) and pixel position information (2,3) are collected. If the pixels in the third and fourth horizontal positions are selected, pixel attribute values, masking information (1,0) and pixel position information (3,4) can be collected. The iris template rotation information, which will be described later, stores information for shifting bits of a certain size from the iris template in proportion to the rotation angle of the iris image. In FIG. 6, since the example assumes an iris template without rotation, the iris template has rotation information of 0 bits.

Thus, each pixel is represented by a matrix, an ordered pair, or a vector with information as [(1,1), (2,3), 0], [(1,0), (3,4), 0].

Next, the iris template is divided into n element templates based on collected pixel attribute values, masking information, pixel position information, and iris template rotation information.

First, determine how many element templates an iris template is divided into. If n is determined to be divided into n element templates (n is a natural number of two or more), the pixels to be included in each element template are selected. In this case, location selection and attribute selection will be used as a selection method. In more detail, location selection is a method of randomly selecting a location, collecting pixel attribute values and masking information of the selected location and dividing it into individual element templates. On the other hand, attribute selection selects a random position among pixels with attribute information of 1 (the opposite of 0) and divides it into element templates first, and when all pixels having a value of 1 (anti-zero) are selected After that, the pixels are randomly selected from among pixels having a value of 0 (or 1) and divided into element templates.

(A1) location selection

7 is an illustration for explaining a method of separating an element template by position selection according to an embodiment of the present invention.

As shown in FIG. 7, when an iris template having a size of 3 * 8 pixels is composed of eight element templates, the element templates are configured in a predetermined order by randomly selecting positions among 24 pixels. The pixels constituting the first element template randomly select three pixels from the total 24 pixels. The selected three pixel position information becomes (1,1), (2.4) and (1,8). The pixels constituting the second element template randomly select three pixels from 21 out of the total 24 pixels except the three previously selected. The selected pixel position information becomes (1,5), (3,3) and (3,5). In this way, you repeat until you construct the last element template. In this case, the number of pixels included in each element template does not necessarily need to be the same. For example, although divided into eight element templates, the number of pixels included in each element template may be 3, 3, 3, 2, 1, 3, 4, or 5.

(A2) attribute selection

8 is an illustration for explaining a method of separating an element template by attribute selection according to an embodiment of the present invention.

As shown in FIG. 8, when an iris template having a size of 3 * 8 pixels is composed of eight element templates, a position is randomly selected among pixels having masking information of 1 (or 0 having opposite) among 24 pixels. After the element templates are configured in the selected order, positions are randomly selected from pixels having masking information of 0 (or 1), and the element templates are configured in the selected order. First, three pixels are randomly selected from the 20 pixels whose masking information is 1 out of 24 pixels. The selected three pixel position information becomes (1,1), (1.3), and (1,5). The pixels constituting the second element template randomly select three pixels among 17 pixels except for the previously selected three among twenty pixels having masking information of one. Repeating in this manner, when all 20 pixels with masking information of 1 are selected, the selection is made from 4 pixels with masking information of 0. Since the masking information is 0 pixels, the pixel selected last when the 7th element template is configured and the 3 pixels of the 8th element template correspond to this. The pixel position information selected as the 7th element template is (2,5), (3,3), (3,5), and the pixel position information selected as the 8th element template is (3,4), (3,6). ), (3,7). In this case, the number of pixels included in each element template does not necessarily need to be the same. For example, although divided into eight element templates, the number of pixels included in each element template may be 3, 3, 3, 2, 1, 3, 4, or 5.

When dividing into n element templates by position selection or attribute selection, each element template size does not necessarily have to be the same as described above. If the pixel attribute value, masking information, pixel position information, and iris template rotation information of the iris template separated and stored in each element template can be stored without being damaged, there is no problem in application, and the capacity of the element template database (DB) and Depending on the number, the same element template may be duplicated and divided.

In the present invention, for convenience of description, it is assumed that each element template size is the same, but it should be understood that the same application is possible even if each element template size is different.

9 is a flowchart illustrating a method of storing and registering an iris template as an element template according to an embodiment of the present invention.

As shown in FIG. 9, first, pixel position information of pixels constituting an element template divided into n pieces from an iris template, information on an iris template before being divided (hereinafter, 'element template division information'), and the like are element templates. Transmitting to the database DB to confirm whether the element template database DB matches the element template partition information previously promised and stored (S901) and the element template database previously promised to match the element template partition information. And storing and registering the element template in (DB) (S902). At this time, in step S903, the element template division information transmitted to the element template database DB is stored together in the element template database DB or the element template division information transmitted to the element template database DB is stored in the element template database DB. It is possible to configure by adding the step (S904) of storing only the element template without storing in the DB).

In FIG. 9, steps S901 through S904 are described as being sequentially executed. However, this is merely illustrative of the technical idea of an embodiment of the present invention, and the general knowledge in the technical field to which an embodiment of the present invention belongs. Those skilled in the art will appreciate that various modifications and variations may be applicable by changing the order shown in FIG. 9 or by executing one or more steps in steps S901 to S904 without departing from the essential characteristics of one embodiment of the present invention. 9 is not limited to the time series order.

Next, let's take a closer look at how to save and register element templates.

As shown in FIG. 9, the element templates divided into n from the iris template are 1, 2, 3,... In order to be stored in the element template database DB. We have element template splitting information, n. The element template database DB is promised in advance to store only element templates in which the element template split information matches.

The element template segmentation information may constitute an element template database (DB) having a size corresponding to all pixels (for example, 8 * 256 = 2048), but in reality, most element templates are divided in consideration of cost and technical efficiency. It is appropriate to divide within.

The element template division information is given by referring to the order and position when dividing by using position selection or attribute selection. In the present invention, for the sake of convenience of explanation, the selection is performed by selecting a position, and the divided element templates are sequentially arranged in order of 1, 2, 3,... , n is given. This is not given with special rules.

10 is an example for describing in detail a method of storing an element template according to an embodiment of the present invention.

As shown in FIG. 10, when storing and registering an element template in the element template database DB, the element template database receives element template division information and checks whether the element template division information matches the element template division information previously specified. In this case, the stored element template is stored or registered only when it matches. In this case, the element template division information is transmitted and stored together with the element template, or the element template division information is simply used to determine whether the element is identical, and the element template database DB may not be stored and registered. When the element template division information is not stored in the element template database DB, in a communication network, a gateway or the like may generally serve to store and store the element template division information.

 (B1) How to store element template split information together

As shown in FIG. 10 (a), the iris template is divided into four element templates, and according to the divided position, the iris template has element template division information 1 , 2 , 3 , and 4 , respectively.

First, the element template division information 1 is sent to four element template databases DB 1 , DB 2 , DB 3 , and DB 4 , and each element template database DB is previously stored. Check that it is correct. DB 2 , DB 3 , and DB 4 will reject because they do not match, and DB 1 will send a signal that they match. After receiving a transmission that the coincidence signal is sent to the storage element template with the template elements in the first division information DB 1. At this time, not only the transmitted element template but also element template division information 1 may be stored at the same time.

Such a method does not need to constitute a means for storing the element template split information in particular, there is an advantage that the operation can be quickly proceeded by the simple process of transmitting and storing. However, if a specific element template database is intruded and related data is leaked, not only the element template but also the element template segmentation information is known to the outside, so that the position of the pixel of the iris template before the segmentation can be known and easily recovered. The chances are high.

(B2) How to transmit except element template split information

As shown in FIG. 12 (b), the iris template is divided into four element templates and has element template division information 1 , 2 , 3 , and 4 , respectively, according to the divided positions.

First, the element template partition information 1 is sent to DB 1 , DB 2 , DB 3 , and DB 4 , and each element template database DB checks whether the element template partition information matches the element template partition information to be stored in advance. Each element template database (DB) checks whether it matches the element template partition information to be stored in advance. DB 2 , DB 3 , and DB 4 will reject because they do not match, and DB 1 will send a signal that they match. After receiving a transmission that the coincidence signal is sent to the storage element template with the template elements in the first division information DB 1. After receiving a signal that matches, the element template having element template division information 1 is transmitted to DB 1 and stored. At this time, the element template database stores only the transmitted element template, and the element template division information 1 is stored together. Do not save.

In this method, when a specific element template database is invaded and related data are leaked, only element template pixel attribute values and masking information are known to the outside, so that the position of the pixel in the outflow part of the original iris template is known. There is no easy way to recover.

However, since a means for storing element template split information must be configured and stored separately, the process of transmitting and storing becomes complicated and the work speed can be relatively slow.

In recent years, since technologies related to communication means and storage means have been rapidly developed, it would be much safer to use a method of separating and storing element template segmentation information for safe storage of iris templates.

11 is a flowchart illustrating a method of authenticating (one-to-one comparison) of an iris template using an element template according to an embodiment of the present invention.

As shown in FIG. 11, first, the distance between the element template for authentication transmitted to the element template database DB matching the element template split information and the pre-registered element template previously registered in the element template database DB is calculated. (S1101) and calculating a value (hereinafter, 'matching distance') calculated by substituting the distance calculated for each element template database (DB) in the above step into a function (S1102); If the matching distance obtained in the step is smaller than a predetermined threshold (hereinafter, 'authentication criteria'), it is determined as the same iris template (S1103), and if it is larger than the authentication criteria, it is determined as another iris template (S1104). .

In FIG. 11, steps S1101 to S1104 are described as being sequentially executed. However, this is merely illustrative of the technical idea of an embodiment of the present invention, and the general knowledge in the technical field to which an embodiment of the present invention belongs. Those having a variety of modifications and variations will be applicable by changing the order described in FIG. 13 or executing one or more steps of steps S1101 to S1104 in parallel without departing from the essential characteristics of an embodiment of the present invention. 11 is not limited to the time series order.

Next, the iris template authentication method using the element template will be described in detail.

12 is an example for explaining in detail an iris template authentication method using an element template according to an embodiment of the present invention.

As shown in FIG. 12, the authentication iris template is divided into four authentication element templates, and each authentication element template is stored in the element template database DB corresponding to each authentication element template split information. . In the four element template database DB, previously registered element templates divided from previously registered iris templates (hereinafter referred to as 'pre-registered iris templates') are stored.

First, the distance between each element template for authentication and the registered element template is calculated from four element template databases (mainly, Hamming distance is used). The matching distance f (r1, r2, r3, r4) calculated by substituting the distances r ₁ , r ₂ , r ₃ , and r ₄ calculated in each element template database into a function for calculating the final comparison result Obtain If the matching distance is smaller than a predetermined threshold (hereinafter, referred to as an authentication criterion), it is determined as the same iris template.

In more detail, first, the Hamming distances (r ₁ , r ₂ , r ₃ , r ₄ ) of the element template for authentication and the registered element templates in the four element template databases and the pixels used to obtain the Hamming distance Find the magnitudes (a ₁ , a ₂ , a ₃ , a ₄ ). By dividing the calculated sum of the Hamming distances (r ₁ + r ₂ + r ₃ + r ₄ ) by the sum of the pixel sizes (a ₁ + a ₂ + a ₃ + a ₄ ), the matching distance of the iris template is calculated.

FIG. 13 illustrates a type of an element template generated in consideration of iris template rotation information according to an embodiment of the present invention.

As illustrated in FIG. 13, the element template separated from the iris template for authentication may be configured by adding iris template rotation information to one or both sides in order to compare with the previously registered element template. In the iris recognition, the rotated iris image is frequently acquired due to the movement of the photographer. If the rotation is not taken into consideration, the iris may be incorrectly recognized as another photographer.

FIG. 14 is an illustration for describing a method of obtaining a matching distance in consideration of rotation according to an embodiment of the present invention.

As shown in FIG. 14 _{, it} is assumed that the distance calculated from DB 1 is r _{1k ,} the distance calculated from DB 2 is r _2k, the distance calculated from DB 3 is r _{3k ,} and the distance calculated from DB 4 is r _{4k ,} do. In addition, each element template for authentication and a registered element template are rotated twice (θ _{1 ,} θ _2). Calculate the Hamming distance obtained by shifting the bit by the size of the rotation angle.

First θ ₁ By size At rotation (k = 1), the Hamming distances of the authentication element template and the registered element template (r ₁₁ , r ₂₁ , r ₃₁ , r ₄₁ ) in each of the four element template databases and Find the pixel sizes (a ₁₁ , a ₂₁ , a ₃₁ , a ₄₁ ) used to find the Hamming distance. The sum of the calculated Hamming distances (r ₁₁ + r ₂₁ + r ₃₁ + r ₄₁ ) divided by the sum of the pixel sizes (a ₁₁ + a ₂₁ + a ₃₁ + a ₄₁ ) yields a θ ₁ rotation angle. The matching distance of the iris template is calculated.

Θ _{2 second} By size When rotating (k = 2), the Hamming distances of the authentication element template and the registered element template in each of the four element template databases (r ₁₂ , r ₂₂ , r ₃₂ , r ₄₂ ) and Find the pixel sizes (a ₁₂ , a ₂₂ , a ₃₂ , a ₄₂ ) used to find the Hamming distance. The sum of the calculated Hamming distance divided by _{(r 12 + r 22 + r} 32 + r 42) the sum of pixel size _{(a 12 + a 22 + a} 32 + a 42), when the θ ₂ revolution gakil The matching distance of the iris template is calculated.

The minimum value is selected from the two matching distances calculated above, and if the minimum value is smaller than the authentication criterion, the same iris template is determined.

If it is assumed that the rotation is k times, the pixel size used to obtain the Hamming distance and Hamming distance between the authentication element template and the registered element template in the i-th element template database can be arranged as shown in the following arrangement. In fact, each element template database stores information in an array form and then calculates it.

Next, the iris template authentication method using the element template described above is now widely used worldwide in iris recognition, and will be described in detail using the Daugman method, which is a de facto standard.

15 is an illustration for explaining a method of comparing a rotated iris template according to an embodiment of the present invention.

When the iris image acquired for iris recognition is rotated and photographed as shown in FIG. 15, in order to compare the two iris templates, the rotated image must be rotated at a predetermined angle and moved to a reference position. At this time, the matrix of the iris template is represented as a result of shifting a bit of an arbitrary size according to the rotation angle.

Specifically, two iris templates A and B are configured as follows. In particular, assuming that the rotated iris template is represented by a shift of -1 bit or +1 bit, it can be expressed as follows.

i) Iris template B- ₁ : -1 bit shift

Iris Template A: 1100111000111010

Iris template B _-1 : 1001101010100110

ii) Iris template B ₊₁ : +1 bit shift

Iris Template A: 1100111000111010

Iris Template B ₊₁ : 1001101010100110

Therefore, three Hamming distances d _H (A, B), d _H (A, B _-1 ), and d _H (A, B ₊₁ ) are calculated and the minimum value is selected from the iris template rotation information. (See equation (1)).

---- (Equation 1)

If 6/14, which is the minimum value selected in Equation (1), is smaller than the authentication criterion, a method of authenticating with the same iris template and with a different iris template is used.

Therefore, it will be easily understood that the iris template rotation information is required when storing or transmitting not only the iris template but also other iris templates.

Next, consider the masking information in detail.

As described above, there is a mask matrix portion in the iris template indicating occlusion of the iris region. It usually occurs when the iris area is covered when the eyes are closed or flickers in the process of acquiring the iris image, but it may also occur when light reflection occurs due to illumination. If this happens, mask it and consider it for comparison.

However, due to this principle, when a part of the entire iris template is leaked to the outside, a fake user (imposter), not a real user (genuine), may be determined as the real owner.

Specifically, when a portion corresponding to 1/4 of the iris template is leaked, and requesting authentication by masking the remaining 3/4 portion other than the leaked portion (hereinafter, 'Occlusion attack'). In consideration of the following).

FIG. 16 is an illustration for explaining a method of authenticating an iris template using a basic authentication method (Daugman method) when there is a masking part according to an embodiment of the present invention.

In order to explain in detail, the size of the iris template A and the iris template B is 100 bits, and the value of the Hamming distance between the two iris templates is calculated. D _H (A, B) = 0.36, and the criterion for authenticating the same iris template is 0.38 (bit Assume that (bit) / score).

(C1) Basic authentication

As shown in Figure 16, the Daugman method does not calculate the masked part. The actual calculation is to find the Hamming distance of 25 bits, which is 1/4 of the non-masking quarter of 100 bits, by multiplying the bit 25 of the comparable area by the average Hamming distance (0.36), and the value is 9 (= 25). * 0.36).

Total hamming distance d calculated using the above calculation _Daugman (A, B) = _9/25 = 0.36, which is less than the standard 0.38 (bit / score) that certifies that it is the same iris template. Therefore, since the same iris template, the authentication is accepted.

However, as described above, when an occlusion attack comes in, there is a disadvantage that it is highly possible to authenticate with the same iris template even though it is another iris template. Therefore, it can be seen that it is necessary to compensate for this.

 (C2) Enhanced Intrusion Prevention Certification

FIG. 17 is an example for explaining a method of authenticating an iris template with enhanced intruder prevention authentication when there is a masking part according to an embodiment of the present invention.

The intruder prevention enhanced authentication shown in FIG. 17 can prevent the problem of authenticating with the same iris template even when the iris template is received when an occlusion attack is received. Specifically, the actual calculation process is as follows.

First, the Hamming distance of 25 bits corresponding to 1/4 of unmasked 1/4 of 100 bits is obtained by multiplying the bit 25 of the comparable area by the average Hamming distance (0.36), and the value is 9 (= 25 * 0.36). Can be calculated as However, the masked part of the 100 bits, which is equivalent to 3/4, is calculated by giving an arbitrary value (in our example, we simply put a probability value of 0.5). That is, a value of 37.5 (= 75 * 0.5) is calculated.

The total hamming distance d _New (A, B) = (9 + 37.5) / (25 + 75) = 0.465, calculated using the above calculations, is 0.38 (bit), which certifies that it is the same iris template. Greater than / score). Therefore, the authentication is rejected because it is not the same iris template. Therefore, even when an occlusion attack comes in, the same iris template is not authenticated, so it can be seen that no problem occurs.

In general, the recognition rate is used as a representative index for evaluating whether iris recognition is possible. Regarding the recognition rate, an error in iris recognition is incorrectly determined to be the iris of the same user even though an iris of a different person than the registered user's iris is input (false acceptance rate, FAR (false acceptance rate), This error occurs when the user's iris, such as 'FAR' and the registered user's iris, is incorrectly judged as another person (owner rejection rate, FRR (false rejection rate), hereinafter referred to as 'FRR'). In iris recognition, the lower the FAR and the FRR, the higher the recognition rate.

The Korean Mathematical Society presentation (attachment), which is the research data underlying the present invention, assumes that the attribute value of a certain size pixel is leaked, and creates a new iris by generating the attribute value of the remaining portions except the leaked portion. A template (hereinafter referred to as an 'intruder template') was obtained to obtain an FAR value of an intruder template (hereinafter referred to as an intruder acceptance rate (IAR)) (threshold value: 0.4).

According to the Korea Mathematical Society published data, the IAR value calculated using the new method is much lower than the IAR value calculated using the Daugman method. Therefore, it can be seen that applying iris recognition by applying a new method is much safer.

Next, the iris template identification method using the element template will be described.

First, the distance between the element template for authentication transmitted to the element template database DB matching the element template split information and the plurality of pre-registered element templates previously registered in the element template database DB is calculated.

Authentication (one-to-one) with a number of k elemental templates (e.g., elemental element template_1, elemental element template_2, ..., elemental element template_k) stored in the element template database for identification. Compare). In this case, when the distance between the element template for identification and the arbitrary registered element template_k is expressed as Dk, each distance is D1, D2, D3,... , Dk, and the value will vary.

By calculating the distance between the element template for identification and the registered element template and the distance value, it is possible to arrange the element elements in descending or descending order by comparing the distance values. Here, the singular or plural candidate groups may be determined according to a predetermined threshold value (hereinafter, referred to as 'identification criteria'), and a) a pre-registered element having a minimum distance among the values in which all registered element templates below the identification criteria are aligned. A template may be selected, b) all previously registered element templates below the identification criteria may be selected, and c) previously registered element templates below the identification criteria may be sorted and selected as a minimum number in order of approaching the minimum value.

For example, the distance value between the element template for identification and the arbitrary registered element template _k is D3 <D1 <Dk <D2 <. … In the descending order, D3, D1, Dk, and D2 are all assumed to satisfy the identification criteria. If a candidate group is selected by the method (A), D3 is satisfied, so D3 can be selected. Also, if the candidate group is determined by the method (B), all of D3, D1, Dk, and D2 are satisfied, and thus all can be selected. Also, if the candidate group is limited to at least three in the method (C), D3, D1, and Dk are satisfied, so D3, D1, and Dk can be selected.

In the above description, all elements constituting the embodiments of the present invention are described as being combined or operating in combination, but the present invention is not necessarily limited to the embodiments.

In other words, within the scope of the present invention, all of the components may be selectively operated in combination with one or more. In addition, although all of the components may be implemented in one independent hardware, each or all of the components may be selectively combined to perform some or all functions combined in one or a plurality of hardware. It may be implemented as a computer program having a.

Codes and code segments constituting the computer program may be easily inferred by those skilled in the art. Such a computer program may be stored in a computer readable storage medium and read and executed by a computer, thereby implementing embodiments of the present invention. The storage medium of the computer program may include any recording medium that can be read by a computer or a processor including a magnetic recording medium, an optical recording medium, a carrier wave medium, a hard disk, a memory chip, and the like.

In the previous embodiment according to the present invention, a method for reinforcing iris recognition security using iris template distributed storage and matching has been described. Based on this, an iris recognition security enhancement program using iris template distributed storage and matching is searched by a computer or server. An iris recognition security strengthening apparatus using distributed iris template storage and matching will be described.

The technical configurations described later are those that can be included or included in the iris recognition security enhancement apparatus using iris template distributed storage and matching according to the present invention.

And means for generating an iris template from the obtained iris image for iris recognition, and means for dividing the generated iris template into n element templates.

means for separating and storing the n-divided element templates into a previously promised element template database (DB), and measuring the distance between the previously stored element templates and the stored element templates for authentication. Means for authenticating in a one-to-one comparison.

The iris recognition security reinforcement apparatus using iris template distributed storage and matching may further include means for comparing the iris templates by one to many by measuring the distance between the plurality of separately stored and registered element templates. Can be.

Means for encrypting the iris template or n element templates by applying a watermarking technique, using biohashing and robust hashing means, an encryption key, and the like.

The means for dividing the iris template into n element templates includes means for collecting pixel attribute values, masking information, pixel position information, and iris template rotation information from the iris template to generate n element templates, and separated n element templates. It may include means for transmitting.

Position selection or attribute selection may be used as a means for separating and collecting the pixel attribute value, masking information, pixel position information, and iris template rotation information.

The position selection may include means for randomly selecting a pixel position, collecting pixel attribute values and masking information of the predetermined position, and dividing the pixel into individual element templates.

The attribute selection is performed by randomly selecting a position among pixels having attribute value of 1 or conversely having zero, and dividing it into an element template first, and selecting all pixels having a value of 1 or conversely having zero. If so, it may include means for randomly selecting a position among pixels having a value of 0 or vice versa and dividing it into an element template.

The means for separately storing or registering the n divided element templates in a predetermined element template database (DB) includes the respective element template division information and the element template database (DB) transmitted from the n divided element templates from the iris template. Means for confirming whether is identical to the element template split information previously owned; And

And means for storing and registering the element template in a previously designated element template database DB in which the element template split information matches.

The means for storing and registering the element template in the predetermined element template database (DB) where the element template split information matches is configured to store the element template split information transmitted to the element template database (DB) together in the element template database (DB). Can be configured.

The means for storing and registering the element template in a predetermined element template database (DB) in which the element template fragmentation information matches does not store the element template fragmentation information transmitted to the element template database (DB) in the element template database (DB). It can be configured to store only element templates.

The means for comparing the iris template one-to-one by measuring the distance between the stored registered element template and the element template for authentication is

Means for calculating the distance between the element template for authentication transmitted to the element template database DB matching the element template division information and the pre-registered element template previously registered in the element template database DB, and the respective element template database Each DB may include a means for obtaining a matching distance calculated by substituting the calculated distance into a function.

It can be configured as a means for determining whether the same iris template by comparing the obtained matching distance and the authentication criteria.

The means for comparing the iris templates in a one-to-many manner by measuring the distance between the stored plurality of registered element templates and the identifying element templates is a plurality of registered element templates pre-registered in the element template database and the element template database (DB). And a means for calculating a distance between and a candidate group from a matching distance calculated using the calculated distance.

Means for selecting the selected one or more pre-registered element templates as the same element template.

And a means for calculating a hamming distance between the element templates based on the distance between the stored pre-registered element template and the element template for authentication.

And a means for calculating a hamming distance between the element templates based on the distance between the stored plurality of pre-registered element templates and the element templates for identification.

The distance is calculated by summing the sum of the distances (r ₁ , r ₂ , r ₃ , ..., r _n ) of the authentication element templates and the registered element templates calculated from the n element template databases (DB). Means for using a function of dividing by the sum of the pixel sizes a ₁ , a ₂ , a ₃ ,..., A _n used in.

When two or more matching distances are calculated, the minimum value may be selected.

When the matching distance is calculated in consideration of the rotation of the element template, the hamming distance obtained by shifting bits by the rotation angle size may be used.

The masked pixel of the element template for authentication includes a means for calculating a hamming distance between the element templates without calculating.

The hamming distance between the element templates can be calculated by fixing the hamming distance of the masked pixels in the element templates for authentication to a specific value.

The masking pixel of the element template for identification may be calculated without calculating the hamming distance between the element templates.

The hamming distance between the element templates can be calculated by fixing the hamming distance of the masked pixels in the element templates for identification to a specific value.

A specific value that fixes the hamming distance of the masked pixels can be 0.5.

When the element template for identification is a iris template, a specific value for fixing the hamming distance of the masked pixel may be 0.5.

From among the values of sorting all the registered element templates below the identification criteria as a means for obtaining the candidate group from the calculated matching distance, select the registered element templates with the minimum distance or select all the registered element templates below the identification criteria, It may include a means for arranging the following pre-registered element templates to select at least several and the like in the order close to the minimum value.

The element template division information transmitted to the element template database DB may be stored in the gateway without being stored in the element template database DB.

Technical configurations applied to the method invention can be selectively applied to the device invention.

The present invention comprises the steps of generating an iris template from an iris image obtained through iris recognition, dividing the generated iris template into n element templates, and dividing the n divided element templates into a predetermined element template database (DB). Separately storing or registering, measuring the distance between the stored pre-registered element template and the element template for authentication to measure the iris template (one-to-one comparison) or the distance between the stored multiple registered element templates and the element element for identification By providing a method and apparatus for strengthening iris recognition security using iris template distributed storage and matching, which includes identifying an iris template (one-to-many comparison), it is highly industrially available.

Claims (27)

1. In the method of strengthening iris recognition security using iris template distributed storage and matching,

   Generating an iris template from the iris image acquired for iris recognition;

   Dividing the generated iris template into n element templates;

   separately storing or registering the n divided element templates in a previously promised element template database DB; And

   Iris recognition security strengthening method using the iris template distributed storage and matching, characterized in that the step of measuring the distance between the pre-stored element template and separately stored element template for authentication and comparing the iris template to one-to-one authentication.
2. In the method of strengthening iris recognition security using iris template distributed storage and matching,

   Generating an iris template from the iris image acquired for iris recognition;

   Dividing the generated iris template into n element templates;

   separately storing or registering the n divided element templates in a previously promised element template database DB; And

   Reinforcing iris recognition security using distributed storage and matching of iris templates, characterized in that the step of measuring the distance between the plurality of previously stored element templates and identification element templates stored separately separated by comparing the iris template to one to many Way.
3. The method according to claim 1 or 2,

   Enhancing iris recognition security using iris template distributed storage and matching, comprising adding an iris template or n element templates by applying watermarking techniques, bio hashing, low burst hashing, or encrypting using an encryption key .
4. The method according to claim 1 or 2,

   Dividing the iris template into n element templates

   collecting pixel attribute values, masking information, pixel position information, and iris template rotation information from the iris template to generate n element templates; And

   An iris recognition security enhancement method using iris template distributed storage and matching, comprising: transmitting the separated n element templates.
5. The method according to claim 4,

   An iris recognition security strengthening method using distributed storage and matching of an iris template, wherein position selection or attribute selection is used to separately collect pixel attribute values, masking information, pixel position information, and iris template rotation information.
6. The method according to claim 5,

   The location selection

   Iris recognition security strengthening method using the iris template distributed storage and matching, characterized in that to randomly select the location of the pixel, collecting the pixel attribute value and masking information of the selected position into individual element templates.
7. The method according to claim 5,

   The attribute selection

   Randomly select a position among pixels with attribute value of 1 or reversely zero and divide it into element templates first, and after all pixels with value of 1 or reversely zero are selected, An iris template security enhancement method using distributed storage and matching of an iris template, wherein a position is randomly selected among pixels having a value of 0 or vice versa and divided into element templates.
8. The method according to claim 1 or 2,

   Separately storing and registering the n divided element templates in a predetermined element template database (DB)

   Checking whether each element template division information transmitted by the element template divided into n pieces from the iris template and the element template division information owned by the element template database are previously owned; And

   And storing and registering the element template in a predetermined element template database (DB) in which the element template split information is matched.
9. The method according to claim 8,

   In the step of storing and registering the element template in a predetermined element template database (DB) where the element template split information matches

   An iris recognition security strengthening method using iris template distributed storage and matching, wherein the element template split information transmitted to the element template database is stored in the element template database.
10. The method according to claim 8,

    In the step of storing and registering the element template in a predetermined element template database (DB) where the element template split information matches

    An iris recognition security strengthening method using iris template distributed storage and matching, characterized in that only the element template is stored without storing the element template split information transmitted to the element template database (DB) in the element template database (DB).
11. The method according to claim 1,

    The step of authenticating by comparing the iris template with one-to-one by measuring the distance between the stored pre-registered element template and the element template for authentication

    Calculating a distance between the element template for authentication transmitted to the element template database DB matching the element template division information and the pre-registered element template registered in advance in the element template database DB;

    Obtaining a matching distance calculated by substituting a distance calculated for each element template database in the step into a function; And

    Iris recognition security strengthening method using the iris template distributed storage and matching, characterized in that the step of determining whether the same iris template by comparing the matching distance and the authentication criteria obtained in the step.
12. The method according to claim 2,

    The step of identifying the iris templates by comparing the iris templates by measuring the distance between the stored plurality of registered element templates and the identifying element templates

    Calculating a distance between the element template for identification and a plurality of pre-registered element templates previously registered in the element template database DB;

    Obtaining a candidate group from the matching distance calculated using the distance calculated in the step; And

    Iris template distributed security storage and matching method characterized in that it comprises the step of selecting one or more of the previously registered element template selected in the step as the same element template.
13. The method according to claim 1 or 11,

    The distance between the stored element template and the element template for authentication

    An iris recognition security enhancement method using iris template distributed storage and matching, characterized by calculating and using a hamming distance between element templates.
14. The method according to claim 2 or 12,

    The distance between a number of stored element templates and

    An iris recognition security enhancement method using iris template distributed storage and matching, characterized by calculating and using a hamming distance between element templates.
15. The method according to claim 11 or 12,

    The distance is calculated by summing the sum of the distances (r ₁ , r ₂ , r ₃ , ..., r _n ) of the authentication element templates and the registered element templates calculated from the n element template databases (DB). An iris recognition security enhancement method using iris template distributed storage and matching, which is calculated using a function of dividing by the sum of the pixel sizes (a ₁ , a ₂ , a ₃ ,…, a _n ) used in.
16. The method according to claim 11 or 12,

    Iris recognition security strengthening method using the iris template distributed storage and matching, characterized in that the minimum value is selected if more than two matching distance is calculated.
17. The method according to claim 11 or 12,

    When calculating the matching distance in consideration of the rotation (rotation) of the element template iris recognition security strengthening method using the iris template distributed storage and matching, characterized in that using the Hamming distance obtained by shifting the bit by the rotation angle size.
18. The method according to claim 13,

    Iris recognition security strengthening method using iris template distributed storage and matching, which uses basic authentication that calculates the Hamming distance between element templates without calculating the masked pixels among the element templates for authentication
19. The method according to claim 13,

    Iris template security using iris template distributed storage and matching, which uses intruder prevention enhanced authentication, which calculates the hamming distance between element templates by fixing the hamming distance of masked pixels in the element template for authentication to a specific value Strengthening method.
20. The method according to claim 14,

    An iris recognition security enhancement method using distributed storage and matching of an iris template, characterized in that basic authentication is performed for calculating a hamming distance between element templates without calculating the masked pixels of the element templates for identification.
21. The method according to claim 14,

    Iris template security using iris template distributed storage and matching, which uses intruder prevention enhanced authentication, which calculates the hamming distance between element templates by fixing the hamming distance of masked pixels in the element template for identification to a specific value Strengthening method.
22. The method according to claim 19,

    An iris template security enhancement method using iris template distributed storage and matching, which uses 0.5 as a specific value to fix the hamming distance of masked pixels.
23. The method according to claim 21,

    When the identification element template is a iris template, the iris template security enhancement method using distributed storage and matching of iris templates, characterized in that 0.5 is used as a specific value to fix the hamming distance of the masked pixels.
24. The method according to claim 15,

    From the calculated matching distances, select all the registered element templates with the minimum distance among all the registered element templates below the identification criteria, select all the registered element templates below the identification criteria, or select the registered element templates below the identification criteria. Iris security method using the iris template distributed storage and matching further comprising the step of obtaining a candidate group by selecting at least a few in order of closest to the minimum value.
25. The method according to claim 10,

    An iris recognition security strengthening method using iris template distributed storage and matching, characterized in that the element template split information transmitted to the element template database (DB) is stored in the gateway (gateway) without storing in the element template database (DB).
26. In the iris recognition security strengthening apparatus using iris template distributed storage and matching,

    Means for generating an iris template from the obtained iris image for iris recognition;

    Means for dividing the generated iris template into n element templates;

    means for separately storing or registering the n divided element templates in a previously promised element template database DB; And

    An iris recognition security reinforcement apparatus using iris template distributed storage and matching, comprising a means for certifying by comparing the iris templates with a one-to-one comparison by measuring the distance between the pre-registered element template and the element template for authentication.
27. In the iris recognition security strengthening apparatus using iris template distributed storage and matching,

    Means for generating an iris template from the obtained iris image for iris recognition;

    Means for dividing the generated iris template into n element templates;

    means for separately storing or registering the n divided element templates in a previously promised element template database DB; And

    An iris recognition security strengthening apparatus using distributed storage and matching of an iris template, comprising means for measuring a distance between a plurality of separately stored element templates and an element template for identification and comparing the iris templates.

Images