Free-text Keystroke Authentication using Transformers: A Comparative Study of Architectures and Loss Functions

• URL: http://arxiv.org/abs/2310.11640v1
• Date: Wed, 18 Oct 2023 00:34:26 GMT
• Title: Free-text Keystroke Authentication using Transformers: A Comparative Study of Architectures and Loss Functions
• Authors: Saleh Momeni and Bagher BabaAli
• Abstract summary: 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.
• Score: 1.0152838128195467
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Keystroke biometrics is a promising approach for user identification and verification, leveraging the unique patterns in individuals' typing behavior. In this paper, we propose a Transformer-based network that employs self-attention to extract informative features from keystroke sequences, surpassing the performance of traditional Recurrent Neural Networks. We explore two distinct architectures, namely bi-encoder and cross-encoder, and compare their effectiveness in keystroke authentication. Furthermore, we investigate different loss functions, including triplet, batch-all triplet, and WDCL loss, along with various distance metrics such as Euclidean, Manhattan, and cosine distances. These experiments allow us to optimize the training process and enhance the performance of our model. To evaluate our proposed model, we employ the Aalto desktop keystroke dataset. The results demonstrate that the bi-encoder architecture with batch-all triplet loss and cosine distance achieves the best performance, yielding an exceptional Equal Error Rate of 0.0186%. Furthermore, alternative algorithms for calculating similarity scores are explored to enhance accuracy. Notably, the utilization of a one-class Support Vector Machine reduces the Equal Error Rate to an impressive 0.0163%. The outcomes of this study indicate that our model surpasses the previous state-of-the-art in free-text keystroke authentication. These findings contribute to advancing the field of keystroke authentication and offer practical implications for secure user verification systems.

Related papers

• Multi-threshold Deep Metric Learning for Facial Expression Recognition [60.26967776920412]
  We present the multi-threshold deep metric learning technique, which avoids the difficult threshold validation. We find that each threshold of the triplet loss intrinsically determines a distinctive distribution of inter-class variations. It makes the embedding layer, which is composed of a set of slices, a more informative and discriminative feature.
  arXiv  Detail & Related papers  (2024-06-24T08:27:31Z)
• Sparse Autoencoders Enable Scalable and Reliable Circuit Identification in Language Models [0.0]
  This paper introduces an efficient and robust method for discovering interpretable circuits in large language models. We propose training sparse autoencoders on carefully designed positive and negative examples. Our findings highlight the promise of discrete sparse autoencoders for scalable and efficient mechanistic interpretability.
  arXiv  Detail & Related papers  (2024-05-21T06:26:10Z)
• 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)
• Self-Distilled Masked Auto-Encoders are Efficient Video Anomaly Detectors [117.61449210940955]
  We propose an efficient abnormal event detection model based on a lightweight masked auto-encoder (AE) applied at the video frame level. We introduce an approach to weight tokens based on motion gradients, thus shifting the focus from the static background scene to the foreground objects. We generate synthetic abnormal events to augment the training videos, and task the masked AE model to jointly reconstruct the original frames.
  arXiv  Detail & Related papers  (2023-06-21T06:18:05Z)
• The Wyner Variational Autoencoder for Unsupervised Multi-Layer Wireless Fingerprinting [6.632671046812309]
  We propose a multi-layer fingerprinting framework that jointly considers the multi-layer signatures for improved identification performance. In contrast to previous works, by leveraging the recent multi-view machine learning paradigm, our method can cluster the device information shared among the multi-layer features without supervision. Our empirical results show that the proposed method outperforms the state-of-the-art baselines in both supervised and unsupervised settings.
  arXiv  Detail & Related papers  (2023-03-28T10:05:06Z)
• BeCAPTCHA-Type: Biometric Keystroke Data Generation for Improved Bot Detection [63.447493500066045]
  This work proposes a data driven learning model for the synthesis of keystroke biometric data. The proposed method is compared with two statistical approaches based on Universal and User-dependent models. Our experimental framework considers a dataset with 136 million keystroke events from 168 thousand subjects.
  arXiv  Detail & Related papers  (2022-07-27T09:26:15Z)
• Human-Object Interaction Detection via Disentangled Transformer [63.46358684341105]
  We present Disentangled Transformer, where both encoder and decoder are disentangled to facilitate learning of two sub-tasks. Our method outperforms prior work on two public HOI benchmarks by a sizeable margin.
  arXiv  Detail & Related papers  (2022-04-20T08:15:04Z)
• Encoding Syntactic Knowledge in Transformer Encoder for Intent Detection and Slot Filling [6.234581622120001]
  We propose a novel Transformer encoder-based architecture with syntactical knowledge encoded for intent detection and slot filling. We encode syntactic knowledge into the Transformer encoder by jointly training it to predict syntactic parse ancestors and part-of-speech of each token via multi-task learning.
  arXiv  Detail & Related papers  (2020-12-21T21:25:11Z)
• Autoencoding Variational Autoencoder [56.05008520271406]
  We study the implications of this behaviour on the learned representations and also the consequences of fixing it by introducing a notion of self consistency. We show that encoders trained with our self-consistency approach lead to representations that are robust (insensitive) to perturbations in the input introduced by adversarial attacks.
  arXiv  Detail & Related papers  (2020-12-07T14:16:14Z)
• A Unified Framework of Surrogate Loss by Refactoring and Interpolation [65.60014616444623]
  We introduce UniLoss, a unified framework to generate surrogate losses for training deep networks with gradient descent. We validate the effectiveness of UniLoss on three tasks and four datasets.
  arXiv  Detail & Related papers  (2020-07-27T21:16:51Z)
• Learning to hash with semantic similarity metrics and empirical KL divergence [3.04585143845864]
  Learning to hash is an efficient paradigm for exact and approximate nearest neighbor search from massive databases. Binary hash codes are typically extracted from an image by rounding output features from a CNN, which is trained on a supervised binary similar/ dissimilar task. We overcome (i) via a novel loss function encouraging the relative hash code distances of learned features to match those derived from their targets. We address (ii) via a differentiable estimate of the KL divergence between network outputs and a binary target distribution, resulting in minimal information loss when the features are rounded to binary.
  arXiv  Detail & Related papers  (2020-05-11T08:20:26Z)

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.