Showing papers on "Steganography published in 1999"

Information Hiding Techniques for Steganography and Digital Watermarking

Abstract: From the Publisher: Steganography, a means by which two or more parties may communicate using "invisible" or "subliminal" communication, and watermarking, a means of hiding copyright data in images, are becoming necessary components of commercial multimedia applications that are subject to illegal use. This new book is the first comprehensive survey of steganography and watermarking and their application to modern communications and multimedia. Handbook of Information Hiding: Steganography and Watermarking helps you understand steganography, the history of this previously neglected element of cryptography, the hurdles of international law on strong cryptographic techniques, a description of possible applications, and a survey of the methods you can use to hide information in modern media. Included in this discussion is an overview of "steganalysis," methods which can be used to break steganographic communication. This comprehensive resource also includes an introduction to and survey of watermarking methods, and discusses this method's similarities and differences to steganography. You gain a working knowledge of watermarking's pros and cons, and you learn the legal implications of watermarking and copyright issues on the Internet.

Spread spectrum image steganography

Abstract: We present a new method of digital steganography, entitled spread spectrum image steganography (SSIS). Steganography, which means "covered writing" in Greek, is the science of communicating in a hidden manner. Following a discussion of steganographic communication theory and review of existing techniques, the new method, SSIS, is introduced. This system hides and recovers a message of substantial length within digital imagery while maintaining the original image size and dynamic range. The hidden message can be recovered using appropriate keys without any knowledge of the original image. Image restoration, error-control coding, and techniques similar to spread spectrum are described, and the performance of the system is illustrated. A message embedded by this method can be in the form of text, imagery, or any other digital signal. Applications for such a data-hiding scheme include in-band captioning, covert communication, image tamperproofing, authentication, embedded control, and revision tracking.

Robust mesh watermarking

Abstract: We describe a robust method for watermarking triangle meshes. Watermarking provides a mechanism for copyright protection of digital media by embedding information identifying the owner in the data. The bulk of the research on digital watermarks has focused on media such as images, video, audio, and text. Robust watermarks must be able to survive a variety of “attacks”, including resizing, cropping, and filtering. For resilience to such attacks, recent watermarking schemes employ a “spread-spectrum” approach – they transform the document to the frequency domain and perturb the coefficients of the perceptually most significant basis functions. We extend this spread-spectrum approach to work for the robust watermarking of arbitrary triangle meshes. Generalizing spread spectrum techniques to surfaces presents two major challenges. First, arbitrary surfaces lack a natural parametrization for frequency-based decomposition. Our solution is to construct a set of scalar basis function over the mesh vertices using multiresolution analysis. The watermark perturbs vertices along the direction of the surface normal, weighted by the basis functions. The second challenge is that simplification and other attacks may modify the connectivity of the mesh. We use an optimization technique to resample an attacked mesh using the original mesh connectivity. Results show that our watermarks are resistant to common mesh operations such as translation, rotation, scaling, cropping, smoothing, simplification, and resampling, as well as malicious attacks such as the insertion of noise, modification of low-order bits, or even insertion of other watermarks. CR Categories: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Surface Representations.

Principles and applications of BPCS steganography

Abstract: Steganography is a technique to hide secret information in some other data (we call it a vessel) without leaving any apparent evidence of data alteration. All of the traditional steganographic techniques have limited information-hiding capacity. They can hide only 10% (or less) of the data amounts of the vessel. This is because the principle of those techniques was either to replace a special part of the frequency components of the vessel image, or to replace all the least significant bits of a multivalued image with the secret information. Our new steganography uses an image as the vessel data, and we embed secret information in the bit-planes of the vessel. This technique makes use of the characteristics of the human vision system whereby a human cannot perceive any shape information in a very complicated binary pattern. We can replace all of the noise-like regions in the bit-planes of the vessel image with secret data without deteriorating the image quality. We termed our steganography BPCS-Steganography, which stands for Bit-Plane Complexity Segmentation Steganography. We made an experimental system to investigate this technique in depth. The merits of BPCS-Steganography found by the experiments are as follows. 1. The information hiding capacity of a true color image is around 50%. 2. A sharpening operation on the dummy image increases the embedding capacity quite a bit. 3. Canonical Gray coded bit planes are more suitable for BPCS-Steganography than the standard binary bit planes. 4. Randomization of the secret data by a compression operation makes the embedded data more intangible. 5. Customization of a BPCS-Steganography program for each user is easy. It further protects against eavesdropping on the embedded information.

A Review of Data Hiding in Digital Images.

