• Article / Chapter
  • A Simple Scheme for Constructing Fault-Tolerant Passwords from Biometric…

A Simple Scheme for Constructing Fault-Tolerant Passwords from Biometric Data

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.

Preview

Category

Date Issued:
19.10.2010
URN:
urn:nbn:de:hbz:464-20180814-143505-5
DOI:
10.1155/2010/819376
Language:
English
Type of Resource:
Text
Keywords:
Short Tandem Repeat; Conditional Probability Distribution; Short Tandem Repeat Locus; False Acceptance Rate; False Rejection Rate
Collection:
E-Publications
Dewey Decimal Classification:
510 Mathematics
Subject categories of the Deutsche Nationalbibliografie:
510 Mathematics
Hosting institution:
Scientific institutes, Institute for Experimental Mathematics (IEM) Essen
Info on primary publication:
EURASIP Journal on Information Security, 2010, 2010:819376; published: 19 October 2010
restriction:
Copyright © 2010 V. B. Balakirsky and A. J. H. Vinck. This is an open-access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
funding:
The publication of this article was supported by the Publication Fund of the University of Duisburg-Essen.

Cite

Citation style:
Could not load citation form.

Rights

Use and reproduction:
This work may be used under a
CC BY 1.0 LogoCreative Commons Attribution 1.0 License (CC BY 1.0)
.