A fuzzy commitment scheme
Ari Juels, MARTIN P. WATTENBERG · Proceedings of the ACM Conference on Computer and Communications Security · 1999
We combine well-known techniques from the areas of error-correcting codes and cryptography to achieve a new type of cryptographic primitive that we refer to as a fuzzy commitment scheme. Like a conventional cryptographic commitment scheme, our fuzzy commitment scheme is both concealing and binding: it is infeasible for an attacker to learn the committed value, and also for the committer to decommit a value in more than one way. In a conventional scheme, a commitment must be opened using a unique witness, which acts, essentially, as a decryption key. By contrast, our scheme is fuzzy in the sense that it accepts a witness that is close to the original encrypting witness in a suitable metric, but not necessarily identical.
Cited by 1,591 works. doi:10.1145/319709.319714 Open-access PDF
Authors
References
- The Theory of Error-Correcting Codes
- Handbook of applied cryptography
- Error-Correcting Codes.
- ERROR CORRECTING CODES
- High confidence visual recognition of persons by a test of statistical independence
- Fuzzy Sets and Fuzzy Logic: Theory and Applications
- Cryptography: Theory and Practice
- Password security
- The Theory of Information and Coding
- A Public-Key Cryptosystem Based On Algebraic Coding Theory