scispace - formally typeset
Search or ask a question
DOI

Chaotic-Based Encryption Algorithm using Henon and Logistic Maps for Fingerprint Template Protection

Apri Siswanto1
26 Apr 2020-Vol. 12, Iss: 1
TL;DR: A series of simulations were conducted using MATLAB to evaluate the performance of the proposed chaotic-based encryption algorithm for FTP through different analyses covering key sensitivity, histogram, correlations, differential, information entropy, and encryption/decryption speed.
Abstract: Fingerprint is a reliable user authentication method as it is unique to individual users that makes it efficient for authenticating users. In a fingerprint authentication system, user fingerprint information is stored in databases in an image format known as a fingerprint template. Although fingerprint is reliable, the templates stored in the database are exposed to security threats either during the data transmission process over the network or in storage. Therefore, there is a need to protect the fingerprint template, especially in unsecured networks to maintain data privacy and confidentiality. Many past studies proposed fingerprint template protection (FTP) using chaotic-based encryption algorithms that are more suitable to secure images than conventional encryption such as DES, AES, and RSA. The chaotic-based encryption algorithms have been improved a lot in terms of their robustness. However, the robustness of the algorithm caused a trade-off to encryption speed where it remains an issue in FTP. Hence, this study aims to improve the limitations found in the existing chaotic-based encryption algorithms for FTP by improving its encryption speed using Henon and Logistic map. A series of simulations were conducted using MATLAB to evaluate the performance of the proposed chaotic-based encryption algorithm for FTP through different analyses covering key sensitivity, histogram, correlations, differential, information entropy, and encryption/decryption speed. The performance proposed encryption algorithm was promising which could be a starting point for detailed analysis and implementation in real application domains.
Citations
More filters
Journal ArticleDOI
TL;DR: This research work proposes a two-step hybrid template protection scheme, where first step is the creation of a transformed template from the original template, and the second step is conceal the value of transformed template by applying the text steganography.
Abstract: The most crucial matter to be taken care of while deploying biometric systems is the security of the biometric template. Several algorithms that do not store the original template have been formulated in recent years to protect biometric templates from various attacks. Most of the existing algorithms offer a trade-off between matching performance and biometric template security. Moreover, it is believed that no single template protection scheme is capable of satisfying security, diversity, revocability and performance at the same time. Present research work proposes a two-step hybrid template protection scheme, where first step is the creation of a transformed template from the original template, and the second step is conceal the value of transformed template by applying the text steganography.The effectiveness of the proposed method is well established by thorough experimental analysis, which illustrates that the recognition performance is well maintained as the original template executes.

1 citations

DOI
19 Apr 2019
TL;DR: The very well-known Chua’s circuit is used to generate random sequences based on initial conditions which has plenty of factors that can be unique during generating of these chaotic sequences which makes it very difficult to decrypt the message.
Abstract: In recent years, chaos studies have been developing tremendously. The importance of using chaos is its deterministic nature. Though the chaos is interpreted as random in nature but it is deterministic. This is a very useful aspect that can be used in encryption of signals. In this paper, the very well-known Chua’s circuit is used to generate random sequences based on initial conditions. These sequences are going to be used for encrypting and decrypting an image. The key is going to be encrypted using a function with a modulus operation then used as an initiation for Chua circuit. The output of Chua circuit is three arrays X, Y, and Z. The process can be divided into two steps. First, one of these sequences is going to be used to form 2D array and the other two sequences also form another 2D array where both have the same size. Then, it is going to be XORed with the image and then the rows and the columns are going to be swapped horizontally and vertically. Second, the other matrix coming from X-Y arrays after mod operation is going to be used as an index for the first processed image. Simulation results show that the scheme sensitivity and complexity to such factors. The importance of this method is that it has plenty of factors that can be unique during generating of these chaotic sequences which makes it very difficult to decrypt the message.

1 citations

Journal ArticleDOI
TL;DR: In this article , a client-based user authentication scheme utilizing smartphone fingerprint recognition technology is proposed to fill the gap of the limited capabilities of IoT devices, which enables IoT applications' development and deployment as a service, providing additional data storage, enhanced processing performance, and fast communication between devices.
Abstract: The limited capabilities of IoT devices have resulted in some of the tasks of IoT applications being distributed to a cloud server, which witnessed the arisen of the cloud of things (COT). It enables IoT applications' development and deployment as a service, providing additional data storage, enhanced processing performance, and fast communication between devices. As COT involves communication between IoT devices, a remote server, and users, remote user authentication is crucial to meeting security demands. Therefore, this study designs a client-based user authentication scheme utilizing smartphone fingerprint recognition technology to fill the gap. The scheme comprises six phases, namely (i) configuration phase, (ii) enrolment phase, (iii) authentication phase, (iv) password update phase, (v) fingerprint revocation phase, and (vi) smartphone revocation phase. The security analysis and automated verification using ProVerif suggested that the scheme is resistant to user impersonating attacks, replay attacks, and man-in-the-middle attacks.
References
More filters
Journal ArticleDOI
TL;DR: In this article, the authors present a state-of-the-art review that presents a holistic view of the BD challenges and BDA methods theorized/proposed/employed by organizations to help others understand this landscape with the objective of making robust investment decisions.

