An Agent-Based Modeling Approach to Free-Text Keyboard Dynamics for Continuous Authentication
- URL: http://arxiv.org/abs/2505.05015v1
- Date: Thu, 08 May 2025 07:42:05 GMT
- Title: An Agent-Based Modeling Approach to Free-Text Keyboard Dynamics for Continuous Authentication
- Authors: Roberto Dillon, Arushi,
- Abstract summary: Continuous authentication systems leveraging free-text keyboard dynamics offer a promising additional layer of security in a multifactor authentication setup.<n>This study investigates the efficacy of behavioral biometrics by employing an Agent-Based Model (ABM) to simulate diverse typing profiles across mechanical and membrane keyboards.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Continuous authentication systems leveraging free-text keyboard dynamics offer a promising additional layer of security in a multifactor authentication setup that can be used in a transparent way with no impact on user experience. This study investigates the efficacy of behavioral biometrics by employing an Agent-Based Model (ABM) to simulate diverse typing profiles across mechanical and membrane keyboards. Specifically, we generated synthetic keystroke data from five unique agents, capturing features related to dwell time, flight time, and error rates within sliding 5-second windows updated every second. Two machine learning approaches, One-Class Support Vector Machine (OC-SVM) and Random Forest (RF), were evaluated for user verification. Results revealed a stark contrast in performance: while One-Class SVM failed to differentiate individual users within each group, Random Forest achieved robust intra-keyboard user recognition (Accuracy > 0.7) but struggled to generalize across keyboards for the same user, highlighting the significant impact of keyboard hardware on typing behavior. These findings suggest that: (1) keyboard-specific user profiles may be necessary for reliable authentication, and (2) ensemble methods like RF outperform One-Class SVM in capturing fine-grained user-specific patterns.
Related papers
- Dual-Path Adversarial Lifting for Domain Shift Correction in Online Test-time Adaptation [59.18151483767509]
We introduce a dual-path token lifting for domain shift correction in test time adaptation.
We then perform dual-path lifting with interleaved token prediction and update between the path of domain shift tokens and the path of class tokens.
Experimental results on the benchmark datasets demonstrate that our proposed method significantly improves the online fully test-time domain adaptation performance.
arXiv Detail & Related papers (2024-08-26T02:33:47Z) - Keystroke Verification Challenge (KVC): Biometric and Fairness Benchmark
Evaluation [21.63351064421652]
Keystroke dynamics (KD) for biometric verification has several advantages.
KD is among the most discriminative behavioral traits.
We present a new experimental framework to benchmark KD-based biometric verification performance and fairness.
arXiv Detail & Related papers (2023-11-10T11:23:28Z) - Free-text Keystroke Authentication using Transformers: A Comparative
Study of Architectures and Loss Functions [1.0152838128195467]
Keystroke biometrics is a promising approach for user identification and verification, leveraging the unique patterns in individuals' typing behavior.
We propose a Transformer-based network that employs self-attention to extract informative features from keystroke sequences.
Our model surpasses the previous state-of-the-art in free-text keystroke authentication.
arXiv Detail & Related papers (2023-10-18T00:34:26Z) - DEFT: A new distance-based feature set for keystroke dynamics [1.8796659304823702]
We propose a new set of features based on the distance between keys on the keyboard, a concept that has not been considered before in keystroke dynamics.
We build a DEFT model by combining DEFT features with other previously used keystroke dynamic features.
The DEFT model is designed to be device-agnostic, allowing us to evaluate its effectiveness across three commonly used devices.
arXiv Detail & Related papers (2023-10-06T07:26:40Z) - Anomalous Sound Detection using Audio Representation with Machine ID
based Contrastive Learning Pretraining [52.191658157204856]
This paper uses contrastive learning to refine audio representations for each machine ID, rather than for each audio sample.
The proposed two-stage method uses contrastive learning to pretrain the audio representation model.
Experiments show that our method outperforms the state-of-the-art methods using contrastive learning or self-supervised classification.
arXiv Detail & Related papers (2023-04-07T11:08:31Z) - TypeFormer: Transformers for Mobile Keystroke Biometrics [11.562974686156196]
We propose a novel Transformer architecture to model free-text keystroke dynamics performed on mobile devices for the purpose of user authentication.
TypeFormer outperforms current state-of-the-art systems achieving Equal Error Rate (EER) values of 3.25% using only 5 enrolment sessions of 50 keystrokes each.
arXiv Detail & Related papers (2022-12-26T10:25:06Z) - Machine and Deep Learning Applications to Mouse Dynamics for Continuous
User Authentication [0.0]
This article builds upon our previous published work by evaluating our dataset of 40 users using three machine learning and deep learning algorithms.
The top performer is a 1-dimensional convolutional neural network with a peak average test accuracy of 85.73% across the top 10 users.
Multi class classification is also examined using an artificial neural network which reaches an astounding peak accuracy of 92.48%.
arXiv Detail & Related papers (2022-05-26T21:43:59Z) - Realistic simulation of users for IT systems in cyber ranges [63.20765930558542]
We instrument each machine by means of an external agent to generate user activity.
This agent combines both deterministic and deep learning based methods to adapt to different environment.
We also propose conditional text generation models to facilitate the creation of conversations and documents.
arXiv Detail & Related papers (2021-11-23T10:53:29Z) - Federated Learning of User Authentication Models [69.93965074814292]
We propose Federated User Authentication (FedUA), a framework for privacy-preserving training of machine learning models.
FedUA adopts federated learning framework to enable a group of users to jointly train a model without sharing the raw inputs.
We show our method is privacy-preserving, scalable with number of users, and allows new users to be added to training without changing the output layer.
arXiv Detail & Related papers (2020-07-09T08:04:38Z) - TypeNet: Scaling up Keystroke Biometrics [79.19779718346128]
We first analyze to what extent our method based on a Recurrent Neural Network (RNN) is able to authenticate users when the amount of data per user is scarce.
With 1K users for testing the network, a population size comparable to previous works, TypeNet obtains an equal error rate of 4.8%.
Using the same amount of data per user, as the number of test users is scaled up to 100K, the performance in comparison to 1K decays relatively by less than 5%.
arXiv Detail & Related papers (2020-04-07T18:05:33Z) - Certified Robustness to Label-Flipping Attacks via Randomized Smoothing [105.91827623768724]
Machine learning algorithms are susceptible to data poisoning attacks.
We present a unifying view of randomized smoothing over arbitrary functions.
We propose a new strategy for building classifiers that are pointwise-certifiably robust to general data poisoning attacks.
arXiv Detail & Related papers (2020-02-07T21:28:30Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.