A Cryptanalysis of Two Cancelable Biometric Schemes based on Index-of-Max Hashing
원문 초록
Cancelable biometric schemes generate secure biometric templates by combining user specific tokens and biometric data. The main objective is to create irreversible, unlinkable, and revocable templates, with high accuracy in matching. In this paper, we cryptanalyze two recent cancelable biometric schemes based on a particular locality sensitive hashing function, index-of-max (IoM): Gaussian Random Projection-IoM (GRP-IoM) and Uniformly Random Permutation-IoM (URP-IoM). As originally proposed, these schemes were claimed to be resistant against reversibility, authentication, and linkability attacks under the stolen token scenario. We propose several attacks against GRP-IoM and URP-IoM, and argue that both schemes are severely vulnerable against authentication and linkability attacks. We also propose better, but not yet practical, reversibility attacks against GRP-IoM. The correctness and practical impact of our attacks are verified over the same dataset provided by the authors of these two schemes.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Quantum Processes with Quantum Statistical Queries
Memorization for Good: Encryption with Autoregressive Language Models
Improved (Related-key) Differential-based Neural Distinguishers for SIMON and SIMECK Block Ciphers
Machine Learning Cryptanalysis of a Quantum Random Number Generator
Learning the Enigma with Recurrent Neural Networks
Encoding Cryptographic Functions to SAT Using Transalg System
토론
이 논문과 연결된 포럼 글이 아직 없습니다.