Skip to main content

Examination of a New Defense Mechanism: Honeywords

  • Conference paper
  • First Online:
Information Security Theory and Practice (WISTP 2017)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10741))

Abstract

Past experiences show us that password breach is still one of the main methods of attackers to obtain personal or sensitive user data. Basically, assuming they have access to list of hashed passwords, they apply guessing attacks, i.e., attempt to guess a password by trying a large number of possibilities. We certainly need to change our way of thinking and use a novel and creative approach in order to protect our passwords. In fact, there are already novel attempts to provide password protection. The Honeywords system of Juels and Rivest is one of them which provides a detection mechanism for password breaches. Roughly speaking, they propose a method for password-based authentication systems where fake passwords, i.e., “honeywords” are added into a password file, in order to detect impersonation. Their solution includes an auxiliary secure server called “honeychecker” which can distinguish a user’s real password among her honeywords and immediately sets off an alarm whenever a honeyword is used. However, they also pointed out that their system needs to be improved in various ways by highlighting some open problems. In this paper, after revisiting the security of their proposal, we specifically focus on and aim to solve a highlighted open problem, i.e., active attacks where the adversary modifies the code running on either the login server or the honeychecker.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://hashcat.net/hashcat/.

  2. 2.

    https://gist.github.com/epixoip, Retrieved on June 22, 2017.

References

  1. Burgess, M.: How to Check if Your Linkedin Account was Hacked, May 2016. http://www.wired.co.uk/article/linkedin-data-breach-find-out-included

  2. Conklin, A., Dietrich, G., Walz, D.: Password-based authentication: a system perspective. In: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS 2004) - Track 7, HICSS 2004 - vol. 7, pp. 701–702. IEEE Computer Society, Washington, DC (2004)

    Google Scholar 

  3. Florencio, D., Herley, C.: A large-scale study of web password habits. In: Proceedings of the 16th International Conference on the World Wide Web. Association for Computing Machinery Inc. (2007)

    Google Scholar 

  4. Furnell, S., Dowland, P., Illingworth, H., Reynolds, P.: Authentication and supervision: a survey of user attitudes. Comput. Secur. 19, 529–539 (2000)

    Article  Google Scholar 

  5. Gallagher, S.: Yahoo Admits It’s been Hacked Again, and 1 Billion Accounts were Exposed, December 2016. https://arstechnica.com/security/2016/12/yahoo-reveals-1-billion-more-accounts-exposed-and-some-code-may-have-been-stolen/

  6. Juels, A., Rivest, R.L.: Honeywords: making password-cracking detectable. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, CCS 2013, vol. 38, pp. 145–160. ACM (2013)

    Google Scholar 

  7. Keane, J.: Security Researcher Dumps 427 Million Hacked Myspace Passwords Online, July 2016. https://www.digitaltrends.com/social-media/myspace-hack-password-dump/

  8. Kelley, P.G., Komanduri, S., Mazurek, M.L., Shay, R., Vidas, T., Bauer, L., Christin, N., Cranor, L.F., Lopez, J.: Guess again (and again and again): measuring password strength by simulating password-cracking algorithms. In: IEEE Symposium on Security and Privacy, pp. 523–537 (2012)

    Google Scholar 

  9. Sagitta: Brutalis - GPU Compute Nodes. https://sagitta.pw/hardware/gpu-compute-nodes/brutalis/

  10. Wang, D., Wang, P.: Two birds with one stone: two-factor authentication with security beyond conventional bound. IEEE Trans. Depend. Secur. Comput. (2017). https://ieeexplore.ieee.org/document/7558124/

  11. Wang, D., Gu, Q., Cheng, H., Wang, P.: The request for better measurement: a comparative evaluation of two-factor authentication schemes. In: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, ASIA CCS 2016, pp. 475–486. ACM, New York (2016)

    Google Scholar 

  12. Weir, M., Aggarwal, S., de Medeiros, B., Glodek, B.: Password cracking using probabilistic context-free grammars. In: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy, SP 2009, pp. 391–405. IEEE Computer Society, Washington, DC (2009)

    Google Scholar 

Download references

Acknowledgments

Ziya Alper Genç’s research is supported by a partnership between SnT/University of Luxembourg and pEp Security S.A. Mehmet Sabır Kiraz’s work is supported by a grant from Ministry of Development of Turkey provided to the Cloud Computing and Big Data Research Lab Project (project ID: 2014K121030).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ziya Alper Genç .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Genç, Z.A., Kardaş, S., Kiraz, M.S. (2018). Examination of a New Defense Mechanism: Honeywords. In: Hancke, G., Damiani, E. (eds) Information Security Theory and Practice. WISTP 2017. Lecture Notes in Computer Science(), vol 10741. Springer, Cham. https://doi.org/10.1007/978-3-319-93524-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93524-9_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93523-2

  • Online ISBN: 978-3-319-93524-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics