Adversarial Activity Detection and Prediction Using Behavioral Biometrics

Behavioral biometrics can be used in different security applications like authentication, identification, etc. One of the trending applications is predicting future activities of people and guessing whether they will engage in malicious activities in the future. In this research, we study the possibility of predicting future activities and propose novel methods for near-future activity prediction. First, we study gait signals captured using smartphone accelerometer sensor and build a model to predict a future gait signal. Activity recognition using body movements captured from mobile phone sensors has been a major point of interest in recent research. Data that is being continuously read from mobile sensors can be used to recognize user activity. We propose a model for predicting human body movements based on the previous activity that has been read from sensors and continuously updating our prediction as new data becomes available. Our results show that our model can predict the future movement signal with a high accuracy that can contribute to several applications in the area. Second, we study keystroke acoustics and build a model for predicting future activities of the users by recording their keystrokes audio. Using keystroke acoustics to predict typed text has significant advantages, such as being recorded covertly from a distance and requiring no physical access to the computer system. Recently, some studies have been done on keystroke acoustics, however, to the best of our knowledge none have used them to predict adversarial activities. On a dataset of two million keystrokes consisting of seven adversarial and one benign activity, we use a signal processing approach to extract keystrokes from the audio and a clustering method to recover the typed letters followed by a text recovery module to regenerate the typed words. Furthermore, we use a neural network model to classify the benign and adversarial activities and achieve significant results: (1) we extract individual keystroke sounds from the raw audio with 91% accuracy and recover words from audio recordings in a noisy environment with 71% average top-10 accuracy. (2) We classify adversarial activities with 93% to 98% average accuracy under different operating scenarios. Third, we study the correlation between the personality traits of users with their keystroke and mouse dynamics. Even with the availability of multiple interfaces, such as voice, touch, etc., keyboard and mouse remain the primary interfaces to a computer. Any insights on the relation between keyboard and mouse dynamics with the personality type of the users can provide foundations for various applications, such as advertisement, social media, etc. We use a dataset of keystroke and mouse dynamics collected from 104 users together with their responses to two personality tests to analyze how their interaction with the computer relates to their personality. Our findings show that there are considerable trends and patterns in keystroke and mouse dynamics that are correlated with each personality type

Bolstering user authentication: a kernel-based fuzzy-clustering model for typing dynamics

In most information systems today, static user authentication is accomplished when the user provides a credential (for example, user ID and the matching password). However, passwords appear to be the most insecure authentication method as they are vulnerable to attacks chiefly caused by poor password hygiene. We contend that an additional, non-intrusive level of security can be achieved by analyzing keystroke biometrics and coming up with a unique biometric template of a user\u27s typing pattern. The paper proposes a new model for representing raw keystroke data collected when analyzing typing biometrics. The model is based on fuzzy sets and kernel functions. The corresponding algorithm is developed. In the static authentication problem, our model demonstrated relatively higher performance than some classic anomaly-detection algorithms, such as Mahalanobis, Manhattan, nearest neighbor, outlier counting, neural network, and the support-vector machine

Credential hardening by using touchstroke dynamics

Today, reliance on digital devices for daily routines has been shifted towards portable mobile devices. Therefore, the need for security enhancements within this platform is imminent. Numerous research works have been performed on strengthening password authentication by using keystroke dynamics biometrics, which involve computer keyboards and cellular phones as input devices. Nevertheless, experiments performed specifically on touch screen devices are relatively lacking. This paper describes a novel technique to strengthen security authentication systems on touch screen devices via a new sub variant behavioural biometrics called touchstroke dynamics. We capitalize on the high resolution timing latency and the pressure information on touch screen panel as feature data. Following this a light weight algorithm is introduced to calculate the similarity between feature vectors. In addition, a fusion approach is proposed to enhance the overall performance of the system to an equal error rate of 7.71% (short input) and 6.27% (long input)

Gait Verification using Knee Acceleration Signals

A novel gait recognition method for biometric applications is proposed. The approach has the following distinct features. First, gait patterns are determined via knee acceleration signals, circumventing difficulties associated with conventional vision-based gait recognition methods. Second, an automatic procedure to extract gait features from acceleration signals is developed that employs a multiple-template classification method. Consequently, the proposed approach can adjust the sensitivity and specificity of the gait recognition system with great flexibility. Experimental results from 35 subjects demonstrate the potential of the approach for successful recognition. By setting sensitivity to be 0.95 and 0.90, the resulting specificity ranges from 1 to 0.783 and 1.00 to 0.945, respectively

Ranking to Learn and Learning to Rank: On the Role of Ranking in Pattern Recognition Applications

The last decade has seen a revolution in the theory and application of machine learning and pattern recognition. Through these advancements, variable ranking has emerged as an active and growing research area and it is now beginning to be applied to many new problems. The rationale behind this fact is that many pattern recognition problems are by nature ranking problems. The main objective of a ranking algorithm is to sort objects according to some criteria, so that, the most relevant items will appear early in the produced result list. Ranking methods can be analyzed from two different methodological perspectives: ranking to learn and learning to rank. The former aims at studying methods and techniques to sort objects for improving the accuracy of a machine learning model. Enhancing a model performance can be challenging at times. For example, in pattern classification tasks, different data representations can complicate and hide the different explanatory factors of variation behind the data. In particular, hand-crafted features contain many cues that are either redundant or irrelevant, which turn out to reduce the overall accuracy of the classifier. In such a case feature selection is used, that, by producing ranked lists of features, helps to filter out the unwanted information. Moreover, in real-time systems (e.g., visual trackers) ranking approaches are used as optimization procedures which improve the robustness of the system that deals with the high variability of the image streams that change over time. The other way around, learning to rank is necessary in the construction of ranking models for information retrieval, biometric authentication, re-identification, and recommender systems. In this context, the ranking model's purpose is to sort objects according to their degrees of relevance, importance, or preference as defined in the specific application.Comment: European PhD Thesis. arXiv admin note: text overlap with arXiv:1601.06615, arXiv:1505.06821, arXiv:1704.02665 by other author

Ranking to Learn and Learning to Rank: On the Role of Ranking in Pattern Recognition Applications

The last decade has seen a revolution in the theory and application of machine learning and pattern recognition. Through these advancements, variable ranking has emerged as an active and growing research area and it is now beginning to be applied to many new problems. The rationale behind this fact is that many pattern recognition problems are by nature ranking problems. The main objective of a ranking algorithm is to sort objects according to some criteria, so that, the most relevant items will appear early in the produced result list. Ranking methods can be analyzed from two different methodological perspectives: ranking to learn and learning to rank. The former aims at studying methods and techniques to sort objects for improving the accuracy of a machine learning model. Enhancing a model performance can be challenging at times. For example, in pattern classification tasks, different data representations can complicate and hide the different explanatory factors of variation behind the data. In particular, hand-crafted features contain many cues that are either redundant or irrelevant, which turn out to reduce the overall accuracy of the classifier. In such a case feature selection is used, that, by producing ranked lists of features, helps to filter out the unwanted information. Moreover, in real-time systems (e.g., visual trackers) ranking approaches are used as optimization procedures which improve the robustness of the system that deals with the high variability of the image streams that change over time. The other way around, learning to rank is necessary in the construction of ranking models for information retrieval, biometric authentication, re-identification, and recommender systems. In this context, the ranking model's purpose is to sort objects according to their degrees of relevance, importance, or preference as defined in the specific application.Comment: European PhD Thesis. arXiv admin note: text overlap with arXiv:1601.06615, arXiv:1505.06821, arXiv:1704.02665 by other author