Abstract: In this paper we will overview the use of data hiding techniques in digital images. In particular we will describe how one can use Steganography to hide information in a digital image. Steganography is related to cryptography and is the basis for many of the digital watermarking techniques currently being developed. The interest in data hiding has risen with the recent activity in digital copyright protection schemes. One way to protect the ownership of a digital image is to secretly embed data in the content of the image identifying the owner. This paper will review recent developments in data hiding, specifically as it pertains to copyright protection of digital images.

Dither modulation : a new approach to digital watermarking and information embedding

Abstract: We consider the problem of embedding one signal (e.g., a digital watermark), within another 'host' signal to form a third, 'composite' signal. The embedding must be done in such a way that minimizes distortion between the host signal and composite signal, maximizes the information-embedding rate, and maximizes the robustness of the embedding. In general, these three goals are conflicting, and the embedding process must be designed to efficiently trade-off the three quantities. We propose a new class of embedding methods, which we term quantization index modulation (QIM), and develop a convenient realization of a QIM system that we call dither modulation in which the embedded information modulates a dither signal and the host signal is quantized with an associated dithered quantizer. QIM and dither modulation systems have considerable performance advantages over previously proposed spread-spectrum and low-bit(s) modulation systems in terms of the achievable performance trade-offs among distortion, rate, and robustness of the embedding. We also demonstrate these performance advantages in the context of 'no-key' digital watermarking applications, in which attackers can access watermarks in the clear. We also examine the fundamental limits of digital watermarking from an information theoretic perspective and discuss the achievable limits of QIM and alternative systems.© (1999) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Robust bit extraction from images

Abstract: We describe an algorithm for robust extraction of bits from image blocks and a method for synthesizing a Gaussian pseudo-random sequence from those bits. The bits are extracted by thresholding projections onto random smooth patterns generated from a user-specified key. The extracted bits are further utilized to synthesize a Gaussian pseudo-random sequence that changes continuously with the image block yet depends sensitively on the secret key. The proposed technique is quite general and can be combined with the majority of oblivious watermarking schemes that generate watermarks from pseudo-random sequences. We anticipate that this algorithm will find applications in many oblivious watermarking schemes including secure data embedding into videos and watermarking images for tamper detection.

Digital watermarking: from concepts to real-time video applications

Abstract: Digital watermarking has been increasingly applied to hide information in digital multimedia data, thus enlisting the watermarking technology in the difficult fight against intellectual property rights infringement. The authors have developed a secure, robust watermarking algorithm and applied it in digital streaming MPEG-2 format video-the format of choice in the broadcast and video stock industry.

An Information-Theoretic Approach to Steganography and Watermarking

Abstract: A theoretical model for steganography and digital watermarking is presented, which includes a stego encoder, a stego channel and a stego decoder. The first part states the basic steganographic and watermarking problems in terms of mutual information of the involved quantities such as the secret message, the stego message and the modified stego message. General lower bounds on the robustness-related mutual information are derived. In the second part, perfect steganography is considered and some new schemes are presented that achieve perfect secrecy and provide robustness against some attacks. In the last part, the robustness of some simplistic schemes is evaluated by tight lower bounds on the robustness-related mutual information. From these bounds, two criteria for robust embedding are derived.

DNA-based cryptography.

Abstract: Recent research has considered DNA as a medium for ultra-scale computation and for ultra-compact information storage. One potential key application is DNA-based, molecular cryptography systems. We present some procedures for DNA-based cryptography based on one-time-pads that are in principle unbreakable. Practical applications of cryptographic systems based on one-time-pads are limited in conventional electronic media by the size of the one-time-pad; however DNA provides a much more compact storage medium, and an extremely small amount of DNA suffices even for huge one-time-pads. We detail procedures for two DNA one-time-pad encryption schemes: (i) a substitution method using libraries of distinct pads, each of which defines a specific, randomly generated, pair-wise mapping; and (ii) an XOR scheme utilizing molecular computation and indexed, random key strings. These methods can be applied either for the encryption of natural DNA or for artificial DNA encoding binary data. In the latter case, we also present a novel use of chip-based DNA micro-array technology for 2D data input and output. Finally, we examine a class of DNA steganography systems, which secretly tag the input DNA and then hide it within collections of other DNA. We consider potential limitations of these steganographic techniques, proving that in theory the message hidden with such a method can be recovered by an adversary. We also discuss various modified DNA steganography methods which appear to have improved security.

A New Steganographic Method for Palette-Based Images.

