Event Title

Password typo correction using discrete logarithms

Session

Computer Science and Communication Engineering

Description

As passwords remain the main online authentication method, focus has shifted from naive entropy to how usability improvements can increase security. Chatterjee et al. recently introduced the first two typotolerant password checkers, which improve usability at no security cost but are technically complex. We look at the more general problem of computing an edit distance between two strings without having direct access to those strings — by storing the equivalent of a hash. We propose a simpler algorithm for this problem that is asymptotically quasi-optimal in both bits stored and exchanged, at the cost of more computation on the server.

Keywords:

Usable security • Passwords • Discrete logarithm

Session Chair

Xhafer Krasniqi

Session Co-Chair

Driart Elshani

Proceedings Editor

Edmond Hajrizi

ISBN

978-9951-550-19-2

Location

Pristina, Kosovo

Start Date

26-10-2019 3:30 PM

End Date

26-10-2019 5:00 PM

DOI

10.33107/ubt-ic.2019.279

This document is currently not available here.

Share

COinS
 
Oct 26th, 3:30 PM Oct 26th, 5:00 PM

Password typo correction using discrete logarithms

Pristina, Kosovo

As passwords remain the main online authentication method, focus has shifted from naive entropy to how usability improvements can increase security. Chatterjee et al. recently introduced the first two typotolerant password checkers, which improve usability at no security cost but are technically complex. We look at the more general problem of computing an edit distance between two strings without having direct access to those strings — by storing the equivalent of a hash. We propose a simpler algorithm for this problem that is asymptotically quasi-optimal in both bits stored and exchanged, at the cost of more computation on the server.