采用击键特征曲线差异度的用户身份认证方法

击键特征是一种能反映用户行为的动态特征,可作为用户身份识别的信息源。传统的认证方法通常仅采用击键特征向量中所包含的每个特征值的大小来进行身份识别,而没有利用任意两个相邻特征值之间的变化率,在一些情况下,可能导致识别准确度不理想。针对上述问题,定义了一种新颖的击键特征曲线差异度的概念,并由此提出基于击键特征曲线差异度的认证算法。该认证算法不仅利用了常规的击键特征信息,还首次引入了任意两个相邻特征值之间的变化率信息,使算法性能得到显著提高。实验结果表明,相比于曼哈顿距离算法、统计学算法、神经网络算法和机器学习算法,新算法的错误拒绝率、错误接受率和相等错误率更低,识别准确度更高,效果更好。     

基于流形学习的用户身份认证

本文基于等距映射（ISOMAP）非线性降维算法, 提出了一种新的基于用户击键特征的用户身份认证算法, 该算法用测地距离代替传统的欧氏距离, 作为样本向量之间的距离度量,在用户击键特征向量空间中挖掘嵌入的低维黎曼流形,进行用户识别。用采集到的1500个击键模式数据进行实验测试,结果表明,该文的算法性能优于现有的同类算法,其错误拒绝率（FRR）和错误通过率（FAR）分别是1.65%和0%,低于现有的同类算法。     

基于差别子空间的用户击键特征识别

根据用户的击键行为特征，提出了一种基于差别子空间的识别算法，该算法仅依据用户前几次成功登录的击键特征计算出能够代表用户击键的共性特征向量，进而利用当前用户击键特征向量与共性特征向量的欧几里德距离作为判别依据来判定用户的身份。该算法主要进行内积运算，实现简单且识别速度快，实验结果表明该算法误报率较低，鲁棒性较强。     

基于三分类的击键序列身份认证

针对基于统计学用户击键模式识别算法识别率较低的不足，提出了一种统计学三分类主机用户身份认证算法。该方法通过对当前注册用户的击键特征与由训练样本得到的标准击键特征进行比较，将当前注册用户划分为合法用户类、怀疑类与入侵类三类,对怀疑类采用二次识别机制。 采用动态判别域值，引入了与系统安全性和友好性相关的可控参量k，由系统管理员根据实际确定。并对该算法性能进行了理论分析与实验测试，结果表明该算法在保持贝叶斯统计算法需要训练样本集规模较小、算法收敛速度快优点的基础上,识别精度高于贝叶斯统计算法，错误拒绝率(FRR)和错误通过率(FAR)分别为1.6%和1.5%。     

基于击键特征的用户身份认证新方法

口令保护机制是绝大多数计算机及网络安全管理中的重要一环，如何有效防止因口令失窃而造成计算机及网络系统的非法进入，一直是一个倍受关注的问题，为此文章提出了一种利用用户口令输入击键特征进行用户身份认证的新方法，该方法利用人在点击键盘时所产生的按键压力和击键频率，构造出能够描述每个用户独有特征的击键特征向量，并由此提出了一种基于有限正例样本集合识别正反例的新算法，相关实验结果表明该身份认证新方法具有较高的用户识别能力。     

基于谱系聚类法的用户击键特征识别

以用户击键特征为依据，提出了一种基于谱系聚类法的识别算法。该算法通过谱系聚类法对用户击键特征向量进行聚类分析，并形成各向量之间的谱系关系，从而由谱系关系来对击键特征向量进行识别。该算法的主要特点是使用欧氏距离进行分类，算法实现简单并且识别速度快。由于采用的聚类算法的简单性，其识别精度尚有待提高，因此该算法适用于击键识别的简单应用。     

基于改进DTW及互信息去噪的手势认证研究

为了应对智能手机所面临的信息安全威胁,提出一种基于行为生物特征的手势用户认证方案。实时采集手机内置三轴加速度传感器的数据,经有效手势端点检测得到认证数据,在信号去噪环节提出了一种结合小波包分解与互信息熵的新方法,最终由改进的动态时间规整算法进行手势信号序列相似性度量,从而得出认证结论。实验结果表明,当他人模仿手势错误接受率趋近0%时,本人认证手势错误拒绝率维持在7%左右,认证精度良好,同时算法时间复杂度低,可以实时有效对智能手机的持有者进行身份识别。     

基于击键压力和时间匹配的异常检测方法

为了有效利用用户的生物特征进行入侵者身份识别,提出了一种基于用户击键特征进行异常检测的新方法.该方法根据人们在击键时所产生的按键压力和时间间隔的惟一性,利用正态分布的特性控制模式库生成方式,构造出能够描述每个用户独有特征的击键特征向量库,然后利用模式匹配算法对新登陆用户进行检测.相关实验验证了该方法具有较高的用户识别能力.     

