On enabling secure applications through off-line biometric identification

Davida, George I.; Frankel, Yair; Matt, Brian J.

doi:10.1109/secpri.1998.674831

Cited by 296 publications

(220 citation statements)

References 11 publications

Supporting

Mentioning

215

Contrasting

Unclassified

Order By: Relevance

“…Davida et al [6] were the first to propose a biometric cryptosystem applied to iris biometrics, which they refer to as "private template scheme". In their private template scheme a representative feature vector is concatenated with an error correction code.…”

Section: Previous Workmentioning

confidence: 99%

“…With respect to iris biometrics [2] several approaches have been proposed [3,4,5]. Yet, most existing approaches (based on key-binding schemes) are constrained to store biometric data bound with cryptographic keys involving the application of error correction codes [6,7]. Since biometric information, especially within iriscodes, is not distributed uniformly random and error correction codes underlie specific structures, stored templates are found to suffer from low entropy [8].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Privacy Preserving Key Generation for Iris Biometrics

Rathgeb

Uhl

2010

Communications and Multimedia Security

View full text Add to dashboard Cite

Abstract. In this work we present a new technique for generating cryptographic keys out of iris textures implementing a key-generation scheme. In contrast to existing approaches to iris-biometric cryptosystems the proposed scheme does not store any biometric data, neither in raw nor in encrypted form, providing high secrecy in terms of template protection. The proposed approach is tested on a widely used database revealing key generation rates above 95%.

show abstract

Section: Previous Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Privacy Preserving Key Generation for Iris Biometrics

Rathgeb

Uhl

2010

Communications and Multimedia Security

View full text Add to dashboard Cite

show abstract

“…Error correcting codes [3] have succesfully been utilized in such situations of recovering changed data and their use might be appropriate here. Indeed, Davida et al [4] presented an authentication algorithm based on error correcting codes. In this algorithm, error-correcting digits are generated from the biometric data and some other verifying data, and stored in the database.…”

Section: Previous Workmentioning

confidence: 99%

Symmetric hash functions for secure fingerprint biometric systems

Tulyakov

Farooq

Mansukhani

et al. 2007

Pattern Recognition Letters

102

View full text Add to dashboard Cite

Securing biometrics databases from being compromised is one of the most important challenges that must be overcome in order to demonstrate the viability of biometrics based authentication. In this paper we present a novel method of hashing fingerprint minutia and performing fingerprint identification in the hash space. Our approach uses a family of symmetric hash functions and does not depend on the location of the (usually unstable) singular points (core and delta). In fact, most approaches of hashing minutia and developing a cancellable system described in the literature assume the location of the singular points. Others assume a pre-alignment between the test and the stored fingerprint templates. These assumptions are unrealistic given that fingerprints are very often only partially captured by the commercially available sensors. The Equal Error Rate (EER) achieved by our system is about 3%. We also present the performance analysis of a hybrid system that has an EER of about 2% which is very close to the performance of plain matching in the minutia space.

show abstract

“…[7] and references therein). Security and privacy issues in biometrics have been independently recognized and advocated by many researchers (see, e.g., [3,15,16]). …”

Section: Introductionmentioning

confidence: 99%

Approximate Message Authentication and Biometric Entity Authentication

Crescenzo¹,

Graveman²,

et al. 2005

Financial Cryptography and Data Security

View full text Add to dashboard Cite

Abstract. Approximate Message Authentication Code (AMAC) is a recently introduced cryptographic primitive with several applications in the areas of cryptography and coding theory. Briefly speaking, AMACs represent a way to provide data authentication that is tolerant to acceptable modifications of the original message. Although constructs had been proposed for this primitive, no security analysis or even modeling had been done. In this paper we propose a rigorous model for the design and security analysis of AMACs and show how to transform any ordinary MAC into an AMAC. Our constructions have short output, leading to efficient storage or communication complexity. AMACs is a useful primitive with several applications of different nature. A major one, that we study in this paper, is that of entity authentication via biometric techniques or passwords over noisy channels. We present a formal model for the design and analysis of biometric entity authentication schemes and show simple and natural constructions of such schemes using any AMAC.

show abstract

On enabling secure applications through off-line biometric identification

Abstract: Abstract

Cited by 296 publications

References 11 publications

Privacy Preserving Key Generation for Iris Biometrics

Privacy Preserving Key Generation for Iris Biometrics

Symmetric hash functions for secure fingerprint biometric systems

Approximate Message Authentication and Biometric Entity Authentication

Contact Info

Product

Resources

About