Keystroke Dynamics Etem DENİZ, Buğra KOCATÜRK, Gülşah YILDIZOĞLU, Ömer UZUN Boğaziçi University, CMPE, May 2010.

Slides:



Advertisements
Similar presentations
Data Mining Classification: Alternative Techniques
Advertisements

Data Mining Classification: Alternative Techniques
An Introduction of Support Vector Machine
1 CS 391L: Machine Learning: Instance Based Learning Raymond J. Mooney University of Texas at Austin.
Behavior-based Authentication Systems
Designing a Multi-Biometric System to Fuse Classification Output of Several Pace University Biometric Systems Leigh Anne Clevenger, Laura Davis, Paola.
Spike Sorting Goal: Extract neural spike trains from MEA electrode data Method 1: Convolution of template spikes Method 2: Sort by spikes features.
Determining applications and characteristics of encrypted wireless traffic. Chris Hanks CMPE 257 3/17/2011.
Keystroke Biometrics Study Software Engineering Project Team + DPS Student.
Long Text Keystroke Biometrics Study Gary Bartolacci, Mary Curtin, Marc Katzenberg, Ngozi Nwana Sung-Hyuk Cha, Charles Tappert (Software Engineering Project.
CS Team 5 Alex Wong Raheel Khan Rumeiz Hasseem Swati Bharati Biometric Authentication System.
Fingerprint Authentication Kevin Amendt David Friend April 26, MIT Course Project Presentations.
By Fernando Seoane, April 25 th, 2006 Demo for Non-Parametric Classification Euclidean Metric Classifier with Data Clustering.
Keystroke Biometric Studies Security Research at Pace Keystroke Biometric Drs. Charles Tappert and Allen Stix Seidenberg School of CSIS.
Keystroke Biometric Studies Keystroke Biometric Identification and Authentication on Long-Text Input Book chapter in Behavioral Biometrics for Human Identification.
1 Nearest Neighbor Learning Greg Grudic (Notes borrowed from Thomas G. Dietterich and Tom Mitchell) Intro AI.
Feature Subset Selection using Minimum Cost Spanning Trees Mike Farah Supervisor: Dr. Sid Ray.
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
05/06/2005CSIS © M. Gibbons On Evaluating Open Biometric Identification Systems Spring 2005 Michael Gibbons School of Computer Science & Information Systems.
CS Instance Based Learning1 Instance Based Learning.
Keystroke Dynamics Jarmo Ilonen. Structure of presentation Introduction Keystroke dynamics for Verification Identification Commercial system: BioPassword.
Methods in Medical Image Analysis Statistics of Pattern Recognition: Classification and Clustering Some content provided by Milos Hauskrecht, University.
Supervised Learning and k Nearest Neighbors Business Intelligence for Managers.
: Chapter 10: Image Recognition 1 Montri Karnjanadecha ac.th/~montri Image Processing.
COMMON EVALUATION FINAL PROJECT Vira Oleksyuk ECE 8110: Introduction to machine Learning and Pattern Recognition.
By: Navid Bahrani, Niloufar Azmi, Majid Mafi
Keystroke Biometric System Client: Dr. Mary Villani Instructor: Dr. Charles Tappert Team 4 Members: Michael Wuench ; Mingfei Bi ; Evelin Urbaez ; Shaji.
A Scalable Self-organizing Map Algorithm for Textual Classification: A Neural Network Approach to Thesaurus Generation Dmitri G. Roussinov Department of.
User Authentication Using Keystroke Dynamics Jeff Hieb & Kunal Pharas ECE 614 Spring 2005 University of Louisville.
K Nearest Neighbors Saed Sayad 1www.ismartsoft.com.
1 SUPPORT VECTOR MACHINES İsmail GÜNEŞ. 2 What is SVM? A new generation learning system. A new generation learning system. Based on recent advances in.
COMPARISON OF IMAGE ANALYSIS FOR THAI HANDWRITTEN CHARACTER RECOGNITION Olarik Surinta, chatklaw Jareanpon Department of Management Information System.
Nearest Neighbor (NN) Rule & k-Nearest Neighbor (k-NN) Rule Non-parametric : Can be used with arbitrary distributions, No need to assume that the form.
Selim Akyokus AIA /2/ AIA 2007 ENHANCED PASSWORD AUTENTICATION THROUGH KEYSTROKE TYPING CHARACTERISTICS Ozlem Guven(1), Selim Akyokus(1),
Security Enhancement for Wireless Communication Bassam Almogahed.
1 Pattern Recognition Pattern recognition is: 1. A research area in which patterns in data are found, recognized, discovered, …whatever. 2. A catchall.
Job scheduling algorithm based on Berger model in cloud environment Advances in Engineering Software (2011) Baomin Xu,Chunyan Zhao,Enzhao Hua,Bin Hu 2013/1/251.
Breast Cancer Diagnosis via Neural Network Classification Jing Jiang May 10, 2000.
I can be You: Questioning the use of Keystroke Dynamics as Biometrics —Paper by Tey Chee Meng, Payas Gupta, Debin Gao Presented by: Kai Li Department of.
An Introduction to Support Vector Machine (SVM)
A NOVEL METHOD FOR COLOR FACE RECOGNITION USING KNN CLASSIFIER
Typing Pattern Authentication Techniques 3 rd Quarter Luke Knepper.
Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors by Dennis DeCoste and Dominic Mazzoni International.
I can be You: Questioning the use of Keystroke Dynamics as Biometrics Tey Chee Meng, Payas Gupta, Debin Gao Ke Chen.
Presentation for CDA6938 Network Security, Spring 2006 Timing Analysis of Keystrokes and Timing Attacks on SSH Authors: Dawn Xiaodong Song, David Wagner,
K nearest neighbors algorithm Parallelization on Cuda PROF. VELJKO MILUTINOVIĆ MAŠA KNEŽEVIĆ 3037/2015.
Support-Vector Networks C Cortes and V Vapnik (Tue) Computational Models of Intelligence Joon Shik Kim.
Keystroke Dynamics By Hafez Barghouthi.
K-Nearest Neighbor Learning.
Debrup Chakraborty Non Parametric Methods Pattern Recognition and Machine Learning.
Kernel nearest means Usman Roshan. Feature space transformation Let Φ(x) be a feature space transformation. For example if we are in a two- dimensional.
Kansas State University Department of Computing and Information Sciences CIS 890: Special Topics in Intelligent Systems Wednesday, November 15, 2000 Cecil.
Frank Bergschneider February 21, 2014 Presented to National Instruments.
TING-YI CHANG ( 張庭毅 ) Phone: EXT 7381 GRADUATE INSTITUTE OF E-LEARNING, NATIONAL CHANGHUA UNIVERSITY OF EDUCATION.
Unobtrusive Mobile User Recognition Patent by Seal Mobile ID Presented By: Aparna Bharati & Ashrut Bhatia.
Automatic Classification of Audio Data by Carlos H. L. Costa, Jaime D. Valle, Ro L. Koerich IEEE International Conference on Systems, Man, and Cybernetics.
Long-Text Keystroke Biometric Applications over the Internet Gary Bartolacci, Mary Curtin, Marc Katzenberg, Ngozi Nwana, Sung-Hyuk Cha, and Charles Tappert.
General-Purpose Learning Machine
Enhancing User identification during Reading by Applying Content-Based Text Analysis to Eye- Movement Patterns Akram Bayat Amir Hossein Bayat Marc.
Motivation and Background
Motivation and Background
Prepared by: Mahmoud Rafeek Al-Farra
Dynamic Authentication of Typing Patterns
Neuro-Fuzzy and Soft Computing for Speaker Recognition (語者辨識)
Multi-Biometrics: Fusing At The Classification Output Level Using Keystroke and Mouse Motion Features Todd Breuer, Paola Garcia Cardenas, Anu George, Hung.
Dynamic Authentication of Typing Patterns
Faculty of Science IT Department Lecturer: Raz Dara MA.
Pattern Recognition and Training
Pattern Recognition and Training
Neural Network Typing Authentication
Presentation transcript:

Keystroke Dynamics Etem DENİZ, Buğra KOCATÜRK, Gülşah YILDIZOĞLU, Ömer UZUN Boğaziçi University, CMPE, May 2010

Agenda Introduction Data Sets / Techniques Algorithms Performance Conclusions Q & A

Introduction Keystroke, a developing biometric technique for user authentication Keystroke, a developing biometric technique for user authentication Secure system because different typing rhythms Secure system because different typing rhythms Keystroke terms, latency, keystroke dynamics, click patterns Keystroke terms, latency, keystroke dynamics, click patterns Only using keystroke dynamics loses effectiveness Only using keystroke dynamics loses effectiveness Neural networks, k-nearest neighbor algorithm, Manhattan(scaled), pattern classification methods to train system Neural networks, k-nearest neighbor algorithm, Manhattan(scaled), pattern classification methods to train system

Data Sets / Techniques t e s t t₁ t₂ t₃ t₄ t₅t₆t₇ t₈ hold time up-down latency down-down latency H.t = t ₂ - t ₁ UD.t.e = t ₃ - t ₂ DD.t.e = t ₃ - t ₁

Algorithms Manhattan (scaled) Nearest Neighbor Neural Network (standard)

Manhattan (scaled)

Performance – Benchmark Data Set The data consist of keystroke-timing information from 51 subjects (typists), each typing a password (.tie5Roanl) 400 times. Test all Users:  GAR = , FAR: Test single User:  User: ‘s002’, GAR: , FAR:  User: ‘s017’, GAR: , FAR:  User: ‘s053’, GAR: , FAR:

Nearest Neighbor Training Phase  Mean vectors of all user’s entries are constructed Test Phase  Euclidean Distance between test entry and the constructed mean vectors are calculated  The one with the minimum value is selected as the current user

Experimental Results The results showed that implementation of Nearest Neighbor is not very effective So, just use of this methodology is not reliable. Combination of both techniques are used to increase the reliability.

Live Demo

Performance of Our Application After testing our system  Password authentication: GAR : Very high FAR = Very low To calculate exact values, we need complex password and large data set.  Password + constant text Increases reliability

Conclusions Keystroke biometrics user authentication system is based on a password and keystroke biometric features Keystroke biometrics user authentication system is based on a password and keystroke biometric features The system offers a higher level of security and convenience for computers The system offers a higher level of security and convenience for computers For our project we have selected Neural Networks, Manhattan (scaled), and algorithms and “latency between consecutive keystrokes” and/or “duration of the keystroke, hold-time” t echniques. For our project we have selected Neural Networks (standard), Manhattan (scaled), and Nearest Neighbor (Mahalanobis) algorithms and “latency between consecutive keystrokes” and/or “duration of the keystroke, hold-time” t echniques.

Conclusions (cont’d) To train system Manhattan (scaled) and Nearest Neighbor algorithms are used successfully, but neural networks (standard) can not. It is because that training process takes too long, and returning value is not suitable to test system.