| Paper Abstract and Keywords |
| Presentation |
2015-02-27 13:55
Keystroke dynamics-based user identification via n-graph paths for shorter characteristic texts Yoshihiro Kaneko, Takuya Tsujimoto, Keisuke Ohshima, Atsushi Kato (Gifu Univ.) CAS2014-138 CS2014-110 |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (in English) |
Needless to say, computer systems should be more secure for our safe life and society nowadays. A keystroke dynamics-based user authentication is known as one of potentially valid biometrics. We have so far dealt with a middle-size input, which is neither short text such as password nor long text such as free text. In our previous research, some middle-size input text composed of two hundred keystrokes provides less than 1% EER for fifty-one subjects. To revise data input situation, this report deals with shorter texts. To this end, we have asked totally twenty-nine subjects to type nine shorter texts of Japanese old poems, proverbs and palindromes individually. Although we have proposed digraph model for user authentication or identification, we have not made use of it sufficiently. This report proposes to use size and kind of directed paths composed of n consecutive keys on that model to find different subjects beforehand. Since those paths depend on data filtering, our proposal requires tuning. As identification experiments for those nine characteristic texts, we have a little revised around 65% correctness from around 60% on average. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
keystroke dynamics / user identification / flight time / digraph model / n-graph paths / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 114, no. 462, CAS2014-138, pp. 101-105, Feb. 2015. |
| Paper # |
CAS2014-138 |
| Date of Issue |
2015-02-19 (CAS, CS) |
| ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
| Notes on Review |
This article is a technical report without peer review, and its polished version will be published elsewhere. |
| Download PDF |
CAS2014-138 CS2014-110 |
| Conference Information |
| Committee |
CAS CS |
| Conference Date |
2015-02-26 - 2015-02-27 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Tottori University |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
Network Processor, Signal Processing Circuits for Communication, Wireless LAN/PAN, etc. |
| Paper Information |
| Registration To |
CAS |
| Conference Code |
2015-02-CAS-CS |
| Language |
English |
| Title (in Japanese) |
(See Japanese page) |
| Sub Title (in Japanese) |
(See Japanese page) |
| Title (in English) |
Keystroke dynamics-based user identification via n-graph paths for shorter characteristic texts |
| Sub Title (in English) |
|
| Keyword(1) |
keystroke dynamics |
| Keyword(2) |
user identification |
| Keyword(3) |
flight time |
| Keyword(4) |
digraph model |
| Keyword(5) |
n-graph paths |
| Keyword(6) |
|
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Yoshihiro Kaneko |
| 1st Author's Affiliation |
Gifu University (Gifu Univ.) |
| 2nd Author's Name |
Takuya Tsujimoto |
| 2nd Author's Affiliation |
Gifu University (Gifu Univ.) |
| 3rd Author's Name |
Keisuke Ohshima |
| 3rd Author's Affiliation |
Gifu University (Gifu Univ.) |
| 4th Author's Name |
Atsushi Kato |
| 4th Author's Affiliation |
Gifu University (Gifu Univ.) |
| 5th Author's Name |
|
| 5th Author's Affiliation |
() |
| 6th Author's Name |
|
| 6th Author's Affiliation |
() |
| 7th Author's Name |
|
| 7th Author's Affiliation |
() |
| 8th Author's Name |
|
| 8th Author's Affiliation |
() |
| 9th Author's Name |
|
| 9th Author's Affiliation |
() |
| 10th Author's Name |
|
| 10th Author's Affiliation |
() |
| 11th Author's Name |
|
| 11th Author's Affiliation |
() |
| 12th Author's Name |
|
| 12th Author's Affiliation |
() |
| 13th Author's Name |
|
| 13th Author's Affiliation |
() |
| 14th Author's Name |
|
| 14th Author's Affiliation |
() |
| 15th Author's Name |
|
| 15th Author's Affiliation |
() |
| 16th Author's Name |
|
| 16th Author's Affiliation |
() |
| 17th Author's Name |
|
| 17th Author's Affiliation |
() |
| 18th Author's Name |
|
| 18th Author's Affiliation |
() |
| 19th Author's Name |
|
| 19th Author's Affiliation |
() |
| 20th Author's Name |
|
| 20th Author's Affiliation |
() |
| 21st Author's Name |
|
| 21st Author's Affiliation |
() |
| 22nd Author's Name |
|
| 22nd Author's Affiliation |
() |
| 23rd Author's Name |
|
| 23rd Author's Affiliation |
() |
| 24th Author's Name |
|
| 24th Author's Affiliation |
() |
| 25th Author's Name |
|
| 25th Author's Affiliation |
() |
| 26th Author's Name |
/ / |
| 26th Author's Affiliation |
()
() |
| 27th Author's Name |
/ / |
| 27th Author's Affiliation |
()
() |
| 28th Author's Name |
/ / |
| 28th Author's Affiliation |
()
() |
| 29th Author's Name |
/ / |
| 29th Author's Affiliation |
()
() |
| 30th Author's Name |
/ / |
| 30th Author's Affiliation |
()
() |
| 31st Author's Name |
/ / |
| 31st Author's Affiliation |
()
() |
| 32nd Author's Name |
/ / |
| 32nd Author's Affiliation |
()
() |
| 33rd Author's Name |
/ / |
| 33rd Author's Affiliation |
()
() |
| 34th Author's Name |
/ / |
| 34th Author's Affiliation |
()
() |
| 35th Author's Name |
/ / |
| 35th Author's Affiliation |
()
() |
| 36th Author's Name |
/ / |
| 36th Author's Affiliation |
()
() |
| Speaker |
Author-1 |
| Date Time |
2015-02-27 13:55:00 |
| Presentation Time |
25 minutes |
| Registration for |
CAS |
| Paper # |
CAS2014-138, CS2014-110 |
| Volume (vol) |
vol.114 |
| Number (no) |
no.462(CAS), no.463(CS) |
| Page |
pp.101-105 |
| #Pages |
5 |
| Date of Issue |
2015-02-19 (CAS, CS) |