NESec: A Modified-UI Honeyword Generation Strategy for Mitigating Targeted Guessing Attacks
Bibliographic record
Abstract
By harnessing Graphics Processing Unit (GPU), Field-programmable Gate Array (FPGA), and advanced cracking techniques, the success rates of server-side threats on passwords have reached unprecedented levels. Honeywords, also known as decoy passwords, have emerged as a promising detection strategy against this threat scenario. However, existing work falls short in creating a trap to counter targeted guessing attackers <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(\mathbf{TgA})$</tex> who exploit users' personal information to bypass honeyword-based traps. In this paper, we introduce two fundamental honeyword generation modules, namely NSecure-modifiedUI and ESecure-modifiedUI. Building upon these primary modules, we propose a hybrid honeyword-based strategy named NESec, which significantly enhances the ability to detect <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{TgA}$</tex> 's activities. A comparative analysis showcases the usability advantages and security benefits of the proposed NESec approach.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".