No abstract

No abstract

No abstract

A unified framework which provides a higher security level to e‐passports is proposed. This framework integrates face, iris and fingerprint images. It involves three layers of security: the first layer maps a biometric image to another biometric image which is called biostego image. Three mapping schemes are proposed: the first scheme maps single biometric image to single biostego image, the second scheme maps dual biometric images to single biostego image, the third scheme divides the biometric image into sections and maps each section to different biostego image. A mapping function maps the intensity value of each pixel in the biometric image to pixels with same intensity in the biostego image. A representative pixel is randomly selected from the set of pixels, and its coordinates are recorded in the location map of the biometric image. In the second layer, the location map is encoded using fingerprint fuzzy vault. In the third layer, the encoded location map is hidden in the biostego image using steganography technique. The biostego image which contains the encoded location map is stored in the e‐passport's memory. Keeping the mapping scheme secret and by using the fingerprints fuzzy vault to encrypt location map, the proposed approach provides higher level of protection against fraud.

Abstract-There are continuous threats to network technologies due to its rapidly-changing nature, which raises the demand for data-safe transmission. As a result, the need to come up with new techniques for securing data and accommodating the growing quantities of information is crucial. From nature to science, the idea that genes themselves are made of information stimulated the research in molecular deoxyribonucleic acid (DNA). DNA is capable of storing huge amounts of data, which leads to its promising effect in steganography. DNA steganography is the art of using DNA as an information carrier which achieves high data storage capacity as well as high security level. Currently, DNA steganography techniques utilize the properties of only one DNA strand, since the other strand is completely dependent on the first one. This paper presents a DNA-based steganography technique that hides data into both DNA strands with respect to the dependency between the two strands. In the proposed technique, a key of the same length of the reference DNA sequence is generated after using the second DNA strand. The sender sends both the encrypted DNA message and its reference DNA sequence together into a microdot. If the recipient receives this microdot uncontaminated, the sender can safely send the generated key afterwards. The proposed technique doubles the amount of data stored and guarantees a secure transmission process as well, for even if the attacker suspects the first-sent DNA sequence, they will never receive the key, and hence full data extraction is nearly impossible. The conducted experimental study confirms the effectiveness of the proposed.

DNA-based Steganography is one of the promising techniques to secure data exchange, where data is hidden into a real DNA sequence. For the sake of security, some steganography techniques encrypt data before hiding it which strengthen the technique's steganalysis. One of the widely used encryption techniques is the DNAbased playfair cipher. This technique intensively requires a long list of preprocessing steps in addition to extra bits which must be added to guarantee successful decryption. Nevertheless, the succeeding hiding step suffers from a limited capacity, which turns this current DNA-based Steganography technique into a complex, inefficient, and time consuming process. In this paper, we propose a new DNA-based Steganography algorithm to simplify the current technique as well as achieve higher hiding capacity. In the proposed algorithm, we enhance the commonly used playfair cipher by defining a novel short sequence of preprocessing steps and getting rid of the extra overhead bits. We also utilize a more efficient technique to enhance the hiding phase. The proposed approach is not only simple and fast but also provides a significantly higher hiding capacity with a high security. The conducted extensive experimental studies confirm the outstanding performance of the proposed algorithm.

No abstract

In this paper we present a new energy-based fingerprint matching system which uses both minutiae information available in a fingerprint with the information of the local ridges in their vicinity. The basic idea of this system is to divide the fingerprint matching problem into several small sub-problems that involve the use of image energy minimization for which an iterative schema is devised. At each minimization step this schema optimizes its local energy according to the previous estimate and the observed image features. An energy vectors are produced which represent the fingerprint image. Our system was tested on NIST 4 fingerprints and showed promising results.