A simple scheme for constructing fault-tolerant passwords from biometric data

Authors:
Vladimir B. Balakirsky;A. J. Han Vinck
Affiliations:
Institute for Experimental Mathematics, University of Duisburg-Essen, Essen, Germany;Institute for Experimental Mathematics, University of Duisburg-Essen, Essen, Germany
Venue:
EURASIP Journal on Information Security
Year:
2010

Citing 8
Cited 0

Efficient balanced codes

IEEE Transactions on Information Theory
Universal hashing and authentication codes

Designs, Codes and Cryptography
A fuzzy commitment scheme

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Error-tolerant password recovery

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Guide to Biometrics

Guide to Biometrics
Hashing of Databases with the Use of Metric Properties of the Hamming Space

The Computer Journal
Additive Block Coding Schemes for Biometric Authentication with the DNA Data

Biometrics and Identity Management
Combinatorial data reduction algorithm and its applications to biometric verification

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple combinatorial construction for the mapping of the biometric vectors to short strings, called the passwords. A verifier has to decide whether a given vector can be considered as a corrupted version of the original biometric vector whose password is known or not. The evaluations of the compression factor, the false rejection/acceptance rates, are derived, and an illustration of a possible implementation of the verification algorithm for the DNA data is presented.