Information Security Using DNA Sequences

   يعد أمن المعلومات من المواضيع المهمة، ويرجع ذلك أساسًا إلى النمو الهائل في استخدام الإنترنت على مدى السنوات القليلة الماضية. نتيجة لهذا النمو، كانت هناك حالات وصول غير مصرح به، والتي تم تقليلها بفضل "استخدام مجموعة من بروتوكولات الاتصال الآمن، مثل التشفير وإخفاء البيانات". باستخدام القدرات الجزيئية الحيوية للحمض النووي، ازداد استخدام الحمض النووي كناقل للتشفير وإخفاء البيانات في السنوات الأخيرة. أثار إدراك أن الحمض النووي قد يعمل كوسيط نقل أثار هذه الحركة. في هذه الدراسة، نفحص أولاً ونلخص بإيجاز تطور نظام ترميز الحمض النووي الحالي. بعد ذلك، يتم تصنيف الطرق العديدة التي تم بها استخدام الحمض النووي لتحسين تقنيات التشفير. تمت مناقشة مزايا وعيوب هذه الخوارزميات وأحدث التطورات في تقنيات التشفير القائم على الحمض النووي. أخيرًا، نقدم أفكارنا حول المستقبل المحتمل لخوارزميات التشفير القائمة على الحمض النووي.Information security is a significant cause for concern, mainly because of the explosive growth in internet usage over the last few years. Due to this growth, there have been occurrences of unauthorized access, which have been reduced thanks to “using a range of secure communication protocols, such as encryption and data concealment”. Using DNA's bio-molecular capabilities, the usage of DNA as a carrier for encryption and data concealing has increased in recent years. The realization that DNA may function as a transport medium sparked this movement. In this study, we first examine and briefly outline the evolution of the present DNA coding system. After that, the several ways DNA has been used to enhance encryption techniques are categorized. The benefits and drawbacks of these algorithms and the most recent advancements in DNA-based encryption techniques are discussed. Finally, we provide our thoughts on the potential future of DNA-based encryption algorithms. &nbsp

Error resilient image transmission using T-codes and edge-embedding

Current image communication applications involve image transmission over noisy channels, where the image gets damaged. The loss of synchronization at the decoder due to these errors increases the damage in the reconstructed image. Our main goal in this research is to develop an algorithm that has the capability to detect errors, achieve synchronization and conceal errors.;In this thesis we studied the performance of T-codes in comparison with Huffman codes. We develop an algorithm for the selection of best T-code set. We have shown that T-codes exhibit better synchronization properties when compared to Huffman Codes. In this work we developed an algorithm that extracts edge patterns from each 8x8 block, classifies edge patterns into different classes. In this research we also propose a novel scrambling algorithm to hide edge pattern of a block into neighboring 8x8 blocks of the image. This scrambled hidden data is used in the detection of errors and concealment of errors. We also develop an algorithm to protect the hidden data from getting damaged in the course of transmission

An efficient data masking for securing medical data using DNA encoding and chaotic system

Data security is utmost important for ubiquitous computing of medical/diagnostic data or images. Along with must consider preserving privacy of patients. Recently, deoxyribose nucleic acid (DNA) sequences and chaotic sequence are jointly used for building efficient data masking model. However, the state-of-art model are not robust against noise and cropping attack (CA). Since in existing model most digits of each pixel are not altered. This work present efficient data masking (EDM) method using chaos and DNA based encryption method for securing health care data. For overcoming research challenges effective bit scrambling method is required. Firstly, this work present an efficient bit scrambling using logistic sine map and pseudorandom sequence using chaotic system. Then, DNA substitution is performed among them to resist against differential attack (DA), statistical attack (SA) and CA. Experiment are conducted on standard considering diverse images. The outcome achieved shows proposed model efficient when compared to existing models

Research on digital image watermark encryption based on hyperchaos

The digital watermarking technique embeds meaningful information into one or more watermark images hidden in one image, in which it is known as a secret carrier. It is difficult for a hacker to extract or remove any hidden watermark from an image, and especially to crack so called digital watermark. The combination of digital watermarking technique and traditional image encryption technique is able to greatly improve anti-hacking capability, which suggests it is a good method for keeping the integrity of the original image. The research works contained in this thesis include: (1)A literature review the hyperchaotic watermarking technique is relatively more advantageous, and becomes the main subject in this programme. (2)The theoretical foundation of watermarking technologies, including the human visual system (HVS), the colour space transform, discrete wavelet transform (DWT), the main watermark embedding algorithms, and the mainstream methods for improving watermark robustness and for evaluating watermark embedding performance. (3) The devised hyperchaotic scrambling technique it has been applied to colour image watermark that helps to improve the image encryption and anti-cracking capabilities. The experiments in this research prove the robustness and some other advantages of the invented technique. This thesis focuses on combining the chaotic scrambling and wavelet watermark embedding to achieve a hyperchaotic digital watermark to encrypt digital products, with the human visual system (HVS) and other factors taken into account. This research is of significant importance and has industrial application value

Image processing algorithms employing two-dimensional Karhunen-Loeve Transform

