Alignment-Robust Cancelable Biometric Scheme for Iris Verification

In the modern digital world, biometric systems are a significant part of personal identification and access control. The use of sensitive biometric data such as iris and facial features raises huge privacy concerns because of the possibilities of data breaches and misuse. Therefore, this project focuses on the enhancement of the security of multimodal biometric systems through encryption mechanisms. The idea is to generate a strong biometric key based on features produced from iris and face biometric systems through advanced machine learning techniques. The features are then employed to produce a strong biometric key capable of encrypting the secret value using the AES algorithm. AES is a widely adopted symmetric encryption algorithm that ensures high efficiency in its software implementation and seamless processing capabilities of image data. This provides not only the reinforcement of authentication but also maintains confidentiality of biometric characteristics and mitigates the risks of privacy attacks and unauthorized access. Thus, this multimodal biometric encryption improves reliability, robustness, and the resistance power of the system against potential attacks, making it a promising step forward in the realm of secure biometric authenticationsystems. Keywords- Biometric encryption,Multimodal biometrics, ,Privacy attacks,Advanced Encryption Standard (AES), Biometric key generation,Iris recognition,Face recognition,Machine learning,Bio-crypto systems, Data security.

Cancelable biometrics has been proposed for canceling and re-issuing biometric templates and for protecting privacy in biometrics systems. Recently, new cancelable biometric approaches are proposed based on BioHashing, which are random transformed feature-based cancelable biometrics. In this paper, we consider the accuracy of one of the cancelable biometrics based on BioHashing and face. Through this analysis, as an illustration, we would like to raise an issue to be considered in cancelable biometrics: accuracy may be traded for biometrics being cancelable.

The main aim of biometric-based identification systems is to automatically recognize individuals based on their physiological and/or behavioural characteristics such as fingerprint, face, hand-geometry, among others. These systems offer several advantages over traditional forms of identity protection. However, there are still some important aspects that need to be addressed in these systems. The main questions are concerned with the security of biometric authentication systems since it is important to ensure the integrity and public acceptance of these systems. In order to avoid the problems arising from compromised biometric templates, the concept of cancellable biometrics has recently been introduced. The concept is to transform a biometric trait into a new representation for enrolment and matching. Although cancellable biometrics were proposed to solve privacy concerns, the concept raises new issues, since they make the authentication problem more complex and difficult to solve. Thus, more effective authentication structures are needed to perform these tasks. In this paper, we investigate the use of ensemble systems in cancellable biometrics, using fingerprint-based identification to illustrate the possible benefits accruing. In order to increase the effectiveness of the proposed ensemble systems, three feature selection methods will be used to distribute the attributes among the individual classifiers of an ensemble. The main aim of this paper is to analyse the performance of such well-established structures on transformed biometric data to determine whether they have a positive effect on the performance of this complex and difficult task.

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.

Machine learning models are vulnerable to both security attacks (e.g., adversarial examples) and privacy attacks (e.g., private attribute inference). We take the first step to mitigate both the security and privacy attacks, and maintain task utility as well. Particularly, we propose an information-theoretic framework to achieve the goals through the lens of representation learning, i.e., learning representations that are robust to both adversarial examples and attribute inference adversaries. We also derive novel theoretical results under our framework, e.g., the inherent trade-off between adversarial robustness/utility and attribute privacy, and guaranteed attribute privacy leakage against attribute inference adversaries.

Template-Protection-Techniken stellen eine wichtige Ergänzung zu biometrischen Systemen, um das gewünschte Sicherheitsniveau zu erreichen und die Anforderungen an den Schutz der Privatsphäre zu erfüllen. Diese Techniken ermöglichen Erneuerung und Widerruf der Referenzendaten in biometrischen Systemen. In dieser Arbeit wird ein systematisches Evaluierungsframework entwickelt, das sich an die wesentlichen Kriterien und Anforderungen an biometrische Template-Protection-Verfahren festhält. Seine Anwendbarkeit wird durch die Analyse der verschiedenen Algorithmen demonstriert. Die in dieser Arbeit präsentierte Evaluierung ist grundlegend für eine vollständige Analyse. Darüber hinaus ermöglicht es einen Nachweis der Sicherheit und Einhaltung der Privatsphäre. Es schafft eine Basis für Zertifizierung und Benchmark der Template-Protection-Verfahren.

