Key masking using biometry
From MaRDI portal
Publication:764394
DOI10.1134/S0032946011020098zbMATH Open1242.94021MaRDI QIDQ764394FDOQ764394
Authors: A. L. Chmora 
Publication date: 13 March 2012
Published in: Problems of Information Transmission (Search for Journal in Brave)
Recommendations
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- An algorithm for cryptographic key keeping and generation based on fingerprint features
- scientific article; zbMATH DE number 2089662
- An Application of the Goldwasser-Micali Cryptosystem to Biometric Authentication
Cites Work
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The intractability of computing the minimum distance of a code
- On the inherent intractability of certain coding problems (Corresp.)
- Hardness of approximating the minimum distance of a linear code
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Title not available (Why is that?)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- A fuzzy vault scheme
- Complete discrete 2-D Gabor transforms by neural networks for image analysis and compression
- Selecting cryptographic key sizes
- Password hardening based on keystroke dynamics
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of minimum distance decoding of long linear codes
Cited In (2)
This page was built for publication: Key masking using biometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764394)
