Lehigh University
COLLEGE HOME | LEHIGH HOME | SEARCH



•  Biometrics Research Archive Homepage


   

Verbose Keyword Index: "biometrics"


Note:  the material below is archived for the use of researchers collaborating on projects involving the Lehigh University Pattern Recognition Research (PatRec) Lab. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. While you may bookmark this page, please do not link to it from public webpages.



[A05]   "Vulnerabilities in Biometric Encryption Systems", Andy Adler, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, July 2005, Rye Brook, NY, pp. 1100-1109.
Keyword(s):   biometrics
Links:
(PDF 321 kbytes), (concise)
Abstract:
The goal of a biometric encryption system is to embed a secret into a biometric template in a way that can only be decrypted with a biometric image from the enroled person. This paper describes a potential vulnerability in such systems that allows a less-than-brute force regeneration of the secret and an estimate of the enrolled image. This vulnerability requires the biometric comparison to "leak" some information from which an analogue for a match score may be calculated. Using this match score value, a "hill-climbing" attack is performed against the algorithm to calculate an estimate of the enrolled image, which is then used to decrypt the code. Results are shown against a simplified implementation of the algorithm of Soutar et al. (1998).
Bibtex:
@incollection{A05,
author = "Andy Adler",
title = "Vulnerabilities in Biometric Encryption Systems",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3546,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
address = "Berlin, Germany"
year = 2005,
pages = "1100-1109",
}
Comment(s):
By Dishant on August 18, 2005:
This paper talks about breaking biometric encryption algorithm using less than a brute force attack.

