Robust and Reusable Fuzzy Extractors for Low-entropy Rate Randomness Sources
Abstract: Fuzzy extractors (FE) are cryptographic primitives that extract reliable cryptographic key from noisy real world random sources such as biometric sources. The FE generation algorithm takes a source sample, extracts a key and generates some helper data that will be used by the reproduction algorithm to recover the key. Reusability of FE guarantees that security holds when FE is used multiple times with the same source, and robustness of FE requires tampering with the helper data be detectable. In this paper, we consider information theoretic FEs, define a strong notion of reusability, and propose strongly robust and reusable FEs (srrFE) that provides the strongest combined notion of reusability and robustness for FEs. We give two constructions, one for reusable FEs and one for srrFE with information theoretic (IT) security for structured sources. The constructions are for structured sources and use sample-then-lock approach. We discuss each construction and show their unique properties in relation to existing work. Construction 2 is the first robust and reusable FE with IT-security without assuming random oracle. The robustness is achieved by using an IT-secure MAC with security against key-shift attack, which can be of independent interest.
- U. Maurer, “Secret Key Agreement by Public Discussion from Common Information,” IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733–742, may 1993. [Online]. Available: https://ieeexplore.ieee.org/document/256484/
- Dodis, Ostrovsky, Reyzin, and Smith, “Fuzzy extractors: How to generate strong keys from biometrics and other noisy data,” SIAM J. Comput., vol. 38, no. 1, pp. 97–139, 2008. [Online]. Available: https://doi.org/10.1137/060651380
- Daugman, “How iris recognition works,” IEEE Trans. Circuits Syst. Video Technol., vol. 14, no. 1, pp. 21–30, 2004. [Online]. Available: https://doi.org/10.1109/TCSVT.2003.818350
- Karakaya, Alptekin, and İncel, “Using behavioral biometric sensors of mobile phones for user authentication,” Procedia Computer Science, vol. 159, pp. 475–484, 2019.
- M. M. Islam, R. Safavi-Naini, and M. Kneppers, “Scalable behavioral authentication,” IEEE Access, vol. 9, pp. 43 458–43 473, 2021.
- Boyen, “Reusable cryptographic fuzzy extractors,” in Proceedings of the 11th ACM Conf. on Computer and communications security, 2004, pp. 82–91.
- Canetti, Fuller, Paneth, Reyzin, and Smith, “Reusable fuzzy extractors for low-entropy distributions,” Cryptol. ePrint Archive, Report 2014/243, 2014, https://ia.cr/2014/243.
- Dodis, Kanukurthi, Katz, Reyzin, and D. Smith, “Robust fuzzy extractors and authenticated key agreement from close secrets,” IEEE Trans. Inf. Theory, vol. 58, no. 9, pp. 6207–6222, 2012. [Online]. Available: https://doi.org/10.1109/TIT.2012.2200290
- Wen and Liu, “Robustly reusable fuzzy extractor from standard assumptions,” in ASIACRYPT 2018, ser. LNCS, vol. 11274. Springer, pp. 459–489. [Online]. Available: https://doi.org/10.1007/978-3-030-03332-3_17
- Wen, Liu, and Han, “Reusable fuzzy extractor from the decisional diffie-hellman assumption,” Des. Codes Cryptogr., vol. 86, no. 11, pp. 2495–2512, 2018. [Online]. Available: https://doi.org/10.1007/s10623-018-0459-4
- Wen, Liu, and Gu, “Generic constructions of robustly reusable fuzzy extractor,” in PKC 2019. Springer International Publishing, 2019, pp. 349–378.
- Simhadri, Steel, and Fuller, “Cryptographic authentication from the iris,” in ISC 22, 2019, vol. 11723, 2019, pp. 465–485. [Online]. Available: https://doi.org/10.1007/978-3-030-30215-3_23
- N. Cui, S. Liu, D. Gu, and J. Weng, “Robustly reusable fuzzy extractor with imperfect randomness,” Des. Codes Cryptogr., vol. 89, no. 5, pp. 1017–1059, 2021. [Online]. Available: https://doi.org/10.1007/s10623-021-00843-1
- S. Panja, N. Tripathi, S. Jiang, and R. Safavi-Naini, “Robust and reusable fuzzy extractors and their application to authentication from iris data,” Cryptology ePrint Archive, Paper 2023/284, 2023, https://eprint.iacr.org/2023/284. [Online]. Available: https://eprint.iacr.org/2023/284
- Boyen, Dodis, Katz, Ostrovsky, and Smith, “Secure remote authentication using biometric data,” in Proc. EUROCRYPT 2005. Springer, 2005, pp. 147–163.
- B. Fuller, L. Reyzin, and A. Smith, “When are fuzzy extractors possible?” IEEE Transactions on Information Theory, vol. 66, no. 8, pp. 5282–5298, 2020.
- Apon, Cho, Eldefrawy, and Katz, “Efficient, reusable fuzzy extractors from LWE,” in CSCML 2017, Proc., ser. LNCS, vol. 10332. Springer, 2017, pp. 1–18. [Online]. Available: https://doi.org/10.1007/978-3-319-60080-2_1
- Feng and Tang, “Computational robust (fuzzy) extractors for crs-dependent sources with minimal min-entropy,” in Theory of Cryptogr. Conf. Springer, 2021, pp. 689–717.
- D. Apon, C. Cachet, B. Fuller, P. Hall, and F.-H. Liu, “Nonmalleable digital lockers and robust fuzzy extractors in the plain model,” in Advances in Cryptology – ASIACRYPT 2022, S. Agrawal and D. Lin, Eds. Cham: Springer Nature Switzerland, 2022, pp. 353–383.
- Cramer, Dodis, Fehr, Padró, and Wichs, “Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors,” in Advances in Cryptol. - EUROCRYPT 2008, ser. LNCS, vol. 4965. Springer, 2008, pp. 471–488. [Online]. Available: https://doi.org/10.1007/978-3-540-78967-3_27
- Dodis and Wichs, “Non-malleable extractors and symmetric key cryptography from weak secrets,” in ACM Symp. on Theory of Computing, 2009, pp. 601–610.
- U. M. Maurer and S. Wolf, “Secret-key agreement over unauthenticated public channels III: privacy amplification,” IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 839–851, 2003. [Online]. Available: https://doi.org/10.1109/TIT.2003.809559
- Impagliazzo, Levin, and Luby, “Pseudo-Random Generation from One-Way Functions,” in STOC ’89. ACM Press, 1989, pp. 12–24. [Online]. Available: http://portal.acm.org/citation.cfm?doid=73007.73009
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.