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

A Study of Image Fingerprinting by Using Visual Cryptography

As digital media has made our life more colourful because of its advantages like easier to access, copy and distribute. But as what we have seen, series of malice activities like copyright infringement, counterfeiting, piracy and information distortion make damages to both the producers and the users of digital products. So we really need some technology to protect the copyright, authenticity, integrity of the digital products and the intellectual property of the users. There are many techniques such as Digital watermarking and Visual Cryptography both have been widely used for protection of data either in text, video, sound or digital images form in modern network time. Digital watermarking is an evolving field that requires continuous effort to find for the best possible method in protecting multimedia content. But Visual Cryptography is a special encryption technique to hide information in images in such a way that it can be decrypted by the human vision if the correct key image is used. Both techniques addresses the growing concerns of theft and tampering of digital media through the use of advanced signal processing strategies to embed copyright and authentication information within media content in their respective manner. In this paper we have discussed image fingerprinting with the help of visual cryptography technique. Keywords: Authentication, Digital Media, Digital Watermarking, Fingerprinting, Image, Piracy, Visual Cryptograph

Secured Lossless Share Watermarking

Security has gained a lot of importance as information technology is widely used. The main issue in visual cryptography is quality of reconstructed image. This problem is overcome by using “Secured Lossless share Watermarking ”. In this method the quality of reconstructed image is higher and the security of share is high compare with conventional visual cryptographic scheme. The secret image is converted into. Each share is embedded to different carrier images. Invisible watermarking method is used for embedding carrier image and shares. For security, the invisible watermarked shares are then encrypted, AES modified encryption method is used. The encrypted shares are send to other participants. At the receiver end receiving the shares and decrypt the shares, then combining these shares together reveal the secret. The quality of rejoined shares and original secret shares are almost same. DOI: 10.17762/ijritcc2321-8169.15038

A Localized Geometric-Distortion Resilient Digital Watermarking Scheme Using Two Kinds of Complementary Feature Points

With the rapid development of digital multimedia and internet techniques in the last few years, more and more digital images are being distributed to an ever-growing number of people for sharing, studying, or other purposes. Sharing images digitally is fast and cost-efficient thus highly desirable. However, most of those digital products are exposed without any protection. Thus, without authorization, such information can be easily transferred, copied, and tampered with by using digital multimedia editing software. Watermarking is a popular resolution to the strong need of copyright protection of digital multimedia. In the image forensics scenario, a digital watermark can be used as a tool to discriminate whether original content is tampered with or not. It is embedded on digital images as an invisible message and is used to demonstrate the proof by the owner. In this thesis, we propose a novel localized geometric-distortion resilient digital watermarking scheme to embed two invisible messages to images. Our proposed scheme utilizes two complementary watermarking techniques, namely, local circular region (LCR)-based techniques and block discrete cosine transform (DCT)-based techniques, to hide two pseudo-random binary sequences in two kinds of regions and extract these two sequences from their individual embedding regions. To this end, we use the histogram and mean statistically independent of the pixel position to embed one watermark in the LCRs, whose centers are the scale invariant feature transform (SIFT) feature points themselves that are robust against various affine transformations and common image processing attacks. This watermarking technique combines the advantages of SIFT feature point extraction, local histogram computing, and blind watermark embedding and extraction in the spatial domain to resist geometric distortions. We also use Watson’s DCT-based visual model to embed the other watermark in several rich textured 80×80 regions not covered by any embedding LCR. This watermarking technique combines the advantages of Harris feature point extraction, triangle tessellation and matching, the human visual system (HVS), the spread spectrum-based blind watermark embedding and extraction. The proposed technique then uses these combined features in a DCT domain to resist common image processing attacks and to reduce the watermark synchronization problem at the same time. These two techniques complement each other and therefore can resist geometric and common image processing attacks robustly. Our proposed watermarking approach is a robust watermarking technique that is capable of resisting geometric attacks, i.e., affine transformation (rotation, scaling, and translation) attacks and other common image processing (e.g., JPEG compression and filtering operations) attacks. It demonstrates more robustness and better performance as compared with some peer systems in the literature

Design and Implementation of Visual Cryptography System for Transmission of Secure Data

