The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Password hardening based on keystroke dynamics
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
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
CSI/FBI computer crime and security survey
Power, R. (2001) · Medical Entomology and Zoology · Cited by 924
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 1×
“Guessing entropy [5, 21] is a natural way to define the entropy of a cover.”
BackgroundOn enabling secure applications through off-line biometric identification
Davida, G. I., Frankel, Y., & Matt, B. J. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674831 · Cited by 406
Foiling the cracker: A survey of, and improvements to, password security
Klein, D. V. (1992) · Cited by 349
Computer-access security systems using keystroke dynamics
Bleha, S., Slivinsky, C., & Hussien, B. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.62613 · Cited by 312
Entropy measures and unconditional security in cryptography
Cachin, C. (1997) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-001806220 · Cited by 246
UNIX Password Security - Ten Years Later
Feldmeier, D. C., & Karn, P. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_6 · Cited by 172
A Real-World Analysis of Kerberos Password Security.
Wu, T. D. (1999) · Cited by 120
Protecting secret keys with personal entropy
Ellison, C. M., Hall, C., Milbert, R., & Schneier, B. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(99)00055-2 · Cited by 106
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
Bleichenbacher, D., & Nguyễn, P. Q. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_4 · Cited by 98
A simple scheme to make passwords based on one-way functions much harder to crack
Manber, U. (1996) · Computers & Security · doi:10.1016/0167-4048(96)00003-x · Cited by 96
Cryptographic Authentication of Time-Invariant Quantities
Lennon, R. E., Matyas, S. M., & Meyer, C. (1981) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1981.1095067 · Cited by 91
Using voice to generate cryptographic keys.
Monrose, F., Reiter, M. K., Li, Q. L., & Wetzel, S. (2001) · Cited by 83
Self-citation
Cited by
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
Fast dictionary attacks on passwords using time-space tradeoff
Narayanan, A., & Shmatikov, V. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102168 · Cited by 447
Biometric Authentication and Identification Using Keystroke Dynamics: A Survey
Banerjee, S. P., & Woodard, D. (2012) · Journal of Pattern Recognition Research · doi:10.13176/11.427 · Cited by 369
Reducing shoulder-surfing by using gaze-based password entry
Kumar, M., Garfinkel, T., Boneh, D., & Winograd, T. (2007) · Proceedings of the 3rd symposium on Usable privacy and security · doi:10.1145/1280680.1280683 · Cited by 309
Securing passwords against dictionary attacks
Pinkas, B., & Sander, T. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586133 · Cited by 307
Metadata
- Authors
- Monrose, F., Reiter, M. K., & Wetzel, S.
- Venue
- International Journal of Information Security
- Published
- 2002-02-01
- Volume
- 1
- Issue
- 2
- Pages
- 69-83
- ISSN
- 1615-5262 (ISSN-L)
- OpenAlex
- W2107661464
- Cited by
- 254
- References
- 20
- FWCI
- 13.96
- 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
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.