The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Honeywords: making password-cracking detectable
Open accessAbstract
We propose a simple method for improving the security of hashed passwords: the maintenance of additional ``honeywords'' (false passwords) associated with each user's account. An adversary who steals a file of hashed passwords and inverts the hash function cannot tell if he has found the password or a honeyword. The attempted use of a honeyword for login sets off an alarm. An auxiliary server (the ``honeychecker'') can distinguish the user password from honeywords for the login routine, and will set off an alarm if a honeyword is submitted.
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
De-anonymizing Social Networks
Narayanan, A., & Shmatikov, V. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.22 · Cited by 1,301
Password security: a case history
Morris, R., & Thompson, K. (1979) · Communications of the ACM · doi:10.1145/359168.359172 · Cited by 926
The Science of Guessing: Analyzing an Anonymized Corpus of 70 Million Passwords
Bonneau, J. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.49 · Cited by 687
All your contacts are belong to us: automated identity theft attacks on social networks
Bilge, L., Strufe, T., Balzarotti, D., & Kirda, E. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526784 · Cited by 545
Password Cracking Using Probabilistic Context-Free Grammars
Weir, M., Aggarwal, S., Medeiros, B. D., & Glodek, B. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.8 · Cited by 524
Kelley, P. G., Komanduri, S., Mazurek, M. L., Shay, R., Vidas, T., Bauer, L., Christin, N., Cranor, L. F., & Lopez, J. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.38 · Cited by 397
Stronger password authentication using browser extensions
Ross, B. B., Jackson, C., Miyake, N., Boneh, D., & Mitchell, J. C. (2005) · USENIX Security Symposium · Cited by 362
A Research Agenda Acknowledging the Persistence of Passwords
Herley, C., & Van Oorschot, P. (2012) · IEEE Security & Privacy Magazine · doi:10.1109/msp.2011.150 · Cited by 279
How Unique and Traceable Are Usernames?
Perito, D., Castelluccia, C., Kaafar, M. A., & Manils, P. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22263-4_1 · Cited by 194
Baiting Inside Attackers Using Decoy Documents
Bowen, B. M., Hershkop, S., Keromytis, A. D., & Stolfo, S. J. (2009) · Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-05284-2_4 · Cited by 193
Cited by
Two birds with one stone: two-factor authentication with security beyond conventional bound
Wang, D., & Wang, P. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2605087 · Cited by 539
Cutting the Gordian Knot: A Look Under the Hood of Ransomware Attacks
Kharraz, A., Robertson, W., Balzarotti, D., Bilge, L., & Kirda, E. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-20550-2_1 · Cited by 458
Qiu, S., Wang, D., Xu, G., & Kumari, S. (2020) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2020.3022797 · Cited by 224
Integrating Cyber Deception Into Attribute-Based Access Control (ABAC) for Insider Threat Detection
Alohaly, M., Balogun, O., & Takabi, D. (2022) · IEEE Access · doi:10.1109/access.2022.3213645 · Cited by 28
Reti, D., Becker, N., Angeli, T., Chattopadhyay, A., Schneider, D., Vollmer, S., & Schotten, H. D. (2024) · Proceedings of the 11th ACM Workshop on Adaptive and Autonomous Cyber Defense · doi:10.1145/3689935.3690394 · Cited by 13
Metadata
- Authors
- Juels, A., & Rivest, R. L.
- Venue
- Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13
- Publisher
- ACM Press
- Published
- 2013
- Pages
- 145-160
- OpenAlex
- W2093397575
- Cited by
- 258
- References
- 27
- FWCI
- 14.80
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Honeywords: making password-cracking detectable. https://app.cochat.ai/papers/10.1145/2508859.2516671
- The paper
- Juels, A., & Rivest, R. L. (2013). Honeywords: making password-cracking detectable. Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13. https://doi.org/10.1145/2508859.2516671
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.