Abstract: In this paper, we present a new steganographic technique for embedding messages in palette-based images, such as GIF files. The new technique embeds one message bit into one pixel (its pointer to the palette). The pixels for message embedding are chosen randomly using a pseudorandom number generator seeded with a secret key. For each pixel at which one message bit is to be embedded, the palette is searched for closest colors. The closest color with the same parity as the message bit is then used instead of the original color. This has the advantage that both the overall change due to message embedding and the maximal change in colors of pixels is smaller than in methods that perturb the least significant bit of indices to a luminance-sorted palette, such as EzStego [1]. Indeed, numerical experiments indicate that the new technique introduces approximately four times less distortion to the carrier image than EzStego. The maximal color change is 4− 5 times smaller for the new technique than that of EzStego. A technique that introduces less distortion to the carrier image will generally cause changes that are more difficult to detect, and will therefore provide more security.

Steganography: the art of hiding information in plain sight

Abstract: Steganography is the art (as well as the science) of communicating in a hidden way. It is referred to as "transmission security", or TRANSEC in military literature. Its goal is to hide messages inside other "harmless" messages in such a way that an "enemy" would not even know a second secret message was present. The history of steganography is discussed as is the design principle of steganographic systems. Some examples are given.

Large capacity steganography

Abstract: A technique for hiding information in an image that is based a property of the human vision system. Because of its relation to human vision properties, the technique of the present invention provides an information hiding capacity is as large as 50% of the original image data. The method includes the steps of segmenting each region of a vessel image into informative and noise-like regions by using a threshold value, arranging the data into a series of data blocks, and embedding each data block into the noise-like regions of the image.

Data hiding within audio signals

Abstract: In this paper we present the general principles of steganography, basic terminology, and an overview of applications and techniques In particular we will consider data hiding within audio signals, the basic requirements and the state of the art techniques We propose a novel technique, short-term autocorrelation modulation, with several variations The proposed method is characterized by perfect transparency, robustness, high bit rate, low processing load, and, particularly, high security

An Adaptive Image Steganographic Model Based on Minimum-Error LSB Replacement

Abstract: Steganography is an ancient art of conveying message in a secret way that only the receiver knows the existence of message. Steganalysis is the art of detecting the message's existence and blockading the covert communication. The least-significant bit (LSB) insertion method, which uses fixed k LSBs in each pixel to embed secret message, is the most common and easy one to hide message in an image. However, it is easy to reveal a stego-image produced by the LSB insertion method. In this paper, we will first lead a bit-plane steganalysis on such stego-images. Then, an adaptive steganographic model will be proposed to take off the restriction of fixed embedding size in each pixel. The model will reduce the embedding error and provide higher embedding capacity. Moreover, to detect the message's existence will be very hard for those stego-images produced using the proposed model.

Information Hiding: an Annotated Bibliography

Abstract: : There are a number of application areas in which we want to hide information or to stop someone else from doing so. These steganography, copyright marking, the study of covert channels in operating systems, low-probability of intercept communications, and the study of subliminal channels in digital signature schemes. There follow abstracts of material from number of relevant publications.

Developments in Steganography

Abstract: This paper presents two main results. The first is a new approach to steganography in which data is encoded in correlations among the pixels in an image. Almost all previous steganographic methods encode data in correlations between the pixels and a known external reference signal. This method hints at the existence of public key watermarking techniques, which will be defined.

Steganography Secure against Cover-Stego-Attacks

Abstract: Steganography aims to secretly transmit messages by embedding them in cover data. The usual criterion each stegosystem must meet is to resist stego-only-attacks. An even stronger criterion is to resist cover-stego-attacks. The article introduces a stego paradigm which aims to meet this stronger requirement by simulating a “usual process” of data processing. The general realization of the paradigm is discussed. One possible realization is sketched.

Self-noise suppression schemes in blind image steganography

Abstract: Blind or oblivious data hiding, can be considered as a signaling method where the origin of the signal constellation is not known. The origin however, can be estimated, by means of self-noise suppression techniques. In this paper, we propose such a technique, and present both theoretical and numerical evaluations of its performance in an additive noise scenario. The problem of optimal choice of the parameters of the proposed technique is also explored, and solutions are presented. Though the cover object is assumed to be an image for purposes of illustration, the proposed method is equally applicable for other types of multimedia data, like video, speech or music.

Steganography based on region segmentation with a complexity measure

Abstract: This paper describes a new steganographic technique using image segmentation based on a local complexity measure. The key to this approach is that a binary image can be divided into “informative” and “noiselike” regions by using a “complexity measure.” This property allows us to embed secret data in the noiselike regions if the secret data have a random pattern. If the secret data are simple, then we apply an image conjugate operation that transforms a simple pattern into a complex pattern. In the experiment, a JPEG file was embedded into a gray scale dummy image (256 × 256, 8 bits/pixel) without losing any visual information. © 1999 Scripta Technica, Syst Comp Jpn, 30(3): 1–9, 1999

