Paper 2025/1211
May the Force $\textit{not}$ Be with you: Brute-Force Resistant Biometric Authentication and Key Reconstruction
Abstract
The use of biometric-based security protocols is on the steep rise. As biometrics become more popular, we witness more attacks. For example, recent BrutePrint/InfinityGauntlet attacks showed how to brute-force fingerprints stored on an Android phone in about 40 minutes. The attacks are possible because biometrics, like passwords, do not have high entropy. But unlike passwords, brute-force attacks are much more damaging for biometrics, because one cannot easily change biometrics in case of compromise. In this work, we propose a novel provably secure Brute-Force Resistant Biometrics (BFRB) protocol for biometric-based authentication and key reconstruction that protects against brute-force attacks even when the server storing biometric-related data is compromised. Our protocol utilizes a verifiable partially oblivious pseudorandom function, an authenticated encryption scheme, a pseudorandom function, and a hash. We formally define security for a BFRB protocol and reduce the security of our protocol to the security of the building blocks. We implement the protocol and study its performance for the ND-0405 iris dataset.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Major revision. ACM CCS 2025
- Keywords
- biometricsbrute-force resistanceauthenticationkey reconstructionOPRF
- Contact author(s)
-
sasha @ gatech edu
dmohan @ gatech edu
ac tianxin tang @ gmail com - History
- 2025-07-02: approved
- 2025-06-28: received
- See all versions
- Short URL
- https://ia.cr/2025/1211
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1211, author = {Alexandra Boldyreva and Deep Inder Mohan and Tianxin Tang}, title = {May the Force $\textit{not}$ Be with you: Brute-Force Resistant Biometric Authentication and Key Reconstruction}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/1211}, year = {2025}, url = {https://eprint.iacr.org/2025/1211} }