Enhancing password security with honeywords and LLMs

IF 3.7 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Afamefuna P. Umejiaku, Moroti Sonde, Victor S. Sheng
{"title":"Enhancing password security with honeywords and LLMs","authors":"Afamefuna P. Umejiaku,&nbsp;Moroti Sonde,&nbsp;Victor S. Sheng","doi":"10.1016/j.jisa.2025.104129","DOIUrl":null,"url":null,"abstract":"<div><div>The increasing sophistication of cyber threats has amplified the need for innovative solutions to secure authentication systems. Honeywords, disguised credentials designed to detect unauthorized access, play a crucial role in cybersecurity by serving as early warning mechanisms. However, traditional honeyword generation methods often struggle with high false-positive and False-Negative Probability, limiting their effectiveness against advanced attackers. This study explores the integration of Large Language Models (LLMs) into password and honeyword generation systems. Leveraging LLMs’ natural language processing capabilities, we propose a novel framework for creating secure, user-friendly passwords and realistic honeywords. Our approach introduces multi-word, context-aware decoy generation, enhancing the indistinguishability of honeywords from genuine credentials. Empirical evaluations demonstrate significant improvements in performance metrics. Our model achieves a false negative probability (<span><math><mrow><mi>F</mi><mi>N</mi><mi>P</mi><mrow><mo>(</mo><mi>B</mi><mo>)</mo></mrow></mrow></math></span>) of 0.33944, outperforming existing methods such as the Tweaking Path Model (0.54), the Deep Tweak Model (0.56), and the Chunk-Level GPT3 (0.58). Furthermore, it achieves a near-perfect false positive probability (<span><math><mrow><mi>F</mi><mi>P</mi><mi>P</mi><mrow><mo>(</mo><mi>A</mi><mo>)</mo></mrow></mrow></math></span>) of <span><math><mo>&lt;</mo></math></span>0.01, surpassing all compared algorithms. This research highlights the transformative potential of LLMs in enhancing authentication security. By addressing the limitations of traditional honeyword systems and introducing scalable, customizable solutions, this work contributes to the development of next-generation robust cybersecurity frameworks capable of countering evolving threats.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"93 ","pages":"Article 104129"},"PeriodicalIF":3.7000,"publicationDate":"2025-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Security and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214212625001668","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The increasing sophistication of cyber threats has amplified the need for innovative solutions to secure authentication systems. Honeywords, disguised credentials designed to detect unauthorized access, play a crucial role in cybersecurity by serving as early warning mechanisms. However, traditional honeyword generation methods often struggle with high false-positive and False-Negative Probability, limiting their effectiveness against advanced attackers. This study explores the integration of Large Language Models (LLMs) into password and honeyword generation systems. Leveraging LLMs’ natural language processing capabilities, we propose a novel framework for creating secure, user-friendly passwords and realistic honeywords. Our approach introduces multi-word, context-aware decoy generation, enhancing the indistinguishability of honeywords from genuine credentials. Empirical evaluations demonstrate significant improvements in performance metrics. Our model achieves a false negative probability (FNP(B)) of 0.33944, outperforming existing methods such as the Tweaking Path Model (0.54), the Deep Tweak Model (0.56), and the Chunk-Level GPT3 (0.58). Furthermore, it achieves a near-perfect false positive probability (FPP(A)) of <0.01, surpassing all compared algorithms. This research highlights the transformative potential of LLMs in enhancing authentication security. By addressing the limitations of traditional honeyword systems and introducing scalable, customizable solutions, this work contributes to the development of next-generation robust cybersecurity frameworks capable of countering evolving threats.
通过honeyword和llm增强密码安全性
日益复杂的网络威胁加大了对创新解决方案的需求,以确保身份验证系统的安全。Honeywords是一种伪装凭证,用于检测未经授权的访问,作为早期预警机制,在网络安全中发挥着至关重要的作用。然而,传统的蜜词生成方法往往存在较高的假阳性和假阴性概率,限制了其对高级攻击者的有效性。本研究探讨了将大型语言模型(llm)集成到密码和蜜词生成系统中。利用法学硕士的自然语言处理能力,我们提出了一个新的框架来创建安全,用户友好的密码和现实的甜言蜜语。我们的方法引入了多词、上下文感知的诱饵生成,增强了蜜词与真实凭证的不可区分性。经验性评估表明在性能指标方面有显著的改进。我们的模型实现了0.33944的假阴性概率(FNP(B)),优于现有的方法,如调整路径模型(0.54),深度调整模型(0.56)和块级GPT3(0.58)。此外,它实现了接近完美的假阳性概率(FPP(a))为<;0.01,超过了所有比较算法。这项研究强调了法学硕士在增强身份验证安全性方面的变革潜力。通过解决传统honeyword系统的局限性,并引入可扩展、可定制的解决方案,这项工作有助于开发下一代强大的网络安全框架,能够应对不断变化的威胁。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Information Security and Applications
Journal of Information Security and Applications Computer Science-Computer Networks and Communications
CiteScore
10.90
自引率
5.40%
发文量
206
审稿时长
56 days
期刊介绍: Journal of Information Security and Applications (JISA) focuses on the original research and practice-driven applications with relevance to information security and applications. JISA provides a common linkage between a vibrant scientific and research community and industry professionals by offering a clear view on modern problems and challenges in information security, as well as identifying promising scientific and "best-practice" solutions. JISA issues offer a balance between original research work and innovative industrial approaches by internationally renowned information security experts and researchers.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信