A Visibility-Based Lower Bound for Android Unlock Patterns
暂无分享,去创建一个
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. key words: user authentication, graphical password, Android unlock patterns, lower bound
[1] Gary C. Kessler,et al. Technology Corner: Calculating the Number of Android Lock Patterns: An Unfinished Study in Number Theory , 2013, J. Digit. Forensics Secur. Law.
[2] Adam J. Aviv,et al. Is Bigger Better? Comparing User-Generated Passwords on 3x3 vs. 4x4 Grid Sizes for Android's Pattern Unlock , 2015, ACSAC.
[3] Adam J. Aviv,et al. Smudge Attacks on Smartphone Touch Screens , 2010, WOOT.
[4] Markus Dürmuth,et al. Quantifying the security of graphical passwords: the case of android unlock patterns , 2013, CCS.