基于支持向量数据描述的击键生物特征认证

由于计算机用户对键盘的熟悉程度、击键习惯等不尽相同,每个用户都具有自己独特的击键生物特征,对于某个用户来说,其击键特征为正常类,其他所有用户为异常类,这可以利用模式识别中的单类分类器来解决,本文设计基于支持向量数据描述(SVDD)的击键生物特征身份认证系统模型,将该方法与BP、RBF和SOM方法进行对比,证实SVDD具有较好的识别效果,它可将非法用户误接受率从28.9%降低到0.28%,最后给出一个嵌入Windows用户登录中的口令+击键特征身份认证的实现技术.     

基于口令击键过程的用户身份识别方法研究

口令保护机制是计算机系统及其网络安全管理中重要的一环.如何有效防止因口令失窃所造成计算机及其网络系统的非法进入,一直是一个倍受关注的问题.为此本文提出了一种利用用户口令输入时的击键特征进行用户身份认证的方法.该方法利用用户在点击键盘时所产生的按键压力和击键频率,构造出能够描述每个用户特有的击键特征向量,并由此提出了一种基于有限正例样本集合识别正反例的归纳方法.相应的实验结果表明这种用户身份认证方法,具有较高的用户识别能力.     

User authentication via keystroke dynamics based on difference subspace and slope correlation degree

User authentication via keystroke dynamics remains a challenging problem due to the fact that keystroke dynamics pattern cannot be maintained stable over time. This paper describes a novel keystroke dynamics-based user authentication approach. The proposed approach consists of two stages, a training stage and an authentication stage. In the training stage, a set of orthogonal bases and a common feature vector are periodically generated from keystroke features of a legitimate user?s several recent successful authentications. In the authentication stage, the current keystroke feature vector is projected onto the set of orthogonal bases, and the distortion of the feature vector between its projection is obtained. User authentication is implemented by comparing the slope correlation degree of the distortion between the common feature vector with a threshold determined periodically using the recent impostor patterns. Theoretical and experimental results show that the proposed method presents high tolerance to instability of user keystroke patterns and yields better performance in terms of false acceptance rate (FAR) and false rejection rate (FRR) compared with some recent methods.     

A parameterized model to select discriminating features on keystroke dynamics authentication on smartphones

Nowadays, smartphones work not only as personal devices, but also as distributed IoT edge devices uploading information to a cloud. Their secure authentications become more crucial as information from them can spread wider. Keystroke dynamics is one of prominent candidates for authentications factors. Combined with PIN/pattern authentications, keystroke dynamics provide a user-friendly multi-factor authentication for smartphones and other IoT devices equipped with keypads and touch screens. There have been many studies and researches on keystroke dynamics authentication with various features and machine-learning classification methods. However, most of researches extract the same features for the entire user and the features used to learn and authenticate the user’s keystroke dynamics pattern. Since the same feature is used for all users, it may include features that express the users’ keystroke dynamics well and those that do not. The authentication performance may be deteriorated because only the discriminative feature capable of expressing the keystroke dynamics pattern of the user is not selected. In this paper, we propose a parameterized model that can select the most discriminating features for each user. The proposed technique can select feature types that better represent the user’s keystroke dynamics pattern using only the normal user’s collected samples. In addition, performance evaluation in previous studies focuses on average EER(equal error rate) for all users. EER is the value at the midpoint between the FAR(false acceptance rate) and FRR(false rejection rate), FAR is the measure of security, and FRR is the measure of usability. The lower the FAR, the higher the authentication strength of keystroke dynamics. Therefore, the performance evaluation is based on the FAR. Experimental results show that the FRR of the proposed scheme is improved by at least 10.791% from the maximum of 31.221% compared with the other schemes.     

基于手机触摸屏传感器多点触摸身份认证算法

针对智能手机所面临的信息安全威胁问题,提出一种基于手机触摸屏传感器的多点触摸身份认证方法。首先由触摸屏传感器采集手指滑动原始数据序列,通过平滑去噪、位置及长度归一化预处理;然后提取手势运动一阶、二阶归一化导数序列及运动方向为身份验证特征序列;最后采用模板匹配方法,使用动态时间规整算法匹配比较注册模板特征序列与测试特征序列,判断用户身份真实性。仿真结果表明,所提算法对不同用户身份认证的平均错误拒绝率和错误接受率分别为3.83%和2.07%,与使用径向基函数为核函数的支持向量分布估计(SVDE)算法相比,平均错误拒绝率和错误接受率分别降低1.81%和2.35%。经性能分析,所提算法能明显提高身份认证的准确性。     

Continuous Authentications Using Frequent English Terms