Biometrics plays a vital role in security through authentication and verification. Securing the biometric template is the current challenge field of research. As intruders attack the biometric system which affects the applications which are being used for human authentication. To name a few border security, access control surveillance and so on. Vulnerabilities too affect the protected templates at the time of biometric verification process. Biometric templates can be protected by using the techniques like transformation or cancelable biometrics, biometrics cryptosystem, and hybridization. Most of the vulnerabilities or attacks are resolved by developing hybridization process like combining biometrics template with user knowledge keys or passwords for secure authentication. The challenges in template protection are like alignment of template, selection of pseudonymous identifiers (PI), and auxiliary data (AD). An attempt is made to review the literature in this direction and present few issues and challenges in the field of biometric template protection.

Trivial quantisation is widely used in cancellable biometrics and bio-cryptosystems for error tolerance. This method segments the feature domain into several non-overlapping intervals of equal size, whereas all features in the same interval will be considered matched. Although it is intuitive that trivial quantisation brings about the boundary issue, similar features near interval boundaries may be mapped into different intervals and lead to matching failure. Previous works do not provide specific theoretical analysis on how trivial quantisation impacts discrimination power (DP), an important performance index in biometric systems. Assuming genuine features and imposter features follow Gaussian distributions, the DP provided by the conventional matching method and trivial quantisation-based matching method from a theoretical perspective is discussed and compared. Also, formulas are developed for calculating the error tolerance parameter that maximises the DP in each method and the discrimination loss caused by trivial quantisation.

Cancelable biometrics are a group of techniques to transform the input biometric to an irreversible feature intentionally using a transformation function and usually a key in order to provide security and privacy in biometric recognition systems. This transformation is repeatable enabling subsequent biometric comparisons. This paper introduces a new idea to be exploited as a transformation function for cancelable biometrics aimed at protecting templates against iterative optimization attacks. Our proposed scheme is based on time-varying keys (random biometrics in our case) and morphing transformations. An experimental implementation of the proposed scheme is given for face biometrics. The results confirm that the proposed approach is able to withstand leakage attacks while improving the recognition performance.

Cancelable biometric techniques play a vital role in the privacy and security of remote surveillance systems to keep the genuine users’ confidential data safe and away from intruders. This research presents an efficient cancelable biometric framework by exploiting an irreversible hybrid encryption technique that incorporates Deoxyribonucleic, Ribonucleic acid sequences (DNA and RNA), and the evolutionary optimization technique of the Genetic Algorithm (GA). So, these techniques are employed to create completely deformed templates from their original ones. Thus, our main contribution is offering a novel biometric security framework that achieves unique randomness characteristics using RNA and DNA sequences and the evolutionary GA-based encryption scheme. The proposed framework produces an entirely unrecognized biometric template by ciphering the main discriminative features of the biometric traits of the authorized clients. The proposed algorithm is first initialized by creating several encrypted biometric images of the original users by employing the logistic map function. Secondly, the initialized encrypted images are transformed into one vector of a binary array. Then, they are converted to their corresponding introns, exons, and consequently, their relevant codons are stored in the cloud database. Thirdly, these relevant codons are replaced by new ones after generating encrypted RNA lists. The utilized encryption key is extracted from the original biometric image after utilizing excessive permutations between its pixels. Then, the GA-based optimization technique is applied to select the most convenient biometric features. Finally, after employing the GA-based cross-over and mutation operations, the chosen features are used to generate the cancelable biometric traits. To validate the security efficacy of the proposed framework, different six biometric databases are used, which are Olivetti Research Laboratory (ORL) Faces (gray), CASIA v.5 Faces (color), UPOL Iris (gray), Indian Institute of Technology Delhi (IIT Delhi) Ear (color and gray), Fingerprint, and CASIA Palmprint (color and gray). The security performance of the proposed framework is compared to those of recent studies in this field, such as OSH (Optical Scanning Holography) and DRPE (Double Random Phase Encoding). The simulation results prove the superior performance of the proposed framework in terms of all tested evaluation metrics. The proposed framework provides high AROC (Area under the Receiver Operating Characteristic) that reaches 0.9990, low FAR (False Acceptance Rate) of 0.0015, more uniform histograms, high correlation values for genuine users, and complete hidden of biometric features. In addition, from a security perspective, the proposed framework accomplishes good entropy, UACI (unified average changing intensity), and NPCR (number of pixels change rate) values that reach 7.9960, 33.55%, and 99.65%, respectively.