Mismatching perceptual models for effective watermarking in the presence of compression

Abstract: In this paper, we concentrate on the problem of robust watermarking in the presence of perceptual coding. We first present a watermarking approach called Robust Reference Watermarking (RRW) which can be incorporated into a broad class of watermarking algorithms to improve their performance. Through analysis of this scheme we demonstrate how embedding the watermark using a different perceptual model and domain than for compression can result in improved watermark extraction and detection reliability. Simulation results are also presented to verify our theoretical observations.

Methods of digital steganography for multimedia data

Abstract: A lossless steganographic encoding method for secure transmission or storage of multimedia data. Primary data, such as text, image, video, audio or other digital data, is utilised in a steganographic process to encode secondary data, such as text, image, video, audio or other digital data. The primary data includes a plurality of first data elements and the secondary data includes a plurality of second data elements. For each second data element an operation is performed with a first data element so as to generate a key element as a result of the operation. The key elements may then be securely transmitted and/or stored. In preferred embodiments of the method, the primary data may be rearranged according to a predefined or random manner, or it may be resized so as to match the size of the secondary data. A complementary decoding method is disclosed, and a method of generating a pseudo-random number sequence, which may be used in the steganographic and decoding methods, is also disclosed.

One-Time Hash Steganography

Abstract: In this paper we first generalize the steganography system model which Christian Cachin proposed, and specialize it to be suitable for computer oriented steganography systems. Based on this model, we introduce a new perfectly secure steganography scheme, one-time hash steganography, with which one can hide a secret bit into any cover-data that satisfies certain condition (partial recomputability). Finally we prove that there exists a perfectly secure steganography system with given cover-data source if and only if the cover-data source is partially recomputable to its sender.

Strategies for Steganalysis of Bitmap Graphics Files.

Abstract: : Steganography is the art and science of communicating through covert channels The goal of steganography is to hide the fact that a message is even being transmitted In the context of today's digital world, this ancient practice is enjoying resurgence due to the plethora of hiding places made possible by modern information media Of particular concern is the use of graphics image files to conceal both legitimate and criminal communications

Steganograpic image transformation

Abstract: Due to the drastic development of Internet, it has recently been a critical problem to secure multimedia contents against illegal use. In order to solve this problem, data hiding has drawn great attention as a promising method that plays a complementary role to conventional cryptographic techniques. The idea of this approach is found in ancient Greek literature as 'Steganography,' which means a 'covered writing' for special secret communication. This paper presents a new method for steganographic image transformation, which is different from conventional data hiding techniques. The transformation is achieved in frequency domain and the concept of Fourier filtering method is used. An input image is transformed into a fractal image, which can be used in Computer Graphic (CG) applications. Unauthorized users will not notice the 'secret' original image behind the fractal image, but even if they know that there is a hidden image it will be difficult for them to estimate the original image from the transformed image. Only authorized users who know the proper keys can regenerate the original image. The proposed method is applicable not only as a security tool for multimedia contents on web pages but also as a steganographic secret communication method through fractal images.© (1999) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Steganographic image transformation

Abstract: Due to the drastic development of Internet, it has recently been a critical problem to secure multimedia contents against illegal use. In order to solve this problem, data hiding has drawn great attention as a promising method that plays a complementary role to conventional cryptographic techniques. The idea of this approach is found in ancient Greek literature as Steganography, which means a covered writing for special secret communication. This paper presents a new method for steganographic image transformation, which is different from conventional data hiding techniques. The transformation is achieved in frequency domain and the concept of Fourier filtering method is used. An input image is transformed into a fractal image, which can be used in Computer Graphic (CG) applications. Unauthorized users will not notice the secret original image behind the fractal image, but even if they know that there is a hidden image it will be difficult for them to estimate the original image from the transformed image. Only authorized users who know the proper keys can regenerate the original image. The proposed method is applicable not only as a security tool for multimedia contents on web pages but also as a steganographic secret communication method through fractal images.

Information hiding using random sequences

Abstract: During the past few years a variety of techniques have emerged to hid specific information within multimedia data for copyright protection, tamper-proofing and secret communication. The schemes for information hiding that have been proposed so far used either digital signal processing software or hardware. So they inevitably have a problem in some applications like automatic copyright control system which need fast data-extracting scheme. In this paper, we show that the newly proposed optical correlator-based information hiding system has an advantage in that sense. In this scheme it is possible to simultaneously extract all the data hidden in one stego image and furthermore it is also possible to simultaneously extract all the data hidden in several stego images using optical correlators such as matched spatial filter and joint transform correlator.© (1999) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.