The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Secure Human Identification Protocols
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
Password authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
Some optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
Katz, J., & Robshaw, M. J. B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53018-4 · Cited by 795
(1991) · Lecture notes in computer science · doi:10.1007/3-540-46416-6 · Cited by 725
(2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56880-1 · Cited by 628
Advances in Cryptology — CRYPTO’ 86: Proceedings
(1987) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7 · Cited by 519
Advances in Cryptology — EUROCRYPT ’95
(1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x · Cited by 355
Cryptographic Primitives Based on Hard Learning Problems
Blum, A., Furst, M., Kearns, M., & Lipton, R. J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_24 · Cited by 332
Self-testing/correcting with applications to numerical problems
Blum, M., Luby, M., & Rubinfeld, R. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100225 · Cited by 303
Self-citationVisual authentication and identification
Naor, M., & Pinkas, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052245 · Cited by 258
Efficient noise-tolerant learning from statistical queries
Kearns, M. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167200 · Cited by 173
Matsumoto, T. (1996) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/238168.238190 · Cited by 63
Cited by
The Quest to Replace Passwords: A Framework for Comparative Evaluation of Web Authentication Schemes
Bonneau, J., Herley, C., Oorschot, P. C. V., & Stajano, F. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.44 · Cited by 1,110
Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2011) · SIAM Journal on Computing · doi:10.1137/090756090 · Cited by 898
Authenticating Pervasive Devices with Human Protocols
Juels, A., & Weis, S. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_18 · Cited by 718
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Applebaum, B., Cash, D., Peikert, C., & Sahai, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_35 · Cited by 562
A Generalized Birthday Problem
Wagner, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_19 · Cited by 539
Metadata
- Authors
- Hopper, N. J., & Blum, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 52-66
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1529679142
- Cited by
- 499
- References
- 14
- FWCI
- 2.60
- Type
- conference paper
- 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.