The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
On enabling secure applications through off-line biometric identification
Open accessAbstract
In developing secure applications and systems, designers must often incorporate secure user identification in the design specification. In this paper, we study secure off-line authenticated user identification schemes based on a biometric system that can measure a user's biometrics accurately (up to some Hamming distance). The presented schemes enhance identification and authorization in secure applications by binding a biometric template with authorization information on a token such as a magnetic strip. Also developed are schemes specifically designed to minimize the compromising of a user's private biometrics data, encapsulated in the authorization information, without requiring secure hardware tokens. We also study the feasibility of biometrics performing as an enabling technology for secure systems and applications design. We investigate a new technology which allows a user's biometrics to facilitate cryptographic mechanisms.
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
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
High confidence visual recognition of persons by a test of statistical independence
Daugman, J. G. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.244676 · Cited by 3,252
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
Zero-knowledge proofs of identity
Feige, U., Fiat, A., & Shamir, A. (1988) · Journal of Cryptology · doi:10.1007/bf02351717 · Cited by 1,029
Universal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73011 · Cited by 959
Cited by
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Reyzin, L., & Smith, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_31 · Cited by 2,038
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
Jain, A. K., Nandakumar, K., & Nagar, A. (2008) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/2008/579416 · Cited by 1,134
Biometric cryptosystems: issues and challenges
Uludag, U., Pankanti, S., Prabhakar, S., & Jain, A. K. (2004) · Proceedings of the IEEE · doi:10.1109/jproc.2004.827372 · Cited by 921
Generating Cancelable Fingerprint Templates
Ratha, N. K., Chikkerur, S., Connell, J. H., & Bolle, R. M. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1004 · Cited by 877
Juels, A., & Sudan, M. (2003) · Proceedings IEEE International Symposium on Information Theory, · doi:10.1109/isit.2002.1023680 · Cited by 820
Juels, A., & Sudan, M. (2006) · Designs, Codes and Cryptography · doi:10.1007/s10623-005-6343-z · Cited by 648
A survey on biometric cryptosystems and cancelable biometrics
Rathgeb, C., & Uhl, A. (2011) · EURASIP Journal on Information Security · doi:10.1186/1687-417x-2011-3 · Cited by 641
Fingerprint-Based Fuzzy Vault: Implementation and Performance
Nandakumar, K., Jain, A. K., & Pankanti, S. (2007) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2007.908165 · Cited by 553
Secure smartcardbased fingerprint authentication
Clancy, T. C., Kiyavash, N., & Lin, D. J. (2003) · Proceedings of the 2003 ACM SIGMM workshop on Biometrics methods and applications - WBMA '03 · doi:10.1145/982507.982516 · Cited by 482
Teoh, A. B. J., Goh, A., & Ngo, D. C. L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.250 · Cited by 467
Cancelable Biometrics: A review
Patel, V. M., Ratha, N. K., & Chellappa, R. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2015.2434151 · Cited by 419
New Shielding Functions to Enhance Privacy and Prevent Misuse of Biometric Templates
Linnartz, J.-P., & Tuyls, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-44887-x_47 · Cited by 387
Cryptographic key generation from voice
Monrose, F., Reiter, M. K., Li, Q., & Wetzel, S. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924299 · Cited by 333
Secure and Robust Iris Recognition Using Random Projections and Sparse Representations
Pillai, J. K., Patel, V. M., Chellappa, R., & Ratha, N. K. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.34 · Cited by 324
Password hardening based on keystroke dynamics
Monrose, F., Reiter, M. K., & Wetzel, S. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319720 · Cited by 315
Cherukuri, S., Venkatasubramanian, K. K., & Gupta, S. K. S. (2003) · 2003 International Conference on Parallel Processing Workshops, 2003. Proceedings. · doi:10.1109/icppw.2003.1240399 · Cited by 308
Surveying the Development of Biometric User Authentication on Mobile Phones
Meng, W., Wong, D. S., Furnell, S., & Zhou, J. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2386915 · Cited by 300
Password hardening based on keystroke dynamics
Monrose, F., Reiter, M. K., & Wetzel, S. (2002) · International Journal of Information Security · doi:10.1007/s102070100006 · Cited by 254
Cancellable biometrics and annotations on biohash
Teoh, A. B. J., Kuan, Y. W., & Lee, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.12.002 · Cited by 213
Metadata
- Authors
- Davida, G. I., Frankel, Y., & Matt, B. J.
- Venue
- Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186)
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-27
- Pages
- 148-157
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2127697997
- Cited by
- 406
- References
- 14
- FWCI
- 14.78
- Type
- conference paper
- Language
- en
- Open access
- green
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
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.