The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Multibiometric Cryptosystems Based on Feature-Level Fusion
Abstract
Multibiometric systems are being increasingly de- ployed in many large-scale biometric applications (e.g., FBI-IAFIS, UIDAI system in India) because they have several advantages such as lower error rates and larger population coverage compared to unibiometric systems. However, multibiometric systems require storage of multiple biometric templates (e.g., fingerprint, iris, and face) for each user, which results in increased risk to user privacy and system security. One method to protect individual templates is to store only the secure sketch generated from the corresponding template using a biometric cryptosystem. This requires storage of multiple sketches. In this paper, we propose a feature-level fusion framework to simultaneously protect multiple templates of a user as a single secure sketch. Our main contributions include: (1) practical implementation of the proposed feature-level fusion framework using two well-known biometric cryptosystems, namery,fuzzy vault and fuzzy commitment, and (2) detailed analysis of the trade-off between matching accuracy and security in the proposed multibiometric cryptosystems based on two different databases (one real and one virtual multimodal database), each containing the three most popular biometric modalities, namely, fingerprint, iris, and face. Experimental results show that both the multibiometric cryptosystems proposed here have higher security and matching performance compared to their unibiometric counterparts.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
Eigenfaces vs. Fisherfaces: recognition using class specific linear projection
Belhumeur, P. N., Hespanha, J. P., & Kriegman, D. J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.598228 · Cited by 11,707
A Bayesian Hierarchical Model for Learning Natural Scene Categories
Li, F.-F., & Perona, P. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.16 · Cited by 3,613
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Ostrovsky, R., Reyzin, L., & Smith, A. (2008) · SIAM Journal on Computing · doi:10.1137/060651380 · Cited by 1,717
Juels, A., & Wattenberg, M. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319714 · Cited by 1,591
On-line fingerprint verification
Jain, A., Hong, L., & Bolle, R. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.587996 · Cited by 1,316
Self-citation(2006) · International Series on Biometrics · doi:10.1007/0-387-33123-9 · Cited by 1,189
Jain, A. K., Nandakumar, K., & Nagar, A. (2008) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/2008/579416 · Cited by 1,134
Self-citationNear-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
Andoni, A., & Indyk, P. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.49 · Cited by 1,067
Cited by
An overview of steganography techniques applied to the protection of biometric data
Douglas, M., Bailey, K., Leeney, M., & Curran, K. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-017-5308-3 · Cited by 122
Metadata
- Authors
- Nagar, A., Nandakumar, K., & Jain, A. K.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2012-02
- Volume
- 7
- Issue
- 1
- Pages
- 255-268
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2044862799
- Cited by
- 286
- References
- 31
- FWCI
- 27.43
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multibiometric Cryptosystems Based on Feature-Level Fusion. https://app.cochat.ai/papers/10.1109/tifs.2011.2166545
- The paper
- Nagar, A., Nandakumar, K., & Jain, A. K. (2012). Multibiometric Cryptosystems Based on Feature-Level Fusion. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2011.2166545
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.