1,267 citations


"Chaotic-Based Encryption Algorithm ..." refers background in this paper

  • ...Like other types of data such as text, sounds, or video [2], the fingerprint template is susceptible to security attacks, including forgery and server spoofing [3]....

    [...]

01 Jan 2011
TL;DR: The question of whether a given NPCR/UACI score is sufficiently high such that it is not discernible from ideally encrypted images is answered by comparing actual NPCR and UACI scores with corresponding critical values.
Abstract: The number of changing pixel rate (NPCR) and the unified averaged changed intensity (UACI) are two most common quantities used to evaluate the strength of image encryption algorithms/ciphers with respect to differential attacks. Conventionally, a high NPCR/UACI score is usually interpreted as a high resistance to differential attacks. However, it is not clear how high NPCR/UACI is such that the image cipher indeed has a high security level. In this paper, we approach this problem by establishing a mathematical model for ideally encrypted images and then derive expectations and variances of NPCR and UACI under this model. Further, these theoretical values are used to form statistical hypothesis NPCR and UACI tests. Critical values of tests are consequently derived and calculated both symbolically and numerically. As a result, the question of whether a given NPCR/UACI score is sufficiently high such that it is not discernible from ideally encrypted images is answered by comparing actual NPCR/UACI scores with corresponding critical values. Experimental results using the NPCR and UACI randomness tests show that many existing image encryption methods are actually not as good as they are purported, although some methods do pass these randomness tests.

857 citations


"Chaotic-Based Encryption Algorithm ..." refers background in this paper

  • ...While the UACI is the percentage of the average intensity of differences between plain image and encrypted image [31]....

    [...]

Proceedings ArticleDOI
11 Aug 2002
TL;DR: The FVC 2002 database, the test protocol and the main differences between FVC2000 and FVC2002 are discussed.
Abstract: Two years after the first edition, a new Fingerprint Verification Competition (FVC2002) was organized by the authors, with the aim of determining the state-of-the-art in this challenging pattern recognition application. The experience and the feedback received from FVC2000 allowed the authors to improve the organization of FVC2002 and to capture the attention of a significantly higher number of academic and commercial organizations (33 algorithms were submitted). This paper discusses the FVC2002 database, the test protocol and the main differences between FVC2000 and FVC2002. The algorithm performance evaluation will be presented at the 16/sup th/ ICPR.

677 citations


"Chaotic-Based Encryption Algorithm ..." refers methods in this paper

  • ...The fingerprint ciphered images FVC2002 Databases Plain fingerprint images Ciphered fingerprint images DB1(101_1.tif) DB2(101_1.tif) DB3(101_1.tif) DB4(101_1.tif)...

    [...]

  • ...FVC2002 [27] was used as the source of the fingerprint image dataset....

    [...]

Journal ArticleDOI
TL;DR: The results of several experimental, statistical analysis and key sensitivity tests show that the proposed image encryption scheme based on Henon chaotic maps provides an efficient and secure way for image encryption.
Abstract: Recent researches of image encryption algorithms have been increasingly based on chaotic systems, but the drawbacks of small key space and weak security in one-dimensional chaotic cryptosystems are obvious. This paper presents a new nonlinear chaotic algorithm (NCA) which uses power function and tangent function instead of linear function. Its structural parameters are obtained by experimental analysis. And an image encryption algorithm in a one-time-one-password system is designed. The experimental results demonstrate that the image encryption algorithm based on NCA shows advantages of large key space and high-level security, while maintaining acceptable efficiency. Compared with some general encryption algorithms such as DES, the encryption algorithm is more secure.

485 citations


"Chaotic-Based Encryption Algorithm ..." refers background in this paper

  • ...The plethora of studies is mainly conducted to address the limitations in the conventional encryption algorithms like AES and RSA, that do not work efficiently on images as they have enormous capacity, highlevel of redundancy, and close relationships of the nearby pixels [8, 9]....

    [...]

Proceedings ArticleDOI
11 Aug 2002
TL;DR: An interactive vision system for a robot that finds an object specified by a user and brings it to the user and the user may provide additional information via speech such as pointing out mistakes and choosing the correct object from multiple candidates.
Abstract: This paper describes an interactive vision system for a robot that finds an object specified by a user and brings it to the user. The system first registers object models automatically. When the user specifies an object, the system tries to recognize the object automatically. When the recognition result is shown to the user, the user may provide additional information via speech such as pointing out mistakes, choosing the correct object from multiple candidates, or giving the relative position of the object. Based on the advice, the system tries again to recognize the object. Experiments are described using real-world refrigerator scenes.

241 citations