Growth of automated vehicle and emergence of Vehicular Social Network (VSN) gave rise to the various services such as traffic recommendation system, alert messages in case of danger and bad weather condition etc. All these communications are susceptible to various security and privacy attacks. Need of a robust infrastructure that is capable of guaranteeing communication with low storage cost for safety message and also thwart basic security attacks on the communicating vehicle. Vehicular Adhoc Network (VANET) provides a promising solution. PKI based infrastructure normally relies on a central trusted authority (TA) take decision and hence a collapse of TA leads the complete communication system down which may results in a catastrophe. Hence, a Blockchain based framework has been proposed to mitigate the security and privacy attacks. Theoretical analysis proves its effectiveness in storing a safety message as 2.33 MB per year.

Despite their usability advantages over traditional authentication systems, biometrics-based authentication systems suffer from inherent privacy violation and non-revocability issues. In order to address these issues, the concept of cancelable biometrics was introduced as a means of generating multiple, revocable, and noninvertible identities from true biometric templates. Apart from BioHashing, which is a two-factor cancelable biometrics technique based on mixing a set of tokenized user-specific random numbers with biometric features, cancelable biometrics techniques usually cannot preserve the recognition accuracy achieved using the unprotected biometric systems. However, as the employed token can be lost, shared, or stolen, BioHashing suffers from the same issues associated with token-based authentication systems. In this paper, a reliable tokenless cancelable biometrics scheme, referred to as BioEncoding, for protecting IrisCodes is presented. Unlike BioHashing, BioEncoding can be used as a one-factor authentication scheme that relies only on sole IrisCodes. A unique noninvertible compact bit-string, referred to as BioCode, is randomly derived from a true IrisCode. Rather than the true IrisCode, the derived BioCode can be used efficiently to verify the user identity without degrading the recognition accuracy obtained using original IrisCodes. Additionally, BioEncoding satisfies all the requirements of the cancelable biometrics construct. The performance of BioEncoding is compared with the performance of BioHashing in the stolen-token scenario and the experimental results show the superiority of the proposed method over BioHashing-based techniques.

With the use of computers and Internet in every major activity of our society, security is increasingly important. Biometric recognition is not only challenging but also computationally demanding. This chapter aims develop an iris biometric system. The iris has the advantages of uniqueness, stableness, anti-spoof, non-invasiveness and efficiency and could be applied in almost every area (banking, forensics, access control, etc.). The performance of a biometric classification system is largely depending on the techniques used for feature extraction. Inspired by the biological plausibility of ordinal measures, we propose their employment for iris representation and recognition. Qualitative measurement, associated to the relative ordering of different characteristics, is defined as ordinal measurement. Besides the proposing of a novel, fast and robust, ordinal based feature extraction method, the chapter also considers the problem of designing the decision making model so as to obtain an efficient and effective biometric system. In the literature, there are different approaches for iris recognition, nevertheless, there are still challenging open problems in improving the accuracy, robustness, security and ergonomics of biometric systems.

Internet of Things (IoT) enables massive interconnectivity and interoperability between devices. With the growing number of devices, higher level of information exchange between the connected entities becomes possible. However, at the same time the sensitive information pertaining to the nodes becomes prone to security and privacy attacks. This is a serious topic in the IoT due to the large number of interconnections. In this paper, the detailed layer wise security vulnerabilities are enumerated. The security architecture of the IoT is presented. The solutions to the possible security attacks are detailed which will be a helping hand for the researchers working in this direction. The current state of the operational technology (OT)security is included.

A lightweight machine learning-based authentication framework for smart IoT devices