In recent period of time security of the transmitted data is most critical problem, as network technology is greatly advanced and heaps of information is transmitted via net. Visual cryptography strategy is one of the most secure technique for privacy auspices, that allow the encryption of secret image or data by transferring it into the secure percentage and such a strategy is able to recover the secret image or data. This behavior makes visual cryptography especially useful for the low computation load requirement. In this paper, we are providing the information regarding information security by using Visual Cryptography scheme by making use of exclusive new technique of splitting of images along with their pixels rotation with the help of generated random number. We also have made an attempt to overcome some of the disadvantages of preexisting techniques of encryption and decryption. Finally, successful transmission of the message from transmitting end to receiving end without any interception was done. Most importantly, it is very difficult to hack by use of any professional hacking techniques as the message is encrypted twice. Hence the data is highly secured under transmission pat

Sharing Secret Colour Images with Embedded Visual Cryptography Using the Stamping Algorithm and OTP Procedure

Finding a way to ensure the safety of media is becoming increasingly common in the modern world as digital media usage increases. Visual cryptography (VC) offers an efficient method for sending images securely. Images that have been protected using visual encryption can be decoded using features of human vision. Emails are not a highly safe method of exchanging private data because someone else can quickly weaken the content. In the visual cryptography technique, we presented for colour pictures, the divided shares are enclosed in additional pictures using stamping. Using a random number generator, the shares are created. Visual cryptography schemes (VCS) are a method of encoding pictures that conceals the secret information which is present in images. A secret image is encrypted using a straightforward visual cryptography technique by splitting it into n shares, and the stamping operation is carried out by overlapping k shares. It can be beneficial for hiding a secret image. There is a chance that employing cryptography for information exchange could cause security problems because the process of decryption of simple visual cryptographic algorithms can be completed by the human eye. To address this issue, we are using the OTP procedure. In the past, static ID and passwords were employed, making them susceptible to replay and eavesdropping attacks. One Time Password technology, which generates a unique password each time, is utilized to solve this issue. The suggested approach strengthens the security of the created transparencies by applying an envelope to each share and employing a stamping technique to address security vulnerabilities that the previous methods had, such as pixel expansion and noise

Privacy-preserving information hiding and its applications

The phenomenal advances in cloud computing technology have raised concerns about data privacy. Aided by the modern cryptographic techniques such as homomorphic encryption, it has become possible to carry out computations in the encrypted domain and process data without compromising information privacy. In this thesis, we study various classes of privacy-preserving information hiding schemes and their real-world applications for cyber security, cloud computing, Internet of things, etc. Data breach is recognised as one of the most dreadful cyber security threats in which private data is copied, transmitted, viewed, stolen or used by unauthorised parties. Although encryption can obfuscate private information against unauthorised viewing, it may not stop data from illegitimate exportation. Privacy-preserving Information hiding can serve as a potential solution to this issue in such a manner that a permission code is embedded into the encrypted data and can be detected when transmissions occur. Digital watermarking is a technique that has been used for a wide range of intriguing applications such as data authentication and ownership identification. However, some of the algorithms are proprietary intellectual properties and thus the availability to the general public is rather limited. A possible solution is to outsource the task of watermarking to an authorised cloud service provider, that has legitimate right to execute the algorithms as well as high computational capacity. Privacypreserving Information hiding is well suited to this scenario since it is operated in the encrypted domain and hence prevents private data from being collected by the cloud. Internet of things is a promising technology to healthcare industry. A common framework consists of wearable equipments for monitoring the health status of an individual, a local gateway device for aggregating the data, and a cloud server for storing and analysing the data. However, there are risks that an adversary may attempt to eavesdrop the wireless communication, attack the gateway device or even access to the cloud server. Hence, it is desirable to produce and encrypt the data simultaneously and incorporate secret sharing schemes to realise access control. Privacy-preserving secret sharing is a novel research for fulfilling this function. In summary, this thesis presents novel schemes and algorithms, including: • two privacy-preserving reversible information hiding schemes based upon symmetric cryptography using arithmetic of quadratic residues and lexicographic permutations, respectively. • two privacy-preserving reversible information hiding schemes based upon asymmetric cryptography using multiplicative and additive privacy homomorphisms, respectively. • four predictive models for assisting the removal of distortions inflicted by information hiding based respectively upon projection theorem, image gradient, total variation denoising, and Bayesian inference. • three privacy-preserving secret sharing algorithms with different levels of generality

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