Cited 0 time in webofscience Cited 0 time in scopus

A Visibility-Based Lower Bound for Android Unlock Patterns

Title
A Visibility-Based Lower Bound for Android Unlock Patterns
Authors
Lee, JinwooSeo, Jae WooCho, KookraeLee, Pil JoongYum, Dae Hyun
DGIST Authors
Cho, Kookrae
Issue Date
2017-03
Citation
IEICE Transactions on Information and Systems, E100D(3), 578-581
Type
Article
Article Type
Article
Keywords
Android (Operating System)Android Unlock PatternsAuthenticationBrute ForceConnecting PointsDraw a SecretsGraphical PasswordGraphical PasswordLower BoundLower Boundandroid Unlock PatternsLower BoundsUpper BoundUser AuthenticationUser Authentication
ISSN
1745-1361
Abstract
The Android pattern unlock is a widely adopted graphical password system that requires a user to draw a secret pattern connecting points arranged in a grid. The theoretical security of pattern unlock can be defined by the number of possible patterns. However, only upper bounds of the number of patterns have been known except for 3×3 and 4×4 grids for which the exact number of patterns was found by brute-force enumeration. In this letter, we present the first lower bound by computing the minimum number of visible points from each point in various subgrids. © 2017 The Institute of Electronics, Information and Communication Engineers.
URI
http://hdl.handle.net/20.500.11750/4231
DOI
10.1587/transinf.2016EDL8196
Publisher
Maruzen Co., Ltd.
Related Researcher
Files:
There are no files associated with this item.
Collection:
Companion Diagnostics and Medical Technology Research Group1. Journal Articles


qrcode mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE