1993
DOI: 10.1006/imms.1993.1092
|View full text |Cite
|
Sign up to set email alerts
|

User identification via keystroke characteristics of typed names using neural networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
52
0
3

Year Published

1995
1995
2023
2023

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 146 publications
(58 citation statements)
references
References 0 publications
0
52
0
3
Order By: Relevance
“…Thirty repetitions of each keyword were included, to ensure enough data for classification. The words selected are listed in Table 2, along with the number of inter-keystroke latencies that they involve and the number of samples used for training and testing after outliers were removed (a standard procedure for keystroke analysis studies [7][8][9][10][11][12][13][14][15]. Literature has showed that attempts to perform dynamic analysis on keystroke dynamics [13,14] did not yield satisfactory results.…”
Section: Methodsmentioning
confidence: 99%
“…Thirty repetitions of each keyword were included, to ensure enough data for classification. The words selected are listed in Table 2, along with the number of inter-keystroke latencies that they involve and the number of samples used for training and testing after outliers were removed (a standard procedure for keystroke analysis studies [7][8][9][10][11][12][13][14][15]. Literature has showed that attempts to perform dynamic analysis on keystroke dynamics [13,14] did not yield satisfactory results.…”
Section: Methodsmentioning
confidence: 99%
“…Previous works [3,18,20] used these two components in their verification systems. However, the initial sample sets of [3,20] did not provide enough data to ascertain whether the use of the two separate orthogonal digraph components added significant predictive power to the more traditional key down-to-down measure. Substantially improved performance results based on using the bivariate measure of latency with an appropriate distance measure were achieved by [18].…”
Section: The Current State Of Keystroke Dynamicsmentioning
confidence: 99%
“…Some neural network approaches [1,3,12] have also been undertaken in the last few years. While the back-propagation models used yield favorable performance results on small databases, neural networks have a fundamental limitation in that each time a new user is introduced into the database, the network must be retrained.…”
Section: The Current State Of Keystroke Dynamicsmentioning
confidence: 99%
“…D'Souza's experiment weighted the latencies to reduce false acceptances [4]. Brown and Rogers [3] and Obaidat and Sadoun [15] used short name strings for user verification. Dynamic shuffling was also evaluated as a process applied to training samples for neural networks as a means of enhancing sample classification and reducing false acceptance and rejection rates during keystroke analysis [3].…”
Section: Introductionmentioning
confidence: 99%
“…Brown and Rogers [3] and Obaidat and Sadoun [15] used short name strings for user verification. Dynamic shuffling was also evaluated as a process applied to training samples for neural networks as a means of enhancing sample classification and reducing false acceptance and rejection rates during keystroke analysis [3]. Recent work by Gunnetti and Picardi [8] suggest that if short inputs do not provide sufficient timing C3.2 information, and if long predefined texts entered repeatedly are unacceptable, we are left with only one possible solution, which is using the typing rhythms users show during their normal interaction with a computer; in other words, deal with the keystroke dynamics of free text.…”
Section: Introductionmentioning
confidence: 99%