Paper 2024/1445 Original: eprint.iacr.org/2024/1445 ↗
Another Walk for Monchi
Abstract
Monchi is a new protocol aimed at privacy-preserving biometric identification. It begins with scores computation in the encrypted domain thanks to homomorphic encryption and ends with comparisons of these scores to a given threshold with function secret sharing. We here study the integration in that context of scores computation techniques recently introduced by Bassit et al. that eliminate homomorphic multiplications by replacing them by lookup tables. First, we extend this lookup tables biometric recognition solution by adding the use of function secret sharing for the final comparison of scores. Then, we introduce a two-party computation of the scores with lookup tables which fits nicely together with the function secret sharing scores comparison. Our solutions accommodate well with the flight boarding use case introduced by Monchi.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2024-11-25: last updated
- 2024-09-16: published
- Short URL
- https://ia.cr/2024/1445
- License
- https://creativecommons.org/licenses/by-nc-sa/4.0/
BibTeX
@misc{cryptoeprint:2024/1445,
author = {Riccardo Taiello and Emre Tosun and Alberto Ibarrondo and Hervé Chabanne and Melek Önen},
title = {Another Walk for Monchi},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1445},
year = {2024},
url = {https://eprint.iacr.org/2024/1445}
}