CHAPTER 11: Steganography and Watermarking INFORMATION HIDING SUBDISCIPLINES COVERT CHANNELS STEGANOGRAPHY versus WATERMARKING.II Both techniques belong to the category of information hiding, but the objectives and embeddings of these techniques are just opposite. In watermarking, the important information is in the cover data. The embedded data is added for protection of the cover data. In steganography, the cover data is not important. It mostly serves as a diversion from the most important information that is in embedded data. Steganography tools typically hide relatively large blocks of information while watermarking tools place/hide less information in an image or sounds. Data hiding dilema: to find the best trade-off between three quantities: robustness, capacity and security. Watermarking versus Steganography Systems for inserting messages in cover data can be divided into: • watermarking systems, in which the message is related to the cover data (copyright, licence, authorship); • non-watermarking systems, in which the message inserted is not related to the cover data. STEGANOGRAPHY versus WATERMARKING again Technically, differences between steganography and watermarking are both subtle and essential. The main goal of steganography is to hide a message m in some audio or video (cover) data d, in such a wat that one obtains new data d', practically indistinguishable from d, by people, in such a way that an eavesdropper cannot detect the presence of m in d'. The main goal of watermarking is to hide a message m in some audio or video (cover) data d, to obtain new data d', practically indistinguishable from d, by people, in such a way that an eavesdropper cannot remove or replace m in d'. It is also often said that the goal of steganography is to hide a message in one-to-one communications and the goal of watermarking is to hide message in one-to-many communications. Shortly, one can say that cryptography is about protecting the content of messages, steganography is about concealing its very existence. Steganography methods usually do not need to provide strong security against removing or modification of the hidden message. Watermarking methods need to to be very robust to attempts to remove or modify a hidden message. BASIC PROBLEMS -- Where and how can secret-data be undetectably hidden? -- Why and who needs steganography? -- What is the maximum amount of information that can be hidden given a level of degradation to the digital media? -- How one chooses good cover media for a given stego message? -- How to detect, localize a stego message? APPLICATIONS of STEGANOGRAPHY To have secure secret communications where cryptographic encryption methods are not available. • To have secure secret communication where strong cryptography is impossible. • In some cases, for example in military applications, even the knowledge that two parties communicate can be of large importance. • The health care, and especially medical imaging systems, may very much benefit from information hiding techniques. APPLICATIONS of WATERMARKING A popular application of watermarking techniques is to provide a proof of ownership of digital data by embedding copyright statements into a video or Into a digital image. Other applications: • Automatic monitoring and tracking of copy-write material on WEB. (For example, a robot searches the Web for marked material and thereby identifies potential illegal issues.) • Automatic audit of radio transmissions: (A robot can “listen” to a radio station and look for marks, which indicate that a particular piece of music, or advertisement , has been broadcast.) • Data augmentation - to add information for the benefit of the public. • Fingerprinting applications (in order to distinguish distributed data) Actually, watermarking has recently emerged as the leading technology to solve the above very important problems. All kind of data can be watermarked: audio, images, video, formatted text, 3D models, … Steganography/Watermarking versus Cryptography The purpose of both is to provide secret communication. Cryptography hides the contents of the message from an attacker, but not the existence of the message. Steganography/watermarking even hide the very existence of the message in the communicating data. Consequently, the concept of breaking the system is different for cryptosystems and stegosystems (watermarking systems). • A cryptographic system is broken when the attacker can read the secrete message. • Breaking of a steganographic/watermarking system has two stages: - The attacker can detect that steganography/watermarking has been used; - The attacker is able to read, modify or remove the hidden message. A steganography/watermarking system is considered as insecure already if the detection of steganography/watermarking is possible. Cryptography and steganography Both, steganography and watermarking, are used in security and both may be used together. By using steganography to hide the encrypted communication, an enemy is not only faced with a difficult encryption problem, but also with the problem of finding the embedded data. WHO NEEDSTEGANOGRAPHY? -- Secure communication. -- Automatic monitoring of copywriting material on the web. -- Automatic audit of radio transmissions. -- Video conferencing. -- LSB and ISDN telephone conversation -- Ownership of digital images FIRST STEGANOGRAPHIC METHODS • Ancient Chinese wrote messages on fine silk, which was then crunched into a tiny ball and covered in wax. The messenger then swallowed the ball of wax. • In the sixteenth century, the Italian scientist Giovanni Porta described how to conceal a message within a hard-boiled egg by making an ink from a mixture of one ounce of alum and a pint of vinegar, and then using ink to write on the shell. The ink penetrated the porous shell, and left the message on the surface of the hardened egg albumen, which could be read only when the shell was removed. • Special “inks” were important steganographic tools even during Second World War. • During Second World War a technique was developed to shrink photographically a page of text into a dot less than one millimeter in diameter, and then hide this microdot in an apparently innocuous letter. (The first microdot has been spotted by FBI in 1941.) HISTORY of MICRODOTS • In 1857, Brewster suggested hiding secret messages "in spaces not larger than a full stop or small dot of ink". • In 1860 the problem of making tiny images was solved by French photographer Dragon. • During Franco-Prussian war (1870-1881) from besieged Paris messages were sent on microfilms using pigeon post. • During Russo-Japanese war (1905) microscopic images were hidden in ears, nostrils, and under fingernails. • During First World War messages to and from spies were reduced to microdots, by several stages of photographic reductions, and then stuck on top of printed periods or commas (in innocuous cover materials, such as magazines). FIRST STEGANOGRAPHY BOOKS A variety of methods was used already in Roman times and then in 15-16 century (ranging from coding messages in music, and string knots, to invisible inks). In 1499 Johannes Trithemius, opat from Würzburg, wrote 3 out of 8 planned books “Steganographia”. In 1518 Trithemius printed 6 books, 540 pages, on cryptography and steganography called Polygraphiae. This is Trithemius' most notorious work. It includes a sophisticated system of steganography, as well as angel magic. It also contains a synthesis of the science of knowledge, the art of memory, magic, an accelerated language learning system, and a method of sending messages without symbols. In 1665 Gaspari Schotti published the book “Steganographica”, 400pages. (New presentation of Trithemius.) TRITHEMIUS • Born on February 2, 1462 and considered as one of the main intellectual of his time. • His book STEGANOGRAPHIA was published in 1606. • In 1609 catholic church has put the book on the list of forbidden books (to be there for more than 200 years). • His books are obscured by his strong belief in occult powers. • He classified witches into four categories. • He fixed creation of the world at 5206 B.C. • He described how to perform telepathy. • Trithemius died on December 14, 1516. GENERAL STEGANOGRAPHIC MODEL A general model of a steganographic system: Figure 1: Model of steganographic systems Steganographic algorithms are in general based on replacing noise component of a digital object with a to-be-hidden message. Kirchoffov principle holds also for steganography. Security of the system should not be based on hiding embedding algorithm, but on hiding the key. BASIC CONCEPTS of STEGOSYSTEMS • Covertext (cover-data - cover-object) is an original (unaltered) message. • Embedding process (ukryvaci proces) in which the sender, Alice, tries to hide a message by embedding it into a (randomly chosen) covertext, usually using a key, to obtain a stegotext (stego-data or stego-object). The embedding process can be described by the mapping E:C ´ K ´ M ® C, where C is the set of possible cover- and stegotexts, K is the set of keys, and M is the set of messages. • Stegotext (stego-data - stego-object) • Recovering process (or extraction process – odkryvaci proces) in which the receiver, Bob, tries to get, using the key only but not the covertext, the hidden message in the stegotext. The recovery (decoding) process D can be seen as a mapping D: C ´ K ® C. • Security requirement is that a third person watching such a communication should not be able to find out whether the sender has been active, and when, in the sense that he really embedded a message in the covertext. In other words, stegotexts should be indistinguishable from covertexts. BASIC TYPES of STEGOSYSTEMS PUBLLIC-KEY STEGANOGRAPHY Similarly as in the case of the public-key cryptography, two keys are used: a public-key E for embedding and a private-key D for recovering. It is often useful to combine such a public-key stegosystem with a public-key cryptosystem. For example, in case Alice wants to send a message m to Bob, encodes first m using Bob’s public key e[B], then makes embedding of e[B](m) using process E into a cover and then sends the resulting stegotext to Bob, who recovers e[B](m) using D and then decrypts it, using his decryption function d[B]. LINGUISTIC STEGANOGRAPHY ACROSTIC Amorosa visione by Giovanni Boccaccio (1313-1375) is said to be the world largest acrostic. Boccaccio first wrote three sonnets (1500 letters together) and then he wrote other poems such that the initials of the successive tercets correspond exactly to the letters of the sonnets. In the book Hypnerotomachia Poliphili, published by an anonymous in 1499, and considered as one of the most beautiful books ever,the first letters of the 38 chapters spelled out as follows: Poliam frater Franciscus Columna peramavit with the translation Brother Francesco Colonna passionately loves Polia PERFECT SECRECY of STEGOSYSTEMS PERFECTLY SECURE STEGOSYSTEMS DETECTING SECRET MESSAGES The main goal of a passive attacker is to decide whether the data sent to Bob by Alice contain a secret message or not. The above task can be formalized as a statistical hypothesis-testing problem with the test function f: C ® {0,1}: f(c) = 1, if c contains a secret message; 0, otherwise There are two types of errors possible: Type-I error - a secret message is detected in data with no secret message; Type-II error - a hidden secret message is not detected Practical steganography tries to minimize probability that passive attackers make type-II error. In the case of e-secure stegosystems, there is a well know relation between the probability b of the type II error and probability a of the type I error. Theorem Let S be a stegosystem which is e-secure against passive attackers and let b be the probability that the attacker does not detect a hidden message and a be the probability that the attacker falsely detects a hidden message. Then d(a||b) Ł e, where d(a,b) is the binary relative entropy defined by INFORMATION HIDING in NOISY DATA Perhaps the most basic methods of steganography is to utilize the existence of redundant information in a communication process. Images and digital sounds naturally contain such redundancies in the form of noise components. For images and digital sounds it is naturally to assume that a cover-data are represented by a sequence of numbers and their least significant bits (LSB) represent noise. If cover-data are represented by numbers c[1], c[2], c[3], …, then one of the most basic steganographic method is to replace, in some of c[i]'s, chosen using an algorithm and a key, the least significant bits by the bits of the message that should be hidden. Unfortunately, this method does not provide high level of security and it can change significantly statistical properties of the cover-data. ROBUSTNESS of STEGOSYSTEMS ACTIVE and MALICIOUS ATTACKS SECURITY of STEGOSYSTEMS Definition A steganographic algorithm is called secure if • Messages are hidden using a public algorithm and a secret key. The secret key must identify the sender uniquely. • Only the holder of the secret key can detect, extract and prove the existence of the hidden message. (Nobody else should be able to find any statistical evidence of a message's existence.) • Even if an enemy gets the contents of one hidden message, he should have no chance of detecting others. • It is computationally infeasible to detect hidden messages. STEGO - ATTACKS BASIC STEGANOGRAPHIC TECHNIQUES COVER DATA A cover-object or, shortly, a cover c is a sequence of numbers c[i], i = 1,2,…, |c|. Such a sequence can represent digital sounds in different time moments, or a linear (vectorized) version of an image. c[i ] Î {0,1} in case of binary images and, usually, 0 Ł c[i] Ł 256 in case of quantized images or sounds. An image C can be seen as a discrete function assigning a color vector c(x,y) to each pixel p(x,y). A color value is normally a three-component vector in a color space. Often used are the following color spaces: RGB-space - every color is specified as a weighted sum of a red, green and a blue component. A vector specifies intensities of these three components. YCbCr-space It distinguishes a luminance Y and two chrominance components (Cb, Cr). Note A color vector can be converted to YCbCr components as follows: Y = 0.299 R + 0.587 G + 0.114 B Cb = 0.5 + (B - Y) / 2 Cr = 0.5 + (R - Y) / 1.6 BASIC SUBSTITUTION TECHNIQUES LSB substitution pluses and minuses Bits or pixels can be chosen (a) randomly; (b) adaptively according to local properties of digital media. Advantages: (a) LSB substitution is the simplest and most common stego technique and it can be used also for different color models. (b) This method can reach a very high capacity with little, if any, visible impact to the cover digital media. (c) It is relatively easy to apply on images and radio data. (d) Many tools are available on internet Disadvantages: •It is relatively simple to detect the hidden data; •It does not offer robustness against small modifications (including compression) at the stego images. HISTORY of WATERMARKING Paper watermarks appeared in the art of handmade papermarking 700 hundred years ago. Watermarks were mainly used to identify the mill producing the paper and paper format, quality and strength. Paper watermarks was a perfect technique to eliminate confusion from which mill paper is and what are its parameters. Legal power of watermarks has been demonstrated in 1887 in France when watermarks of two letters, presented as a piece of evidence in a trial, proved that the letters had been predated, what resulted in the downfall of a cabinet and, finally, the resignation of the president Grévy. Paper watermarks in bank notes or stamps inspired the first use of the term water mark in the context of digital data. The first publications that really focused on watermarking of digital images were from 1990 and then in 1993. EMBEDDING and RECOVERY SYSTEMS in WATERMARKING SYSTEMS Figure 2 shows the basic scheme of the watermarks embedding systems. Figure 2: Watermark embedding scheme Inputs to the scheme are the watermark, the cover data and an optional public or secret key. The output are watermarked data. The key is used to enforce security. Figure 3 shows the basic scheme for watermark recovery schemes. Figure 3: Watermark recovery scheme Inputs to the scheme are the watermarked data, the secret or public key and, depending on the method, the original data and/or the original watermark. The output is the recovered watermarked W or some kind of confidence measure indicating how likely it is for the given watermark at the input to be present in the data under inspection. TYPES of WATERMARKING SCHEMES INVISIBLE COMMUNICATIONS SECRET SHARING by SECRET HIDING A simple technique has been developed, by Naor and Shamir, that allows for a given n and t < n to hide any secret (image) message m in images on transparencies in such away that each of n parties receives one transparency and · no t -1 parties are able to obtain the message m from the transparencies they have. · any t of the parties can easily get (read or see) the message m just by stacking their transparencies together and aligning them carefully. TO REMEMBER !!! There is no use in trying, she said: one cannot believe impossible things. I dare to say that you have not had much practice, said the queen, When I was your age, I always did it for half-an-hour a day and sometimes I have believed as many as six impossible things before breakfast. Lewis Carroll: Through the Looking-glass, 1872