Steganography: a class of secure and robust algorithms

This research work presents a new class of non-blind information hiding algorithms that are stego-secure and robust. They are based on some finite domains iterations having the Devaney's topological chaos property. Thanks to a complete formalization of the approach we prove security against watermark-only attacks of a large class of steganographic algorithms. Finally a complete study of robustness is given in frequency DWT and DCT domains.Comment: Published in The Computer Journal special issue about steganograph

Application of Stochastic Diffusion for Hiding High Fidelity Encrypted Images

Cryptography coupled with information hiding has received increased attention in recent years and has become a major research theme because of the importance of protecting encrypted information in any Electronic Data Interchange system in a way that is both discrete and covert. One of the essential limitations in any cryptography system is that the encrypted data provides an indication on its importance which arouses suspicion and makes it vulnerable to attack. Information hiding of Steganography provides a potential solution to this issue by making the data imperceptible, the security of the hidden information being a threat only if its existence is detected through Steganalysis. This paper focuses on a study methods for hiding encrypted information, specifically, methods that encrypt data before embedding in host data where the ‘data’ is in the form of a full colour digital image. Such methods provide a greater level of data security especially when the information is to be submitted over the Internet, for example, since a potential attacker needs to first detect, then extract and then decrypt the embedded data in order to recover the original information. After providing an extensive survey of the current methods available, we present a new method of encrypting and then hiding full colour images in three full colour host images with out loss of fidelity following data extraction and decryption. The application of this technique, which is based on a technique called ‘Stochastic Diffusion’ are wide ranging and include covert image information interchange, digital image authentication, video authentication, copyright protection and digital rights management of image data in general

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

Imperceptible and secure image watermarking using DCT and random spread technique

Watermarking is a copyright protection technique, while cryptography is a message encoding technique. Imperceptibility, robustness, and safety are aspects that are often investigated in watermarking. Cryptography can be implemented to increase watermark security. Beaufort cipher is the algorithm proposed in this research to encrypt watermark. The new idea proposed in this research is the utilization of Beaufort key for watermark encryption process as well as for spread watermark when inserted as PN Sequence substitute with the aim to improve imperceptibility and security aspects. Where PN Sequence is widely used in spread spectrum watermarking technique. Based on the experimental results and testing of the proposed method proved that imperceptibility and watermark security are increased. Improved imperceptibility measured by PSNR rose by about 5dB and so did the MSE score better. Robustness aspect is also maintained which has been proven by the excellent value of NCC

A Non-Blind Image Watermarking Method for Copyright Protection

   في هذا البحث ، تم تقديم طريقة العلامة المائية غير العمياء لحماية حقوق النشر الخاصة بالصور الرقمية الملونة. تعتمد هذه الطريقة على مجموعة من التحويلات الرقمية (DWT ، DCT) في مجال التردد. تعتمد عملية التضمين في هذه الطريقة على تقسيم الصورة المضيفة إلى كتل غير متراكبة 16 × 16 واستخدام مقياس إنتروبيا الحافة لاختيار الكتل المناسبة لعملية التضمين لزيادة عدم الإدراك في النظام المقترح. أما بالنسبة لعملية الاستخراج ، فهي تتم بطريقة تتطلب وجود الصورة الأصلية ولكنها تتبع نفس بروتوكول التضمين لاستخراج العلامة المائية المشفرة المضمنة . و لرفع مستوى الأمان ، تم تطبيق طريقة تشفير هجينة باستخدام الخريطة الفوضوية وترميز الحمض النووي لتشفير العلامة المائية قبل تضمينها. تظهر النتائج التجريبية أن الاختلافات بين الصورة ذات العلامة المائية والصورة الأصلية لا يمكن تمييزها. الطريقة المقترحة قاومت بشكل فعال هجمات معالجة الصور الشائعة.    In this paper, a non-blind watermarking method for protecting the copyright of digital color images is introduced. This method based on the combination of digital transforms (DWT, DCT) in the frequency domain. The embedding process in this method depends on the partition of the host image into 16×16 non-overlapped blocks and the use of edge entropy metric to choose the appropriate blocks for the insertion process for the purpose of increasing the imperceptibility of the proposed system. As for the extraction process, it is carried out in a way that requires the presence of the original image but rather follows the same embedding protocol to extract the embedded encrypted watermark. To raise the security level, a hybrid encryption method using the chaotic map and DNA coding has been applied for encrypting the watermark before embedding it. Experimental results demonstrate that the differences between the watermarked image and the original image are indistinguishable. The proposed method is effectively resisted common image processing attacks

A review of compressive sensing in information security field

The applications of compressive sensing (CS) in the fi eld of information security have captured a great deal of researchers\u27 attention in the past decade. To supply guidance for researchers from a comprehensive perspective, this paper, for the fi rst time, reviews CS in information security field from two aspects: theoretical security and application security. Moreover, the CS applied in image cipher is one of the most widespread applications, as its characteristics of dimensional reduction and random projection can be utilized and integrated into image cryptosystems, which can achieve simultaneous compression and encryption of an image or multiple images. With respect to this application, the basic framework designs and the corresponding analyses are investigated. Speci fically, the investigation proceeds from three aspects, namely, image ciphers based on chaos and CS, image ciphers based on optics and CS, and image ciphers based on chaos, optics, and CS. A total of six frameworks are put forward. Meanwhile, their analyses in terms of security, advantages, disadvantages, and so on are presented. At last, we attempt to indicate some other possible application research topics in future

Copyright Protection for Surveillance System Multimedia Stream with Cellular Automata Watermarking

