Review on DNA Cryptography

Cryptography is the science that secures data and communication over the network by applying mathematics and logic to design strong encryption methods. In the modern era of e-business and e-commerce the protection of confidentiality, integrity and availability (CIA triad) of stored information as well as of transmitted data is very crucial. DNA molecules, having the capacity to store, process and transmit information, inspires the idea of DNA cryptography. This combination of the chemical characteristics of biological DNA sequences and classical cryptography ensures the non-vulnerable transmission of data. In this paper we have reviewed the present state of art of DNA cryptography.Comment: 31 pages, 12 figures, 6 table

A Comparison of Cryptography Courses

The author taught two courses on cryptography, one at Duke University aimed at non-mathematics majors and one at Rose-Hulman Institute of Technology aimed at mathematics and computer science majors. Both tried to incorporate technical and societal aspects of cryptography, with varying emphases. This paper will discuss the strengths and weaknesses of both courses and compare the differences in the author's approach.Comment: 14 pages; to appear in Cryptologi

Diffie-Hellman Key Exchange through Steganographied Images

Purpose – In a private key system, the major problem is the exchange of the key between the two parties. Diffie and Hellman have set up a way to share the key. However, this technique is not protected against a man-in-the-middle attack as the settings are not authenticated. The Diffie-Hellman key exchange requires the use of digital signature or creating a secure channel for data exchanging to avoid the man-in-the-middle attack. Methodology/approach/design – We present a Diffie-Hellman key exchange implementation using steganographied images. Using steganography made invisible the data exchange to a potential attacker. So, we will not need a digital signature or creating a secure channel to do our key exchange since only the two concerned parts are aware of this exchange. Findings – We generate a symmetric 128-bit key between two users without use of digital signature or secure channel. However, it works only on bitmap images, heavy images and sensitive to compression

DATA SECURITY IN THE CLOUD USING SERPENT ENCRYPTION AND DISTRIBUTED STEGANOGRAPHY

Despite the enormous benefits derived from the adoption of cloud computing concept, its widespread acceptance has been considerably encumbered by security concerns. The enlarged attack surface in a cloud environment makes it more vulnerable to existing and emerging security threats. Conventional data security approaches have been found incapable in curtailing these threats and this unpleasant trend has necessitated the need for a futuristic approach to data security. Serpent encryption algorithm and distributed steganography are already proven techniques for securing data. This paper proposes an enhanced mechanism to ensuring data security by strategically combining serpent cryptographic algorithm and distributed steganography. The unified approach is aimed at leveraging the strength of these two proven techniques to achieve a robust mechanism for ensuring confidentiality and integrity of data in the cloud

Hybrid Approach to Steganography System Based on Quantum Encryption and Chaos Algorithms

This paper proposes a hybrid system for secretly embedding images into the dithered multilevelimage. Confident hybridizations between steganography and quantum encryptions are either rare inliterature or suffer a poor effectiveness in secure communication. This paper scrambles and divides thesecret image into groups to be embedded in the blocks of the cover image using three chaos algorithms.These are Lorenz map, Henon map, and Logistic map algorithms. The encryption of embedded imagesconducted using the quantum one-time pad. Results showed that the proposed hybrid system succeeded inembedding and combining images with quantum cryptography algorithms

DATA SECURITY IN THE CLOUD USING SERPENT ENCRYPTION AND DISTRIBUTED STEGANOGRAPHY

Despite the enormous benefits derived from the adoption of cloud computing concept, its widespread acceptance has been considerably encumbered by security concerns. The enlarged attack surface in a cloud environment makes it more vulnerable to existing and emerging security threats. Conventional data security approaches have been found incapable in curtailing these threats and this unpleasant trend has necessitated the need for a futuristic approach to data security. Serpent encryption algorithm and distributed steganography are already proven techniques for securing data. This paper proposes an enhanced mechanism to ensuring data security by strategically combining serpent cryptographic algorithm and distributed steganography. The unified approach is aimed at leveraging the strength of these two proven techniques to achieve a robust mechanism for ensuring confidentiality and integrity of data in the cloud

Automatic region selection method to enhance image-based steganography

