WO2018199713A1 - Biometric information authentication method for protecting biometric information - Google Patents
Biometric information authentication method for protecting biometric information Download PDFInfo
- Publication number
- WO2018199713A1 WO2018199713A1 PCT/KR2018/005012 KR2018005012W WO2018199713A1 WO 2018199713 A1 WO2018199713 A1 WO 2018199713A1 KR 2018005012 W KR2018005012 W KR 2018005012W WO 2018199713 A1 WO2018199713 A1 WO 2018199713A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- secret information
- secret
- authentication
- vector
- authentication server
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
- G06F21/31—User authentication
- G06F21/32—User authentication using biometric data, e.g. fingerprints, iris scans or voiceprints
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
- G06F21/45—Structures or tools for the administration of authentication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
Definitions
- the present invention relates to a secret information authentication method, and more particularly to a biometric information authentication method.
- biometric information unique to each human being such as fingerprint and iris information. Since the biometric information is unique to each person, there is no hassle such as having to memorize a password and there is no fear of leakage.
- biometric authentication has a different feature from the existing authentication method.
- the biometric input information inputted for recognition varies slightly depending on the noise generated in the biometric information recognition process.
- authentication should be possible even in the presence of noise.
- An object of the present invention is to solve the above-mentioned problems of the prior art, and to provide a method for authenticating secret information, particularly biometric information, which has a short cipher text and is fast.
- a secret information authentication server is performed in an environment including a secret information registration terminal, a secret information authentication server, and a secret information authentication request terminal, and the secret information authentication server performs a secret information vector.
- matrix Is the product of Receiving and storing the secret information from the registration terminal;
- Secret authentication server authentication requested secret information vector about, Vector created to satisfy the relationship of Receiving a secret information authentication request terminal from the terminal;
- Secret authentication server Wow Calculating an inner product of the third product; Secret authentication server, And a fourth step of determining that the secret information authentication succeeds when this value is less than or equal to the predetermined value, and determining otherwise as the secret information authentication failure.
- a secret information authentication server is a secret information vector.
- matrix A first step of receiving a product of a secret information registration terminal; Secret authentication server, authentication requested secret information vector And error vector ( )about, Vector created to satisfy the relationship of Receiving a secret information authentication request terminal from the terminal; Secret authentication server, Wow Calculating an inner product of the third product; Secret authentication server, And a fourth step of determining that the secret information authentication succeeds when this value is less than or equal to the predetermined value, and determining otherwise as the secret information authentication failure.
- Matrix after the first step Can be deleted from the secret information registration terminal.
- At least one of them may be transmitted encrypted with a public key.
- the secret information is encrypted and transmitted to the authentication server, the secret information is not leaked even if it is exposed in the middle or the authentication server is attacked.
- it is possible to determine whether to authenticate the encrypted secret information that has been requested for authentication and the encrypted secret information that has been registered it is possible to fundamentally block the possibility that the secret information is leaked.
- secret information is determined based on the inner product of a ciphertext having a vector of length m, the efficiency is improved.
- FIG. 1 is a flow chart of a secret information authentication method according to the present invention.
- the information (data) transmission process performed in the present specification may be applied to encryption / decryption as necessary, and in this specification and the claims, the expressions describing the information (data) transmission process are all encrypted / decrypted even if not mentioned otherwise. It should also be interpreted to include cases.
- expressions of the form "transfer from A to B (transfer)" or "A receives from B” include those that are transmitted (transmitted) or received with other mediators in between, and directly from A to B. It does not represent only what is transmitted (delivered) or received.
- the order of each step is to be understood without limitation unless the preceding step is to be performed logically and temporally prior to the later step.
- the present invention is performed by an electronic computing device such as a computer capable of electronic operations, and the mathematical operations and calculations of the steps of the present invention described later are suitable for the known coding method and / or the present invention for performing the operations or calculations. It can be implemented by computer operation by means of coding designed to be.
- value is defined as a concept including not only a scalar value but also a vector and a matrix.
- the encryption method and the authentication method according to the present invention may include general secret information (for example, a password, a secret key, and personal sensitivity information). Etc.), and the scope of the right should not be limited as it applies to biometric information.
- the secret information authentication method according to the present invention is performed in an environment including a secret information registration terminal 10, a secret information authentication request terminal 20, and an authentication server 30.
- the secret information registration terminal 10 is a terminal for first registering the user's secret information in the authentication server 30, and the secret information authentication request terminal 20 registers the secret information recognized after registering the secret information in the authentication server 30. It is a terminal for authenticating secret information by sending it).
- the secret information registration terminal 10 and the secret information authentication request terminal 20 may be the same terminal or may be different terminals. In this specification, it is assumed that the terminal is different from each other.
- the secret information registered and requested for authentication may be, for example, fingerprint information.
- the terminal When the user inputs the secret information to be registered in the secret information registration terminal 10, the terminal stores the secret information vector as a vector of length n consisting of -1 and 1. To create. And m ⁇ n matrix Secret information received with Is the product of Calculate (100). procession The secret information may be deleted from the terminal 10 after a process of initially registering the secret information in the registration terminal 10. procession If you delete it after registering confidential information, you can eliminate the risk of later leakage.
- a user who wants to authenticate secret information reads or inputs his secret information to the secret information authentication request terminal 20 so that the secret information authentication request terminal 20 has a length of -1, 1 n secret information vector Create
- the secret information vector requested authentication about, Vector satisfying the relationship of Generate (130).
- vector For example may be generated by randomly selecting (mn) components to an arbitrary value, and then calculating the remaining n components to satisfy the above relationship.
- n is a dimension of secret information, and security is determined by m.
- n may be set to 2,000 and m may be set to 2,500 to set the k value to 500.
- the invention is not to be interpreted as limiting the scope of protection to such specific values.
- the Hamming distance of two vectors is the number of different elements when comparing two elements in the same position. For example, the Hamming distance between the vector 1100 and the vector 1000 is 1, and the Hamming distance between the vector 1111 and the vector 1100 is 2. In other words, if the secret information is expressed as a vector, the smaller the hamming distance, the more similar the secret information can be seen.
- the authentication server 30 registers the encrypted secret information.
- Vector with The inner product of is calculated (150). This dot product satisfies the following relationship.
- Secret information property vector by equation (1) And, secret information vector generated during secret information authentication Hamming distance of To It is calculated as (160). If the calculated hamming distance is within a predetermined range, it is determined that the secret information requesting authentication is legitimate, otherwise, it is determined as authentication failure (170). The authentication success or failure is transmitted to the authentication server 30 to the secret information authentication request terminal 20 (180).
- a vector created to satisfy the relationship You can also use vector Is It is a noise vector having a small magnitude in the LWE problem that is randomly selected from.
- the authentication server 30 Wow A secret information vector registered by Equation 1 from the inner product of Error value is added to the secret vector The Hamming distance is calculated to determine whether to authenticate according to Equation 1.
- Equation 3 Is a small error Having It can be seen as an approximation of. Therefore, it can be used for secret information authentication.
- the secret information is encrypted and transmitted to the authentication server, the secret information is not leaked even if it is exposed in the middle or the authentication server is attacked.
- the matrix Q As described above, it is possible to discriminate whether or not the secret information is leaked since it is possible to determine whether to authenticate without decrypting the encrypted secret information requested for authentication and the encrypted secret information registered. Can be.
- secret information is determined based on the inner product of a ciphertext having a vector of length m, the efficiency is improved.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Collating Specific Patterns (AREA)
Abstract
A confidential information authentication method according to the present invention comprises: a first step of allowing a confidential information authentication server to receive, from a confidential information registration terminal, the product of a first confidential information vector and a matrix (Q) and store the same; a second step of allowing the confidential information authentication server to receive, from a confidential information authentication request terminal, a third vector enabling the value, obtained by multiplying a transposed matrix (QT) of the matrix and the third vector, to become a second confidential vector, with respect to a second confidential information vector for which an authentication request was made; a third step of allowing the confidential information authentication server to calculate the product of the matrix and a first confidential vector and an inner product of the third vector; and a fourth step of allowing the confidential information authentication server to calculate 1/2(n - inner product), determine the confidential information authentication to have succeeded if the value is less than or equal to a predetermined value, and determine the confidential information authentication to have failed in all other cases.
Description
본 발명은 비밀 정보 인증 방법에 대한 것으로서 특히 생체 정보의 인증 방법에 대한 것이다.The present invention relates to a secret information authentication method, and more particularly to a biometric information authentication method.
최근에 지문, 홍채 정보 등과 같은 인간마다 고유하게 가지고 있는 생체 정보를 이용하여 인증 방법이 널리 개발되고 있다. 생체 정보는 사람마다 고유하기 때문에 비밀번호를 외워야 하는 등의 번거로움이 없고, 유출의 우려도 없는 장점이 있다.Recently, authentication methods have been widely developed using biometric information unique to each human being, such as fingerprint and iris information. Since the biometric information is unique to each person, there is no hassle such as having to memorize a password and there is no fear of leakage.
그런데 생체 정보 인증은 기존의 인증 방법과 다른 특징을 가지고 있다. 첫째, 생체 정보 인식 과정에서 발생하는 노이즈에 의해서 인식을 위해 입력되는 생체 입력 정보가 조금씩 달라지는데 이처럼 노이즈가 있는 상태에서도 인증이 가능해야 한다. 둘째, 생체 정보가 노출되는 경우라고 해도, 비밀번호와 달리 생체 정보는 변경이 불가능하다. 따라서, 노출의 위험성을 원천적으로 차단해야 한다.However, biometric authentication has a different feature from the existing authentication method. First, the biometric input information inputted for recognition varies slightly depending on the noise generated in the biometric information recognition process. However, authentication should be possible even in the presence of noise. Second, even if the biometric information is exposed, unlike the password, the biometric information cannot be changed. Therefore, the risk of exposure must be fundamentally blocked.
이와 같은 생체 정보 인증의 특성을 고려하여 Fuzzy extractor나 Inner product encryption 등의 암호화 방식이 연구되고 있다. 그러나 종래의 암호화 방식에 따른 인증은 속도가 느리거나 암호문의 크기가 크다는 단점이 존재한다.In consideration of such characteristics of biometric authentication, encryption methods such as fuzzy extractor and inner product encryption have been studied. However, there is a disadvantage that the authentication according to the conventional encryption method is slow or large in size of the cipher text.
본 발명은 전술한 종래 기술의 문제점을 해결하여, 암호문의 크기가 짧고 속도가 빠른 비밀 정보 특히 생체 정보 인증 방법을 제공하는 것을 목적으로 한다.An object of the present invention is to solve the above-mentioned problems of the prior art, and to provide a method for authenticating secret information, particularly biometric information, which has a short cipher text and is fast.
본 발명에 의한 비밀 정보 인증 방법은, 비밀 정보 등록 단말기와, 비밀 정보 인증 서버와, 비밀 정보 인증 요청 단말기를 포함하는 환경에서 비밀 정보 인증 서버가 수행되며, 비밀 정보 인증 서버가, 비밀 정보 벡터 
와 행렬 
의 곱인 
를 비밀 정보 등록 단말기로부터 수신하고 저장하는 제1 단계와; 비밀 정보 인증 서버가, 인증 요청된 비밀 정보 벡터 
에 대해서, 
의 관계를 만족하도록 생성된 벡터 
를 비밀 정보 인증 요청 단말기로부터 수신하는 제2 단계와; 비밀 정보 인증 서버가, 
와 
의 내적값(inner product)을 산출하는 제3 단계와; 비밀 정보 인증 서버가, 
을 산출하고, 이 값이 소정의 값보다 작거나 같은 경우에 비밀 정보 인증에 성공한 것으로 판별하고, 그 이외의 경우에는 비밀 정보 인증 실패로 판별하는 제4 단계를 포함한다.In the secret information authentication method according to the present invention, a secret information authentication server is performed in an environment including a secret information registration terminal, a secret information authentication server, and a secret information authentication request terminal, and the secret information authentication server performs a secret information vector. And matrix Is the product of Receiving and storing the secret information from the registration terminal; Secret authentication server, authentication requested secret information vector about, Vector created to satisfy the relationship of Receiving a secret information authentication request terminal from the terminal; Secret authentication server, Wow Calculating an inner product of the third product; Secret authentication server, And a fourth step of determining that the secret information authentication succeeds when this value is less than or equal to the predetermined value, and determining otherwise as the secret information authentication failure.
본 발명의 다른 실시형태에 의하면, 본 발명에 의한 인증 방법은, 비밀 정보 인증 서버가, 비밀 정보 벡터 
와 행렬 
의 곱을 비밀 정보 등록 단말기로부터 수신하는 제1 단계와; 비밀 정보 인증 서버가, 인증 요청된 비밀 정보 벡터 
와 에러벡터(
)에 대해서, 
의 관계를 만족하도록 생성된 벡터 
를 비밀 정보 인증 요청 단말기로부터 수신하는 제2 단계와; 비밀 정보 인증 서버가, 
와 
의 내적값(inner product)을 산출하는 제3 단계와; 비밀 정보 인증 서버가, 
을 산출하고, 이 값이 소정의 값보다 작거나 같은 경우에 비밀 정보 인증에 성공한 것으로 판별하고, 그 이외의 경우에는 비밀 정보 인증 실패로 판별하는 제4 단계를 포함한다.According to another embodiment of the present invention, in the authentication method according to the present invention, a secret information authentication server is a secret information vector. And matrix A first step of receiving a product of a secret information registration terminal; Secret authentication server, authentication requested secret information vector And error vector ( )about, Vector created to satisfy the relationship of Receiving a secret information authentication request terminal from the terminal; Secret authentication server, Wow Calculating an inner product of the third product; Secret authentication server, And a fourth step of determining that the secret information authentication succeeds when this value is less than or equal to the predetermined value, and determining otherwise as the secret information authentication failure.
제1 단계 수행 후 행렬 
는 비밀 정보 등록 단말기로부터 삭제될 수 있다.Matrix after the first step Can be deleted from the secret information registration terminal.
본 발명에 의하면, 비밀 정보가 암호화되어 인증 서버로 전송되므로 도중에 노출되거나 인증 서버가 공격받더라도 비밀 정보는 누출되지 않는 효과가 있다. 그리고 인증 요청을 받은 암호화된 비밀 정보와 등록되어 있는 암호화된 비밀 정보를 복호화할 필요없이 인증 여부를 판별할 수 있기 때문에 비밀 정보가 누설될 가능성을 원천적으로 차단할 수 있다. 또한, 비밀 정보는 길이가 m인 벡터로 되어 있는 암호문의 내적값으로 인증 여부를 판별하기 때문에 기존의 방법에 비해 효율성도 고양된다.According to the present invention, since secret information is encrypted and transmitted to the authentication server, the secret information is not leaked even if it is exposed in the middle or the authentication server is attacked. In addition, since it is possible to determine whether to authenticate the encrypted secret information that has been requested for authentication and the encrypted secret information that has been registered, it is possible to fundamentally block the possibility that the secret information is leaked. In addition, since secret information is determined based on the inner product of a ciphertext having a vector of length m, the efficiency is improved.
도 1은 본 발명에 의한 비밀 정보 인증 방법의 흐름도.1 is a flow chart of a secret information authentication method according to the present invention.
이하에서는 첨부 도면을 참조하여 본 발명에 대해서 자세하게 설명한다.Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.
본 명세서에서 수행되는 정보(데이터) 전송 과정은 필요에 따라서 암호화/복호화가 적용될 수 있으며, 본 명세서 및 특허청구범위에서 정보(데이터) 전송 과정을 설명하는 표현은 별도로 언급되지 않더라도 모두 암호화/복호화하는 경우도 포함하는 것으로 해석되어야 한다. 본 명세서에서 "A로부터 B로 전송(전달)" 또는 "A가 B로부터 수신"과 같은 형태의 표현은 중간에 다른 매개체가 포함되어 전송(전달) 또는 수신되는 것도 포함하며, A로부터 B까지 직접 전송(전달) 또는 수신되는 것만을 표현하는 것은 아니다. 본 발명의 설명에 있어서 각 단계의 순서는 선행 단계가 논리적 및 시간적으로 반드시 후행 단계에 앞서서 수행되어야 하는 경우가 아니라면 각 단계의 순서는 비제한적으로 이해되어야 한다. 즉 위와 같은 예외적인 경우를 제외하고는 후행 단계로 설명된 과정이 선행 단계로 설명된 과정보다 앞서서 수행되더라도 발명의 본질에는 영향이 없으며 권리범위 역시 단계의 순서에 관계없이 정의되어야 한다. 그리고 본 명세서에서 “A 또는 B”은 A와 B 중 어느 하나를 선택적으로 가리키는 것 뿐만 아니라 A와 B 모두를 포함하는 것도 의미하는 것으로 정의된다. 또한, 본 명세서에서 "포함"이라는 용어는 포함하는 것으로 나열된 요소 이외에 추가로 다른 구성요소를 더 포함하는 것도 포괄하는 의미를 가진다.The information (data) transmission process performed in the present specification may be applied to encryption / decryption as necessary, and in this specification and the claims, the expressions describing the information (data) transmission process are all encrypted / decrypted even if not mentioned otherwise. It should also be interpreted to include cases. In this specification, expressions of the form "transfer from A to B (transfer)" or "A receives from B" include those that are transmitted (transmitted) or received with other mediators in between, and directly from A to B. It does not represent only what is transmitted (delivered) or received. In the description of the present invention, the order of each step is to be understood without limitation unless the preceding step is to be performed logically and temporally prior to the later step. In other words, except in the exceptional case described above, even if the process described in the following step is performed in advance of the process described in the preceding step, the nature of the invention is not affected, and the scope of rights should be defined regardless of the order of the steps. In this specification, “A or B” is defined to mean not only selectively indicating any one of A and B, but also including both A and B. In addition, the term "comprising" in this specification has the meaning encompassing further including other elements in addition to the elements listed as containing.
본 명세서에서는 본 발명의 설명에 필요한 필수적인 구성요소만을 설명하며, 본 발명의 본질과 관계가 없는 구성요소는 언급하지 아니한다. 그리고 언급되는 구성요소만을 포함하는 배타적인 의미로 해석되어서는 아니되며 다른 구성요소도 포함할 수 있는 비배타적인 의미로 해석되어야 한다.In this specification, only essential components necessary for the description of the present invention are described, and components not related to the nature of the present invention are not mentioned. It should not be construed in an exclusive sense that includes only the constituent elements but in a non-exclusive sense, which may also include other components.
본 발명은 전자적 연산이 가능한 컴퓨터 등의 전자적 연산 장치에 의해서 수행되며, 후술하는 본 발명의 각 단계의 수학적 연산 및 산출은 해당 연산 또는 산출을 하기 위해 공지되어 있는 코딩 방법 및/또는 본 발명에 적합하게 고안된 코딩에 의해서 컴퓨터 연산으로 구현될 수 있다.The present invention is performed by an electronic computing device such as a computer capable of electronic operations, and the mathematical operations and calculations of the steps of the present invention described later are suitable for the known coding method and / or the present invention for performing the operations or calculations. It can be implemented by computer operation by means of coding designed to be.
그리고 본 명세서에서 "값"이라 함은 스칼라값 뿐만 아니라 벡터, 행렬도 포함하는 개념으로 정의된다.In the present specification, the term "value" is defined as a concept including not only a scalar value but also a vector and a matrix.
본 명세서에서는 본 발명이 생체 정보인 비밀 정보에 적용되는 실시예에 대해서 주로 설명하지만, 본 발명에 의한 암호화 방법 및 인증 방법은 통상적인 비밀 정보(예를 들어, 비밀 번호와 비밀키, 개인민감 정보 등)에도 적용할 수 있으며, 생체 정보에 적용되는 것으로 권리범위가 제한되어서는 아니된다.In the present specification, an embodiment in which the present invention is applied to secret information, which is biometric information, will be mainly described. However, the encryption method and the authentication method according to the present invention may include general secret information (for example, a password, a secret key, and personal sensitivity information). Etc.), and the scope of the right should not be limited as it applies to biometric information.
도 1에는 본 발명에 의한 비밀 정보 인증 방법이 수행되는 흐름도가 도시되어 있다. 본 발명에 의한 비밀 정보 인증 방법은, 비밀 정보 등록 단말기(10)와, 비밀 정보 인증 요청 단말기(20)와, 인증 서버(30)를 포함하는 환경에서 수행된다. 비밀 정보 등록 단말기(10)는, 최초에 사용자의 비밀 정보를 인증 서버(30)에 등록하기 위한 단말기이며, 비밀 정보 인증 요청 단말기(20)는 비밀 정보 등록 후 인식된 비밀 정보를 인증 서버(30)로 전송하여 비밀 정보를 인증받기 위한 단말기이다. 비밀 정보 등록 단말기(10)와 비밀 정보 인증 요청 단말기(20)는 서로 동일한 단말기일 수도 있고, 서로 다른 단말기일 수도 있다. 본 명세서에서는 서로 다른 단말기인 것으로 가정하고 설명하기로 한다. 등록되고 인증 요청되는 비밀 정보로는 예를 들어 지문 정보가 될 수 있다.1 is a flowchart illustrating a secret information authentication method according to the present invention. The secret information authentication method according to the present invention is performed in an environment including a secret information registration terminal 10, a secret information authentication request terminal 20, and an authentication server 30. The secret information registration terminal 10 is a terminal for first registering the user's secret information in the authentication server 30, and the secret information authentication request terminal 20 registers the secret information recognized after registering the secret information in the authentication server 30. It is a terminal for authenticating secret information by sending it). The secret information registration terminal 10 and the secret information authentication request terminal 20 may be the same terminal or may be different terminals. In this specification, it is assumed that the terminal is different from each other. The secret information registered and requested for authentication may be, for example, fingerprint information.
등록하고자 하는 비밀 정보를 사용자가 비밀 정보 등록 단말기(10)에 입력하면 단말기는 비밀 정보 벡터를 -1, 1 로 구성된 길이 n인 벡터 
로 생성한다. 그리고 m×n 행렬 
와 입력받은 비밀 정보 벡터 
의 곱인 
을 산출한다(100). 행렬 
는 비밀 정보 등록 단말기(10)에서 최초에 비밀 정보를 등록하는 과정을 거친 후에 단말기(10)에서 삭제할 수 있다. 행렬 
를 비밀 정보 등록 후에 삭제해 버리면 이후에 유출될 위험을 제거할 수 있다.When the user inputs the secret information to be registered in the secret information registration terminal 10, the terminal stores the secret information vector as a vector of length n consisting of -1 and 1. To create. And m × n matrix Secret information received with Is the product of Calculate (100). procession The secret information may be deleted from the terminal 10 after a process of initially registering the secret information in the registration terminal 10. procession If you delete it after registering confidential information, you can eliminate the risk of later leakage.
산출된 
는 인증 서버(30)로 전송된다(110). 행렬 
는 비밀 정보 등록 단말기(10)만 가지고 있는 값이기 때문에 인증 서버(30)로 전송되는 값은 일종의 비밀 정보 암호화 값이다. 인증 서버(30)는 전송받은 
값을 비밀 정보의 암호화값으로 등록한다(120).Calculated Is transmitted to the authentication server 30 (110). procession Since is a value having only the secret information registration terminal 10, the value transmitted to the authentication server 30 is a kind of secret information encryption value. Authentication server 30 is received The value is registered as an encrypted value of secret information (120).
비밀 정보가 등록된 후에, 비밀 정보 인증을 받고자 하는 사용자는 비밀 정보 인증 요청 단말기(20)에 자신의 비밀 정보를 판독시키거나 입력하여 비밀 정보 인증 요청 단말기(20)가 -1, 1 로 구성된 길이 n인 비밀 정보 벡터 
를 생성한다. After the secret information is registered, a user who wants to authenticate secret information reads or inputs his secret information to the secret information authentication request terminal 20 so that the secret information authentication request terminal 20 has a length of -1, 1 n secret information vector Create
그리고 비밀 정보 인증 요청 단말기(20)는, 인증 요청된 비밀 정보 벡터 
에 대해서, 
의 관계를 만족하는 벡터 
를 생성한다(130). 벡터 
는 예를 들어, (m-n)개의 성분을 임의의 값으로 랜덤하게 선택한 후에, 나머지 n개 성분을 위 관계를 만족하도록 계산하여 생성할 수 있다.And the secret information authentication request terminal 20, the secret information vector requested authentication about, Vector satisfying the relationship of Generate (130). vector For example, may be generated by randomly selecting (mn) components to an arbitrary value, and then calculating the remaining n components to satisfy the above relationship.
m과 n의 관계는 
인 것이 바람직하다. n은 비밀 정보의 차원이고, m에 의해서 보안성이 결정된다. m과 n의 차이인 k(= m-n)값이 중요한데 이는 후술하는 LWE 문제의 안전성을 담보한다. 소망하는 보안성의 정도와 다른 인수들에 따라서 차이는 있지만, 대략 k값은 500 내지 1,000을 취하는 것이 일반적이다. 예를 들어 홍채 인식의 경우 n을 2,000으로, m은 2,500으로 설정하여 k값을 500으로 할 수 있다. 물론, 본 발명은 그러한 구체적인 값에 보호범위가 제한되지 것으로 해석되지 않는다.the relationship between m and n Is preferably. n is a dimension of secret information, and security is determined by m. The value of k (= mn), which is the difference between m and n, is important, which ensures the safety of the LWE problem described later. Depending on the desired degree of security and other factors, it is common to have a value of approximately 500 to 1,000. For example, in the case of iris recognition, n may be set to 2,000 and m may be set to 2,500 to set the k value to 500. Of course, the invention is not to be interpreted as limiting the scope of protection to such specific values.
산출된 
는 인증 서버로 전송된다(140).Calculated Is sent to the authentication server (140).
비밀 정보 등록시 사용한 비밀 정보 벡터 
와, 비밀 정보 인증시 생성된 비밀 정보 벡터 
가 
이므로 
와 
의 해밍 거리(hamming distance) 
는 다음과 같이 
와 
의 내적 계산을 통해서 산출이 가능하다.Secret information vector used when registering confidential information And, secret information vector generated during secret information authentication end Because of Wow Hamming distance of As follows Wow It can be calculated through the internal product of.
두 벡터의 해밍 거리는 두 벡터의 같은 위치에 있는 원소를 비교했을 때 서로 다른 원소의 개수를 의미한다. 예를 들어, 벡터 1100과 벡터 1000의 해밍 거리는 1이고, 벡터 1111과 벡터 1100 사이의 해밍 거리는 2가 된다. 즉 비밀 정보를 벡터로 표현하면 해밍 거리가 작을수록 서로 비슷한 비밀 정보로 볼 수 있다.The Hamming distance of two vectors is the number of different elements when comparing two elements in the same position. For example, the Hamming distance between the vector 1100 and the vector 1000 is 1, and the Hamming distance between the vector 1111 and the vector 1100 is 2. In other words, if the secret information is expressed as a vector, the smaller the hamming distance, the more similar the secret information can be seen.
인증 서버(30)는 등록해 놓은 암호화된 비밀 정보 
와 벡터 
의 내적값을 산출한다(150). 이 내적값은 다음과 같은 관계를 만족한다.The authentication server 30 registers the encrypted secret information. Vector with The inner product of is calculated (150). This dot product satisfies the following relationship.
수학식 1에 의해서 비밀 정보 등록 정보 벡터 
와, 비밀 정보 인증시 생성된 비밀 정보 벡터 
의 해밍 거리 
를 
으로 산출한다(160). 이렇게 산출된 해밍 거리가 미리 정한 범위 이내라면 인증을 요청한 비밀 정보가 정당한 것으로 판별하고, 그렇지 않으면 인증 실패로 판별한다(170). 인증 성공 여부는 인증 서버(30)가 비밀 정보 인증 요청 단말기(20)로 전송한다(180).Secret information property vector by equation (1) And, secret information vector generated during secret information authentication Hamming distance of To It is calculated as (160). If the calculated hamming distance is within a predetermined range, it is determined that the secret information requesting authentication is legitimate, otherwise, it is determined as authentication failure (170). The authentication success or failure is transmitted to the authentication server 30 to the secret information authentication request terminal 20 (180).
생체 정보가 아닌 비밀정보는 노이즈가 개입할 여지가 없으므로 해밍 거리가 0이 되어야 인증에 성공한 것으로 판단한다.Secret information that is not biometrics has no room for noise, so it is determined that authentication is successful when the Hamming distance is zero.
노이즈가 없는 비밀 정보의 경우에는 해밍 거리가 0인 경우에만 인증에 성공하는 것으로 할 수 있다.In the case of secret information without noise, authentication can be successful only when the hamming distance is zero.
인증 서버(30)로 전달되는 
와 
중 적어도 어느 하나를 인증 서버(30)의 공개키로 암호화하여 전송하면 보안성이 더 고양될 수 있다.That is passed to the authentication server 30 Wow If at least one of the encrypted by the public key of the authentication server 30 is transmitted, the security can be further enhanced.
본 발명의 다른 실시예에 의하면 
(
)의 관계를 만족하도록 생성된 벡터 
를 사용할 수도 있다. 벡터 
는 
로부터 랜덤하게 선택되는 LWE 문제에 있어서의 크기가 작은 노이즈 벡터이다. 이 실시예에서는, 인증 서버(30)가 
와 
의 내적값을 산출하고, 그 내적값으로부터 수학식 1에 의해 등록된 비밀 정보 벡터 
와 인증 요청을 받은 비밀 정보 벡터에 에러값이 더해진 
의 해밍 거리를 산출하여 수학식 1에 따라서 인증 여부를 판단한다.According to another embodiment of the present invention ( A vector created to satisfy the relationship You can also use vector Is It is a noise vector having a small magnitude in the LWE problem that is randomly selected from. In this embodiment, the authentication server 30 Wow A secret information vector registered by Equation 1 from the inner product of Error value is added to the secret vector The Hamming distance is calculated to determine whether to authenticate according to Equation 1.
위 수학식 3의 관계에 따라서, 
는 작은 오차 
를 가지는 
의 근사값으로 볼 수 있다. 따라서, 비밀 정보 인증에 사용할 수 있다.According to the relationship of Equation 3 above, Is a small error Having It can be seen as an approximation of. Therefore, it can be used for secret information authentication.
이 실시예에 의하면, LWE 문제에 의해 에러가 포함되어 암호화되므로 비밀 정보 인증을 위해 전송되는 비밀 정보 
의 보안성을 더 높이는 효과가 있다.According to this embodiment, since the error is encrypted due to the LWE problem, secret information transmitted for secret information authentication It is effective to increase the security of the.
본 발명에 의하면, 비밀 정보가 암호화되어 인증 서버로 전송되므로 도중에 노출되거나 인증 서버가 공격받더라도 비밀 정보는 누출되지 않는 효과가 있다. 그리고 전술한 바와 같은 행렬 Q를 이용하여 암호화함으로써 인증 요청받은 암호화된 비밀 정보와 등록되어 있는 암호화된 비밀 정보를 복호화할 필요없이 인증 여부를 판별할 수 있기 때문에 비밀 정보가 누설될 가능성을 원천적으로 차단할 수 있다. 또한, 비밀 정보는 길이가 m인 벡터로 되어 있는 암호문의 내적값으로 인증 여부를 판별하기 때문에 기존의 방법에 비해 효율성도 고양된다.According to the present invention, since secret information is encrypted and transmitted to the authentication server, the secret information is not leaked even if it is exposed in the middle or the authentication server is attacked. By encrypting by using the matrix Q as described above, it is possible to discriminate whether or not the secret information is leaked since it is possible to determine whether to authenticate without decrypting the encrypted secret information requested for authentication and the encrypted secret information registered. Can be. In addition, since secret information is determined based on the inner product of a ciphertext having a vector of length m, the efficiency is improved.
이상 첨부 도면을 참고하여 본 발명에 대해서 설명하였지만 본 발명의 권리범위는 후술하는 특허청구범위에 의해 결정되며 전술한 실시예 및/또는 도면에 제한되는 것으로 해석되어서는 아니된다. 그리고 특허청구범위에 기재된 발명의, 당업자에게 자명한 개량, 변경 및 수정도 본 발명의 권리범위에 포함된다는 점이 명백하게 이해되어야 한다.While the invention has been described above with reference to the accompanying drawings, the scope of the invention is determined by the claims that follow, and should not be construed as limited to the embodiments and / or drawings described above. And it should be clearly understood that improvements, changes and modifications apparent to those skilled in the art of the invention described in the claims are included in the scope of the present invention.
Claims (4)
- 비밀 정보 등록 단말기와, 비밀 정보 인증 서버와, 비밀 정보 인증 요청 단말기를 포함하는 환경에서 비밀 정보 인증 서버가 수행하는 비밀 정보 인증 방법에 있어서,A secret information authentication method performed by a secret information authentication server in an environment including a secret information registration terminal, a secret information authentication server, and a secret information authentication request terminal,비밀 정보 인증 서버가, 비밀 정보 벡터와 행렬
의 곱인
를 비밀 정보 등록 단말기로부터 수신하고 저장하는 제1 단계와,Secret information authentication server, secret information vector
And matrixIs the product ofReceiving and storing the secret information from the registration terminal;비밀 정보 인증 서버가, 인증 요청된 비밀 정보 벡터에 대해서,
의 관계를 만족하도록 생성된 벡터
를 비밀 정보 인증 요청 단말기로부터 수신하는 제2 단계와,Secret authentication server, authentication requested secret information vector
about,Vector created to satisfy the relationship ofReceiving a secret information authentication request terminal from the terminal;비밀 정보 인증 서버가,와
의 내적값(inner product)을 산출하는 제3 단계와,Secret authentication server,
WowA third step of calculating the inner product of,비밀 정보 인증 서버가,을 산출하고, 이 값이 소정의 값보다 작거나 같은 경우에 비밀 정보 인증에 성공한 것으로 판별하고, 그 이외의 경우에는 비밀 정보 인증 실패로 판별하는 제4 단계를 포함하는,Secret authentication server,
And a fourth step of determining that the secret authentication is successful when the value is less than or equal to the predetermined value, and otherwise determining the secret authentication failure.비밀 정보 인증 방법.Secret authentication method. - 비밀 정보 등록 단말기와, 비밀 정보 인증 서버와, 비밀 정보 인증 요청 단말기를 포함하는 환경에서 비밀 정보 인증 서버가 수행하는 비밀 정보 인증 방법에 있어서,A secret information authentication method performed by a secret information authentication server in an environment including a secret information registration terminal, a secret information authentication server, and a secret information authentication request terminal,비밀 정보 인증 서버가, 비밀 정보 벡터와 행렬
의 곱을 비밀 정보 등록 단말기로부터 수신하는 제1 단계와,Secret information authentication server, secret information vector
And matrixA first step of receiving a product of the secret information registration terminal;비밀 정보 인증 서버가, 인증 요청된 비밀 정보 벡터와 에러벡터(
)에 대해서,
의 관계를 만족하도록 생성된 벡터
를 비밀 정보 인증 요청 단말기로부터 수신하는 제2 단계와,Secret authentication server, authentication requested secret information vector
And error vector ()about,Vector created to satisfy the relationship ofReceiving a secret information authentication request terminal from the terminal;비밀 정보 인증 서버가,와
의 내적값(inner product)을 산출하는 제3 단계와,Secret authentication server,
WowA third step of calculating the inner product of,비밀 정보 인증 서버가,을 산출하고, 이 값이 소정의 값보다 작거나 같은 경우에 비밀 정보 인증에 성공한 것으로 판별하고, 그 이외의 경우에는 비밀 정보 인증 실패로 판별하는 제4 단계를 포함하는,Secret authentication server,
And a fourth step of determining that the secret authentication is successful when the value is less than or equal to the predetermined value, and otherwise determining the secret authentication failure.비밀 정보 인증 방법.Secret authentication method. - 청구항 1 또는 청구항 2에 있어서,The method according to claim 1 or 2,제1 단계 수행 후 행렬는 비밀 정보 등록 단말기로부터 삭제되는,Matrix after the first step
Is deleted from the secret registration terminal,비밀 정보 인증 방법.Secret authentication method. - 청구항 1 또는 청구항 2에 있어서,The method according to claim 1 or 2,및
중 적어도 어느 하나는 공개키로 암호화되어 전송되는,
AndAt least one of which is encrypted with a public key and transmitted,비밀 정보 인증 방법.Secret authentication method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US16/519,865 US11032273B2 (en) | 2017-04-29 | 2019-07-23 | Method for authenticating secret information which protects secret information |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR10-2017-0055803 | 2017-04-29 | ||
| KR1020170055803A KR101838008B1 (en) | 2017-04-29 | 2017-04-29 | Method for Authenticating Biometric Information Which Protects Biometric Information |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US16/519,865 Continuation-In-Part US11032273B2 (en) | 2017-04-29 | 2019-07-23 | Method for authenticating secret information which protects secret information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2018199713A1 true WO2018199713A1 (en) | 2018-11-01 |
Family
ID=61660791
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/KR2018/005012 WO2018199713A1 (en) | 2017-04-29 | 2018-04-30 | Biometric information authentication method for protecting biometric information |
Country Status (2)
| Country | Link |
|---|---|
| KR (1) | KR101838008B1 (en) |
| WO (1) | WO2018199713A1 (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR102019388B1 (en) * | 2018-07-26 | 2019-09-06 | 주식회사 크립토랩 | High Speed Biometric Authentication with Biometric Privacy |
| US11032273B2 (en) | 2017-04-29 | 2021-06-08 | Crypto Lab Inc. | Method for authenticating secret information which protects secret information |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20090042143A (en) * | 2007-10-24 | 2009-04-29 | 한국전자통신연구원 | Biometric authentication method |
| KR100911594B1 (en) * | 2006-10-04 | 2009-08-07 | 가부시키가이샤 히타치세이사쿠쇼 | Biometric authentication system, registration terminal, authentication terminal and authentication server |
| KR20100013486A (en) * | 2008-07-31 | 2010-02-10 | 한국전자통신연구원 | Biometric authentication method, client and server |
| JP2012022507A (en) * | 2010-07-14 | 2012-02-02 | Ntt Data Corp | Authentication system, authentication method, authentication server and authentication program |
| JP2013120580A (en) * | 2011-12-09 | 2013-06-17 | Hitachi Ltd | Biometric authentication system |
-
2017
- 2017-04-29 KR KR1020170055803A patent/KR101838008B1/en active IP Right Grant
-
2018
- 2018-04-30 WO PCT/KR2018/005012 patent/WO2018199713A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100911594B1 (en) * | 2006-10-04 | 2009-08-07 | 가부시키가이샤 히타치세이사쿠쇼 | Biometric authentication system, registration terminal, authentication terminal and authentication server |
| KR20090042143A (en) * | 2007-10-24 | 2009-04-29 | 한국전자통신연구원 | Biometric authentication method |
| KR20100013486A (en) * | 2008-07-31 | 2010-02-10 | 한국전자통신연구원 | Biometric authentication method, client and server |
| JP2012022507A (en) * | 2010-07-14 | 2012-02-02 | Ntt Data Corp | Authentication system, authentication method, authentication server and authentication program |
| JP2013120580A (en) * | 2011-12-09 | 2013-06-17 | Hitachi Ltd | Biometric authentication system |
Also Published As
| Publication number | Publication date |
|---|---|
| KR101838008B1 (en) | 2018-03-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20230325491A1 (en) | Method and System for Securing User Access, Data at Rest and Sensitive Transactions Using Biometrics for Mobile Devices with Protected, Local Templates | |
| EP3320662B1 (en) | Method of securing authentication in electronic communication | |
| CN112926092A (en) | Privacy-protecting identity information storage and identity authentication method and device | |
| EP3040898A1 (en) | System and method for obfuscating an identifier to protect the identifier from impermissible appropriation | |
| US20050114686A1 (en) | System and method for multiple users to securely access encrypted data on computer system | |
| CN1509546A (en) | Platform and method for securely transmitting authorization data | |
| US11227037B2 (en) | Computer system, verification method of confidential information, and computer | |
| KR20120007509A (en) | Method for authenticating identity and generating share key | |
| US20040059919A1 (en) | Security system for preventing a personal computer from being used by an unauthorized people | |
| CN116362747A (en) | Block chain digital signature system | |
| US20090064273A1 (en) | Methods and systems for secure data entry and maintenance | |
| CN110401538A (en) | Data ciphering method, system and terminal | |
| US10263780B2 (en) | Encryption and authentication method and apparatus | |
| CN112035860A (en) | File encryption method, terminal, device, equipment and medium | |
| WO2018199713A1 (en) | Biometric information authentication method for protecting biometric information | |
| JP2022093492A (en) | Data extraction system, data extraction method, registration device, and program | |
| CN110968878A (en) | Information transmission method, system, electronic device and readable medium | |
| Adam et al. | Multilevel Authentication Scheme for Cloud Computing | |
| WO2017005230A1 (en) | Method of authenticating communication of an authentication device and at least one authentication server using local factor | |
| CN111262702A (en) | Double-factor authentication method, device and system based on cryptographic algorithm and biological characteristics | |
| WO2020130297A1 (en) | Method for storing and recovering confidential information in server | |
| KR102019388B1 (en) | High Speed Biometric Authentication with Biometric Privacy | |
| Subhashini et al. | Protecting password piracy using authentication protocol | |
| WO2016159538A1 (en) | System and method for pin authentication | |
| US20240095410A1 (en) | Neural network cryptography coprocessor providing countermeasture against side-channel analysis |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 18791169 Country of ref document: EP Kind code of ref document: A1 |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 18791169 Country of ref document: EP Kind code of ref document: A1 |