[BA03]   "Multifactor Biometric Sketch Authentication," Arslan Brömme and Stephan Al-Zubi, Proceedings of the First Conference on Biometrics and Electronic Signatures of the GI Working Group BIOSIG, July 2003, Darmstadt, Germany, pp. 81-90.
Keyword(s):   biometrics, handwriting
Links:
(PDF 1938 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper talks about handwritten sketch authentication. The paper goes further proving that the reliability of handwritten sketch can be augmented by systematically adding user's knowledge about sketch's content.

[BCPRS02]   "Biometrics 101," Rudolf M. Bolle, Jonathan Connell, Sharathchandra Pankanti, Nalini K. Ratha, Andrew W. Senior, IBM Research Report, RC22481 (W0206-033), June 2002.
Keyword(s):   biometrics
Links:
(PDF 1095 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This thesis discusses in detail various aspects of biometric authentication system.

[BP93]   "Segmenting Handwritten Signatures at Their Perceptually Important Points," Jean-Jules Brault and Rejean Plamondon, International Journal of Pattern Analysis and Machine Intelligence, volume 15, number 9, September 1993, pp. 953-957.
Keyword(s):   handwriting, biometrics
Links:
(PDF 726 kbytes), (concise)
Abstract:
This correspondence describes a new algorithm for segmenting continuous handwritten signatures sampled by a digitizer. Tbe segmentation points are found by means of a two-step procedure. The principal step is to construct a function that weights the perceptual importance of every signature point according to its specific neighboring points. The second step points out the various IocaI maxima of tbis function that correspond wheR the signature should be segmented. The method is well illustrated and tested on a number of signatures that requin different kinds of segmentation decisions.
Bibtex:
@article{BP93,
author = "Jean-Jules Brault and Rejean Plamondon",
title = "Segmenting Handwritten Signatures at Their Perceptually Important Points",
journal = "International Journal of Pattern Analysis and Machine Intelligence",
volume = 15,
number = 9,
year = 1993,
pages = "953-957",
}

[CZC04]   "Biometrics-Based Cryptographic Key Generation," Yuo-Jen Chang, Wende Zhung, and Tsiihun Chen, Proceedings of the International Conference on Multimedia and Expo, June 2004, pp. 2203-2206.
Keyword(s):   biometrics
Links:
(PDF 314 kbytes), (concise)
Abstract:
Instead of using PINs and passwords as cryptographic keys that are either easy to forget or vulnerable to dictionary attacks, easy-to-carry and difficult-to-transfer keys can be generated based on user-specific biometric information. In this paper, a framework is proposed to generate stable cryptographic keys from biometric data that is unstable in nature. The proposed framework differs from prior work in that user-dependent transforms are utilized to generate more compact and distinguishable features. Thereby, a longer and more stable bitstream can be generated as the cryptographic key. Experiments are performed on one face database to verify the feasibility of the proposed framework. The preliminary result is very encouraging.
Bibtex:
@inproceedings{CZC04,
author = {Yuo-Jen Chang and Wende Zhung and Tsiihun Chen},
title = {Biometrics-Based Cryptographic Key Generation},
booktitle = {Proceedings of the International Conference on Multimedia and Expo},
volume = {3},
pages = {2203-2206},
year = {2004}
}

[DRS04]   "Fuzzy Extractors and Cryptography, or How to Use Your Fingerprints," Yevgeniy Dodis, Leonid Reyzin, and Adam Smith, Proceedings of the 11th ACM Conference on Computer and Communications Security, 2004, pp. 82-91.
Keyword(s):   biometrics
Links:
(PDF 215 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper describes the technique to convert the biometric data (stored in the fingerprints) into keys. The paper further talks about the use of these keys for user aunthentication.

[E02]   "Development of a Biometric Testing Protocol for Dynamic Signature Verification," Stephen J. Elliott, Proceedings of the International Conference on Automation, Robotics, and Computer Vision, 2002, Singapore.
Keyword(s):   biometrics, handwriting
Links:
(PDF 139 kbytes), (concise)
Abstract:
This paper accounts the testing protocols used at the author's university. It examines the experiences of one particular study in dynamic signature verification. The paper also outlines some additions to the current UK Biometric Working Group Best Practice document.
Bibtex:
@inproceedings{E02,
author = "Stephen J. Elliott",
title = "Development of a Biometric Testing Protocol for Dynamic Signature Verification",
booktitle = "Proceedings of the International Conference on Automation, Robotics, and Computer Vision",
year = 2002,
address = "Singapore",
}

[F97]   "Signature verification revisited: promoting practical exploitation of biometric technology," M. C. Fairhurst, Electronics & Communication Engineering Journal, December 1997, pp. 273-280.
Keyword(s):   biometrics, handwriting
Links:
(PDF 1845 kbytes), (concise)
Abstract:
Despite research over a long period, biometric approaches to authenticating personal identity have not met with the degree of success in practical applications originally predicted. This paper discusses approaches to biometric testing, focusing particularly on automatic signature verification, and addresses some of the important issues which might help to promote the introduction of practical systems in the future. Examples associated with the adoption of an explicitly flexible approach to signature verification are used to illustrate the discussion, and it is argued that there is still considerable potential for practical exploitation of this type of technology.
Bibtex:
@article{F97,
author = "M. C. Fairhurst",
title = "Signature verification revisited: promoting practical exploitation of biometric technology",
journal = "Electronics \& Communication Engineering Journal",
month = "December",
year = 1997,
pages = "273-280",
}

[FK02]   "Strategies for exploiting signature verification based on complexity estimates," M. C. Fairhurst and E. Kaplani, Proceedings of the BMVA Symposium on Advancing Biometric Technologies, March 2002.
Keyword(s):   biometrics, handwriting
Links:
(PDF 17 kbytes), (concise)
Bibtex:
@inproceedings{FK02,
author = "M. C. Fairhurst and E. Kaplani",
title = "Strategies for exploiting signature verification based on complexity estimates",
booktitle = "Proceedings of the BMVA Symposium on Advancing Biometric Technologies",
month = "March",
year = 2002,
}

[FNLOM05]   "An On-Line Signature Verification System Based on Fusion of Local and Global Information," Julian Fierrez-Aguilar, Loris Nanni, Jaime Lopez-Peñalba, Javier Ortega-Garcia, and Davide Maltoni, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, July 2005, Rye Brook, NY, pp. 523-532.
Keyword(s):   biometrics, handwriting
Links:
(PDF 446 kbytes), (concise)
Abstract:
An on-line signature verification system exploiting both local and global information through decision-level fusion is presented. Global information is extracted with a feature-based representation and recognized by using Parzen Windows Classifiers. Local information is extracted as time functions of various dynamic properties and recognized by using Hidden Markov Models. Experimental results are given on the large MCYT signature database (330 signers, 16500 signatures) for random and skilled forgeries. Feature selection experiments based on feature ranking are carried out. It is shown experimentally that the machine expert based on local information outperforms the system based on global analysis when enough training data is available. Conversely, it is found that global analysis is more appropriate in the case of small training set size. The two proposed systems are also shown to give complementary recognition information which is successfully exploited using decision-level score fusion.
Bibtex:
@incollection{FNLOM05,
author = "Julian Fierrez-Aguilar and Loris Nanni and Jaime Lopez-Pe\~{n}alba and Javier Ortega-Garcia and Davide Maltoni",
title = "An On-Line Signature Verification System Based on Fusion of Local and Global Information",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3546,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
address = "Berlin, Germany"
year = 2005,
pages = "523-532",
}
Comment(s):
By Dishant on August 18, 2005:
This paper describes the "online signature verification" system which, through decision level score fusion, uses both local and global information extracted from a signature.

[FW02]   "Private Key Generation from On-Line Handwritten Signatures," Feng Hao and Choong Wah Chan, Information Management & Computer Security, volume 10, number 2, 2002, pp. 159-164.
Keyword(s):   authentication, biometrics, handwriting
Links:
(PDF 322 kbytes), (concise)
Abstract:
In recent years, public key infrastructure (PKI) has emerged as co-existent with the increasing demand for digital security. A digital signature is created using existing public key cryptography technology. This technology will permit commercial transactions to be carried out across insecure networks without fear of tampering or forgery. The relative strength of digital signatures relies on the access control over the individual's private key. The private key storage, which is usually password-protected, has long been a weak link in the security chain. In this paper, we describe a novel and feasible system -- BioPKI cryptosystem -- that dynamically generates private keys from users' on-line handwritten signatures. The BioPKI cryptosystem eliminates the need of private key storage. The system is secure, reliable, convenient and non-invasive. In addition, it ensures non-repudiation to be addressed on the maker of the transaction instead of the computer where the transaction occurs.
Bibtex:
@article{FW02,
author = "Feng Hao and Choong Wah Chan",
title = "Private Key Generation from On-Line Handwritten Signatures",
journal = "Information Management \& Computer Security",
volume = 10,
number = 2,
year = 2002,
pages = "159-164",
}

[G04]   "The Repeatability of Signatures," Richard M. Guest, Proceedings of the Ninth International Workshop on Frontiers in Handwriting Recognition, October 2004, pp. 492-497.
Keyword(s):   biometrics, handwriting
Links:
(PDF 83 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper talks about the wide range of commonly used repeatable features both within a single singature capture session and across multiple sessions. The paper also investigates the particular physical characteristics of individual signatures in order to assess factors of repeatability.

[GDR00]   "Off-Line Skilled Forgery Detection Using Stroke and Sub-stroke Properties," Jinhong K. Guo, David Doermann, and Azriel Rosenfeld, Proceedings of the Fifteenth International Conference on Pattern Recognition, vol. 2, September 2000, pp. 2355-2358.
Keyword(s):   biometrics, handwriting
Links:
(PDF 361 kbytes), (concise)
Abstract:
Research has been active in the field of forgery detection, but relatively little work has been done on the detection of skilled forgeries. In this paper, we present an algorithm for detecting skilled forgeries based on a local correspondence between a questioned signature and a model obtained a priori. Writer-dependent properties are measured at the substroke level and a cost function is trained for each writer. When a candidate signature is presented, the same features are extracted and matched against the model. We present a description of the features and experimental results.
Bibtex:
@inproceedings{GDR00,
author = {Jinhong K. Guo and David Doermann and Azriel Rosenfeld},
title = {Off-Line Skilled Forgery Detection Using Stroke and Sub-stroke Properties},
booktitle = {Proceedings of the Fifteenth International Conference on Pattern Recognition},
volume = {2},
pages = {2355-2358},
year = {2000},
}

[GK95]   "A Robust Speaker Verification Biometric," M. H. George and R. A. King, Proceedings of IEEE 29th Annual International Carnahan Conference on Security Technology, pp. 41-46, October 1995.
Keyword(s):   biometrics, speech
Links:
(PDF 267 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper discusses about TESPAR/FANN, a new digital data/artifical neural network combination which is proving highly effective in speaker verification area and in other key non-speech applications.

[GN03]   "Computation of Cryptographic Keys from Face Biometrics" Alwyn Goh and David C. L. Ngo, Proceedings of Communications and Multimedia Security, 2003, pp. 1-13.
Keyword(s):   biometrics
Links:
(PDF 275 kbytes), (concise)
Abstract:
We outline cryptographic key­computation from biometric data based on error-tolerant transformation of continuous-valued face eigenprojections to zero-error bitstrings suitable for cryptographic applicability. Biohashing is based on iterated inner-products between pseudorandom and userspecific eigenprojections, each of which extracts a single-bit from the face data. This discretisation is highly tolerant of data capture offsets, with same-user face data resulting in highly correlated bitstrings. The resultant user identification in terms of a small bitstring-set is then securely reduced to a single cryptographic key via Shamir secret-sharing. Generation of the pseudorandom eigenprojection sequence can be securely parameterised via incorporation of physical tokens. Tokenised bio-hashing is rigorously protective of the face data, with security comparable to cryptographic hashing of token and knowledge key-factors. Our methodology has several major advantages over conventional biometric analysis ie elimination of false accepts (FA) without unacceptable compromise in terms of more probable false rejects (FR), straightforward key-management, and cryptographically rigorous commitment of biometric data in conjunction with verification thereof.
Bibtex:
@inproceedings{GN03,
author = "Alwyn Goh and David C. L. Ngo",
title = "Computation of Cryptographic Keys from Face Biometrics",
booktitle = "Proceedings of Communications and Multimedia Security",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 2828,
year = 2003,
pages = "1-13",
}

[HB03]   "A Set of Novel Features for Writer Identification", Caroline Hertel and Horst Bunke, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, June 2003, Guildford, England, pp. 679-687.
Keyword(s):   biometrics, handwriting
Links:
(PDF 189 kbytes), (concise)
Abstract:
A system for writer identification is described in this paper. It first segments a given page of handwritten text into individual lines and then extracts a set of features from each line. These features are subsequently used in a k-nearest-neighbor classifier that compares the feature vector extracted from a given input text to a number of prototype vectors coming from writers with known identity. The proposed method has been tested on a database holding pages of handwritten text produced by 50 writers. On this database a recognition rate of about 90% has been achieved using a single line of handwritten text as input. The recognition rate is increased to almost 100% if a whole page of text is provided to the system.
Bibtex:
@incollection{HB03,
author = "Caroline Hertel and Horst Bunke",
title = "A Set of Novel Features for Writer Identification",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 2688,
editor = "Josef Kittler and Mark S. Nixon",
address = "Berlin, Germany"
year = 2003,
pages = "679-687",
}
Comment(s):
By Dishant on September 13, 2005:
This paper discusses about text independent writer identification system. The system uses k-nearest-neighbor classifier for identification purposes. Moreover, the best part of the system is that it works even if the single line of text is available from a writer.

[HMM05]   "Modification of Intersession Variability in On-Line Signature Verifier," Yasunori Hongo, Daigo Muramatsu, and Takashi Matsumoto, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, July 2005, Rye Brook, NY, pp. 455-463.
Keyword(s):   biometrics, handwriting
Links:
(PDF 424 kbytes), (concise)
Abstract:
For Pen-input on-line signature verification algorithms, the influence of intersession variability is a considerable problem because hand-written signatures change with time, causing performance degradation. In our previous work, we proposed a user-generic model using AdaBoost. However, this model did not allow for the fact that features of signatures change over time. In this paper, we propose a template renewal method to reduce the performance degradation caused by signature changes over time. In our proposed method, the oldest template is replaced with a new one if the new signature data gives rise to an index which exceeds a threshold value. No further learning is necessary. A preliminary experiment was conducted on a subset of the MCYT database.
Bibtex:
@incollection{HMM05,
author = "Yasunori Hongo, Daigo Muramatsu, and Takashi Matsumoto",
title = "Modification of Intersession Variability in On-Line Signature Verifier",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3546,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
address = "Berlin, Germany"
year = 2005,
pages = "455-463",
}
Comment(s):
By Dishant on August 18, 2005:
This paper talks about the template renewal method to reduce the performance degradation caused by the signature changes over time.

[HN06]   "Inferring Motor Programs from Images of Handwritten Digits," Geoff Hinton and Vinod Nair, in Advances in Neural Information Processing Systems, Y. Weiss and B. Schölkopf and J. Platt, eds., Cambridge, MA: MIT Press, 2006.
Keyword(s):   biometrics, handwriting, generative models
Links:
(PDF 203 kbytes), (concise)
Abstract:
We describe a generative model for handwritten digits that uses two pairs of opposing springs whose stiffnesses are controlled by a motor program. We show how neural networks can be trained to infer the motor programs required to accurately reconstruct the MNIST digits. The inferred motor programs can be used directly for digit classification, but they can also be used in other ways. By adding noise to the motor program inferred from an MNIST image we can generate a large set of very different images of the same class, thus enlarging the training set available to other methods. We can also use the motor programs as additional, highly informative outputs which reduce overfitting when training a feed-forward classifier.
Bibtex:
@incollection{HN06,
title = "Inferring Motor Programs from Images of Handwritten Digits",
author = "Geoff Hinton and Vinod Nair",
booktitle = "Advances in Neural Information Processing Systems 18",
editor = "Y. Weiss and B. Sch\"{o}lkopf and J. Platt",
publisher = "MIT Press",
address = "Cambridge, MA",
year = 2006,
}

[HY03]   "Stability and Style-Variation Modeling for On-line Signature Verification," Kai Huang and Hong Yan, Pattern Recognition, vol. 36, 2003, pp. 2253-2270.
Keyword(s):   biometrics, handwriting
Links:
(PDF 409 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper describes the SDG (structure description graph) based stability modeling technique of handwritings in context of online signature verification.

[JU03]   "Hiding Biometric Data," Anil K. Jain and Umut Uludag, International Journal of Pattern Analysis and Machine Intelligence, volume 25, number 11, November 2003, pp. 1494-1498.
Keyword(s):   biometrics
Links:
(PDF 560 kbytes), (concise)
Abstract:
With the wide spread utilization of biometric identification systems, establishing the authenticity of biometric data itself has emerged as an important research issue. The fact that biometric data is not replaceable and is not secret, combined with the existence of several types of attacks that are possible in a biometric system, make the issue of security/integrity of biometric data extremely critical. We introduce two applications of an amplitude modulation-based watermarking method, in which we hide a user's biometric data in a variety of images. This method has the ability to increase the security of both the hidden biometric data (e.g., eigen-face coefficients) and host images (e.g., fingerprints). Image adaptive data embedding methods used in our scheme lead to low visibility of the embedded signal. Feature analysis of host images guarantees high verification accuracy on watermarked (e.g., fingerprint) images.
Bibtex:
@article{JU03,
author = "Anil K. Jain and Umut Uludag",
title = "Hiding Biometric Data",
journal = "International Journal of Pattern Analysis and Machine Intelligence",
volume = 25,
number = 11,
year = 2003,
pages = "1494-1498",
}

[KD05]   "Addressing the Vulnerabilities of Likelihood-Ratio-Based Face Verification" Krzysztof Kryszczuk and Andrzej Drygajlo, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, July 2005, Rye Brook, NY, pp. 426-435.
Keyword(s):   biometrics
Links:
(PDF 689 kbytes), (concise)
Abstract:
Anti-spoofing protection of biometric systems is always a serious issue in real-life applications of an automatic personal verification system. Despite the fact that face image is the most common way of identifying persons and one of the most popular modalities in automatic biometric authentication, little attention has been given to the spoof resistance of face verification algorithms In this paper, we discuss how a system based on DCT features with a likelihood-ratio-based classifier can be easily spoofed by adding white Gaussian noise to the test image. We propose a strategy to address this problem by measuring the quality of the test image and of the extracted features before making a verification decision.
Bibtex:
@incollection{KD05,
author = "Krzysztof Kryszczuk and Andrzej Drygajlo",
title = "Securing Electronic Medical Records Using Biometric Authentication",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3546,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
address = "Berlin, Germany"
year = 2005,
pages = "426-435",
}
Comment(s):
By Dishant on August 18, 2005:
This paper talks about spoofing a system based on DCT features with likelihood ratio based classifier in biometric face verification. The paper further proposes the solution to the mentioned problem.

[KFC97]   "Writer Identification by Professional Document Examiners," Moshe Kam, Gabriel Fielding, and Robert Conn, Journal of Forensic Sciences, volume 42, 1997, pp. 778-786.
Keyword(s):   biometrics, handwriting
Links:
(PDF 100 kbytes), (concise)
Abstract:
Reliable data on the capabilities of professional document examiners are scarce, rendering most past characterizations of these capabilities somewhat speculative. We report on a comprehensive test administered to more than 100 professional document examiners, intended to close this data gap in the area of writer identification. Each examiner made 144 pair-wise comparisons of freely-created original handwritten documents. The task was to determine whether or not a "match" was detected, namely whether or not the two documents were written by the same hand. Matching criteria were based on the identification and strong probability definitions of the ASTM standard E1658. The professionals were tested in three groups (in the northeastern, southeastern, and southwestern United States). In addition, we have created a control group of similar educational background. Several individuals training to become professional document examiners were tested as well. Examination of the data and statistical tests show that the answers collected from the professional and nonprofessional groups came from different populations. The trainees' data were shown to have come from a population that is distinct from both professional and nonprofessional groups. Unlike the professional examiners, the nonprofessionals tended to grossly over-associate. They erroneously "matched" many documents that were created by different writers, mismatching almost six times as many unknown documents to database documents as the professionals did (38.3% vs. 6.5% of the documents). The results of our test lay to rest the debate over whether or not professional document examiners possess writer-identification skills absent in the general population. They do.
Bibtex:
@article{KFC97,
author = "Moshe Kam and Gabriel Fielding and Robert Conn",
title = "Writer Identification by Professional Document Examiners",
journal = "Journal of Forensic Sciences",
volume = 42,
year = 1997,
pages = "778-786",
}

[KGNT05]   "Cryptographic Keys from Dynamic Hand-signatures with Biometric Security Preservation and Replaceability" Yip Wai Kuan, Alwyn Goh, David Ngo, and Andrew Teoh, Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies, October 2005, Buffalo, NY, pp. 27-32.
Keyword(s):   biometrics, handwriting
Links:
(PDF 909 kbytes), (concise)
Abstract:
We propose a method of extracting cryptographic key from dynamic handwritten signatures that does not require storage of the biometric template or any statistical information that could be used to reconstruct the biometric data. Also, the keys produced are not permanently linked to the biometric hence, allowing them to be replaced in the event of key compromise. This is achieved by incorporating randomness which provides high-entropy to the naturally low-entropy biometric key using iterative inner-product method as in Goh-Ngo, and modified multiple-bit discretization that deters guessing from key statistics. Our proposed methodology follows the design principles of block ciphers to result in unpredictable key space and secure construction.
Bibtex:
@inproceedings{KGNT05,
author = "Yip Wai Kuan and Alwyn Goh and David Ngo and Andrew Teoh",
title = "Cryptographic Keys from Dynamic Hand-signatures with Biometric Security Preservation and Replaceability",
booktitle = "Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies",
publisher = "IEEE Computer Society",
editor = "Vijayakumar Bhagavatula and Venu Govindaraju",
address = "Los Alamitos, CA"
year = 2005,
pages = "27-32",
}

[KHNT97]   "On-line Handwritten Signature Verification Using Hidden Markov Model Features," Ramanujan S. Kashi, Jianying Hu, Winston L. Nelson, and William Turin, Proceedings of Fourth International Conference on Document Analysis and Recognition, August 1997, pp. 253-257.
Keyword(s):   biometrics, handwriting
Links:
(PDF 161 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
The paper demonstrates the hybrid signature verification system using both local and global features. The local features using discrete HMM capture the dynamics of the signature while global features capture various spatial and temporal characteristics of the signature.

[KJ05]   "Securing Electronic Medical Records Using Biometric Authentication" Stephen Krawczyk and Anil K. Jain, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, July 2005, Rye Brook, NY, pp. 1110-1119.
Keyword(s):   biometrics, handwriting, speech
Links:
(PDF 235 kbytes), (concise)
Abstract:
Ensuring the security of medical records is becoming an increasingly important problem as modern technology is integrated into existing medical services. As a consequence of the adoption of electronic medical records in the health care sector, it is becoming more and more common for a health professional to edit and view a patient's record using a tablet PC. In order to protect the patient's privacy, as required by governmental regulations in the United States, a secure authentication system to access patient records must be used. Biometric-based access is capable of providing the necessary security. On-line signature and voice modalities seem to be the most convenient for the users in such authentication systems because a tablet PC comes equipped with the associated sensors/hardware. This paper analyzes the performance of combining the use of on-line signature and voice biometrics in order to perform robust user authentication. Signatures are verified using the dynamic programming technique of string matching. Voice is verified using a commercial, off the shelf, software development kit. In order to improve the authentication performance, we combine information from both on-line signature and voice biometrics. After suitable normalization of scores, fusion is per- formed at the matching score level. A prototype bimodal authentication system for accessing medical records has been designed and evaluated on a small truly multimodal database of 50 users, resulting in an average equal error rate (EER) of 0.86%.
Bibtex:
@incollection{KJ05,
author = "Stephen Krawczyk and Anil K. Jain",
title = "Securing Electronic Medical Records Using Biometric Authentication",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3546,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
address = "Berlin, Germany"
year = 2005,
pages = "1110-1119",
}
Comment(s):
By Dishant on August 18, 2005:
This paper demonstrates and analyzes the performance of combining online signature verification and voice verification techniques for robust user authentication.

[KL04]   "Practical Digital Signature Generation using Biometrics," Taekyoung Kwon and Jae-il Lee, Computational Science and Its Applications, Lecture Notes in Computer Science, Vol. 3043, Springer-Verlag, May 2004, pp. 728-737.
Keyword(s):   authentication, biometrics
Links:
(PDF 165 kbytes), (concise)
Abstract:
It is desirable to generate a digital signature using biometrics but not practicable because of its inaccurate measuring and potential hill-climbing attacks, without using specific hardware devices that hold signature keys or biometric templates securely. We study a simple practical method for biometrics based digital signature generation without such restriction, by exploiting the existing tools in software in our proposed model where a general digital signature such as RSA can be applied without losing its security.
Bibtex:
@incollection{KL04,
author = "Taekyoung Kwon and Jae-il Lee",
title = "Practical Digital Signature Generation using Biometrics",
booktitle = "Computational Science and Its Applications",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3043,
address = "Berlin, Germany"
year = 2004,
pages = "728-737",
}

[KN02]   "Signature Verification: Benefits of Multiple Tries," Ramanujan S. Kashi and Winston L. Nelson, Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition, August 2002, pp. 424-427.
Keyword(s):   biometrics, handwriting
Links:
(PDF 119 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper demonstrates the advantages of signature verification system in which the user is given multiple tries. At the end, the authors come to the conclusion that the mentioned system achieves significant performance improvement without making any changes in the algorithm.

[KZK05]   "A Study of Brute-Force Break-Ins of a Palmprint Verification System," Adams Kong, David Zhang, and Mohamed Kamel, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, July 2005, Rye Brook, NY, pp. 447-454.
Keyword(s):   biometrics
Links:
(PDF 310 kbytes), (concise)
Abstract:
Biometric systems are widely applied since they offer inherent advantages over traditional knowledge-based and token-based personal authentication approaches. This has led to the development of palmprint systems and their use in several real applications. Biometric systems are not, however, invulnerable. The potential attacks including replay and brute-force attacks have to be analyzed before they are massively deployed in real applications. With this in mind, this paper will consider brute-force break-ins directed against palmprint verification systems.
Bibtex:
@incollection{KZK05,
author = "Adams Kong and David Zhang and Mohamed Kamel",
title = "A Study of Brute-Force Break-Ins of a Palmprint Verification System",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3546,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
address = "Berlin, Germany"
year = 2005,
pages = "447-454",
}
Comment(s):
By Dishant on August 18, 2005:
This paper presents a study of brute force attacks directed against the palmprint system that uses competitive code (derived from various palmprint features) as features and difference in the competitive code for the matching purposes.

[LBA96]   "Reliable On-Line Human Signature Verification Systems," Luan L. Lee, Toby Berger, and Erez Aviczer, International Journal of Pattern Analysis and Machine Intelligence, volume 18, number 6, June 1996, pp. 643-647.
Keyword(s):   biometrics, handwriting
Links:
(PDF 923 kbytes), (concise)
Abstract:
On-line dynamic signature verification systems were designed and tested. A data base of more than 10,000 signatures in (I, y(t))-form was acquired using a graphics tablet. We extracted a 42-parameter feature set at first, and advanced to a set of 49 normalized features that tolerate inconsistencies in genuine signatures while retaining the power to discriminate against forgeries. We studied algorithms for selecting and perhaps orthogonalizing features in accordance with the availability of training data and the level of system complexity. For decision making we studied several classifiers types. A modified version of our majority classifier yielded 2.5% equal error rate and, more importantly, an asymptotic performance of 7% false acceptance rate at zero false rejection rate, was robust to the speed of genuine signatures, and used only 15 parameter features.
Bibtex:
@article{LBA96,
author = "Luan L. Lee and Toby Berger and Erez Aviczer",
title = "Reliable On-Line Human Signature Verification Systems",
journal = "International Journal of Pattern Analysis and Machine Intelligence",
volume = 18,
number = 6,
year = 1996,
pages = "643-647",
}

[LP94]   "Automatic Signature Verification: the State of the Art 1989-1993," Frank Leclerc and Rejean Plamondon, International Journal of Pattern Recognition and Artificial Intelligence, volume 8, number 3, 1994, pp. 643-660.
Keyword(s):   handwriting, biometrics
Links:
(PDF 2442 kbytes), (concise)
Abstract:
This paper is a follow up to an article published in 1989 by R. Plamondon and G. Lorette on the state of the art in automatic signature verification and writer identification. It summarizes the activity from 1989 to 1993 in automatic signature verification. For this purpose, we report on the different projects dealing with dynamic, static, and neural network approaches. In each section, a brief description of the major investigations is given.
Bibtex:
@article{LP94,
author = "Frank Leclerc and Rejean Plamondon",
title = "Automatic Signature Verification: the State of the Art 1989-1993",
journal = "International Journal of Pattern Recognition and Artificial Intelligence",
volume = 8,
number = 3,
year = 1994,
pages = "643-660",
}

[LR05]   "The Effectiveness of Generative Attacks on an Online Handwriting Biometric," Daniel Lopresti and Jarret Raim, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, July 2005, Rye Brook, NY, pp. 1090-1099.
Keyword(s):   biometrics, handwriting, generative models
Links:
(PDF 196 kbytes), (concise)
Abstract:
The traditional approach to evaluating the performance of a behavioral biometric such as handwriting or speech is to conduct a study involving human subjects (naive and/or skilled "forgers") and report the system's False Reject Rate (FRR) and False Accept Rate (FAR). In this paper, we examine a different and perhaps more ominous threat: the possibility that the attacker has access to a generative model for the behavior in question, along with information gleaned about the targeted user, and can employ this in a methodical search of the space of possible inputs to the system in an attempt to break the biometric. We present preliminary experimental results examining the effectiveness of this line of attack against a published technique for constructing a biometric hash based on online handwriting data. Using a concatenative approach followed by a feature space search, our attack succeeded 49% of the time.
Bibtex:
@incollection{LR05,
author = "Daniel P. Lopresti and Jarret D. Raim",
title = "The Effectiveness of Generative Attacks on an Online Handwriting Biometric",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3546,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
address = "Berlin, Germany"
year = 2005,
pages = "1090-1099",
}
Comment(s):
By Dan on August 7, 2005:
This paper presents a preliminary study attacking the biometric hash for handwriting proposed by Vielhauer, et al. in [VSM02].
By Dishant on August 18, 2005:
This paper presents the preliminary results of effectiveness of various attacks against the published technique (by Vielhauer et al.) for constructing biometric hash on online handwriting data.

[MA03]   "On-line Signature Verification Based on Optimal Feature Representation and Neural-Network-Driven Fuzzy Reasoning," Julio Martínez-R. and Rogelio Alcántara-S. Proceedings of the International Conference on Advances in Infrastructure on the Internet, July 2003.
Keyword(s):   biometrics, handwriting
Links:
(PDF 250 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper talks about on-line signature verification using optimal feature representation (which gives an averaged prototype and consistency function of each feature) and Neural Network driven fuzzy reasoning. The results shown in the paper are very promising with misclassification rate of just 0.14%.

[MHTK99]   "On the Security of HMM-Based Speaker Verification Systems Against Imposture Using Synthetic Speech," Takashi Masuko, Takafumi Hitotsumatsu, Keiichi Tokuda, and Takao Kobayashi, Proceedings of the European Conference on Speech Communication and Technology, vol. 3, pages 1223-1226, September 1999.
Keyword(s):   biometrics, speech, generative models
Links:
(PDF 58 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper talks about the security of HMM (Hidden Markov Model) based speaker verification system against synthetic speech.

[MRLLS02]   "Towards Speech-Generated Cryptographic Keys on Resource-Constrained Devices," Fabian Monrose, Michael K. Reiter, Qi Li, Daniel P. Lopresti, and Chilin Shih, Proceedings of the Eleventh USENIX Security Symposium, August 2002, San Francisco, CA, pp. 283-296.
Keyword(s):   biometrics, speech, generative models
Links:
(URL), (concise)
Abstract:
Programmable mobile phones and personal digital assistants (PDAs) with microphones permit voice-drive user interfaces in which a user provides input by speaking. In this paper, we show how to exploit this capability to generate cryptographic keys on such devices. Specifically, we detail our implementation of a technique to generate a repeatable cryptographic key on a PDA from a spoken passphrase. Rather than deriving the cryptographic key from merely the passphrase that was spoken -- which would constitute little more than an exercise in automatic speech recognition -- we strive to generate a substantially stronger cryptographic key with entropy drawn both from the passphrase spoken and how the user speaks it. Moreover, the cryptographic key is designed to resist cryptanalysis even by an attacker who captures and reverse-engineers the device on which the key is generated. We describe the major hurdles of achieving this on an off-the-shelf PDA bearing a 206 MHz StrongArm CPU and an inexpensive microphone. We also evaluate our approach using multiple data sets, one recorded on the device itself, to clarify the effectiveness of our implementation against various attackers.
Bibtex:
@inproceedings{USENIX02,
author = "Fabian Monrose and Michael K. Reiter and Qi Li and Daniel P. Lopresti and Chilin Shih",
title = "Toward Speech-Generated Cryptographic Keys on Resource Constrained Devices",
booktitle = "Proceedings of the 11th USENIX Security Symposium",
month = "August",
year = 2002,
address = "San Francisco, CA",
pages = "283-296",
}
Comment(s):
By Dishant on August 17, 2005:
This paper describes major hurdles in generating a substantially stronger cryptographic key on an off-the-shelf PDA bearing a 206 MHz StrongArm CPU and an inexpensive microphone.
By Dishant on August 18, 2005:
This paper shows the detailed implementation of generating a cryptographic key from "the spoken passphrase" and "the way it was spoken by the user" on the PDA and programmable mobile phones with microphones.

[MS01]   "BIOVISION: User and Application Security Issues for Biometric Systems (Interim version)," Tony Mansfield and Philip Statham, 2001.
Keyword(s):   biometrics
Links:
(PDF 891 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
The mentioned report is concerned with the security of biometric authentication systems.

[MTK00]   "Imposture Using Synthetic Speech Against Speaker Verification Based on Spectrum and Pitch," Takashi Masuko, Keiichi Tokuda, and Takao Kobayashi, Proceedings of the Sixth International Conference on Spoken Language Processing, 2000, pp. 302-305.
Keyword(s):   biometrics, speech, generative models
Links:
(PDF 122 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
The paper demonstrates the implementation of MSD-HMM (multi-space probability distribution) based speaker verification system which uses pitch information. The paper also investigates whether the system rejects the synthetic speech or not.

[NSIF05]   "Optimal User Weighting Fusion in DWT Domain On-Line Signature Verification" Isao Nakanishi, Hiroyuki Sakamoto, Yoshio Itoh, and Yutaka Fukui, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, July 2005, Rye Brook, NY, pp. 758-766.
Keyword(s):   biometrics, handwriting
Links:
(PDF 283 kbytes), (concise)
Abstract:
DWT domain on-line signature verification method has bee proposed. Time-varying pen-position signal is decomposed into sub-band signals by using the DWT. Individual features are extracted as high frequency signals in sub-band. By using the extracted feature, verification is achieved at each sub-band and then total decision is done by combininig such verification results. In this paper, we introduce a user weighting fusion into the total decision for improving verification performance. Through many verification experiments, it is confirmed that there is an optimal weight combination for each user and verifiaction rate can be improved when the optimal weight combination is applied. Such the optimal weight combination also becomes an individual feature which can not be known by others.
Bibtex:
@incollection{NSIF05,
author = "Isao Nakanishi and Hiroyuki Sakamoto and Yoshio Itoh and and Yutaka Fukui",
title = "Optimal User Weighting Fusion in DWT Domain On-Line Signature Verification",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3546,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
address = "Berlin, Germany"
year = 2005,
pages = "758-766",
}
Comment(s):
By Dishant on August 18, 2005:
In this paper, the authors proved that there is an optimal weight combination of the verification results obtained at each sub-band signal(obtained by decomposition of time-varying pen position signal) for each user and this technique improves the verification results.

[PH99]   "An Experimental Study of Speaker Verification Sensitivity to Computer Voice-Altered Imposters," Bryan L. Pellom and John H. L. Hansen, Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, vol. 2, pp. 837-840, Phoenix, Arizona, March 1999.
Keyword(s):   biometrics, speech, generative models
Links:
(PDF 794 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper demonstrates the new approach for trainable voice synthesis. This synthesized voice was then verified using GMM based verification algorithms.

[RSB01]   "Automated Biometrics," Nalini K. Ratha, Andrew Senior, and Ruud M. Bolle, Proceedings of ICAPR-2001, Rio de Janeiro, Brazil, 2001.
Keyword(s):   biometrics
Links:
(PDF 95 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This papers gives an overview of six popular biometrics used for automatic authentication of user. It also gives the comparative evaluation of the mentioned biometrics based on various factors.

[SA03]   "A Novel Approach for Generating Digital Signature using Fingerprint, Password and Smart Card," M. Y. Siyal and Fawad Ahmed, Proceedings of the International Workshop on Frontiers of Technology, December 2003.
Keyword(s):   authentication, biometrics
Links:
(PDF 292 kbytes), (concise)
Abstract:
Despite the fact that public key algorithms are very strong, their security lies in the safe custody of the private key. In case of private key compromise, extensive damage may be caused to the user as the key can be used to sign forged documents. The usual way to store a private key is through password-based encryption. However, user-chosen passwords have very low entropy, which may be exploited by an attacker to launch password-guessing attacks. In this paper, a new method is proposed that employ fingerprint, password and smart card to dynamically generate a private key for digital signatures. The scheme is sufficiently robust to generate a constant key and is tolerant to errors generated in the fingerprint pattern at the time of key generation. Our proposed algorithm is capable of generating key lengths that can meet the current security requirements of public key algorithms used for digital signatures and is more secure than traditional password-based method of protecting a private key.
Bibtex:
@inproceedings{SA03,
author = "M. Y. Siyal and Fawad Ahmed",
title = "A Novel Approach for Generating Digital Signature using Fingerprint, Password and Smart Card",
booktitle = "Proceedings of the International Workshop on Frontiers of Technology",
month = "December",
year = "2003",
}

[SA04]   "A Biometric-Based Scheme for Enhancing Security of Cryptographic Keys," M. Y. Siyal and Fawad Ahmed, Proceedings of the IEEE Tencon Conference, December 2004.
Keyword(s):   biometrics
Links:
(PDF 1890 kbytes), (concise)
Abstract:
In public key cryptography, the security of private keys is of vital importance. If a private key is ever compromised, it can be used to sign forge documents or to decrypt secret messages. Conventional methods such as password-based encryption that are used for safe custody of private keys do not provide adequate security due to very low entropy in user chosen passwords. In order to enhance the security of private keys, we propose a novel biometric-based method that dynamically regenerates the private key of a user rather than storing it directly in an encrypted form. Our proposed algorithm is capable of regenerating key lengths that can meet the current security requirements of any public key algorithm and is more secure than conventional methods of protecting private keys using password-based encryption.
Bibtex:
@inproceedings{SA04,
author = "M. Y. Siyal and Fawad Ahmed",
title = "A Biometric-Based Scheme for Enhancing Security of Cryptographic Keys",
booktitle = "Proceedings of the IEEE Tencon Conference",
month = "December",
year = "2004",
}

[SKB05]   "Improving Writer Identification by Means of Feature Selection and Extraction," Andreas Schlapbach, Vivian Kilchherr, and Horst Bunke, Proceedings of the Eighth International Conference on Document Analysis and Recognition, August-September 2005, Seoul, South Korea, pp. 131-135.
Keyword(s):   biometrics, handwriting
Links:
(PDF 46 kbytes), (concise)
Abstract:
To identify the author of a sample handwriting from a set of writers, 100 features are extracted from the handwriting sample. By applying feature selection and extraction methods on this set of features, subsets of lower dimensionality are obtained. We show that we can achieve significantly better writer identification rates if we use smaller feature subsets returned by different feature extraction and selection methods. The methods considered in this paper are feature set search algorithms, genetic algorithms, principal component analysis, and multiple discriminant analysis.
Bibtex:
@inproceedings{SKB05,
author = "Andreas Schlapbach and Vivian Kilchherr and Horst Bunke",
title = "Improving Writer Identification by Means of Feature Selection and Extraction",
booktitle = "Proceedings of the Eighth International Conference on Document Analysis and Recognition",
address = "Seoul, South Korea"
month = "August-September",
year = 2005,
pages = "131-135",
}
Comment(s):
By Dishant on September 13, 2005:
The paper discusses about various algorithms that can be used to find smaller feature subsets for better writer identification purposes.

[SRSGK99]   "Biometric Encryption," Colin Soutar, Danny Roberge, Alex Stoianov, Rene Gilroy, and B. V. K. Vijaya Kumar, Chapter 22 in ICSA Guide to Cryptography, edited by Randall K. Nichols, McGraw-Hill (1999).
Keyword(s):   biometrics
Links:
(PDF 271 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper discusses the practical implementation of innovative technique of securing a key using biometric. The key is linked with the biometric at a more fundamental level during enrollment, and is later retrieved using the biometric during verification.

[SSS00]   "Usability of Biometrics in Relation to Electronic Signatures," Dirk Scheuermann, Scarlet Schwiderski-Grosche, Bruno Struif, EU Study 502533/8, Version 1.0, September 2000.
Keyword(s):   biometrics
Links:
(PDF 1891 kbytes), (concise)
Comment(s):
By Dishant on August 18, 2005:
This paper deals with the discussion of SSCDs and their use in connection with biometrics,different biometric methods, data transmission from biometric sensor to SSCD, existing standards for biometrics and legal aspects for the use of biometrics.

[TAKSBV05]   "Practical Biometric Authentication with Template Protection" Pim Tuyls, Anton H. M. Akkermans, Tom A. M. Kevenaar, Geert-Jan Schrijen, Asker M. Bazen, and Raymond N. J. Veldhuis, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, July 2005, Rye Brook, NY, pp. 436-446.
Keyword(s):   biometrics
Links:
(PDF 385 kbytes), (concise)
Abstract:
In this paper we show the feasibility of template protecting biometric authentication systems. In particular, we apply template protection schemes to fingerprint data. Therefore we first make a fixed length representation of the fingerprint data by applying Gabor filtering Next we introduce the reliable components scheme. In order to make a binary representation of the fingerprint images we extract and then quantize during the enrollment phase the reliable components with the highest signal to noise ratio. Finally, error correction coding is applied to the binary representation. It is shown that the scheme achieves an EER of approximately 4.2% with secret length of 40 bits in experiments.
Bibtex:
@incollection{TAKSBV05,
author = "Pim Tuyls and Anton H. M. Akkermans and Tom A. M. Kevenaar and Geert-Jan Schrijen and Asker M. Bazen and Raymond N. J. Veldhuis",
title = "Practical Biometric Authentication with Template Protection",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3546,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
address = "Berlin, Germany"
year = 2005,
pages = "436-446",
}
Comment(s):
By Dishant on August 18, 2005:
This paper talks about practical implementation of "Fingerprint verification system with template protection".

[UPJ05]   "Fuzzy Vault for Fingerprints" Umut Uludag, Sharath Pankanti, and Anil K. Jain, Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication, July 2005, Rye Brook, NY, pp. 310-319.
Keyword(s):   biometrics
Links:
(PDF 257 kbytes), (concise)
Abstract:
Biometrics-based user authentication has several advantages over traditional password-based systems for standalone authentication applications, such as secure cellular phone access. This is also true for new authentication architectures known as crypto-biometric systems, where cryptography and biometrics are merged to achieve high security and user convenience at the same time. In this paper, we explore the realization of a previously proposed cryptographic construct, called fuzzy vault, with the fingerprint minutiae data. This construct aims to secure critical data (e.g., secret encryption key) with the fingerprint data in a way that only the authorized user can access the secret by providing the valid fingerprint. The results show that 128-bit AES keys can be secured with fingerprint minutiae data using the proposed system.
Bibtex:
@incollection{UPJ05,
author = "Umut Uludag and Sharath Pankanti and Anil K. Jain",
title = "Fuzzy Vault for Fingerprints",
booktitle = "Proceedings of the International Conference on Audio- and Video-based Biometric Person Authentication",
publisher = "Springer-Verlag",
series = "Lecture Notes in Computer Science",
volume = 3546,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
address = "Berlin, Germany"
year = 2005,
pages = "310-319",
}
Comment(s):
By Dishant on August 18, 2005:
This paper discusses about securing secret key with the fingerprint data in such a way that only authorized user can access the secret key by providing valid fingerprints.

[VS04]   "Handwriting: Feature Correlation Analysis for Biometric Hashes," Claus Vielhauer and Ralf Steinmetz, EURASIP Journal on Applied Signal Processing, vol. 4, 2004, pp. 542-558.
Keyword(s):   biometrics, handwriting
Links:
(PDF 1236 kbytes), (concise)
Abstract:
In the application domain of electronic commerce, biometric authentication can provide one possible solution for the key management problem. Besides server-based approaches, methods of deriving digital keys directly from biometric measures appear to be advantageous. In this paper, we analyze one of our recently published specific algorithms of this category based on behavioral biometrics of handwriting, the biometric hash. Our interest is to investigate to which degree each of the underlying feature parameters contributes to the overall intrapersonal stability and interpersonal value space. We will briefly discuss related work in feature evaluation and introduce a new methodology based on three components: the intrapersonal scatter (deviation), the interpersonal entropy, and the correlation between both measures. Evaluation of the technique is presented based on two data sets of different size. The method presented will allow determination of effects of parameterization of the biometric system, estimation of value space boundaries, and comparison with other feature selection approaches.
Bibtex:
@article{VS04,
author = "Claus Vielhauer and Ralf Steinmetz",
title = "Handwriting: Feature Correlation Analysis for Biometric Hashes",
journal = "EURASIP Journal on Applied Signal Processing",
volume = 4,
year = 2004,
pages = "542-558",
}

[VSM01]   "Transitivity Based Enrollment Strategy for Signature Verification Systems," Claus Vielhauer, Ralf Steinmetz, and Astrid Mayerhofer, Proceedings of the Sixth International Conference on Document Analysis and Recognition, Seattle, WA, Sept. 2001, pp. 1263-1266.
Keyword(s):   biometrics, handwriting
Links:
(PDF 146 kbytes), (concise)
Abstract:
The enrollment phase of signature verification systems is a critical process, in which reference data of user is acquired, that needs to be satisfying quality without overloading the subject by asking for too many repetitions. Many signature verification systems do not perform an enrollment quality evaluation at all, or only after capturing a fixed number of samples, accepting or rejecting the whole reference set. To limit the number of rejections and as such the False- Enrollment-Rate (FER), we propose a new algorithm for sample adaptive quality evaluation during the enrollment process. This algorithm is based on transitivity criteria within a set of multidimensional reference vectors. We will show that our approach leads to a significant reduction of FER.
Bibtex:
@inproceedings{Vielhauer01,
author = {C. Vielhauer and R. Steinmetz and A. Mayerhofer},
title = {Transitivity Based Enrollment Strategy for Signature Verification Systems},
booktitle = {Proceedings of the Sixth International Conference on Document Analysis and Recognition},
pages = {1263-1266},
year = {2001},
}
Comment(s):
By Dishant on August 18, 2005:
This paper proposes a new sample adaptive quality algorithm which reduces the number of false enrollment rate during the enrollment process in Signature verification systems. The preliminary results show that the above mentioned algorithm can also be used for Handwriting verification systems.

[VSM02]   "Biometric Hash based on Statistical Features of Online Signatures," Claus Vielhauer, Ralf Steinmetz, and Astrid Mayerhofer, Proceedings of the Sixteenth International Conference on Pattern Recognition, vol. 1, August 2002, pp. 123-126.
Keyword(s):   biometrics, handwriting
Links:
(PDF 251 kbytes), (concise)
Bibtex:
@inproceedings{Vielhauer02,
author = {C. Vielhauer and R. Steinmetz and A. Mayerhofer},
title = {Biometric hash based on statistical features of online signatures},
booktitle = {Proceedings of the Sixteenth International Conference on Pattern Recognition},
volume = {1},
pages = {123-126},
year = {2002},
}
Comment(s):
By Dishant on August 18, 2005:
This paper presents a new approach of generating hash values from Online signatures in Online Signature verification systems. The advantage of this approach is that there is no need to store reference samples of signatures taken during enrollment phase. This approach can be useful in systems in which key management strategies are required as key can be directly generated from biometric hash.

[YCXGKMR04]   "SVC2004: First International Signature Verification Competition", Dit-Yan Yeung, Hong Chang, Yimin Xiong, Susan George, Ramanujan Kashi, Takashi Matsumoto, and Gerhard Rigoll Proceedings of the First International Conference on Biometric Authentication, July 2004, Hong Kong, pp. 16-22.
Keyword(s):   biometrics, handwriting
Links:
(PDF 98 kbytes), (concise)
Abstract:
Handwritten signature is the most widely accepted biometric for identity verification. To facilitate ob jective evaluation and comparison of algorithms in the field of automatic handwritten signature verification, we organized the First International Signature Verification Competition (SVC2004) recently as a step towards establishing common benchmark databases and benchmarking rules. For each of the two tasks of the competition, a signature database involving 100 sets of signature data was created, with 20 genuine signatures and 20 skilled forgeries for each set. Eventually, 13 teams competed for Task 1 and eight teams competed for Task 2. When evaluated on data with skilled forgeries, the best team for Task 1 gives an equal error rate (EER) of 2.84% and that for Task 2 gives an EER of 2.89%. We believe that SVC2004 has successfully achieved its goals and the experience gained from SVC2004 will be very useful to similar activities in the future.
Bibtex:
@proceedings{YCXGKMR04,
title = {SVC2004: First International Signature Verification Competition},
author = {Dit-Yan Yeung and Hong Chang and Yimin Xiong and Susan George and Ramanujan Kashi and Takashi Matsumoto and and Gerhard Rigoll},
editor = {David Zhang and Anil K. Jain},
booktitle = {Proceedings of the First International Conference on Biometric Authentication}
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
volume = {3072},
year = {2004},
pages = {16-22},
}

[YNTK05]   "A Study on Vulnerability in On-line Writer Verification System," Yasushi Yamazaki, Akane Nakashima, Kazunobu Tasaka, and Naohisa Komatsu, Proceedings of the Eighth International Conference on Document Analysis and Recognition, August-September 2005, Seoul, South Korea, pp. 640-644.
Keyword(s):   biometrics, handwriting, generative models
Links:
(PDF 253 kbytes), (concise)
Abstract:
The analysis of vulnerabilities and threats in biometrics-based personal authentication systems is indispensable for the development and promotion of wide spread utilization of biometric technologies in accordance with international standardization of information security technologies. In this paper, we discuss the vulnerabilities and threats in a writer verification system which is an application of biometric technologies using handwriting information. We propose some attack methods that use verification results or user templates of a writer verification system. From some simulation results, it is clear that an attacker can estimate an authorized user's biometric information (handwriting information) and produce some forged handwritings which are accepted by the verification system.
Bibtex:
@inproceedings{YNTK05,
author = "Yasushi Yamazaki and Akane Nakashima and Kazunobu Tasaka and Naohisa Komatsu",
title = "A Study on Vulnerability in On-line Writer Verification System",
booktitle = "Proceedings of the Eighth International Conference on Document Analysis and Recognition",
address = "Seoul, South Korea",
month = "August-September",
year = 2005,
pages = "640-644",
}
Comment(s):
By Dishant on September 13, 2005:
This paper talks about various attack models that use either verification results or user templates to show vulnerabilities and threats in a writer verification system .

[ZV03]   "A Test Tool to Support Brut-Force Online and Offline Signature Forgery Tests on Mobile Devices," Frank Zoebisch and Claus Vielhauer, Proceedings of the International Conference on Multimedia and Expo, July 2003, pp. 225-228.
Keyword(s):   biometrics, handwriting
Links:
(PDF 360 kbytes), (concise)
Bibtex:
@inproceedings{Vielhauer03,
author = {Frank Zoebisch and Claus Vielhauer},
title = {A Test Tool to support Brute-Force Online and Offline Signature Forgery Tests on Mobile Devices},
booktitle = {Proceedings of the International Conference on Multimedia and Expo},
volume = {3},
pages = {225-228},
year = {2003}
}
Comment(s):
By Dishant on August 18, 2005:
This paper presents a new tool for the systematic evaluation of handwriting verification algorithms (in this case, the algorithm is of very basic nature) against various types of forgeries.


image


© 2004 P.C. Rossin College of Engineering & Applied Science
Computer Science & Engineering, Packard Laboratory, Lehigh University, Bethlehem PA 18015