Making the High Security of Repeated Hashing Practical

  Last week I explained how repeated hashing works. Our user Alice can prove that she knows her secret without exposing that secret, and the server can verify this without knowing what her secret is. The follow-up question is – how to make it practical? My explanation last week told you how repeated hashing works, but […]
Read More ›

We Need Something Better Than Passwords, And We Already Have It

A technology called repeated hashing provides user authentication that can only be defeated by guessing the user’s secret or traveling back in time. Since the second is impossible, this is as good as user authentication security can get. Hashing, Again and Again In Learning Tree’s System and Network Security Introduction course we explain hash functions. […]
Read More ›

Type to search blog.learningtree.com

Do you mean "" ?

Sorry, no results were found for your query.

Please check your spelling and try your search again.