The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Authenticating Pervasive Devices with Human Protocols
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 magical number seven, plus or minus two: Some limits on our capacity for processing information.
Miller, G. A. (1956) · Psychological Review · doi:10.1037/h0043158 · Cited by 17,812
The magical number seven, plus or minus two: Some limits on our capacity for processing information.
Miller, G. A. (1994) · Psychological Review · doi:10.1037/0033-295x.101.2.343 · Cited by 17,161
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Some optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems
Weis, S. A., Sarma, S. E., Rivest, R. L., & Engels, D. W. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39881-3_18 · Cited by 1,382
Self-citationHansmann, U., Stöber, T., Merk, L., & Nicklous, M. S. (2003) · Cited by 1,168
The blocker tag: selective blocking of RFID tags for consumer privacy
Juels, A., Rivest, R. L., & Szydlo, M. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948126 · Cited by 807
Self-citationAdvances in Cryptology – ASIACRYPT 2021
(2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3 · Cited by 780
Advances in Cryptology – CRYPTO 2016
Katz, J., & Robshaw, M. J. B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53018-4 · Cited by 767
(1991) · Lecture notes in computer science · doi:10.1007/3-540-46416-6 · Cited by 725
Strong Authentication for RFID Systems Using the AES Algorithm
Feldhofer, M., Dominikus, S., & Wolkerstorfer, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28632-5_26 · Cited by 715
Privacy and security in library RFID: issues, practices, and architectures
Molnar, D., & Wagner, D. (2004) · Proceedings of the 11th ACM conference on Computer and communications security · doi:10.1145/1030083.1030112 · Cited by 681
(2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5 · Cited by 671
Efficient noise-tolerant learning from statistical queries
Kearns, M. (1998) · Journal of the ACM · doi:10.1145/293347.293351 · Cited by 665
(2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56880-1 · Cited by 628
Noise-tolerant learning, the parity problem, and the statistical query model
Blum, A., Kalai, A., & Wasserman, H. (2003) · Journal of the ACM · doi:10.1145/792538.792543 · Cited by 598
Knapsack-type cryptosystems and algebraic coding theory
Niederreiter, H. (1986) · Medical Entomology and Zoology · Cited by 587
Low cost attacks on tamper resistant devices
Anderson, R., & Kuhn, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0028165 · Cited by 582
RFID Systems and Security and Privacy Implications
Sarma, S. E., Weis, S. A., & Engels, D. W. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5_33 · Cited by 547
Self-citationHenrici, D., & Muller, P. (2004) · IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second · doi:10.1109/percomw.2004.1276922 · Cited by 508
Secure Human Identification Protocols
Hopper, N. J., & Blum, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_4 · Cited by 499
Cliques, Coloring, and Satisfiability
(1996) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/026 · Cited by 476
How to Achieve a McEliece-Based Digital Signature Scheme
Courtois, N. T., Finiasz, M., & Sendrier, N. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_10 · Cited by 435
Advances in Cryptology — EUROCRYPT ’95
(1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x · Cited by 355
Squealing Euros: Privacy Protection in RFID-Enabled Banknotes
Juels, A., & Pappu, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45126-6_8 · Cited by 347
Self-citationCryptographic 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
Active attack against HB + : a provably secure lightweight authentication protocol
Gilbert, H., Robshaw, M., & Sibert, H. (2005) · Electronics Letters · doi:10.1049/el:20052622 · Cited by 277
Juels, A. (2004) · IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second · doi:10.1109/percomw.2004.1276920 · Cited by 269
Self-citationSecurity analysis of a cryptographically-enabled RFID device
Bono, S., Green, M., Stubblefield, A., Juels, A., Rubin, A. D., & Szydlo, M. (2005) · USENIX Security Symposium · Cited by 266
Self-citationVisual authentication and identification
Naor, M., & Pinkas, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052245 · Cited by 258
Issues with RFID Usage in Ubiquitous Computing Applications
Floerkemeier, C., & Lampe, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24646-6_13 · Cited by 199
Minimalist Cryptography for Low-Cost RFID Tags (Extended Abstract)
Juels, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30598-9_11 · Cited by 194
Self-citationLightweight Authentication Protocols for Low-Cost RFID Tags
Vajda, I. (2003) · Cited by 190
A new paradigm for public key identification
Stern, J. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556672 · Cited by 180
A Secure Human-Computer Authentication Scheme
Hopper, N., & Blum, M. (2000) · doi:10.21236/ada382135 · Cited by 90
Matsumoto, T. (1996) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/238168.238190 · Cited by 63
Land, T. (1992) · Nature · doi:10.1038/355192a0 · Cited by 60
A two-phase algorithm for solving a class of hard satisfiability problems
Warners, J. P., & van Maaren, H. (1998) · Operations Research Letters · doi:10.1016/s0167-6377(98)00052-2 · Cited by 58
On the security of some cryptosystems based on error-correcting codes
Chabaud, F. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053430 · Cited by 50
Cited by
RFID security and privacy: a research survey
Juels, A. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861395 · Cited by 1,911
Self-citationFast 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
The PHOTON Family of Lightweight Hash Functions
Guo, J., Peyrin, T., & Poschmann, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_13 · Cited by 558
Pseudorandom Functions and Lattices
Banerjee, A., Peikert, C., & Rosen, A. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_42 · Cited by 459
Thakor, V. A., Razzaque, M. A., & Khandaker, M. R. A. (2021) · IEEE Access · doi:10.1109/access.2021.3052867 · Cited by 424
Metadata
- Authors
- Juels, A., & Weis, S. A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 293-308
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2160584199
- Cited by
- 718
- References
- 41
- FWCI
- 27.71
- 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.