Most of the current computer systems authenticate a user’s identity only at the point of entry to the system (i.e., login). However, an effective authentication system includes continuous or frequent monitoring of the identity of a user already logged into a system to ensure the validity of the identity of the user throughout a session. Such a system is called a “continuous or active authentication system.” An authentication system equipped with such a security mechanism protects the system against certain attacks including session hijacking that can be performed later by a malicious user. The aim of this research is to advance the state-of-the-art of the user-active authentication research using keystroke dynamics. Through this research, we assess the performance and influence of various keystroke features on keystroke dynamics authentication systems. In particular, we investigate the performance of keystroke features on a subset of most frequently used English words. The performance of four features including key duration, flight time latency, diagraph time latency, and word total time duration are analyzed. A series of experiments is performed to measure the performance of each feature individually as well as the results from the combinations of these features. More specifically, four machine learning techniques are adapted for the purpose of assessing keystroke authentication schemes. The selected classification methods are Support Vector Machine (SVM), Linear Discriminate Classifier (LDC), K-Nearest Neighbors (K-NN), and Naive Bayesian (NB). Moreover, this research proposes a novel approach based on sequential change-point methods for early detection of an imposter in computer authentication without the needs for any modeling of users in advance, that is, no need for a-priori information regarding changes. The proposed approach based on sequential change-point methods provides the ability to detect the impostor in early stages of attacks. The study is performed and evaluated based on data collected for 28 users. The experimental results indicate that the word total time feature offers the best performance result among all four keystroke features, followed by diagraph time latency. Furthermore, the results of the experiments also show that the combination of features enhances the performance accuracy. In addition, the nearest neighbor method performs the best among the four machine learning techniques.     

Embedded access points for trusted data and resources access in HPC systems

Biometric authentication systems represent a valid alternative to the conventional username–password based approach for user authentication. However, authentication systems composed of a biometric reader, a smartcard reader, and a networked workstation which perform user authentication via software algorithms have been found to be vulnerable in two areas: firstly in their communication channels between readers and workstation (communication attacks) and secondly through their processing algorithms and/or matching results overriding (replay attacks, confidentiality and integrity threats related to the stored information of the networked workstation). In this paper, a full hardware access point for HPC environments is proposed. The access point is composed of a fingerprint scanner, a smartcard reader, and a hardware core for fingerprint processing and matching. The hardware processing core can be described as a Handel-C algorithmic-like hardware programming language and prototyped via a Field Programmable Gate Array (FPGA) based board. The known indexes False Acceptance Rate (FAR) and False Rejection Rate (FRR) have been used to test the prototype authentication accuracy. Experimental trials conducted on several fingerprint DBs show that the hardware prototype achieves a working point with FAR=1.07% and FRR=8.33% on a proprietary DB which was acquired via a capacitive scanner, a working point with FAR=0.66% and FRR=6.13% on a proprietary DB which was acquired via an optical scanner, and a working point with FAR=1.52% and FRR=9.64% on the official FVC2002_DB2B database. In the best case scenario (depending on fingerprint image size), the execution time of the proposed recognizer is 183.32 ms.     

手势认证中基于能量熵的端点检测方法研究

为了保证智能手机敏感信息的安全性,设计实现了一种基于手机内置三轴加速度传感器的三维手势认证方案。在手势端点检测部分,在定性分析手势加速度信号能量分布特性的基础上,提出了一种基于能量熵的新方法实现有效手势截取。进一步设计基于欧式距离的动态时间规整算法对截取后的手势序列信号进行匹配认证,当他人模仿手势错误接受率趋近0%时,本人认证手势错误拒绝率维持在7%左右,从而实现智能手机用户身份识别。     

Unconstrained keystroke dynamics authentication with shared secret

Among all the existing biometric modalities, authentication systems based on keystroke dynamics present interesting advantages. These solutions are well accepted by users and cheap as no additional sensor is required for authenticating the user before accessing to an application. In the last thirty years, many researchers have proposed, different algorithms aimed at increasing the performance of this approach. Their main drawback lies on the large number of data required for the enrollment step. As a consequence, the verification system is barely usable, because the enrollment is too restrictive. In this work, we propose a new method based on the Support Vector Machine (SVM) learning satisfying industrial conditions (i.e., few samples per user are needed during the enrollment phase to create its template). In this method, users are authenticated through the keystroke dynamics of a shared secret (chosen by the system administrator). We use the GREYC keystroke database that is composed of a large number of users (100) for validation purposes. We compared the proposed method with six methods from the literature (selected based on their ability to work with few enrollment samples). Experimental results show that, even though the computation time to build the template can be longer with our method (54 s against 3 s for most of the others), its performance outperforms the other methods in an industrial context (Equal Error Rate of 15.28% against 16.79% and 17.02% for the two best methods of the state-of-the-art, on our dataset and five samples to create the template, with a better computation time than the second best method).