Error-tolerant password recovery
- 5 November 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
Many encryption systems require the user to memorize high entropy passwords or passphrases and reproduce them exactly. This is often a difficult task. We propose a more fault-tolerant scheme, where a high entropy key (or password) is derived from a sequence of low entropy passwords. The user is able to recover the correct key if she remembers a certain percentage of the passwords correctly. In contrast to other systems that have been proposed for fault-tolerant passwords, our basic design is provably secure against a computationally unbounded attacker.Keywords
This publication has 5 references indexed in Scilit:
- Noisy Polynomial Interpolation and Noisy Chinese RemainderingPublished by Springer Nature ,2000
- Protecting secret keys with personal entropyFuture Generation Computer Systems, 2000
- A fuzzy commitment schemePublished by Association for Computing Machinery (ACM) ,1999
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- How to share a secretCommunications of the ACM, 1979