• 정보보호학회논문지
• /
• 제18권2호
• /
• pp.33-38
• /
• 2008

바이오정보를 이용한 사용자 인증시스템은 편리함과 동시에 강력한 보안을 제공할 수 있다. 그러나 사용자 인증을 위해 저장된 중요한 바이오정보가 타인에게 도용된다면 심각한 문제를 일으킨다. 따라서 타인에게 유출되더라도 재사용이 불가능하도록 하기 위하여 사용자의 바이오정보에 역변환이 불가능한 함수를 적용하여 저장하고 변환된 상태에서 인증과정을 수행할 수 있는 방법이 필요하다. 본 논문에서는 최근 지문 템플릿 보호를 위해 활발히 연구되고 있는 지문 퍼지볼트의 빠른 다항식 복원 방법을 제안한다. 제안된 방법은 (k-1)차 다항식을 복원하기 위해 (k+1)개의 real point를 필요로 하며, 전수조사에 비해서 수행속도가 다항식의 차수에 따라 약 $300{\sim}1500$배 향상되는 효과를 가져왔다.

• 정보보호학회논문지
• /
• 제16권6호
• /
• pp.37-46
• /
• 2006

생체 정보를 사용하는 시스템에 암호학적 단방향 함수를 직접적으로 적용하는 것은 어려운 것으로 알려져 있다. 이러한 문제를 해결하기 위한 한 가지 방법으로써, 치환 변환 기법이 존재한다. 그러나 그 기법에서는 실험을 통한 구체적인 알고리즘이나 변환 기법에 따른 성능 분석을 직접 보여주지 않았다. 이 논문에서는 변환 기법의 인식률을 실험을 통하여 보여줌으로써 기법이 올바르게 동작한다는 사실을 보인다. 또한 실험 결과를 보여주는데 있어서 LDA에 치환 변환 기법을 적용하였다. 반대로 우리는 또한 치환 변환 기법에 반하는 새로운 공격에 대해서 소개하고, 마지막으로 이 문제를 해결할 수 있는 치환 변환 기법의 일반화를 간략히 소개한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.2221-2234
• /
• 2011

The fuzzy vault scheme has emerged as a promising solution to user privacy and fingerprint template security problems. Recently, however, the fuzzy vault scheme has been shown to be susceptible to a correlation attack. This paper proposes a novel scheme for one-time templates for fingerprint authentication based on the fuzzy vault scheme. As in one-time passwords, the suggested method changes templates after each completion of authentication, and thus the compromised templates cannot be reused. Furthermore, a huge number of chaff minutiae can be added by expanding the size of the fingerprint image. Therefore, the proposed method can protect a user's fingerprint minutiae against the correlation attack. In our experiments, the proposed approach can improve the security level of a typical approach against brute-force attack by the factor of $10^{34}$.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.331-332
• /
• 2006

To enhance security and privacy in biometrics, changeable (or cancelable) biometrics have recently been introduced. The idea is to transform a biometric signal or feature into a new one for enrollment and matching. In this paper, we proposed changeable biometrics for face recognition using on PCA based approach. PCA coefficient vector extracted from an input face image. The vector is scrambled randomly and removed. When a transformed template is compromised, it is replaced by a new scrambling rule. In our experiment, we compared the performance between when PCA coefficient vectors are used for verification and when the transformed coefficient vectors are used for verification.

• ETRI Journal
• /
• 제32권6호
• /
• pp.950-960
• /
• 2010

In response to increased security concerns, biometrics is becoming more focused on overcoming or complementing conventional knowledge and possession-based authentication. However, biometric authentication requires special care since the loss of biometric data is irrecoverable. In this paper, we present a biometric authentication framework, where several novel techniques are applied to provide security and privacy. First, a biometric template is saved in a transformed form. This makes it possible for a template to be canceled upon its loss while the original biometric information is not revealed. Second, when a user is registered with a server, a biometric template is stored in a special form, named a 'soft vault'. This technique prevents impersonation attacks even if data in a server is disclosed to an attacker. Finally, a one-time template technique is applied in order to prevent replay attacks against templates transmitted over networks. In addition, the whole scheme keeps decision equivalence with conventional face authentication, and thus it does not decrease biometric recognition performance. As a result, the proposed techniques construct a secure face authentication framework in open networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.968-988
• /
• 2010

Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key, and it additionally provide the anonymity of identity in ciphertexts. Using the anonymous HIBE schemes, it is possible to construct anonymous communication systems and public key encryption with keyword search. This paper presents an anonymous HIBE scheme with constant size ciphertexts under prime order symmetric bilinear groups, and shows that it is secure under the selective security model. Previous anonymous HIBE schemes were constructed to have linear size ciphertexts, to use composite order bilinear groups, or to use asymmetric bilinear groups that is a special type of bilinear groups. Our construction is the first efficient anonymous HIBE scheme that has constant size ciphertexts and that uses prime order symmetric bilinear groups. Compared to the previous scheme of composite order bilinear groups, ours is ten times faster. To achieve our construction, we first devise a novel cancelable random blinding technique. The random blinding property of our technique provides the anonymity of our construction, and the cancellation property of our technique enables decryption.