METHODS AND SYSTEMS FOR FINGERPRINTING DIGITAL DATA

Abstract: Methods and systems for fingerprinting digital data are described. In the described embodiment, Direct Sequence Spread Spectrum (DSSS) technology is utilized. Unique fingerprinting words are defined where each includes at least one spread sequence. In the described embodiment, a fingerprinting word comprises a plurality symbols, called " GAMMA symbols". Each GAMMA symbol is composed of <i>2c-1</i> blocks, where <i>c</i> represents the number of colluders that are desired to be protected against. Each block contains <i>d</i> spread sequence chips. The fingerprinting words are assigned to a plurality of entities to which protected objects embedded with the fingerprinting words are to be distributed. To ascertain the identity of an entity that has altered its unique fingerprinting word, the relative weight of each block is computed in accordance with a defined function and blocks whose weights satisfy a predetermined relationship are "clipped" to a so-called working range. Each GAMMA -symbol of the altered fingerprinting word is then processed to produce a set of one or more colors that might be the subject of a collusion. Each GAMMA -symbol in the fingerprinting word for each entity is then evaluated against a corresponding produced set and the entity having the most overall GAMMA -symbol coincidences is incriminated.

Description: METHODS AND SYSTEMS FOR FINGERPRINTING DIGITAL DATA TECHNICAL FIELD This invention pertains to methods and systems for fingeφrinting digital data. BACKGROUND OF THE INVENTION Fingeφrinting is a technique that involves uniquely marking each copy of a particular object, and associating each uniquely marked copy with a particular entity to which the copy is distributed. If unauthorized copies of the uniquely marked copy are made, the fmgeφrint can be traced back to the original entity to which the copy was initially distributed. As an example, consider a printed map. When a map maker produces a map, they may want to ensure that those individuals to whom the map is distributed do not make unauthorized copies of the map and distribute them to others. One way that the map maker might protect his maps is to introduce a different trivial error, or fϊngeφrint, (e.g. a non-existent street) into each of the copies of the map that are distributed. Each ftngeφrint is then associated with an individual to whom the map is to be distributed. By associating each different fingeφrint with a different individual, if and when unauthorized copies of that individual's copy are uncovered, they can be traced back to the original individual by virtue of the unique fmgeφrint that the map contains. One problem with this type of fingeφrinting can arise when two or more individuals collude for the puφose of discovering their fmgeφrints. That is, when two or more individuals get together and compare their maps, they can, given enough time, ascertain their unique fingeφrints by simply looking for the differences between their maps. If they can ascertain their fmgeφrint, they can alter it and therefore possibly avoid detection. In contemporary times, particularly with the advent of the Internet and electronic distribution, fingeφrinting digital data (e.g. software, documents, music, and video) for puφoses of detecting or deterring unauthorized copying has become particularly important. As in the above map example, collusion by different individuals in the digital context can pose challenges to the owners and distributors of such digital data. Although progress has been made in the area of digital fingeφrinting, further strides are necessary to increase the breadth of protection that is afforded by digital fingeφrinting. For example, in one fingeφrinting system (the "Boneh-Shaw system" discussed in more detail below), some protection against collusion is provided, but only when the number of colluders is relatively small. Thus, there is a need to increase the protection that is provided by digital fingeφrinting to provide detection of colluders even when the number of colluders is large. Accordingly, this invention arose out of concerns associated with providing improved methods and systems for fingeφrinting digital data. SUMMARY OF THE INVENTION Methods and systems for fingeφrinting digital data are described. In the described embodiment, Direct Sequence Spread Spectrum (DSSS) technology is utilized. Unique fingeφrinting words are defined where each includes at least one spread sequence. In the described embodiment, a fingeφrinting word comprises a plurality symbols, called 'T symbols." Each T symbol is composed of 2c- 1 blocks, where c represents the number of colluders that are desired to be protected against. Each block contains d spread sequence chips. The fingeφrinting words are assigned to a plurality of entities to which protected objects embedded with the fingeφrinting words are to be distributed. To ascertain the identity of an entity that has altered its unique fingeφrinting word, the relative weight of each block is computed in accordance with a defined function and blocks whose weights satisfy a predetermined relationship are "clipped" to a so-called working range. Each T-symbol of the altered fingeφrinting word is then processed to produce a set of one or more "colors" that might be the subject of a collusion. Each T-symbol in the fingeφrinting word for each entity is then evaluated against a corresponding produced set and the entity having the most overall incriminating "colors" is incriminated. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a diagram of a computer system that can be utilized in connection with various aspects of the invention. Fig. 2 is a table that contains a plurality of values that are assignable to various users in connection with the Boneh-Shaw system. Fig. 3 is a table that contains a plurality of values that are assignable to various users in connection with the described embodiment. Fig. 4 is a flow diagram that describes steps in an embedding method in accordance with the described embodiment. Fig. 5 is a flow diagram that describes steps in a detection method in accordance with the described embodiment. Fig. 6 is a flow diagram that describes steps in a detection method in accordance with the described embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT Overview In the described embodiment, digital data or objects are fingeφrinted, i.e. embedded, with unique fingeφrinting words. Each fingeφrinting word is associated with one of a number of entities or users to which the fingeφrinted objects are to be distributed. In the described scheme, each fingeφrinting word contains a plurality of T-symbols, and each T-symbol contains a plurality of blocks. Each block, in turn, comprises a spread sequence that has a plurality of spread sequence chips. When an altered object is received, it is first processed to identify the embedded spread sequence chips. Once the chips are identified, a relative weight function is defined and used to calculate the relative weight for each block. The relative weight calculations for each block are analyzed in accordance with a predetermined relationship which determines which of the blocks gets "clipped" to a predefined working range. The clipped blocks are those that are likely to be "unseen" in the sense that the colluders who colluded to produce the altered object likely were not able to see these blocks, i.e. they were the same. The blocks that are not clipped constitute those blocks that likely were "seen" and therefore possibly altered by the colluders. With the relative weights of each block having been computed, and the working range defined, each r-symbol of the altered object is processed to produce a set of possible T-symbols that might be the subject of a collusion. The collection of sets defines a matrix. Each T symbol for a user's unique fmgeφrint is then compared with the set for each corresponding T-symbol in the matrix and a count is kept of the number of times each user's T symbol coincides with a T-symbol that is found in a particular set. When all of the users have been thus evaluated, the user with the highest count is selected as a colluder that produced the altered object. Exemplary Computer System Fig. 1 shows a general example of a computer 130 that can be used in accordance with the invention. Various numbers of computers such as that shown can be used in the context of a distributed computing environment. Computer 130 includes one or more processors or processing units 132, a system memory 134, and a bus 136 that couples various system components including the system memory 134 to processors 132. The bus 136 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. The system memory 134 includes read only memory (ROM) 138 and random access memory (RAM) 140. A basic input/output system (BIOS) 142, containing the basic routines that help to transfer information between elements within computer 130, such as during start-up, is stored in ROM 138. Computer 130 further includes a hard disk drive 144 for reading from and writing to a hard disk (not shown), a magnetic disk drive 146 for reading from and writing to a removable magnetic disk 148, and an optical disk drive 150 for reading from or writing to a removable optical disk 152 such as a CD ROM or other optical media. The hard disk drive 144, magnetic disk drive 146, and optical disk drive 150 are connected to the bus 136 by an SCSI interface 154 or some other appropriate interface. The drives and their associated computer-readable media provide nonvolatile storage of computer-readable instructions, data structures, program modules and other data for computer 130. Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 148 and a removable optical disk 152, it should be appreciated by those skilled in the art that other types of computer-readable media which can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, random access memories (RAMs), read only memories (ROMs), and the like, may also be used in the exemplary operating environment. A number of program modules may be stored on the hard disk 144, magnetic disk 148, optical disk 152, ROM 138, or RAM 140, including an operating system 158, one or more application programs 160, other program modules 162, and program data 164. A user may enter commands and information into computer 130 through input devices such as a keyboard 166 and a pointing device 168. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are connected to the processing unit 132 through an interface 170 that is coupled to the bus 136. A monitor 172 or other type of display device is also connected to the bus 136 via an interface, such as a video adapter 174. In addition to the monitor, personal computers typically include other peripheral output devices (not shown) such as speakers and printers. Computer 130 commonly operates in a networked environment using logical connections to one or more remote computers, such as a remote computer 176. The remote computer 176 may be another personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to computer 130, although only a memory storage device 178 has been illustrated in Fig. 1. The logical connections depicted in Fig. 1 include a local area network (LAN) 180 and a wide area network (WAN) 182. Such networking environments are commonplace in offices, enteφrise-wide computer networks, intranets, and the Internet. When used in a LAN networking environment, computer 130 is connected to the local network 180 through a network interface or adapter 184. When used in a WAN networking environment, computer 130 typically includes a modem 186 or other means for establishing communications over the wide area network 182, such as the Internet. The modem 186, which may be internal or external, is connected to the bus 136 via a serial port interface 156. In a networked environment, program modules depicted relative to the personal computer 130, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used. Generally, the data processors of computer 130 are programmed by means of instructions stored at different times in the various computer-readable storage media of the computer. Programs and operating systems are typically distributed, for example, on floppy disks or CD-ROMs. From there, they are installed or loaded into the secondary memory of a computer. At execution, they are loaded at least partially into the computer's primary electronic memory. The invention described herein includes these and other various types of computer-readable storage media when such media contain instructions or programs for implementing the steps described below in conjunction with a microprocessor or other data processor. The invention also includes the computer itself when programmed according to the methods and techniques described below. For puφoses of illustration, programs and other executable program components such as the operating system are illustrated herein as discrete blocks, although it is recognized that such programs and components reside at various times in different storage components of the computer, and are executed by the data processor(s) of the computer. The Boneh-Shaw System The Boneh-Shaw system (hereinafter "the BS-system") is a fingeφrinting system for use with digital data. The BS-system attempts to overcome the problem of collusion when fingeφrinting digital data. Aspects of the B-S system are described in an article entitled "Collusion-Secure Fingeφrinting for Digital Data" authored by Boneh and Shaw, appearing in IEEE Transactions on Information Theory, Vol. 44, No. 5, September 1998. One of the principle assumptions in the B-S system is known as the "marking assumption": that users cannot alter marks if they cannot determine which data comprise the marks. When an object is fingeφrinted, it is embedded with a fingeφrinting word that is unique for each entity or user. By colluding, users can detect a specific mark if it differs between their copies; otherwise, a mark cannot be detected. This is the basis of the marking assumption — that is, users cannot change marks that they cannot see. These marks are referred to as "unseen" marks. In the B-S system, each user is assigned a unique fingeφrinting word. An example of fingeφrinting word assignments is shown in Fig. 2 for five users. Each row corresponds to a user and shows blocks that form the fingeφrinting word for that user. For example, user 1 has a fingeφrinting word "1111111111111111", user 2 has a fingeφrinting word "00001111111111111111", and so on for each of the users. The collection of the fingeφrinting words for all of the users defines a step structure that is illustrated by the bold line through the table. This stepped structure is instrumental in ascertaining potential colluders as will become apparent below. Each fingeφrinting word is divided into a number of blocks that, in turn, include a plurality of bits. In this example, there are four blocks that are designated as block 0, block 1, block 2, and block 3. Each of the blocks includes, in this example, four bits. For puφoses of this discussion, the matrix that is defined by the fingeφrinting word assignments is known as a "T-code". As there can be many, many users, the T-code necessary to provide fingeφrinting words for all of the users will be quite large. In accordance with the B-S system, a single permutation of the columns of the T-code is performed before embedding an object with a fmgeφrint word. An exemplary permutation is shown in Table 1 below where the order of the blocks is changed. For simplicity, the permutation as represented in the table above occurs over whole blocks. In reality, the permutation occurs at the bit level. For example, the column of leftmost bits might be moved to bit position 12. This permutation is uniform for all of the users and is known only to the encoder or embedder and the decoder: Table 1 When an object is fϊngeφrinted, it is embedded with a permuted fmgeφrinting word that corresponds to one of the users. For puφoses of discussion, an "object" is any digital data that is suitable for fingeφrinting Examples of such objects include, without limitation, documents, music, and video When an illegal copy of a protected object is made, a user will typically attempt to alter their fingeφrinting word so as to avoid detection. The BS-system is directed to ascertaining, with a desirable degree of certainty, the identity of one or more users that may have collaborated in the altering of a protected object. This is done by examining the altered object. In the discussion that follows, the altered object is represented as x where x is a binary word of length u, and I={iι .. ,ι r } is a subset of bit locations of x, l e I c { 1...n} The notation x-ll denotes the restriction of word x to the bit locations of I Let W(x) denote the Hamming weight of the string x. The Hamming weight of a binary string of 1 's and 0's is the number of 1 's in the string. Likewise, if the string is composed of +l 's and -l 's, we could define it to be the number of +l 's in the string. The First Algorithm The BS-system employs a first algorithm that is directed to finding a subset of a coalition that produced an altered object x Thus, at this point, an altered object has been produced by two or more users and an attempt is going to be made to identify a subset of users that likely produced the object x. Before describing the algorithm that produces a subset of likely user candidates, consider the following. When an altered object x is received, it will inevitably contain some form of a fingeφrinting word Recall that each user is assigned a unique permuted fmgeφπntmg word, an example of which is given in Table 1 above. Because each user is assigned a unique fingeφrinting word, certain aspects of the ffngeφrmting word will be unique to each user. For example, a unique aspect of user l 's fingeφrinting word in Fig. 2 is that block 0 comprises all 1 's. Each of the other users has all 0's in their corresponding block 0. Thus, if users other than user 1 are colluders, then, in accordance with the marking assumption (which states that users cannot modify "unseen" bits), none of the bits in block 0 will be modified. Accordingly, all of the bits in block 0 will be 0 and user 1 can be ruled out as a colluder. On the other hand, if any of the bits in block 0 of the altered object x are determined to be 1, then user 1 can be incriminated as a colluder. Again, this is because the bits of block 0 are only capable of being "seen" by a collusion that includes user 1 because they are different from the bits in block 0 for all of the other users. Thus, the first algorithm simply looks at the fingeφrinting word in the altered object and attempts to identify, with a desired degree of certainty, which users are possible candidates for incrimination given that certain bits or blocks have been modified. It does this by considering the Hamming weight of particular blocks that are or can be uniquely seen by particular users. As a more concrete example, consider that users 3 and 4 are going to collude to change a fingeφrinting word on their protected objects. Users 3 and 4 will thus compare their permuted fingeφrinting words. From Table 1 above, this comparison will be as follows: When users 3 and 4 compare their fingeφrinting words, the bits that appear in blocks 1, 3, and 0 are "unseen" to the users. This is because they contain the same values. Thus, in accordance with the marking assumption, the users cannot change the values of any of the bits at these locations. The bits that appear in block 2, however, are different as between the users, i.e. they are "seen". Accordingly, users 2 and 3 will recognize that because of this difference, there must be a fingeφrint in block 2. Knowing this, they can then modify the fingeφrint of block 2 so as to avoid detection. In this example, the resulting fingeφrinting words might look like this: Here, they changed the first two bits in block 2 from "1" to "0". Note that they would not change all of the bits of block 2 because then the resultant fingeφrinting word would be that of user 4 and would result in user 4's incrimination as a colluder. When the blocks are unpermuted, the resulting T-code looks like this: One thing that the reader will notice is that there is still some semblance of a step function that is defined for user 3 by blocks 1 and 2. This step function, as was pointed out above, is unique for user 3 at the location of blocks 1 and 2. That is, all of the other users, either above or below user 3 have, respectively, all l 's or all 0's in their blocks 1 and 2. What the first algorithm does is that, after the columns are unpermuted, it looks for this unique step function or some semblance thereof for users other than the first and last users. For the first and last users, the algorithm simply looks for the unique bits in the blocks that are unique for the first and last users. When a step function (or unique bits) are located, a corresponding user can be incriminated. In this example, since the step function still exists for user 3, user 3 can be incriminated. This can be mathematically represented as follows (ε is the incrimination error probability): Algorithm 1 1. If W(x4TBlock 1) > 0, then user 1 is incriminated. 2. If W(x Block (n-1)) < d, then user n is incriminated. 3. For all s=2 to n-1 do: the bit locations of those two adjacent blocks.) < K/2 - ((K/2)log(2n/ε)) 1/2 , then user "s" is incriminated. The Second Algorithm As was pointed out above, the number of potential users of a given protected object can be quite large. Thus, using the T-code approach discussed above will, accordingly, result in fingeφrinting words that are very large in size. The second algorithm of the BS-system is directed to incriminating a user or colluder without having to use such a large T-code. When using this algorithm, let c represent the number of colluders that are desired to be defended against. A T-code is then selected to have 2c rows. In this system each row is also referred to as a "color". So, for example, if one wants to defend against 20 colluders, then a T-code is selected that has 40 rows or colors. Each row or color in the T-code comprises a plurality of blocks that make up a T-symbol. Each color or T-symbol is treated as a letter in an alphabet that is defined by the T-code The letters in the alphabet are then used to build unique fingeφrinting words for each of the users of the protected object That is, fingeφrmting words contain L colors or T-symbols, where L is a number that is selected to be large enough so that, given the number of users that are to be assigned fingeφrinting words, each is assured of being assigned a unique fingeφrinting word. As an example, consider the following. Assume that it is desirable to defend against 3 colluders at any given time. Thus, a T-code is defined to have 2(3)=6 colors or T-symbols. This is illustrated in the Table 2 below. Table 2 Consider further, in this example, that in the universe of users, the number of T symbols that are necessary for each user to be assigned a unique fingeφrinting word is 3, that is L=3. So, user 1 might be assigned a fingeφrinting word (T 4 T 5 T 3 ), user 2 might be assigned a unique fingeφrinting word (T 3 T 5 T ), and so on for all of the users. Each of the protected objects are embedded with a permuted form of one of the fingeφrinting words. Now, when an altered object is found, applying the principles of Algorithm 1 to each of the T symbols in the altered object will yield a set of colors or T-symbols that are likely the subject of a collusion. So, in this example, there are three T symbols that comprise the altered fingeφrinting word. Algorithm 1 is applied to each of the three T symbols. The result of this computation yields a set of colors or T-symbols for each T symbol of the altered fingeφrinting word. So, for the first T symbol of the altered fingeφrinting word, the set of colors (1, 2, 3), i.e. T \ T 2 T 3 , might be produced. For the second T symbol of the altered fingeφrinting word, the set of colors (2, 4), i.e. T T 4 , might be produced. For the third T symbol of the altered fingeφrinting word, the set of colors (3, 6), i.e. T T 6 , might be produced. These results are summarized in the table below: From the collection of possible color sets, the BS-system builds a word or vector by selecting, at random, one and only one color from each color set. In this example, a word might be built by selecting color 1 from the color set associated with the first T symbol, color 4 from the color set associated with the second T symbol, and color 6 from the color set associated with the third T symbol. Thus, the word that is built is as follows: T \ T 4 T 6 . Now, the user having a fingeφrinting word that is closest to this word is incriminated. More detailed information on the BS-system and its proofs can be found in the article referenced above. Algorithm 2 is summarized just below. Algorithm 2 1. Apply Algorithm 1 to each of the L T-symbols. For each of the L components arbitrarily choose one of the outputs of Algorithm 1. Set y, to be that chosen output (y, is an integer in [l,n]). Form the word y = (yι - - -yL)- 2. Find the fingeφrinting word that is closest to y, and incriminate the corresponding user or entity. In the BS-system, the length in bits of the fingeφrinting word or sequence is given by the following equation: O(c 4 log(N/ε) log(l/ε)), where "c" is the size of the collusion, "N" is the number of users, and ε is the incrimination error probability. Suppose that it is desirable to protect a 2-hour long object in a system that is able to robustly hide 1 bit/sec. The number of colluders that can be protected against, assuming the N=10 6 , and ε=10 "3 is just c-4. Protecting against just four colluders, while a step in the right direction, does not go far enough for defending against the possibility that larger numbers of users might get together and collude. Inventive Methods and System Overview In accordance with the inventive methods and systems, aspects of the BS- system are exploited in conjunction with the use of spread spectrum technology. A spread spectrum sequence is associated with individual blocks of individual fingeφrint words. The spread spectrum sequence utilizes a data structure called a "chip" that is embedded in the protected object. The use of spread sequences in the embedding process enables redefinition of the relative weight of each block as well as redefinition of a working range (defined below). The new weights and working range are utilized in connection with an analysis that increases the robustness of the protectiveness over that of conventional methods and systems provide. Spread Spectrum Before discussing the details of the inventive methods and systems, some basic background information on spread spectrum technology is given. For additional background on spread spectrum technology, the reader is referred to a text entitled "Spread Spectrum Communications Handbook" Revised Edition (1994), authored by Simon, Omura, Scholtz, and Levitt. An object that is desired to be protected can be represented as a vector This vector can represent pixels in a movie or any type of suitable digital content that is desirable to protect. The components of this vector are viewed over some large alphabet size, e.g. m } could be an 8-bit byte that can have a value from between -128 to +128. Spread spectrum chips x - (xj, ...xj are utilized that have values that are measured in the same units as the individual components of the protected object vector, but which have values that are small in comparison to the values that the individual vector components can have, e.g. the chips have values that are in {+1, -1 }. That is, values of x are selected to be small enough that when they are added to m they are difficult if not impossible to detect. A spread sequence can be utilized to embed data symbols that are in {+1, - 1}. These embedded data symbols are different from the individual values {+1, -1 } that a spread spectrum chip can have, and therefore the notation {+D, -D} is utilized to represent the data symbols {+1, -1} so as to avoid confusion. When a data symbol +D or -D is to be embedded, the vector m for the object is combined with the appropriate spread spectrum chips. To embed a +D we add the spread sequence as is, while to embed -D we flip the chips (i.e. take the Is complement of the sequence) of the spread sequence before adding it. So, to embed +D we compute a new vector b as follows: (Vj)[b j = rø/ ,], and to embed -D we compute (Vj)[b j = m } - X j ], When such an embedded object is to be detected, the vector b can be multiplied by the vector x and summed over all of the vector components. The summing of the resultant vector components will indicate whether a data symbol +D or -D was embedded, as will be understood by those skilled in the art. Embedding In the discussion that follows, four specific types of data structures are defined and used in the embedding/detection process, i.e. chips, blocks, T-symbols and fingeφrinting words. While the latter three data structures share the same names as those discussed above in connection with the BS-system, their definitions render them completely different and represent a significant departure from the BS- system, as will become apparent below. A "chip" is the smallest of the data structures and refers to a spread spectrum chip. Spread spectrum chips are designated as x = (x,, ...xj and have values in {+1, -1 }. As in the above discussion on spread spectrum technology, the data symbols that are embedded through the use of the spread spectrum chips are in {+D, -D}. A "block" is composed of d chips, where d represents a parameter that controls the error rate. The blocks are designated as Cι . ...C k , where an individual block i is defined as C, = (c \ ...c χι →), with c \ ...c λ& constituting the individual spread spectrum chips. The Is complement of block C, is denoted C',. A "T-symbol" comprises a plurality of blocks. In the described embodiment, a T-symbol is composed of 2c- 1 blocks, where c represents the number of colluders that are desired to be defended against. Last of the data structures is the fingeφrinting word which is composed of L T-symbols, where L represents a particular number that is selected to ensure that all of the users in the relevant user universe receive unique fingeφrinting words. Each user is first assigned a unique fmgeφrinting word. In the described embodiment, the fingeφrinting words incoφorate a spread sequence rather than the individual bits as in the BS-system. Specifically, in the described embodiment, each block B, of the T code in the BS-system is replaced with a suitable spread sequence. In this example, blocks that are supposed to be a l d in the BS-system are replaced with C„ and blocks that are supposed to be 0 d are replaced with the Is complement C',. An exemplary T code in accordance with this embodiment is shown in Fig. 3. Once the users have been assigned their fingeφrint words, the columns of the T code are permuted (at the chip level) as discussed above. An object can now be fingeφrinted with the fingeφrinting words that are defined by the permuted T code. Fig. 4 shows a flow diagram that describes steps in an embedding method in accordance with the described embodiment. Step 100 builds or defines a suitable T-code, an exemplary one of which is shown in Fig. 3. Step 102 permutes the columns of the T-code in a manner that is known only to the embedder and the decoder that will ultimately decode the fingeφrints. Permutation of the columns can take place by randomly shuffling the chips for all of the users (the same permutation for all the users). The permutation is the same for all of the users. An example of a suitable permutation was given above. Once the columns have been permuted, step 104 embeds a unique fingeφrinting word in each of a number of different objects that are desired to be protected. An example of an embedding process is given just below After the embedding process, the protected objects can be distributed. Assume that a vector m=(m 1 ,...m u ) is defined that represents an object or signal that is to be protected. A spread sequence x = (x h x is to be used as an embedded spread sequence. Here, (Vj)[ , e {+1, -1 }], and the signal is over a large alphabet whose size is not important for this discussion When the object is embedded with a data symbol +D (or -D), the resultant marked signal is designated as b = {bj b k J, where (Vj)[b / = m } +(-) Λ * ,] Assume also that an adversary attempts to jam the protected object signal by adding a noise element J, to each component, where J, is at the same energy level as the spread sequence, i.e J, e {+1, -1 }, but it is uncorrelated with the spread sequence After the jamming attack the signal can be represented as a=(aι aj, where (Vj)[ a } = m } +- x } + J,] Accordingly, the vector a represents the protected object as seen by the detector, (I e. after embedding and after jamming attacks) Chip Detection A first step in the detection process when an object is received is to unpermute the columns that were previously permuted Recall that after the flngeφrmtmg words are assigned but before an object is embedded, the columns (at the chip level) of the T-code are randomly permuted. Both the embedder and the detector know the random permutation. After the columns are unpermuted, the chips are detected in the received object. In this example, the received object is represented as ..aj and the chips are detected by comparing the received object with an original expected object m=(mj,...m u ) Each component, e.g. pixel, a, is compared with the expected unflngeφπnted component, e.g. pixel, m, The following table lists the comparisons and their outcomes: We use z to denote the detected chip i. This may differ from the original chip x„ due to attacks. With the individual chips having been identified, attention is now turned to detecting a user that likely constitutes a colluder. Clipping In the described embodiment, each block in a fingeφrinting word comprises d chips. These chips were previously detected as described above. With the chips having been detected, the blocks that comprise the fingeφrinting word are initially "clipped" in an effort to distinguish between so-called "seen" and "unseen" blocks. Recall that "seen" blocks are those blocks that can be ascertained by two or more users or entities because of their differences. Alternately, "unseen" blocks are those blocks that cannot be "seen" by users because they are identical. Hence, clipping the blocks as described below distinguishes the "seen" and "unseen" blocks. In the discussion that follows, the analysis deals with blocks, T-symbols, and Error correcting codes over an alphabet whose symbols are the T-symbols. In a first step, a function is defined from which a relative weight can be calculated. The function is defined as follows: Let * e {1, -1} and^ e {0, 1, -1 } . Define the function: f(y, x) = 1 ifx is not equal to y, andy is not equal to 0, 0 Otherwise. Let X - (xj, ....,X d ), where , e {I, -1} and Y = (y lt ....,ya), where y t <≡ {1, -1, 0}. The weight of Y relative to Xis w(Y, X) — which is the sum from i=l to d offfy,, xj. When the reference point, X, is known from the context, we omit it and write w(Y). It follows that when an original block i has a value C,' ("light blocks"), then its weight relative to C,' is zero. This holds true even after jamming. On the other hand, if the original block was C, ("heavy block"), then its weight relative to C,' after maximal jamming has a mean d/2, with deviation O((d) 1/2 ). This means that the working range is roughly d/2. With the above function having been defined, weight assignment and clipping steps can now take place. In the described embodiment, this takes place by receiving, as input, the detected chips z, arranged as blocks of d chips each (B l 5 B 2 , ...). The output of the weight assignment and clipping steps is the relative weight of each block, with blocks that are likely "unseen" being clipped to their working range value. This can be represented mathematically as follows: Input: Detected chips z = (z z 2 , ...,), arranged as blocks of d chips each Output: For each block B t output its relative weight, w, = w(B„ C, '), clipping blocks that are likely unseen to their working range value. Method: Define μ = d/2, and letδ be a parameter that is defined just below. For each block Bj { Ifw(Bi) >(l-δ)μ, then set w t = (l-δ)μ; Else, Wj = set w(Bj, '); } Parameter choice: For N users, assuming we want to defend against a collusion of size c, with error probability ε, then we choose: • Number of /"-symbols per a fingeφrint → woτά-L-2cln(2N/ε), • Block size=d=8c 2 ln(8cL/ε), • f=2ln(4c 2 ln(2N/ε)/ε), δ=f/V(d/2), μ=d/2. Fig. 5 shows a flow diagram that describes steps in a weight assignment and clipping method in accordance with the described embodiment, an example of which is given directly above. Step 200 gets the first block that is present in a fingeφrinting word. Step 202 calculates the weight of the first block. In the described embodiment, the weight of a given block is calculated as set forth above. Step 204 determines whether the block is likely an "unseen" block and if so, step 206 clips the block's weight to its working range value. If the block is likely "seen", then its weight is as calculated above (step 208). Step 210 determines whether there are any additional blocks. If so, the method branches back to step 202. Detection of a Subset that Produced an Altered Object x With the weights having been calculated for the various blocks of the altered fingeφrinting word, and with the working range having been defined as set forth above, attention is now turned to ascertaining a subset of the coalition that produced an altered object x. The method that is utilized to ascertain such a coalition is similar, in some respects, to the method of the BS-system discussed above. Primary differences lie in the use of the newly-defined weights for the blocks, as well as the use of the new working range. Algorithm 3 Given xe {0,1} , k=2c-l, find a subset of the coalition that produced x (within a T-code blocks are numbered 0,..., k-1, and "colors" are numbered 0,...k).. 1. If w 0 > 0 output "color 0 is guilty. " 2. Ifw k -i < d/2 - (fd) output "color k is guilty. " 3. For all s=2 to k-2 do: a. (here the reference point for weight computation b. Ifw s _ι < KJ2 - ((K/2)ln(2n/ε)) 1/2 , then output "color s is guilty. " The approach discussed above is particularly useful in the context of using a T-code having a reduced size. Recall that in the BS-system, a T-code having a reduced size was defined when the size of the T-code was considered in light of the number of colluders that were to be defended against. In that example, each new row or color of the T-code defined a T-symbol, and multiple T-symbols were used to build fingeφrinting words for all of the users. Each of the fingeφrinting words were different and unique. The permuted forms of the fingeφrinting words are used for embedding in an object to be protected. Each of the fingeφrinting words, when unpermuted and analyzed in accordance with the BS-system's second algorithm yielded a user that likely constituted a colluder. In the presently-described embodiment, a reduced-size T-code is also defined and includes a plurality of colors or rows. The number of colors or rows is a function of the number of colluders c that are desired to be defended against. That is, the number of colors or rows is defined, in this example, to be 2c. Each color or row defines a T-symbol. The T-symbols that are being defined here are, however, very different from the T-symbols that are defined in the BS-system. Specifically, the presently-described T-symbols that make up the T-code each contain spread sequences, rather than collections of bits. In the specifically- discussed example, a fingeφrinting word is composed of L T-symbols, where a T- symbol is composed of 2c-I blocks. A block, in turn, is composed of d chips, where a chip is a spread spectrum chip. Given this relationship, the size of a vector that represents the protected object is 2dcL. An exemplary, reduced-size T-code is shown in the table immediately below: Here, there are six colors that define the T-code. These individual colors are used as the alphabet to build fingeφrinting words for all of the users in the particular user universe. After the T-code is defined, each user or entity is assigned a fingeφrinting word having L of these T-symbols, where L is a number that is selected so that no two users or entities have the same fingeφrinting word. It also controls the error probability. With N users, and error probability ε we need L=2c *log(2N/ε). This fingeφrinting word serves to identify a user or entity later when an altered object is received. After the fingeφrinting words are assigned, the columns are randomly permuted in a manner that is known to both the embedder and the detector. After permutation of the columns, individual objects that are desired to be protected are embedded with a permuted fingeφrinting word that uniquely serves to identify an associated user or entity. Recall that the way that protected objects typically get altered is that different entities or users get together and compare their protected objects. The concept of "seen" and "unseen" blocks was discussed above and refers, respectively, to blocks that have differences that can be ascertained by different colluders, and blocks that do not have differences and that cannot be seen by colluders. In accordance with the marking assumption discussed above, it is assumed, logically, that colluders will manipulate or adjust only the blocks that they can see. Accordingly, "unseen" blocks will not be manipulated or adjusted by colluders. Thus, when an altered object is received, it has a fingeφrinting word that has been manipulated by two or more colluders. It may also be the case that random jamming may occur on the unseen bits. Detection of an Entity that Likely Constitutes a Colluder The manipulated or altered fingeφrinting word contains L T-symbols. In the described embodiment, each of the individual constituent T-symbols in the altered fingeφrinting word is analyzed and a set of one or more likely colors that might be the subject of a collusion is built. When all of the T-symbols in the altered fingeφrinting word have been analyzed in this manner, an m x L, (where m is the number of T-symbols or colors, i.e. m=2c) matrix is defined that contains an indication of which colors might be the subject of a collusion for each of the T- symbols in the altered fingeφrinting word. The fingeφrinting word for each of the users or entities is then compared with the matrix. Specifically, each T-symbol of the user's fingeφrinting word is compared with the set of likely colors for the corresponding T-symbol of the altered fingeφrinting word. If the user's T-symbol coincides with one of the colors in the set, then a counter is incremented. If there is no coincidence, then the counter is not incremented and the next T-symbol for the user is checked. This process continues until all of the T-symbols for all of the users have been checked. At this point in the process, all of the users will have a value associated with their counter. The most likely colluder is the user that has the highest counter value. Fig. 6 shows a flow diagram that describes steps in a detection method in accordance with the described embodiment. Step 300 receives a protected object that has a fingeφrinting word that has been altered by a user or entity. Step 302 unpermutes the columns (at the chip level) of the altered fingeφrinting word. Step 304 evaluates each of the T-symbols in the altered fingeφrinting word. In the described embodiment, each of the T-symbols is evaluated by applying Algorithm 3 (above) to the T-symbol. Application of Algorithm 3 produces a matrix (step 306) of likely colors that might be the subject of a collusion. Production of the described matrix takes place by selecting a T-symbol if the weight of a block satisfies a predefined relationship that is specified, in this example, by Algorithm 3. Step 308 then gets the first user's fingeφrinting word and step 310 evaluates the user's fingeφrinting word by comparing the first T-symbol in the user's fingeφrinting word with a set of one or more colors from the matrix. In the described embodiment, the matrix has L columns, each of which corresponds to a different T- symbol of a fmgeφrinting word. For any one column, there is a set of one or more colors that are produced by Algorithm 3. Each of the produced colors in a column are used for comparison with a corresponding T-symbol in a user's fingeφrinting word. This will become more apparent in the example that is given below. Step 312 determines whether the user's particular fingeφrinting word T-symbol coincides with one of the colors in the set of colors for the corresponding column in the matrix. If there is a coincidence, then step 314 increments the user's counter. If there is not a coincidence, then step 316 determines whether there are any additional T-symbols for the user. If there are, then step 318 gets the next T-symbol and loops back to step 310. If there are no additional T-symbols for the user, then step 320 determines whether there are any additional users. If there are additional users, then the method loops back to step 308 and gets the new user's fingeφrinting word. If there are no additional users, then step 322 selects the user with the highest counter value and incriminates them as a colluder. As an example to assist in understanding the above-described process, consider the following elementary example using the following T-code: Assume that each fingeφrinting word has a length L that, in this example, is five T-symbols long. Applying Algorithm 3 to each of the five T-symbols might yield the following matrix: Matrix Here, each of the last five columns corresponds to an individual T-symbol in the altered fingeφrinting word and contains a number of "X" marks. Each "X" indicates, for a particular T-symbol, a color that might be the subject of a collusion. Each T-symbol in the altered fingeφrinting word has a set of one or more colors associated with it. In this example, for the first T-symbol in the altered fingeφrinting word, colors 2 and 3 might be the subject of the collusion. For the second T-symbol in the fingeφrinting word, colors 1 and 5 might be the subject of the collusion, and so on. After this matrix is defined, each user's fingeφrinting word is compared, T-symbol by T-symbol, with the implicated colors for each of the corresponding T-symbols in the matrix. This comparison is summarized in the table that appears below: Here, there are two hypothetical users designated user 1 and user 2. Each user has a unique fingeφrinting word that is represented numerically by its constituent colors. For example, the fingeφrinting word for user 1 is as follows [(color 1) (colorl) (color 4) (color 6) (color 5)]. This can also be represented as (T \ Ti T 4 T 6 T 5 ). To determine which of the two users is incriminated in this example, each of the user's T-symbols or colors is checked against the corresponding incriminated colors for the corresponding T-symbol in the matrix above. If the user's T-symbol is found in the matrix, then the user's counter is incremented for that T-symbol. Thus, for user 1 , its first T-symbol is defined by color 1. Reference to the matrix indicates that, for the first T-symbol, color 1 is not incriminated. Accordingly, the user's counter is not incremented. For user l 's second T-symbol, (defined by color 1) however, color 1 is among the set of colors that are implicated for the second T-symbol of the altered fingeφrinting word. Accordingly the counter is incremented by one. Similar analysis continues for each of the remaining T-symbols, and for each of the remaining users. After all of the users have been checked against the matrix, the user with the highest counter value (right most counter column) is selected as a colluder. In this example, user 2 has the higher of the counter values because there are more coincidences between its fingeφrinting word and the incriminated colors of the matrix. The methods and systems described above can greatly increase the number of colluders that can be defended against over the number enabled by the Boneh- Shaw system. For example, assume that a movie has around 10 i0 pixels and that 10% of the pixels are significant enough so that data can be hidden in them. This means that 10 9 chips can be utilized in connection with this movie. Assuming that there are N=10 6 users and an error rate of 10 "3 is desired, then the number of colludes that can be defended against is c=78. Note that with the above parameters we still may accuse about 1000 entities, where there are only 78 colluders. Hence accusations should take place only with those repeatedly incriminated. However, the number 78 compares favorably with c=4 for Boneh-Shaw. Being able to defend against more colluders increases the breadth of protection and desirably makes it much more difficult for fmgeφrinting words to be altered. The required value of parameter d is d=2c * log(8cL/ε). In compliance with the statute, the invention has been described in language more or less specific as to structural and methodical features. It is to be understood, however, that the invention is not limited to the specific features described, since the means herein disclosed comprise preferred forms of putting the invention into effect. The invention is, therefore, claimed in any of its forms or modifications within the proper scope of the appended claims appropriately inteφreted in accordance with the doctrine of equivalents.

Claims: CLAIMS 1. A method of forming a T code comprising: defining a plurality of fingeφrinting words, each fingeφrinting word being unique and containing at least one spread sequence; and assigning individual fingeφrinting words to individual respective entities, the fingeφrinting words serving to identify an entity to which it is assigned. 2. The method of claim 1, wherein each fingeφrinting word contains a plurality of spread sequences. 3. The method of claim 1, wherein the defining of the plurality of the fingeφrinting words comprises selecting a length for the fingeφrinting words, the length being a function of a number of colluders that are desired to be defended against and an error rate ε. 4. The method of claim 1 , wherein each fingeφrinting word contains a plurality of T-symbols, each T-symbol containing 2c-l spread sequences, where c is the number of colluders that are desired to be defended against. 5. A method of detecting a fingeφrinting word comprising: receiving a protected object that has embedded therein a fingeφrinting word that contains a plurality of spread spectrum chips that are arranged in individual blocks that define individual spread sequences; and processing the protected object sufficient to identify an entity that is associated with the fingeφrinting word. 6. The method of claim 5, wherein said processing comprises: calculating a weight for each block; and restricting the weights of certain blocks to a predetermined value. 7. The method of claim 6, wherein said calculating comprises determining the weight of a block relative to the Is complement of an original spread sequence block value. 8. The method of claim 6, wherein said calculating comprises determining the weight of a block relative to the Is complement of an original spread sequence block value in accordance with the following equation: Let * € {1, -1 } and e {0, 1, -1 }; f(y, x) = 1 ifx is not equal to y, andy is not equal to 0, 0 Otherwise. Let X = (xι, ....,X d ), where x, e {I, -1} and Y = (yι, ....,y d ), where y, e {I, -I, 0}. The weight of Y relative to X is w(Y, X) — which is the sum from i=-l to d off(y„ xj, where "d" is the number of chips in each block. 9. The method of claim 6, wherein said restricting comprises doing so if a block is likely unseen. 10. The method of claim 6, wherein the predetermined value is equal to(I-δ)μ, where: For N users, and to defend against a collusion of size c, with error probability ε, select the following: • Number of /"-symbols per a fingeφrint • woτd=L=2cln(2N/ε), • Block size (measured in c ips)=d=8c 2 ln(8cL/ε), • f=2ln(4c ln(2N/ε)/ε), • δ=f/V(d/2), • μ=d/2. 11. The method of claim 6, wherein the embedded fingeφrinting word has a plurality of T-symbols each of which comprise a plurality of blocks, and wherein each of a plurality of entities are assigned unique fingeφrinting words having a plurality of T-symbols, said processing comprising: for each T-symbol of the embedded fingeφrinting word, determining a set of one or more likely colors that might be the subject of a collusion; for each of the entities' fingeφrinting words, evaluating each T-symbol to ascertain whether it coincides with a color in the set for the corresponding T-symbol of the embedded fingeφrinting word; and selecting an entity that has the largest number of colors. 12. The method of claim 1 1, wherein said determining comprises: evaluating the weight of each block; and selecting a T-symbol if the weight of the blocks satisfies a predefined relationship. 13. A computer-readable medium having computer-executable instructions thereon which, when executed by a computer perform the method of claim 11. 14. A method of protecting an object comprising: defining a plurality of fingeφrinting words, each fmgeφrinting word being unique and containing at least one spread sequence; assigning individual fingeφrinting words to individual respective entities, the fingeφrinting words serving to identify an entity to which it is assigned; embedding a plurality of objects with a respective individual fingeφrinting word to provide individual protected objects; distributing the protected objects to the individual entities; receiving a protected object; and processing the protected object sufficient to identify an entity that is associated with a fingeφrinting word that is contained by the received protected object. 15. The method of claim 14, wherein the fingeφrinting words each comprise a plurality of spread sequences. 16. The method of claim 15, wherein the spread sequences for each fingeφrinting word are arranged in individual blocks, said processing comprising: calculating a weight for each block; and restricting the weights of certain blocks to a predetermined value. 17. The method of claim 16, wherein said calculating comprises determining the weight of a block relative to the Is complement of an original spread sequence block value. 18. The method of claim 16, wherein said calculating comprises determining the weight of a block relative to the Is complement of an original spread sequence block value in accordance with the following equation: Let e { 1, -1 } and y e {0, 1, -1}; f(y, x) = 1 ifx is not equal to y, andy is not equal to 0, 0 Otherwise. Let X = (x ! , ....,x d ), where x, e {1, -1} and Y = (yι, ....,y,j), where y, e {1, -I, 0}. The weight of Y relative to X is w(Y, X) — which is the sum from i=l to d off(y„ xj, where "d" is the number of chips in each block. 19. The method of claim 16, wherein said restricting comprises doing so if a block is likely unseen. 20. The method of claim 16, wherein the predetermined value is equal to (l-δ)μ, where: For N users, and to defend against a collusion of size c, with error probability ε, select the following: • Number of / " -symbols per a fingeφrint word-=/ =2cln(2N/ε), • Block size (measured in c ips)=d=8c 2 ln(8cL/ε), • f=2ln(4c 2 ln(2N/ε)/ε), • δ=f/V(d/2), • μ-d/2. 21. The method of claim 16, wherein the embedded fingeφrinting word has a plurality of T-symbols each of which comprise a plurality of blocks, and wherein each of a plurality of entities are assigned unique fingeφrinting words having a plurality of T-symbols, said processing comprising: for each T-symbol of the embedded fingeφrinting word, determining a set of one or more likely colors that might be the subject of a collusion; for each of the entities' fingeφrinting words, evaluating each T-symbol to ascertain whether it coincides with a color in the set for the corresponding T-symbol of the embedded fingeφrinting word; and selecting an entity that has the largest number of colors. 22. One or more programmable computers programmed with instructions which, when executed by the one or more programmable computers, implement a method of protecting an object comprising: defining a plurality of fingeφrinting words, each fingeφrinting word being unique and containing at least one spread sequence; assigning individual fingeφrinting words to individual respective entities, the fingeφrinting words serving to identify an entity to which it is assigned; embedding a plurality of objects with a respective individual fingeφrinting word to provide individual protected objects; distributing the protected objects to the individual entities; receiving a protected object; and processing the protected object sufficient to identify an entity that is associated with a fingeφrinting word that is contained by the received protected object. 23. The one or more programmable computers of claim 22, wherein the fingeφrinting words each comprise a plurality of spread sequences which are arranged in individual blocks, said processing comprising: calculating a weight for each block; and restricting the weights of certain blocks to a predetermined value. 24. The one or more programmable computers of claim 23, wherein said calculating comprises determining the weight of a block relative to the Is complement of an original block value. 25. The one or more programmable computers of claim 23, wherein said calculating comprises determining the weight of a block relative to the Is complement of an original block value in accordance with the following equation: Let * e {1, -1 } and v e {0, 1, -1 } ; f(y, x) = 1 ifx is not equal toy, andy is not equal to 0, 0 Otherwise. Let X = (xj, ....^^, where x, e {1, -1} and Y = (yι, ....,y d ), where , e {I, -I, 0}. The weight of Y relative to X is w(Y, X) — which is the sum from i=l to d off(y„ xj, where "d" is the number of chips in each block. 26. A T-code data structure configured for use in an embedding process for protecting digital data, the T-code data structure comprising: a memory; and a plurality of spread sequences in the memory, the spread sequences being arranged in blocks that are combinable to define fingeφrinting words that are assignable to individual entities to which protected objects are to be distributed. 27. The T-code data structure of claim 26, wherein the blocks are combinable to define individual T-symbols, each T-symbol comprising 2c-l blocks, where c is the number of colluders that are desired to be defended against. 28. A method of protecting objects containing digital data comprising: defining a plurality of unique fingeφrinting words, each fingeφrinting word comprising at least one spread sequence; associating each fingeφrinting word with an individual entity; embedding a plurality of objects containing digital data with an individual fingeφrinting word to provide protected objects; and distributing the protected objects to the individual entities. 29. The method of claim 28, wherein said defining comprises defining each fingeφrinting word to contain a plurality of T-symbols, each T-symbol containing at least one spread sequence. 30. The method of claim 29, wherein each T-symbol contains a plurality of spread sequences. 31. The method of claim 30, wherein each fingeφrinting word contains the same number of T-symbols. 32. The method of claim 30, wherein each T-symbol contains 2c-l spread sequences, where c is the number of colluders that are desired to be defended against. 33. One or more computer-readable media having computer-executable instructions thereon which, when executed by a computer, implement the method of claim 28. 34. A protected object comprising: digital data; and a fingeφrinting word embedded in the digital data, the fingeφrinting word containing at least one spread sequence, the fingeφrinting word being associated with an entity to which the object is to be, or has been distributed. 35. The protected object of claim 34, wherein the fingeφrinting word contains a plurality of T-symbols, each T-symbol containing at least one spread sequence. 36. The protected object of claim 35, wherein each T-symbol contains a plurality of spread sequences. 37. The protected object of claim 36, wherein each fingeφrinting word contains the same number of T-symbols. 38. The protected object of claim 36, wherein each T-symbol contains 2c-l spread sequences, where c is the number of colluders that are desired to be defended against.

Inventors: YACOBI YACOV, YACOBI, YACOV
Applicants: MICROSOFT CORP, MICROSOFT CORPORATION
Application year: 2000
Main classification: H04N1
IPC codes: G06T1, G09C5, H04N1, H04N5, H04N7