The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Password hardening based on keystroke dynamics
Open accessAbstract
We present a novel approach to improving the security of passwords. In our approach, the legitimate user's typing patterns (e.g., durations of keystrokes, and latencies between keystrokes) are combined with the user's password to generate a hardened password that is convincingly more secure than conventional passwords against both online and offline attackers. In addition, our scheme automatically adapts to gradual changes in a user's typing patterns while maintaining the same hardened password across multiple logins, for use in file encryption or other applications requiring a longterm secret key. Using empirical data and a prototype implementation of our scheme, we give evidence that our approach is viable in practice, in terms of ease of use, improved security, and performance
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
(1979) · Cited by 43,841
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Password security: a case history
Morris, R., & Thompson, K. (1979) · Communications of the ACM · doi:10.1145/359168.359172 · Cited by 926
Identity authentication based on keystroke latencies
Joyce, R., & Gupta, G. (1990) · Communications of the ACM · doi:10.1145/75577.75582 · Cited by 534
Authentication via keystroke dynamics
Monrose, F., & Rubin, A. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266434 · Cited by 497
Self-citationSome Ideal Secret Sharing Schemes
Brickell, E. F. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_45 · Cited by 474
Massey, J. L. (2002) · Proceedings of 1994 IEEE International Symposium on Information Theory · doi:10.1109/isit.1994.394764 · Cited by 463
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
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
Frank, M., Biedert, R., Ma, E., Martinovic, I., & Song, D. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2012.2225048 · Cited by 844
Juels, A., & Sudan, M. (2006) · Designs, Codes and Cryptography · doi:10.1007/s10623-005-6343-z · Cited by 648
Metadata
- Authors
- Monrose, F., Reiter, M. K., & Wetzel, S.
- Venue
- Proceedings of the 6th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 1999-11
- Pages
- 73-82
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2017439879
- Cited by
- 315
- References
- 23
- FWCI
- 4.57
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Password hardening based on keystroke dynamics. https://app.cochat.ai/papers/10.1145/319709.319720
- The paper
- Monrose, F., Reiter, M. K., & Wetzel, S. (1999). Password hardening based on keystroke dynamics. Proceedings of the 6th ACM conference on Computer and communications security. https://doi.org/10.1145/319709.319720
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.