Graphical Dictionaries Presentation by Roger Kahn1 Graphical Dictionaries & Memorable Space of Graphical Passwords

Graphical Dictionaries Presentation by Roger Kahn2 Memorable Space of Graphical Passwords Based on Article by Thorpe, van Oorschot USENIX 2004 Contains References to The Design and Analysis of Graphical Passwords by Jermyn et. al

Graphical Dictionaries Presentation by Roger Kahn3 Memorable Space of Graphical Passwords Purpose of Paper Define a class of memorable graphical passwords Map it on the DAS scheme from Jermyn et al (Moti ’ s lecture)

Graphical Dictionaries Presentation by Roger Kahn4 Memorable Space of Graphical Passwords Textual Passwords Passwords chosen are usually ones that are easy to remember Concrete words easier to remember Text Password space used (with high probability) vulnerable to dictionary attacks since it ’ s a relatively small subset of total password space

Graphical Dictionaries Presentation by Roger Kahn5 Memorable Space of Graphical Passwords Graphical Passwords Recall by people of pictures is better than words – including concrete nouns Presumably better since memorable password space and total password space is larger

Graphical Dictionaries Presentation by Roger Kahn6 Memorable Space of Graphical Passwords Recall of Pictures that are symmetric are far better Recall of pictures symmetric around some truly vertical or horizontal axis is still better due to mirror symmetry Studies indicate that horizontal and vertical symmetry that are centered is still better

Graphical Dictionaries Presentation by Roger Kahn7 Memorable Space of Graphical Passwords Are Types of images recalled better than others? The paper criticizes the visual recall studies due to short recall times in the tests Suggestion that recall is far better than studied

Graphical Dictionaries Presentation by Roger Kahn8 Memorable Space of Graphical Passwords DAS Scheme Review User defined Drawings Repeatable Drawings Start and End Points for drawing Stroke – Movement of the pen on grid between clearly defined points movements on border not accepted Password - List of successive points which stroke goes through separated by pen-up Stroke goes from neighbor to neighbor

Graphical Dictionaries Presentation by Roger Kahn9 Memorable Space of Graphical Passwords DAS Scheme Review(cont ’ d) If current point is (x,y) neighbors are (x,y+1), (x,y-1), (x+1,y), (x-1, y) Stroke length is # of neighbors drawn through until pen-up Password Length is the sum of the stroke lengths Password Space for L max =2 on 5X5 grid is Character password < 2 53

Graphical Dictionaries Presentation by Roger Kahn10 Memorable Space of Graphical Passwords Proposed Class of Memorable Graphical Passwords Purpose of Study Mirror Symmetrical graphical passwords selected Psychological Studies show recall improved over time toward mirror symmetrical images Need to remember less(½ of image plus symmetry axis) Objects viewed and recalled better than pictures

Graphical Dictionaries Presentation by Roger Kahn11 Memorable Space of Graphical Passwords Class I of memorable Passwords Mirror Symmetry about a reflection axis (Vertical or Horizontal) which cuts a 2D set of grid cells of size 5x5 Each Component may be a pair of mirror symmetric components as well Naming Leaves open possibility for future types

Graphical Dictionaries Presentation by Roger Kahn12 Memorable Space of Graphical Passwords

Graphical Dictionaries Presentation by Roger Kahn13 Memorable Space of Graphical Passwords

Graphical Dictionaries Presentation by Roger Kahn14 Memorable Space of Graphical Passwords

Graphical Dictionaries Presentation by Roger Kahn15 Memorable Space of Graphical Passwords Class I of memorable Passwords(cont ’ d) Assumption: User draws password such that the composite stroke of each mirror symmetric component are drawn symmetrically Assumption taken since temporal order of password affects ability of user to recall password One to many relationship between stroke order and drawing

Graphical Dictionaries Presentation by Roger Kahn16 Memorable Space of Graphical Passwords Symmetric Encoding Example

Graphical Dictionaries Presentation by Roger Kahn17 Memorable Space of Graphical Passwords Symmetry Example

Graphical Dictionaries Presentation by Roger Kahn18 Memorable Space of Graphical Passwords Continuous, Enclosed, Disjoint Cases

Graphical Dictionaries Presentation by Roger Kahn19 Memorable Space of Graphical Passwords Continuous, Enclosed, Disjoint Cases

Graphical Dictionaries Presentation by Roger Kahn20 Memorable Space of Graphical Passwords Smaller Password Spaces Class Ia – Subset of Class I passwords whos components are symmetric (individually or pairwise) Class Ib – Subset of Class Ia. Symmetric around Vertical and Horizontal Axes

Graphical Dictionaries Presentation by Roger Kahn21 Memorable Space of Graphical Passwords Quantifying Memorable Password Space General Approach # of passwords given a maximum stroke length This paper ’ s method include only symmetric strokes Stroke set is the number of symmetric strokes from start to end of length l. # of permutations of 4 directions while symmetric around a valid axis Parameters are path diversions, room between current point and the grid bound

Graphical Dictionaries Presentation by Roger Kahn22 Memorable Space of Graphical Passwords Approximate Size of Class I Passwords Class I dictionary size very close to the size of the full password space Class Ia, Ib much more vulnerable to Brute-Force attacks. It ’ s a much smaller password space.

Graphical Dictionaries Presentation by Roger Kahn23 Memorable Space of Graphical Passwords

Graphical Dictionaries Presentation by Roger Kahn24 Memorable Space of Graphical Passwords Questions and Discussion

Graphical Dictionaries Presentation by Roger Kahn25 Memorable Space of Graphical Passwords Assignment Why are the password subclasses more vulnerable to a brute force dictionary attacks? What is easier for Humans to recall pictures or words? What types of pictures and words are the easiest to recall? What is a stroke?