Image-based steganography is an essential procedure with several practical applications related to information security, user authentication, copyright protection, etc. However, most existing image-based steganographic techniques assume that the pixels that hide the data can be chosen freely, such as random pixel selection, without considering the contents of the input image. So, the “region of interest” such as human faces in the input image might have defected after data hiding even at a low inserting rate, and this will degrade the visual quality especially for the images containing several human faces. With this view, we proposed a novel approach that combines human skin-color detection along with the LSB approach which can choose the embedding regions. The idea behind that is based on the fact that the Human Vision System HVS tends to focus its attention on selectively certain structures of the visual scene instead of the whole image. Practically, human skin-color is good evidence of the existence of human targets in images. To the best of our knowledge, this is the first attempt that employs skin detection in application to steganography which consider the contents of input image and consequently can choose the embedding regions. Moreover, an enhanced RSA algorithm and Elliptic Curve Equation are used to provide a double level of security. In addition, the system embeds noise bits into the resulting stego-image to make the attacker’s task more confusing. Two datasets are used for testing and evaluation. The experimental results show that the proposed approach achieves a significant security improvement with high image quality

Theory and Applications of Outsider Anonymity in Broadcast Encryption

Broadcast Encryption (BE) allows efficient one-to-many secret communication of data over a broadcast channel. In the standard setting of BE, information about receivers is transmitted in the clear together with ciphertexts. This could be a serious violation of recipient privacy since the identities of the users authorized to access the secret content in certain broadcast scenarios are as sensitive as the content itself. Anonymous Broadcast Encryption (AnoBe) prevents this leakage of recipient identities from ciphertexts but at a cost of a linear lower bound (in the number of receivers) on the length of ciphertexts. A linear ciphertext length is a highly undesirable bottleneck in any large-scale broadcast application. In this thesis, we propose a less stringent yet very meaningful notion of anonymity for anonymous broadcast encryption called Outsider-Anonymous Broadcast Encryption (oABE) that allows the creation of ciphertexts that are sublinear in the number of receivers. We construct several oABE schemes with varying security guarantees and levels of efficiency. We also present two very interesting cryptographic applications afforded by the efficiency of our oABE schemes. The first is Broadcast Steganography (BS), the extension of the state of the art setting of point-to-point steganography to the multi-recipient setting. The second is Oblivious Group Storage (OGS), the introduction of fine-grained data access control policies to the setting of multi-client oblivious cloud storage protocols

StegoCrypt: Combining steganography and cryptography

The utilization of pictures to conceal data is a highlight which leaves little uncertainty in a watcher's psyche. Utilizing any medium to shroud data alludes to a strategy called steganography. When we utilize a picture as a medium then that technique is called picture steganography. The most renowned technique to now is the Least Significant Bit Algorithm (LSB). In that technique, the least critical piece of every pixel is taken and data is covered up in that. This anyway is effectively brittle. Consequently an option and increasingly secure arrangement is given. First the information is scrambled utilizing the Blowfish calculation. Next an inventive technique is displayed. This encoded square is broken down to 'n' littler squares and 'n' pictures are picked indiscriminately what's more, each picture is made to conceal a square of the encoded information. To keep up the right arrangement of hinders a hash table is kept up. This is then encoded utilizing LSB to another picture called the hashing picture. This hashing picture is sent alongside the 'n' different pictures. To separate the information out, first the hash picture is acquired and utilizing this the scrambled square is reassembled and after that unique information is gotten by unscrambling.The utilization of pictures to conceal data is a highlight which leaves little uncertainty in a watcher's psyche. Utilizing any medium to shroud data alludes to a strategy called steganography. When we utilize a picture as a medium then that technique is called picture steganography. The most renowned technique to now is the Least Significant Bit Algorithm (LSB). In that technique, the least critical piece of every pixel is taken and data is covered up in that. This anyway is effectively brittle. Consequently an option and increasingly secure arrangement is given. First the information is scrambled utilizing the Blowfish calculation. Next an inventive technique is displayed. This encoded square is broken down to 'n' littler squares and 'n' pictures are picked indiscriminately what's more, each picture is made to conceal a square of the encoded information. To keep up the right arrangement of hinders a hash table is kept up. This is then encoded utilizing LSB to another picture called the hashing picture. This hashing picture is sent alongside the 'n' different pictures. To separate the information out, first the hash picture is acquired and utilizing this the scrambled square is reassembled and after that unique information is gotten by unscrambling