A Cancellable Ranking Based Hashing Method for Fingerprint Template Protection

Jin, Zhe; Hwang, Jung Yeon; Kim, Soo-Hyung; Cho, Sangrae; Lai, Yen Lung; Teoh, Andrew Beng Jin

doi:10.1007/978-3-319-90775-8_30

Cited by 5 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This transformation converts the original template into a complicated form, making it harder for an attacker to break its security. In [33], a non-invertible template transformation based on hash code is employed to ensure its linkability and revocability.…”

Section: Introductionmentioning

confidence: 99%

Optical Ciphering Scheme for Cancellable Speaker Identification System

El‐Shafai¹,

El-Sayed²,

Rashwan³

et al. 2023

Computer Systems Science and Engineering

View full text Add to dashboard Cite

Most current security and authentication systems are based on personal biometrics. The security problem is a major issue in the field of biometric systems. This is due to the use in databases of the original biometrics. Then biometrics will forever be lost if these databases are attacked. Protecting privacy is the most important goal of cancelable biometrics. In order to protect privacy, therefore, cancelable biometrics should be non-invertible in such a way that no information can be inverted from the cancelable biometric templates stored in personal identification/verification databases. One methodology to achieve non-invertibility is the employment of non-invertible transforms. This work suggests an encryption process for cancellable speaker identification using a hybrid encryption system. This system includes the 3D Jigsaw transforms and Fractional Fourier Transform (FrFT). The proposed scheme is compared with the optical Double Random Phase Encoding (DRPE) encryption process. The evaluation of simulation results of cancellable biometrics shows that the algorithm proposed is secure, authoritative, and feasible. The encryption and cancelability effects are good and reveal good performance. Also, it introduces recommended security and robustness levels for its utilization for achieving efficient cancellable biometrics systems.

show abstract

Section: Introductionmentioning

confidence: 99%

Optical Ciphering Scheme for Cancellable Speaker Identification System

El‐Shafai¹,

El-Sayed²,

Rashwan³

et al. 2023

Computer Systems Science and Engineering

View full text Add to dashboard Cite

show abstract

“…PIN and random salting are applied to the original templates to produce cancelable ones. In [35], hash coding was employed as a one-way transformation technique, which serves the revocability and linkability to achieve an acceptable degree of the performance of the biometric system. In remote surveillance systems, authentication techniques involved on the internet of things (IoT) devices is essential to IoT security because it participates in preventing unauthorized person entry to IoT networks, as shown in Fig.…”

Section: Introductionmentioning

confidence: 99%

Efficient and Secure Cancelable Biometric Authentication Framework Based on Genetic Encryption Algorithm

et al. 2021

View full text Add to dashboard Cite

Various cancelable biometric techniques have been proposed to maintain user data security. In this work, a cancelable biometric framework is introduced to satisfy user data security and keeping the original biometric template safe away from intruders. Thus, our main contribution is presenting a novel authentication framework based on the evolutionary Genetic Algorithm (GA)-based encryption technique. The suggested framework produces an entirely unrecognized biometric template by hiding the whole discriminative features of biometric templates; this is with exploiting the outstanding characteristics of the employed Genetic operations of the utilized encryption technique. Firstly, the GA initiates its search from a population of templates, not a single template. Secondly, some statistical operators are used to exploit the resulting initial population to generate successive populations. Finally, the crossover and mutation operations are performed to produce the ultimate cancelable biometric templates. Different biometric databases of the face and fingerprint templates are tested and analyzed. The proposed cancelable biometric framework achieves appreciated sensitivity and specificity results compared to the conventional OSH (Optical Scanning Holography) algorithm. It accomplishes recommended outcomes in terms of the AROC (Area under the Receiver Operating Characteristic) and the probability correlation distribution between the original biometrics and the encrypted biometrics stored in the database. The experimental results prove that the proposed framework achieves excellent results even if the biometric system suffers from different noise ratios. The proposed framework achieves an average AROC value of 0.9998, an EER (Equal Error Rate) of 2.0243×10 -4 , FAR (False Acceptance Rate) of 4.8843×10 -4 , and FRR (False Rejection Rate) of 2.2693×10 -4 .

show abstract