Intelligent Surveillance Systems are attracting extraordinary attention from research and industry. Security and privacy protection are critical issues for public acceptance of security camera networks. Existing approaches, however, only address isolated aspects without considering the integration with established security technologies and the underlying platform. Easy availability of internet, together with relatively inexpensive digital recording and storage peripherals has created an era where duplication, unauthorized use and misdistribution of digital content has become easier. The ease of availability made digital video popular over analog media like film or tape. At the same time it demands a sharp attention regarding the ownership issue. The ownership and integrity can easily be violated using different audio and video editing softwares. To prevent unauthorized use, misappropriation, misrepresentation; authentication of multimedia contents achieved a broad attention in recent days and to achieve secure copyright protection we embedded some information in audio and videos and that audio or video is called copyright protected. Digital watermarking is a technology to embed additional information into the host signal to ensure security and protection of multimedia data. The embedded information can’t be detected by human but some attacks and operations can tamper that information to breach protection. So in order to find a secure technique of copyright protection, we have analyzed different techniques. After having a good understanding of these techniques we have proposed a novel algorithm that generates results with high effectiveness, additionally we can use self-extracted watermark technique to increase the security and automate the process of watermarking. Forensic digital watermarking is a promising tool in the fight against piracy of copyrighted motion imagery content, but to be effective it must be (1) imperceptibly embedded in high-definition motion picture source, (2) reliably retrieved, even from degraded copies as might result from camcorder capture and subsequent very-low-bitrate compression and distribution on the Internet, and (3) secure against unauthorized removal. Audio and video watermarking enables the copyright protection with owner or customer authentication and the detection of media manipulations. The available watermarking technology concentrates on single media like audio or video. But the typical multimedia stream consists of both video and audio data. Our goal is to provide a solution with robust and fragile aspects to guarantee authentication and integrity by using watermarks in combination with content information. We show two solutions for the protection of audio and video data with a combined robust and fragile watermarking approach. The first solution is to insert a time code into the data: We embed a signal as a watermark to detect gaps or changes in the flow of time. The second solution is more complex: We use watermarks to embed information in each media about the content of the other media. In our paper we present the problem of copyright protection and integrity checks for combined video and audio data. Both the solutions depend upon cellular automata, cellular automata are a powerful computation model that provides a simple way to simulate and solve many difficult problems in different fields. The most widely known example of Cellular Automata is the Game-of-Life. Cellular automaton growth is controlled by predefined rule or programs .The rule describes how the cell will interact with its neighborhood. Once the automaton is started it will work on its own according to the rule specified.

Enhancing image security via chaotic maps, Fibonacci, Tribonacci transformations, and DWT difusion: a robust data encryption approach

In recent years, numerous image encryption schemes have been developed that demonstrate diferent levels of efectiveness in terms of robust security and real-time applications. While a few of them outperform in terms of robust security, others perform well for real-time applications where less processing time is required. Balancing these two aspects poses a challenge, aiming to achieve efcient encryption without compromising security. To address this challenge, the proposed research presents a robust data security approach for encrypting grayscale images, comprising fve key phases. The frst and second phases of the proposed encryption framework are dedicated to the generation of secret keys and the confusion stage, respectively. While the level-1, level-2, and level-2 difusions are performed in phases 3, 4, and 5, respectively, The proposed approach begins with secret key generation using chaotic maps for the initial pixel scrambling in the plaintext image, followed by employing the Fibonacci Transformation (FT) for an additional layer of pixel shufing. To enhance security, Tribonacci Transformation (TT) creates level-1 difusion in the permuted image. Level-2 difusion is introduced to further strengthen the difusion within the plaintext image, which is achieved by decomposing the difused image into eight-bit planes and implementing XOR operations with corresponding bit planes that are extracted from the key image. After that, the discrete wavelet transform (DWT) is employed to develop secondary keys. The DWT frequency subband (high-frequency sub-band) is substituted using the substitution box process. This creates further difusion (level 3 difusion) to make it difcult for an attacker to recover the plaintext image from an encrypted image. Several statistical tests, including mean square error analysis, histogram variance analysis, entropy assessment, peak signal-to-noise ratio evaluation, correlation analysis, key space evaluation, and key sensitivity analysis, demonstrate the efectiveness of the proposed work. The proposed encryption framework achieves signifcant statistical values, with entropy, correlation, energy, and histogram variance values standing at 7.999, 0.0001, 0.0156, and 6458, respectively. These results contribute to its robustness against cyberattacks. Moreover, the processing time of the proposed encryption framework is less than one second, which makes it more suitable for realworld applications. A detailed comparative analysis with the existing methods based on chaos, DWT, Tribonacci transformation (TT), and Fibonacci transformation (FT) reveals that the proposed encryption scheme outperforms the existing ones

A DATA HIDING SCHEME BASED ON CHAOTIC MAP AND PIXEL PAIRS

Information security is one of the most common areas of study today. In the literature, there are many algorithms developed in the information security. The Least Significant Bit (LSB) method is the most known of these algorithms. LSB method is easy to apply however it is not effective on providing data privacy and robustness. In spite of all its disadvantages, LSB is the most frequently used algorithm in literature due to providing high visual quality. In this study, an effective data hiding scheme alternative to LSB, 2LSBs, 3LSBs and 4LSBs algorithms (known as xLSBs), is proposed. In this method, random numbers which are to be used as indices of pixels of the cover image are obtained from chaotic maps and data hiding process is applied on the values of these pixels by using modulo function. Calculated values are embedded in cover image as hidden data. Success of the proposed data hiding scheme is assessed by Peak Signal-to-Noise Ratio (PSNR), payload capacity and quality