In the fields of image processing and pattern recognition there is an important problem of acquiring, gathering, storing and processing large volumes of data. The most frequently used solution making these data reduced is a compression, which in many cases leads also to the speeding-up further computations. One of the most frequently employed approaches is an image handling by means of Principal Component Analysis and Karhunen-Loeve Transform, which are well known statistical tools used in many areas of applied science. Their main property is the possibility of reducing the volume of data required for its optimal representation while preserving its specific characteristics.The paper presents selected image processing algorithms such as compression, scrambling (coding) and information embedding (steganography) and their realizations employing the twodimensional Karhunen-Loeve Transform (2DKLT), which is superior to the standard, onedimensional KLT since it represents images respecting their spatial properties. The principles of KLT and 2DKLT as well as sample implementations and experiments performed on the standard benchmark datasets are presented. The results show that the 2DKLT employed in the above applications gives obvious advantages in comparison to certain standard algorithms, such as DCT, FFT and wavelets

High security image encryption by 3stage process

As a result of the development of computer network technology, communication of in- formation through personal computer is becoming more convenient. Meanwhile, it also gives hackers opportunities to attack the network. Therefore the security is now an important issue for multimedia communications. Image compression and image encryption are pivotal to proper storage and transmission of images. Simultaneous image compression and encryption aims at achieving enhanced bandwidth utilization and security at the same time. The concepts used here are : Chinese Reminder Theorem, Chaotic map, Bit plane mix- ing. The use of chaotic mixing increases the security of the proposed method and provides the additional feature of imperceptible encryption of the image owner logo in the host image. The image coding results, calculated from actual image size and encoded im- age le, are comparable to the results obtained through much more sophisticated and computationally complex methods. In addition, the algorithm has been applied to the scenario of image multiplexing in order to obtain enhanced level of security along with compression. Here one layer of encryption involves bit plane mixing. Encrypted and compressed image is applied to hiding algorithms. The idea behind our proposed method is, the cover image will be altered based upon the secret image. The secret image will be split into number of blocks and these blocks will be shued intellectually and then it will be merged with the cover image to generate the Segno image. Our proposed method, originally designed for dealing with color images, but also be extended to for grayscale images. Experimental results show that our proposed method improves the security and makes the information hacking hard

Image processing algorithms employing two-dimensional Karhunen-Loeve Transform

In the fields of image processing and pattern recognition there is an important problem of acquiring, gathering, storing and processing large volumes of data. The most frequently used solution making these data reduced is a compression, which in many cases leads also to the speeding-up further computations. One of the most frequently employed approaches is an image handling by means of Principal Component Analysis and Karhunen-Loeve Transform, which are well known statistical tools used in many areas of applied science. Their main property is the possibility of reducing the volume of data required for its optimal representation while preserving its specific characteristics.The paper presents selected image processing algorithms such as compression, scrambling (coding) and information embedding (steganography) and their realizations employing the twodimensional Karhunen-Loeve Transform (2DKLT), which is superior to the standard, onedimensional KLT since it represents images respecting their spatial properties. The principles of KLT and 2DKLT as well as sample implementations and experiments performed on the standard benchmark datasets are presented. The results show that the 2DKLT employed in the above applications gives obvious advantages in comparison to certain standard algorithms, such as DCT, FFT and wavelets

Visual Privacy Protection Methods: A Survey

Recent advances in computer vision technologies have made possible the development of intelligent monitoring systems for video surveillance and ambient-assisted living. By using this technology, these systems are able to automatically interpret visual data from the environment and perform tasks that would have been unthinkable years ago. These achievements represent a radical improvement but they also suppose a new threat to individual’s privacy. The new capabilities of such systems give them the ability to collect and index a huge amount of private information about each individual. Next-generation systems have to solve this issue in order to obtain the users’ acceptance. Therefore, there is a need for mechanisms or tools to protect and preserve people’s privacy. This paper seeks to clarify how privacy can be protected in imagery data, so as a main contribution a comprehensive classification of the protection methods for visual privacy as well as an up-to-date review of them are provided. A survey of the existing privacy-aware intelligent monitoring systems and a valuable discussion of important aspects of visual privacy are also provided.This work has been partially supported by the Spanish Ministry of Science and Innovation under project “Sistema de visión para la monitorización de la actividad de la vida diaria en el hogar” (TIN2010-20510-C04-02) and by the European Commission under project “caring4U - A study on people activity in private spaces: towards a multisensor network that meets privacy requirements” (PIEF-GA-2010-274649). José Ramón Padilla López and Alexandros Andre Chaaraoui acknowledge financial support by the Conselleria d'Educació, Formació i Ocupació of the Generalitat Valenciana (fellowship ACIF/2012/064 and ACIF/2011/160 respectively)

Speech signal compression and encryption based on sudoku, fuzzy C-means and threefish cipher

Compression and encryption of speech signals are essential multimedia technologies. In the field of speech, these technologies are needed to meet the security and confidentiality of information requirements for transferring huge speech signals via a network, and for decreasing storage space for rapid retrieval. In this paper, we propose an algorithm that includes hybrid transformation in order to analyses the speech signal frequencies. The speech signal is then compressed, after removing low and less intense frequencies, to produce a well compressed speech signal and ensure the quality of the speech. The resulting compressed speech is then used as an input in a scrambling algorithm that was proposed on two levels. One of these is an external scramble that works on mixing up the segments of speech that were divided using Fuzzy C-Means and changing their locations. The internal scramble scatters the values of each block internally based on the pattern of a Sudoku puzzle and quadratic map so that the resulting speech is an input to a proposed encryption algorithm using the threefish algorithm. The proposed algorithm proved to be highly efficient in the compression and encryption of the speech signal based on approved statistical measures