# Patent

## Title
Collusion-resistant watermarking and fingerprinting

## Abstract

An implementation of a technology is described herein that facilitates rights enforcement of digital goods using watermarks. More particularly, it is a fingerprinting technology for protecting digital goods by detecting collusion as a malicious attack and identifying the participating colluders. If a digital pirate breaks one client and enables this client to avoid watermark detection, all content (both marked/protected an unmarked/free) can be played as unmarked only on that particular client. However, to enable other clients to play content as unmarked, the digital pirate needs to collude the extracted detection keys from many clients in order to create content that can evade watermark detection on all clients. The described implementation significantly improves collusion resistance through a fingerprinting mechanism that can identify the members of a malicious coalition even when their numbers are several orders of magnitude greater than what conventional collusion-protection schemes can accomplish. However, in this scenario each member of the malicious coalition leaves a fingerprint in every digital good from which the estimated watermark is subtracted. Thus, like a burglar without gloves, the digital pirate leaves her fingerprints only when she commits a crime. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

## Background
RELATED APPLICATIONS
This application is a continuation of and claims priority to U.S. patent application Ser. No. 09/841,159, filed Apr. 23, 2001, the disclosure of which is incorporated by reference herein.
TECHNICAL FIELD
This invention generally relates to a technology facilitating rights enforcement of digital goods using watermarks. This invention further generally relates to a fingerprinting technology for protecting digital goods by detecting collusion as a malicious attack and identifying the participating colluders.
BACKGROUND
“Digital goods” is a generic label for electronically stored or transmitted content. Examples of digital goods include images, audio clips, video, multimedia, software, and data. Digital goods may also be called a “digital signal,” “content signal,” “digital bitstream,” “media signal,” “digital object,” “object,” and the like.
Digital goods are often distributed to consumers over private and public networks—such as Intranets and the Internet. In addition, these goods are distributed to consumers via fixed computer readable media, such as a compact disc (CD-ROM), digital versatile disc (DVD), soft magnetic diskette, or hard magnetic disk (e.g., a preloaded hard drive).
Unfortunately, it is relatively easy for a person to pirate the pristine digital content of a digital good at the expense and harm of the content owners-which includes the content author, publisher, developer, distributor, etc. The content-based industries (e.g., entertainment, music, film, etc.) that produce and distribute content are plagued by lost revenues due to digital piracy.
Modern digital pirates effectively rob content owners of their lawful compensation. Unless technology provides a mechanism to protect the rights of content owners, the creative community and culture will be impoverished.
Watermarking
Watermarking is one of the most promising techniques for protecting the content owner's rights of a digital good. Generally, watermarking is a process of altering the digital good such that its perceptual characteristics are preserved. More specifically, a “watermark” is a pattern of bits inserted into a digital good that may be used to identify the content owners and/or the protected rights.
Generally, watermarks are designed to be completely invisible or, more precisely, to be imperceptible to humans and statistical analysis tools.
A watermark embedder (i.e., encoder) is used to embed a watermark into a digital good. A watermark detector is used to extract the watermark from the watermarked digital good. Watermark detection is performed in real-time even on small devices.
Those of ordinary skill in the art are familiar with conventional techniques and technology associated with watermarks, watermark embedding, and watermark detecting.
Watermarks have limitations. They may be used to designate a digital good as protected and, perhaps, to indicate that a license is necessary to legally use the digital good. However, since watermarks are identical in all copies of a digital good, a digital pirate can reproduce the original content of a marked copy by breaking the watermark at a single watermark detector, for example by extracting the detection key and using it to find the watermark and remove it or jam it.
Therefore, others may use the original content without the watermark; thus, without the content owner receiving the appropriate compensation. This is generally called “break once run everywhere” or BORE.
Furthermore, to individualize a particular copy of a digital good (or a particular system that will use that good) with watermarks, we need to augment it with a technology called “fingerprinting”.
Conventional Fingerprinting
Conventional fingerprinting (i.e., “classic fingerprinting”) refers to techniques that involve uniquely marking each copy of a particular digital good, and associating each uniquely marked copy with a “classic fingerprint.” That classic fingerprint is associated with or assigned to a particular entity (e.g., person, business, media player, or smart card) to which the copy is distributed.
If unauthorized copies of the uniquely marked copy are made, the fingerprint can be traced back to the original entity to which the copy was initially distributed. In other words, classic fingerprinting technology may be used to trace piracy to its origin.
As an example, consider a printed map. When a mapmaker 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 mapmaker might protect his maps is to introduce a different trivial error (e.g., a non-existent street) into each of the copies of the map that are distributed. Those different trivial errors are fingerprints. Each fingerprint is then associated with an individual to whom the map is distributed. By associating each different fingerprint 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 fingerprint that the map contains.
Using embedding methods similar (but not identical) to watermarking, the fingerprint is embedded into a digital good. If we want to achieve both prevention and “after the fact” tracing, a combination of the fingerprint and watermark are embedded into a digital good.
Very powerful machines that can devote significant resources to the process of detecting a fingerprint typically perform fingerprint detection. If necessary, a fingerprint detector can have access to the original unmarked digital good, using it to improve the likelihood of success in detecting the fingerprints—even from content modified by malicious attacks.
Classic Fingerprint=Unique Entity Identifier (UEid)
Although the term “fingerprint” is commonly understood by those of ordinary skill in the art, the terms “classic fingerprint” or “unique entity identifier” (UEid) may be used hereinafter to refer to this conventional technology (and its unique marks). This is done to avoid confusion with the use, herein, of “fingerprinting” in the other sections of this document (i.e., sections other than the “Background” section). In those other sections, the term “fingerprinting” may refer to a similar, but distinctly different technology.
Collusion
One problem with fingerprinting can arise when two or more entities collude. Their purpose for doing this may be to discover, modify, or remove their fingerprints and/or the embedded watermark. Those that attempt to collude are called “colluders.” A group of colluders who attempt to collude are part of a “collusion clique.”
Returning to the map example for illustration, collusion occurs when two or more individuals get together and compare their maps. They can, given enough time, ascertain their unique fingerprints by simply looking for the differences between their maps. If they can ascertain their fingerprint, they can alter it and therefore possibly avoid detection.
With the advent of the Internet and electronic distribution, fingerprinting digital goods for purposes 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 digital goods.
Conventional Fingerprinting/Watermarking Systems with Collusion Resistance
Existing conventional fingerprinting/watermarking systems have some capability for collusion detection. However, the protection offered by these systems is limited.
For example, Ergun et al. have proved that no conventional fingerprinting system can have a better asymptotical collusion-resistance than: O((N/log(NV)1/2)—where O indicates “order of magnitude” and N is the size of the marked digital good. For example, the best fingerprinting system today, “the Improved Boneh Shaw System” achieves for a typical two hour movie a collusion resistance of only 40 users. This system, just as the original “Boneh Shaw Fingeprinting System” has collusion resistance in the order of O(N1/4).
The derivation of the upper bound on fingerprinting mechanisms by Ergun et al. considers embedding distinct fingerprints per copy of a digital good and models collusion attacks as averaging of copies with additive noise. Aspects of their work are described in an article entitled “A Note on the Limits of Collusion-Resistant Watermarks,” authored by Ergun, Kilian, and Kumar, appearing in Proc. Eurocrypt, 1999.
For example, another conventional fingerprinting system (the “Boneh-Shaw, or B-S system”) defines a lower bound on collusion-resistant fingerprinting: O(N1/4). Assuming that the marked digital good is a typical music clip, the lower bound of the number of colluders necessary to thwart this conventional system is in the neighborhood of 4. The B-S system is a fingerprinting system that attempts to overcome the problem of collusion when fingerprinting digital goods. Aspects of the B-S system are described in an article entitled “Collusion-Secure Fingerprinting for Digital Data” authored by Boneh and Shaw, appearing in IEEE Transactions on Information Theory, Vol. 44, No. 5, September 1998.
Those of ordinary skill in the art are familiar with conventional techniques and technology associated with classic fingerprinting, classic fingerprinting embedding, and classic fingerprinting detecting.
Although the conventional fingerprinting systems provide some protection against collusion, that protection is only effective when the number of colluders is relatively small. Consequently, the confidence level that a marked digital good is free from the effects of collusion is not high.
Accordingly, there is a need for a new watermarking/fingerprinting technology that is more collusion resistant. A new technology is needed that increases the protection that is provided by fingerprinting (and watermarking) to detect colluders even when their numbers are large. If that numbers is several orders of magnitude greater than the conventional, then the confidence level—that a marked digital good is free from the effects of collusion—would be very high indeed.
Moreover, there needs to be a more effective technique to identify that a digital good has had its mark removed and who removed that mark. That way, piracy crimes can be more effectively investigated.
SUMMARY
Described herein is a technology facilitating rights enforcement of digital goods using watermarks. Also described herein is a fingerprinting technology for protecting digital goods by detecting collusion as a malicious attack and identifying the participating colluders. With this technology, digital goods are protected by a mechanism that detects collusion and colluders. In other words, with this technology, digital goods are protected by identifying that a digital good has had its mark removed and who removed that mark. That way, piracy crimes can be more effectively investigated.
At least one implementation of the technology, described herein, is characterized by limited BORE-resistance at the protocol level. (BORE is “break once, run everywhere.”) If a digital pirate breaks one client and enables this client to avoid watermark detection, all content (both marked/protected and unmarked/free) can be played as unmarked only on that particular client. However, to enable other clients to play content as unmarked, the digital pirate needs to collude the extracted detection keys from many clients in order to create content that can evade watermark detection on all clients.
At least one implementation, described herein, significantly improves collusion resistance through a fingerprinting mechanism that can identify the members of a malicious coalition even when their numbers are several orders of magnitude greater than what conventional collusion-protection schemes can accomplish. Consequently, the confidence level—that a marked digital good is free from the effects of collusion—may be very high indeed. Each watermark detection key is distinct for all clients and thus contains a fingerprint associated with its corresponding client. The adversary coalition colludes their keys to create the optimal estimate of the embedding watermark. However, in this scenario each member of the malicious coalition leaves a fingerprint in every digital good from which the estimated watermark is subtracted.
Since, with this technology, a watermark detector uses its assigned “fingerprint” (as part of the secret detection key) to detect a watermark embedded in a digital good, a digital pirate (or group of such pirates) leaves her “fingerprint” when she removes (or modifies) the embedded watermark. Thus, like a burglar without gloves, the digital pirate leaves her fingerprints when she commits a crime.
Unlike conventional fingerprinting technologies, the technology described herein does not mark each copy of the content individually. The pirate marks the content when committing the crime.
This summary itself is not intended to limit the scope of this patent. Moreover, the title of this patent is not intended to limit the scope of this patent. For a better understanding of the present invention, please see the following detailed description and appending claims, taken in conjunction with the accompanying drawings. The scope of the present invention is pointed out in the appending claims.



BRIEF DESCRIPTION OF THE DRAWINGS
The same numbers are used throughout the drawings to reference like elements and features.
FIG. 1 is a schematic block diagram showing an architecture in accordance with an implementation of the invention herein and representation of an attack on a digital good.
FIG. 2 is a flow diagram showing an illustrative methodological implementation (e.g., an embedding implementation) of the invention herein.
FIG. 3 is a flow diagram showing an illustrative methodological implementation (e.g., a detection implementation) of the invention herein.
FIG. 4 is a flow diagram showing an illustrative methodological implementation (e.g., a fingerprint detection implementation) of the invention herein.
FIG. 5 is an example of a computing operating environment capable of implementing an implementation (wholly or partially) of the invention herein.



DETAILED DESCRIPTION
In the following description, for purposes of explanation, specific numbers, materials and configurations are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced without the specific exemplary details. In other instances, well-known features are omitted or simplified to clarify the description of the exemplary implementations of present invention, thereby better explain the present invention. Furthermore, for ease of understanding, certain method steps are delineated as separate steps; however, these separately delineated steps should not be construed as necessarily order dependent in their performance.
The following description sets forth one or more exemplary implementations of Collusion-Resistant Watermarking and Fingerprinting that incorporate elements recited in the appended claims. These implementations are described with specificity in order to meet statutory written description, ennoblement, and best-mode requirements. However, the description itself is not intended to limit the scope of this patent.
The inventors intend these exemplary implementations to be examples. The inventors do not intend these exemplary implementations to limit the scope of the present invention. Rather, the inventors have contemplated that the present invention might also be embodied and implemented in other ways, in conjunction with other present or future technologies.
An example of an embodiment of Collusion-Resistant Watermarking and Fingerprinting may be referred to as an “exemplary collusion resister.”
Incorporation by Reference
The following co-pending patent applications are incorporated by reference herein:

    
    
        U.S. patent application Ser. No. 09/437,713, entitled “Methods and Systems for Fingerprinting Digital Data” filed on Oct. 28, 1999, and assigned to the Microsoft Corporation;
        U.S. patent application Ser. No. 09/316,899, entitled “Audio Watermarking with Dual Watermarks” filed on May 22, 1999, assigned to the Microsoft Corporation; and
        U.S. patent application Ser. No. 09/614,660, entitled “Improved Stealthy Audio Watermarking” filed on Jul. 12, 2000, assigned to the Microsoft Corporation.

Introduction

    
    


The one or more exemplary implementations, described herein, of the present invention may be implemented (in whole or in part) by a collusion-resistant architecture 100 and/or by a computing environment like that shown in FIG. 5.
One problem with fingerprinting can arise when two or more entities collude. Their purpose for doing this may be to discover, modify, or remove their fingerprints and/or the embedded watermark. Those that attempt to collude are called “colluders.” A group of colluders is called a “collusion clique.”
The exemplary collusion resister is generally BORE-resistant at the protocol level. (BORE is “break once, run everywhere.”) By breaking a single client (i.e., detection entity), the digital pirate can play content as non-marked on that broken client, but needs to collude with others (other clients or other pirates who have broken into clients) to finally create content that can evade watermark detection on all clients. The exemplary collusion resister significantly improves collusion resistance through a fingerprinting mechanism that can identify the members of a collusion clique if its cardinality (i.e., number of members) is smaller than a relatively large lower bound. That relatively large lower bound is several orders of magnitude greater than the best that can be achieved by conventional systems.
Although the term “fingerprint” is commonly understood by those of ordinary skill in the art, the terms “classic fingerprint” or “unique entity identifier” (UEid) may be used hereinafter to refer to this conventional technology (and its unique marks). This is done to avoid confusion with the use, herein, of “fingerprinting” in the descriptions of one or more implementations of the present invention. In those descriptions, the term “fingerprinting” may refer to a similar, but distinctly different technology. More specifically, the fingerprint of those descriptions operates in a manner that is more analogous to the metaphor of forensic investigation. It is more like gathering evidence for a crime scene investigation. More specifically, it is more like gathering fingerprints to help identify and catch a criminal.
Overview
One or more implementation of the exemplary collusion resister, described herein, limits the scope of possible collusion attacks, when compared to classic fingerprinting systems. Under optimal attacks, the size of the collusion necessary to remove the marks without leaving a detectable fingerprint is asymptotically K ̃O(N) without segmentation, and κS ̃O(N log(N)) with segmentation (where N denotes object size, K is collusion resistance per segment, and κS is the cumulative collusion resistance across segments).
Classic fingerprinting has a lower bound on collusion resistance that is roughly O(N1/4). Thus, by using the exemplary collusion resister, one can achieve content protection with collusion resistance of up to 100,000 users for a two-hour high-definition video, for example.
Generally, the exemplary collusion resister is part of a combined watermarking/fingerprinting (“WM/FP”) technology for dramatically improved collusion resistance. The improvement in collusion resistance is by several orders of magnitude over the conventional. With the conventional approaches, it may require, for example, a handful to a few dozen colluders to effectively remove the watermark without detection. With the exemplary collusion resister, it may require, for example, a hundred thousand (100,000) colluders to effectively remove the watermark without detection.
Unlike conventional fingerprinting, the fingerprints are not embedded in the digital good in at least one implementation of the exemplary collusion resister. Rather, they are assigned to (or associated with) a “client.” A client may be called a “detection entity” because it is an entity that may detect a watermark. Examples of a detection entity include a person, company, or other business entity. Alternatively, a “detection entity” may be a specific copy of an application (e.g., a media player), a hardware device, or some combination. More specifically, the fingerprints are assigned to a watermark detector (WMD). In that implementation, the watermark detector uses its assigned secret detection key—that key includes the fingerprint used to detect the watermark. The detection key is different from the embedding key. By gaining the knowledge of a small number of detection keys (through collusion or other means), a pirate cannot remove the marks from the protected digital good.
Herein, it is assumed that the watermarking is robust against signal-processing attacks on the protected digital good. The exemplary collusion resister focuses on resisting collusion attacks against the detection keys. With the exemplary collusion resister, a pirate who has access to one detection key may be able to fool the watermark detector that corresponds to that one detection key, but cannot fool other detectors. In addition, in that process, the pirate necessarily inserts a fingerprint in the modified digital good.
Since the detector uses its fingerprint (as part of the detection key) to detect a watermark, an attacker (or group of such attackers) leaves her fingerprint when she removes (or modifies) the watermark. Thus, like a burglar without gloves, an attacker leaves fingerprints when she commits a crime. This also is unlike conventional fingerprinting.
With at least one implementation of the exemplary collusion resister, without segmentation the minimum collusion size (K) grows linearly with the size (N) of the marked digital good.
With at least one implementation of the exemplary collusion resister, a marked digital good is partitioned into segments. Each segment is marked with a different watermark. There are S segments. The watermark of each segment is associated with a single fingerprint (or alternatively a small plurality of fingerprints). Consequently, the watermark of each segment may only be detected by a single detector (or alternatively a small plurality of detectors) using its detection key. This segmentation is unlike conventional fingerprinting.
Only colluders with detection keys that belong to the same segment can participate in a collusion clique on that segment. Colluders with keys belonging to differing segments will be of no benefit to each other (unlike in conventional FP). With segmentation, the minimum collusion size K grows as O(N log N), where N is object size.
Therefore, with or without segmentation, the exemplary collusion resister significantly improves on the best conventional asymptotic resistance to fingerprint collusion attacks of O(N1/4) of the B-S system (see the Background section).
In at least one implementation of the exemplary collusion resister, the detection keys used to detect the watermarks are potentially, relatively large. Although the key size is relatively small with respect to the entire bulk of the digital good (which can reach up to 1–2 terabytes for raw uncompressed high definition video), the size of the detection key can still be inconveniently large especially for small embedded devices (approximately in the range of 1 KB). Therefore, the fingerprint is compressed in a sense. More specifically, smaller detection keys are generated during the detection key creation that approximately but correctly correlates with a specific embedded watermark.
Traditional Spread-Spectrum Watermarking
A media signal (i.e., a digital good) to be watermarked x∈RN can be modeled as a random vector, where each element of x is a normal random variable with standard deviation A (i.e., xj ̃η(0, A)). For example, for audio signals A ranges typically within A∈{5,15}, after necessary media preprocessing steps. A “watermark key” w is defined as a spread-spectrum sequence vector w∈(±1}N, where each element wj is usually called a “chip.” The marked signal y is created by vector addition y=x+w.
Let w·v denote the normalized inner product of vectors w and v (i.e. w·v≡N−1Σwjvj, with w2≡w·w. For example, for w as defined above we have w2=1. We assume that the client (e.g., a media player) contains a watermark (WM) detector that receives a modified version ŷof the watermarked signal y. The WM detector performs a correlation (or matched filter) test dW=ŷ·w, and decides that the watermark is present if dW>δW, where δW is the detection threshold that controls the tradeoff between the probabilities of false positive and false negative decisions.
Under no malicious attacks or other signal modifications (i.e. ŷ=y), if the signal y has been marked, then dW=1+gW, where the “detection noise” gW is a normal zero-mean random variable with variance σ2gW=A2/N. Otherwise, the correlation test yields dW=0+gW. For equal probabilities of false positives and false negatives, we should set δW=1⁄2. For robustness against attacks, the signal domain x are appropriately chosen, and some small modifications on the watermark pattern may be necessary.
For the purpose of describing implementations of the present invention, it is assumed that such precautions have been taken care of in the design of the WM detector, so such attacks are disregarded. For an overview of techniques that use this paradigm for hiding data in audio, images, and video, see “Information Hiding Techniques for Steganography and Digital Watermarking,” Katzenbeisser and Petitcolas, Eds., Boston, Mass.: Artech House 2000.
Traditional spread-spectrum watermarking systems detect watermarks using a key w that is in essence a secret watermarking key (SWK). Typically, in many rights enforcement schemes, the watermark detection is done at the client (e.g., a media player), which must then have access to the SWK. An adversary (e.g., a digital pirate) can thus recreate the original content if they succeed in obtaining the SWK. For example, if a pirate breaking into a detector, she may recover/discover the SWK. Armed with this information, the digital pirate may recreate the original digital good which is not protected and thus, can be used and distributed as “free unprotected” content.
Exemplary Collusion-Resistant Architecture
In the exemplary collusion resister, the watermark detection key (WDK) is different from the secret watermarking key (SWK) of traditional watermarking. Consequently, breaking into a single detector does not provide the pirate enough information to remove the watermark w.
FIG. 1 illustrates the collusion-resistant architecture 100. The architecture includes a key generation entity 110, marker 120, fingerprint detector 130, and watermark detector 140. Although FIG. 1 also shows an attacker 150, the attacker, of course, is not part of the architecture. However, their actions are anticipated by this architecture.
FIG. 1 illustrates the key generation entity 110. It includes a pseudorandom key generator (PRKG) 112 for pseudorandomly generating the SWK w. This SWK w is combined (at 122) with the media signal x (i.e., the digital good) by the marker to produce the marked signal y (i.e., marked digital good). This marked signal y is publicly distributed by the content owners. To this extent, the media signal x (in FIG. 1, x is input into marker 120) may be watermarked in much the same manner as in traditional spread-spectrum watermarking.
However, in addition to generating the watermark, the key generation entity 100 generates an individualized “watermark carrier” (ci) for each detector i (alternatively, for each client i). More specifically, a pseudorandom key generator (PRKG) 114 generates ci. That watermark carrier ci is combined (at 116) with the SWK w to produce an individualized watermark detection key (WDK hi).
Thus, for each watermark detector i (for example, the watermark detector 140 of FIG. 1), an individualized watermark detection key (WDK hi) is created. That individualized key (hi) is created from the SWK w. An example of a manner in which hi is created from the SWK w is as follows:

    
    
        Let C={cij} denote an m×N matrix, where cij∈R, cij ̃η(0, B)). In other words, each entry is a zero-mean normal random variable with standard deviation σc=B.
        Each row i contains a “watermark carrier,” denoted by ci. The ith WDK is defined as hi=w+ci.
    
    


The purpose of the watermark carrier (ci) is to hide the SWK w in hi so that knowledge of hi does not imply knowledge of w, as long as B is large enough. In other words, no detector contains the SWK w, but rather a modified version of it. No conventional technique does this.
The key generation entity 110 produces at least two “keys,” and they include SWK w and hi.
Because the watermark detectors use correlation-based watermark detection, they can still detect the watermark in a marked content y, as long as the number of chips N is large enough to attenuate the noise introduced by the watermark carriers ci.
The watermark detection process (by, for example, that watermark detector 140 of FIG. 1) is carried out by correlating the received signal ŷ (which may be modified) with hi. This hi (being used by this detector) is the individualized WDK assigned to the detector doing the detection. More generally, the individualized WDK is assigned to a “client,” which is a person, company, or other business entity. Alternatively, a “client” may be a specific copy of an application (e.g., a media player).
The watermark detector generates a detector output dW=ŷ·hi. This is labeled “mark present/absent decision” in FIG. 1. Similar to traditional spread-spectrum watermarking, if ŷ was marked, then dW=1+gW; otherwise dW=0+gW. The difference is that now gW is a function of both the media x and the watermark carrier ci. If there are no attacks (i.e., ŷ=y) then:

dW=y·hi=(x+w)·(w+ci)=1+gW, where

gW=x·(w+ci)+w·ci

from which is computed the detection noise variance as σ2gW=(A2+B2+A2B2)/N.

FIG. 1 shows the watermark detector (WMD) 140. As described above, the WMD 140 correlates (with a correlation detector 142) a potentially marked signal ŷ with individualized WDK hi (i.e., dW=ŷ·hi). Again, that individualized WDK hi is specifically associated with the WMD 140. More particularly, it may be associated with a client.
The WMD 140 decides that the content of the potentially modified digital good is marked if dW>δW. The probability of false positives (i.e., identifying an unmarked content as marked) is denoted as ε1, which should be very small. (e.g., ε1=10−9).
FIG. 1 shows the attacker 150. Although this illustrates only one attacker, it represents one or more attackers with many individualized WDKs. In other words, this attacker engages in a collusion attack. Regardless, the attacker—whether alone or working with others—is considered a colluder, herein, because it is a collusion attack using multiple WDKs.
The attacker 150 breaks into K clients. This may be accomplished by physically breaking into the client's machines (e.g., code debugging, reverse engineering, etc.) or by using a sensitivity attack. Once in, the attacker 150 extracts their individualized WDKs {hi, i=1, . . . K}. The attacker creates an attack vector v as an optimal estimate of the SWK w given the collusion set {hi, i=1, . . . K}. This estimate is the product of an optimal mark estimator 152 of the attacker 150. Furthermore, the attacker creates (with a signal combiner 154) an attacked signal ŷ=y−v. The closer v estimates w, the more that attacker will “clean” the watermark in generating ŷ.
The symbol ε2 will denote the probability that a watermark chip is incorrectly estimated by the attacker (i.e., ε2=Pr[vj≠wj]). The attacker aims at forcing ε2 as small as possible. In the exemplary collusion resister, the system parameters are designed such that ε2 is as close to 1⁄2 as possible.
FIG. 1 shows the fingerprint detector (FPD) 130. It recovers the attack vector v from an attacked content ŷ and the originally marked content y by v=ŷ−y. Unlike the WMD (like WMD 140), the FPD 130 has access to the watermark carrier matrix C. Thus, the FPD 130 correlates v (with a correlation detector 132) with a suspect watermark carrier ci (i.e., it computes dF=v·ci) and decides that the ith client is part of the collusion if dF>δF (i.e., δF is the FPD threshold). Compared to the WMD, the FPD has less noise in the correlated vectors, and thus the FPD collusion resistance is much higher than that of the WMD.
The symbol ε3 will denote the probability of false positives in the FPD (i.e., incriminating a client that was not in the collusion set). Therefore, ε3 should be very small.
Collusion Attacks on Detection Keys
Consider a collusion clique of size K that acquired K different WDKs hi (possibly, by breaking into K clients and extracting the WDKs). This collusion clique may include only one attacker with K different WDKs. Alternatively, it may include multiple attackers with K different WDKs.
For the purpose of describing collusion attacks, an optimal attack is based on that set of keys {hi, i=1, . . . K}. Without loss of generality, it is assumed that is those extracted WDKs (with indices 1 to K) are the ones in the collusion.
The Optimal Attack
The attacker's goal is to estimate the SWK key w by an attack vector v, so that the modified signal ŷ=y−v will not show significant correlation with any watermark detector j (i.e., ever for j>K). The best job that attacker can possibly perform is given by




  v
  =
  
    
      sign
      ⁡
      
        (
        
          
            ∑
            
              i
              =
              1
            
            K
          
          ⁢
          
            h
            i
          
        
        )
      
    
    .
  




WMD Performance

Given the optimal attack above, the average estimation error in the attack vector (ε2=Pr[vj≠wj]) may be computed, for a collusion of size K, by:




  
    
      
        
          ɛ
          2
        
        =
        
          
            1
            2
          
          ⁢
          
            erfc
            ⁡
            
              (
              
                
                  K
                
                
                  B
                  ⁢
                  
                    2
                  
                
              
              )
            
          
          ⁢
          
            〈
            
              
                1
                2
              
              ⁢
              
                exp
                ⁡
                
                  (
                  
                    -
                    
                      K
                      
                        2
                        ⁢
                        
                          B
                          2
                        
                      
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




Given ε2, the efficiency of a subtraction attack (ŷ=y−v) may be evaluated for the optimal attack vector v. Since E[v·w]=Pr[vj=wj]−Pr[vj≠wj]=1–2ε2, one can see that after attack the expected output of the watermark correlation detector drops to E[dw]=2ε2. The attacker may attempt a stronger subtraction attack, of the form ŷ=y−βv, with β>1, because that would bring the watermark detector output further down to E[dw]=2βε2−(β−1). As long as β is not too large, the attacked content ŷ may be acceptable to users.
Collusion Size
In order to reduce the correlation value to E[dw]=θ, where θ is typically much smaller than δW, the adversary (i.e., digital pirate, attacker, etc.) needs to collude K WDKs, with




  
    
      
        K
        =
        
          2
          ⁢
          
            
              
                B
                2
              
              ⁡
              
                [
                
                  
                    erf
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      
                        1
                        -
                        θ
                      
                      β
                    
                    )
                  
                
                ]
              
            
            2
          
        
      
    
    
      
        (
        2
        )
      
    
  




To make the attacker's job more difficult, the parameter B is increased since K grows with B2. B is the standard deviation of the watermark carrier c. In doing so, however, the detection noise variance is increased. The detection noise variance is σ2gW=(A2+B2+A2B2)/N, where A is the standard deviation of the original content x and N is the size of the digital good. For a given σ2gW, we can determine that the probability of false positives ε1=Pr[dW>δW| object is not marked] by:




  
    
      
        
          
            
              
                ɛ
                1
              
              =
              
              ⁢
              
                
                  
                    1
                    2
                  
                  ⁢
                  
                    erfc
                    ⁡
                    
                      (
                      
                        
                          
                            δ
                            W
                          
                          ⁢
                          
                            N
                          
                        
                        
                          
                            2
                            ⁢
                            
                              (
                              
                                
                                  A
                                  2
                                
                                +
                                
                                  B
                                  2
                                
                                +
                                
                                  
                                    A
                                    2
                                  
                                  ⁢
                                  
                                    B
                                    2
                                  
                                
                              
                              )
                            
                          
                        
                      
                      )
                    
                  
                
                <
              
            
          
        
        
          
            
              
              ⁢
              
                
                  1
                  2
                
                ⁢
                
                  exp
                  ⁡
                  
                    (
                    
                      -
                      
                        
                          
                            δ
                            W
                            2
                          
                          ⁢
                          N
                        
                        
                          2
                          ⁢
                          
                            (
                            
                              
                                A
                                2
                              
                              +
                              
                                B
                                2
                              
                              +
                              
                                
                                  A
                                  2
                                
                                ⁢
                                
                                  B
                                  2
                                
                              
                            
                            )
                          
                        
                      
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




We note that if σ2gW=1⁄2, then ε1 is also the probability of false negatives (i.e., the probability of a WMD not detecting a marked object that was not attacked.)
From the result above, the object size N required to achieve a given ε1 is




  
    
      
        N
        =
        
          
            
              
                2
                ⁡
                
                  [
                  
                    
                      A
                      2
                    
                    +
                    
                      
                        B
                        2
                      
                      ⁡
                      
                        (
                        
                          1
                          +
                          
                            A
                            2
                          
                        
                        )
                      
                    
                  
                  ]
                
              
              
                δ
                W
                2
              
            
            ⁡
            
              [
              
                
                  erf
                  
                    -
                    1
                  
                
                ⁡
                
                  (
                  
                    1
                    -
                    
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      
                        ɛ
                        1
                      
                    
                  
                  )
                
              
              ]
            
          
          2
        
      
    
    
      
        (
        4
        )
      
    
  




By combining the result above with that in Lemma 3, we conclude that the collusion size K grows linearly with object size N (i.e., K ̃O(N)). More specifically:




  
    
      
        K
        =
        
          N
          ⁢
          
            
              
                
                  δ
                  W
                  2
                
                
                  1
                  +
                  
                    A
                    2
                  
                
              
              [
              
                
                  
                    erf
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      
                        1
                        -
                        θ
                      
                      β
                    
                    )
                  
                
                
                  
                    erf
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      1
                      -
                      
                        2
                        ⁢
                        
                          
                        
                        ⁢
                        
                          ɛ
                          1
                        
                      
                    
                    )
                  
                
              
              ]
            
            2
          
        
      
    
    
      
        (
        5
        )
      
    
  




Equation 5 allows for quick computation of the object size N necessary to achieve any desired collusion resistance K.
Fingerprint Detection
Fingerprint detection (such as by fingerprint detector (FPD) 130 of FIG. 1) has less noise in its correlation output. Therefore, it should be able to identify the indices i corresponding all the WDKs hi used in the collusion by the attacker, even if the collusion size K is large enough to fool all clients, as computed above.
The FPD knows the marked content y, the attacked version ŷ, and the watermark carriers ci. It computes the correlation dF=(ŷ−y)·ci, and decides that the ith client participated in the collusion if dF>δF. Assuming the attack model of discussed previously, ŷ=y−βv, the FPD output can be written as:

dF=(ŷ−y)·ci=β(v·ci)=E[dF]+gF  (6)

where gF is the zero-mean FPD correlation noise. The most critical error for the FPD is a false positive (i.e., incriminating a WDK i that did not participate in the collusion). The probability ε3 of that error is given, for an object of size N, by:




  
    
      
        
          ɛ
          3
        
        =
        
          
            
              1
              2
            
            ⁢
            
              erfc
              ⁡
              
                (
                
                  
                    
                      δ
                      F
                    
                    ⁢
                    
                      N
                    
                  
                  
                    
                      2
                    
                    ⁢
                    β
                    ⁢
                    
                      
                    
                    ⁢
                    B
                  
                
                )
              
            
          
          <
          
            
              1
              2
            
            ⁢
            
              exp
              ⁡
              
                (
                
                  -
                  
                    
                      
                        δ
                        F
                        2
                      
                      ⁢
                      
                        N
                      
                    
                    
                      2
                      ⁢
                      
                        β
                        2
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        B
                        2
                      
                    
                  
                
                )
              
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




As expected, ε3<<ε1 (usually by several orders of magnitude), since the argument in erfc(·) for ε3 is approximately (AδF)/(OδW) times larger than the argument in erfc(·) for ε1. Thus, by choosing B and N for a sufficiently low ε1, a negligibly low probability ε3 of false positives in the FPD is achieved.
To compute the detection performance of the FPD, its expected output should be determined when a carrier ci is correlated such that hi was part of the collusion. It can be seen that E[dF]=βE[zj], where:




  
    
      
        
          
            
              
                
                  z
                  j
                
                =
                
                ⁢
                
                  
                    v
                    j
                  
                  ⁢
                  
                    c
                    ij
                  
                
              
            
          
          
            
              
                
                  =
                  
                  ⁢
                  
                    
                      sign
                      ⁡
                      
                        [
                        
                          s
                          j
                        
                        ]
                      
                    
                    ⁢
                    
                      c
                      ij
                    
                  
                
                ,
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              with
              ⁢
              
                
              
              ⁢
              
                s
                j
              
            
            =
            
              
                w
                j
              
              +
              
                b
                j
              
            
          
          ,
          
            
              and
              ⁢
              
                
              
              ⁢
              
                b
                j
              
            
            =
            
              
                1
                K
              
              ⁢
              
                
                  ∑
                  
                    m
                    =
                    1
                  
                  K
                
                ⁢
                
                  c
                  mj
                
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




Thus, a collusion of size K produces:




  
    
      
        
          E
          ⁡
          
            [
            
              d
              F
            
            ]
          
        
        =
        
          β
          ⁢
          
            B
            
              K
            
          
          ⁢
          
            
              2
              π
            
          
          ⁢
          
            exp
            ⁡
            
              (
              
                -
                
                  K
                  
                    2
                    ⁢
                    
                      B
                      2
                    
                  
                
              
              )
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




Given the expected FPD output, δF=E[dF]/2, which determines the probability η of false negatives (i.e., the probability that a key index i in the collusion will not be detected). An object of size N produces:




  
    
      
        η
        =
        
          
            1
            2
          
          ⁢
          
            erfc
            ⁡
            
              (
              
                
                  
                    (
                    
                      
                        E
                        ⁡
                        
                          [
                          
                            d
                            F
                          
                          ]
                        
                      
                      -
                      
                        δ
                        F
                      
                    
                    )
                  
                  ⁢
                  
                    N
                  
                
                
                  
                    2
                  
                  ⁢
                  β
                  ⁢
                  
                    
                  
                  ⁢
                  B
                
              
              )
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




From the results above, it can be computed that the object size N necessary to achieve a desired probability η of false negatives in the FPD. For simplicity, assume that the FPD threshold is set in the middle (i.e., δF=E[dF]/2). The minimum collusion size (as discussed above) is K=2B2μ2, where mu=erf[β−1(1−θ)] is fixed for a fixed attack efficiency (i.e., a fixed θ). Therefore, as B increases, the attacker has to increase K proportionally to B2. The object size N required to achieve a given η is




  
    
      
        N
        =
        
          K
          ⁢
          
            
              
                π
                2
              
              ⁡
              
                [
                
                  
                    
                      erf
                      
                        -
                        1
                      
                    
                    ⁡
                    
                      (
                      
                        1
                        -
                        
                          2
                          ⁢
                          
                            
                          
                          ⁢
                          η
                        
                      
                      )
                    
                  
                  ⁢
                  
                    exp
                    ⁡
                    
                      (
                      
                        μ
                        2
                      
                      )
                    
                  
                
                ]
              
            
            2
          
        
      
    
    
      
        (
        11
        )
      
    
  




Segmentation

In the exemplary collusion resister, watermarks protect the content and fingerprints enable the content owner to identify a clique of clients that launched an attack to remove the watermark. This unique property of the implementation of the present invention provides an avenue to add multiple watermarks in the object (i.e., digital good) and enforce the adversary to create cliques independently for each watermark.
More formally, the exemplary collusion resister divides the protected object into S segments (Ss, s=1 . . . S) and watermark each of them with a distinct spread spectrum sequence (ws, s=1 . . . S). Per each segment Ss, the exemplary collusion resister uses m distinct WDKs (hi[s], i=1 . . . m). Each client gets a single WDK hi[s] that corresponds to exactly one segment. Alternatively, it may correspond to multiple segments.
With this segmentation implementation, a protected object may be defeated if watermarks are removed from all segments, while no fingerprints are introduced in the process. The collusion-resistance κS of this segmentation implementation with S segments equals the expected number of clients needed to use their WDKs in S collusion cliques (a clique per segment) to defeat this segmentation implementation.
The probability q is the probability that after distributing κS keys into segments, no segment contains less than K keys. Assume: S>>1, K is a relatively small constant, and




  
    
      κ
      s
    
    SK
  
  ⪢
  1.




Then: κS=S[ln(S)−ln(2∈4)] then q>1−∈4.

Collectively, the key generation entity 110 and marker 120 of FIG. 1 perform the segmentation. Rather than redundantly embedding the same watermark in the media signal x, the key generation entity 110 and marker 120 embeds a watermark in each segment of the signal that are independent of the watermarks in other segments. Also, the key generation entity 110 generates a set of unique WDKs for each segment; whereas each WDK is associated only with the watermark embedded in the corresponding segment.
Of course, segments may be repeated within the signal. Therefore, when reference is made to “each” segment having unique or independent properties, this refers to unrepeated segments.
How Many Segments Per Object?
Since collusion resistance within a single segment is K ̃N, where N=NO/S is the length of the segment, and collusion resistance achieved over S segments is κS=S In(S) for small K, then the objective is to have as short as possible segments in order to: (i) maximize overall collusion resistance κS and (ii) reduce the storage space for a single WDK Hi.
On the other hand, due to security measures for hiding w within a watermark carrier ci, there exists a lower bound on the watermark carrier amplitude B, commonly set to B≧A. Selection of B uniquely identifies the segment length N with respect to a desired probability of a false alarm ε1 under the optimal sign (mean(h)) attack. Such a setup directly impacts the maximal collusion size per segment K and maximal efficacy of the adversary in guessing SWK bits 1−ε2. It also traces the guidelines for FPD detection performance ε3 and η.
Key Compression
The exemplary collusion resister requires a relatively large storage space for the detection keys. Generally, it is quite difficult to compress the sum of two independent pseudo-random sequences, such that it is hard to infer the individual sequences. However, the exemplary collusion resister has a need to independently create pseudo-random keys (e.g., SWK w and watermark carrier ci) in a secure environment, but store their sum (e.g., WDK hi) in an insecure environment (e.g., on a client). Furthermore, this needs to be done so that the individual keys cannot be inferred from the sum.
Generally, a detection key (e.g., WDK hi) may be about the size of the digital good itself. For realistic loads, the length of the detection key may be in the order of 105 bytes, which may be too much data for certain embedded devices.
Above, it was described that the WDK of client i is created as hi=ci+w where ci and w are mutually independent. Instead, the exemplary collusion resister can generate the watermark detection key from a short seed using any standard cryptographically secure pseudo-random key generator, and per chosen w do sieving and select only those seeds for which the resulting long sequence (denoted as s) has the property that s·w≧1, thus, inferring hi=s. The deviation of s·w is roughly σ*=B√{square root over (NO)}, so the probability for a randomly chosen seed to meet this criterion is




  
    ɛ
    *
  
  =
  
    
      1
      2
    
    ⁢
    
      
        erfc
        ⁡
        
          (
          
            
              N
              o
            
            /
            
              (
              
                B
                ⁢
                
                  2
                
              
              )
            
          
          )
        
      
      .
    
  




FIG. 1 shows an hi (individualized WDK) estimator 118 of the key generation entity 110 in FIG. 1. It generates a short-key estimation (si) for the individualized WDK (hi). Consequently, si≈hi. In other words, the short-key estimation (si) of the individualized WDK is approximately equal to the individualized WDK (hi).
Alternative Key Compression
The exemplary collusion resister may generate the key from a short seed using any standard cryptographically secure pseudorandom key generator, and per a chosen w do sieving and “pick” only those seeds for which the resulting long sequence (call it s) has the property that s·w>2n/3, say (recall that it must be bigger than the detection threshold δ1=n/2).
The deviation of s·w is σ*=n1/2B/2, so the probability for a randomly chosen seed to meet this criteria is ε*<exp(−u2/2), where uσ*=2n/3. So, ε*<exp(−n/B2). This may not be sufficient for a whole object (n=106).
However, the exemplary collusion resister may do a piecewise generation by breaking the whole sequence into sub-sequences of size say n′=20B2 elements, where each element is half a byte. So the length of each subsequence is 4n′ bits. The exemplary collusion resister may try on the average exp(u2/2) seeds until a good one (about a million in the above example) is found. Typically, this is done once per client.
If the exemplary collusion resister uses a random access PRNG, it may jump on the average exp(u2/2) phases until a good one is found. A pointer of this magnitude has log exp(u2/2)=n′/B2 bits, so the compression ratio is 4B2 For example, for B=10, the exemplary collusion resister get compression ratio of 400. If n=106, then a detection key is a size 10 Kbyte per client.
This key can be stored on a smart card, for example. The key is good for a multitude of different goods (e.g., 800 movies) (the error probability in estimating w by averaging k movies is exp(−k/(8A2)).
Methodological Implementation of the Exemplary Collusion Resister
FIGS. 2–4 show methodological implementations of the exemplary collusion resister performed by the collusion-resistant architecture 100 (or some portion thereof). These methodological implementations may be performed in software, hardware, or a combination thereof.
FIG. 2 shows methodological implementation of the exemplary collusion resister performed by, for example, the key generation entity 110 and marker 120 of the collusion-resistant architecture 100.
At 210 of FIG. 2, the exemplary collusion resister generates a pseudorandom watermark w for embedding into a media signal x (i.e., a digital good).
At 212, it generates an individual pseudorandom watermark carrier ci where the carrier and the watermark are based on different seeds. In other words, one is not inferred from the other. Each carrier is associated with an individual client (e.g., person, business, company, detector hardware, detector software, etc.). The carriers are stored in a carrier matrix (C) and each entry in that matrix is associated with an individual client.
At 214, an individualized watermark detection key (WDK hi) is generated by combining the watermark and an individual watermark carrier. Consequently, each individualized WDKs is associated with an individual client. At 216, the exemplary collusion resister produces a short-key estimation (si) of the individualized WDKs.
At 218 of FIG. 2, the media signal x is marked to produce a marked media signal y. In other words, y=x+w. At 220, the marked signal is distributed. The process ends at 222.
NOTE: No fingerprint is embedded into the media signal. Unlike classic fingerprinting, no fingerprint code is embedded into the signal. The WDKs are not embedded into the signal. The watermark carriers are not embedded into the signal. The marked signal includes the watermark, but it does not include a fingerprint.
However, since the individualized WDKs are generated in part by the watermarks, then only those clients having a particularly associated individualized WDK can access (detect, modify, etc.) the particularly associated watermark in the marked signal.
If no segmentation is employed, then these blocks 210–222 are repeated for each copy of a digital good. Each copy is associated with a specific client. That specific client is associated with the individualized WDK for that specific copy.
If segmentation is employed, then blocks 210–218 are repeated for each segment of the media signal x. Each segment has its own watermark embedded therein. Consequently, each segment also has an individualized WDK associated with it. If segmentation is employed, then the copy of the marked signal distributed in block 220 may be an identical for everyone. This is because clients can only access (detect, modify, etc.) watermarks in their associated segment.
FIG. 3 shows methodological implementation of the exemplary collusion resister performed by, for example, the watermark detector 140 of the collusion-resistant architecture 100.
Since watermark detection is typically done in an insecure environment, it has no access to the original unmarked signal (x), the original marked media signal (y), carrier index (C), and the like. Typically, watermark detection is performed in “real-time” by detectors (e.g., desktop hardware and/or software) with pedestrian computing power.
At 310 of FIG. 3, the exemplary collusion resister obtains a subject media signal. It is not known whether this signal has been modified or not. At 312, the individualized WDK associated with a specific client is obtained. The individualized WDK may be hardwired, it may be in firmware, it may be stored in a memory, or the like. It may be encrypted or hidden. Regardless of where the individualized WDK is obtained, it does not come from the subject media signal. The exemplary collusion resister does not obtain the individualized WDK from the signal that it is examining.
At 314, it determines whether a watermark exists in the subject media signal using the individualized WDK associated with the specific client. At 316, it indicates the results of such determination.
At 318, it indicates whether a watermark in the subject signal is suspected of being modified. If so, that may trigger the fingerprint detection (see FIG. 4). At 320, the process ends.
FIG. 4 shows methodological implementation of the exemplary collusion resister performed by, for example, the fingerprint detector 130 of the collusion-resistant architecture 100.
At 410 of FIG. 4, the exemplary collusion resister obtains a media signal suspected of being modified. At 412, it also obtains original marked media signal (y). At 414, it also obtains the watermark carriers (ci) for carrier index (C).
Since fingerprint detection is typically done in a secure environment, it can have access to the original marked media signal and carrier index (C). Typically, fingerprint detection is performed “offline” by powerful computers with sufficient resources.
At 416 of FIG. 4, the exemplary collusion resister determines whether the suspected media signal to has “fingerprints” of colluders by correlating the watermark carrier such that an individual WDK was part of the collusion. At 418, it indicates the presences of “fingerprints” and identifies the colluders. At 420, the process end.
Exemplary Computing System and Environment
FIG. 5 illustrates an example of a suitable computing environment 900 within which an exemplary collusion resister, as described herein, may be implemented (either fully or partially). The computing environment 900 may be utilized in the computer and network architectures described herein.
The exemplary computing environment 900 is only one example of a computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the computer and network architectures. Neither should the computing environment 900 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary computing environment 900.
The exemplary collusion resister may be implemented with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use include, but are not limited to, personal computers, server computers, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The exemplary collusion resister may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The exemplary collusion resister may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
The computing environment 900 includes a general-purpose computing device in the form of a computer 902. The components of computer 902 can include, by are not limited to, one or more processors or processing units 904, a system memory 906, and a system bus 908 that couples various system components including the processor 904 to the system memory 906.
The system bus 908 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. By way of example, such architectures can include an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MCA) bus, an Enhanced ISA (EISA) bus, a Video Electronics Standards Association (VESA) local bus, and a Peripheral Component Interconnects (PCI) bus also known as a Mezzanine bus.
Computer 902 typically includes a variety of computer readable media.
Such media can be any available media that is accessible by computer 902 and includes both volatile and non-volatile media, removable and non-removable media.
The system memory 906 includes computer readable media in the form of volatile memory, such as random access memory (RAM) 910, and/or non-volatile memory, such as read only memory (ROM) 912. A basic input/output system (BIOS) 914, containing the basic routines that help to transfer information between elements within computer 902, such as during start-up, is stored in ROM 912. RAM 910 typically contains data and/or program modules that are immediately accessible to and/or presently operated on by the processing unit 904.
Computer 902 may also include other removable/non-removable, volatile/non-volatile computer storage media. By way of example, FIG. 5 illustrates a hard disk drive 916 for reading from and writing to a non-removable, non-volatile magnetic media (not shown), a magnetic disk drive 918 for reading from and writing to a removable, non-volatile magnetic disk 920 (e.g., a “floppy disk”), and an optical disk drive 922 for reading from and/or writing to a removable, non-volatile optical disk 924 such as a CD-ROM, DVD-ROM, or other optical media. The hard disk drive 916, magnetic disk drive 918, and optical disk drive 922 are each connected to the system bus 908 by one or more data media interfaces 925. Alternatively, the hard disk drive 916, magnetic disk drive 918, and optical disk drive 922 can be connected to the system bus 908 by one or more interfaces (not shown). The disk drives and their associated computer-readable media provide non-volatile storage of computer readable instructions, data structures, program modules, and other data for computer 902. Although the example illustrates a hard disk 916, a removable magnetic disk 920, and a removable optical disk 924, it is to be appreciated that other types of computer readable media which can store data that is accessible by a computer, such as magnetic cassettes or other magnetic storage devices, flash memory cards, CD-ROM, digital versatile disks (DVD) or other optical storage, random access memories (RAM), read only memories (ROM), electrically erasable programmable read-only memory (EEPROM), and the like, can also be utilized to implement the exemplary computing system and environment.
Any number of program modules can be stored on the hard disk 916, magnetic disk 920, optical disk 924, ROM 912, and/or RAM 910, including by way of example, an operating system 926, one or more application programs 928, other program modules 930, and program data 932. Each of such operating system 926, one or more application programs 928, other program modules 930, and program data 932 (or some combination thereof) may include an embodiment of a digital-good obtainer, a fingerprint detector, a collusion indicator, a colluder identifier, a fingerprint memory, and a watermark detector.
A user can enter commands and information into computer 902 via input devices such as a keyboard 934 and a pointing device 936 (e.g., a “mouse”). Other input devices 938 (not shown specifically) may include a microphone, joystick, game pad, satellite dish, serial port, scanner, and/or the like. These and other input devices are connected to the processing unit 904 via input/output interfaces 940 that are coupled to the system bus 908, but may be connected by other interface and bus structures, such as a parallel port, game port, or a universal serial bus (USB).
A monitor 942 or other type of display device can also be connected to the system bus 908 via an interface, such as a video adapter 944. In addition to the monitor 942, other output peripheral devices can include components such as speakers (not shown) and a printer 946 which can be connected to computer 902 via the input/output interfaces 940.
Computer 902 can operate in a networked environment using logical connections to one or more remote computers, such as a remote computing device 948. By way of example, the remote computing device 948 can be a personal computer, portable computer, a server, a router, a network computer, a peer device or other common network node, and the like. The remote computing device 948 is illustrated as a portable computer that can include many or all of the elements and features described herein relative to computer 902.
Logical connections between computer 902 and the remote computer 948 are depicted as a local area network (LAN) 950 and a general wide area network (WAN) 952. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.
When implemented in a LAN networking environment, the computer 902 is connected to a local network 950 via a network interface or adapter 954. When implemented in a WAN networking environment, the computer 902 typically includes a modem 956 or other means for establishing communications over the wide network 952. The modem 956, which can be internal or external to computer 902, can be connected to the system bus 908 via the input/output interfaces 940 or other appropriate mechanisms. It is to be appreciated that the illustrated network connections are exemplary and that other means of establishing communication link(s) between the computers 902 and 948 can be employed.
In a networked environment, such as that illustrated with computing environment 900, program modules depicted relative to the computer 902, or portions thereof, may be stored in a remote memory storage device. By way of example, remote application programs 958 reside on a memory device of remote computer 948. For purposes of illustration, application 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 computing device 902, and are executed by the data processor(s) of the computer.
Computer-Executable Instructions
An implementation of an exemplary collusion resister may be described in the general context of computer-executable instructions, such as program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Typically, the functionality of the program modules may be combined or distributed as desired in various embodiments.
Exemplary Operating Environment
FIG. 5 illustrates an example of a suitable operating environment 900 in which an exemplary collusion resister may be implemented. Specifically, the exemplary collusion resister(s) described herein may be implemented (wholly or in part) by any program modules 928–930 and/or operating system 926 in FIG. 5 or a portion thereof.
The operating environment is only an example of a suitable operating environment and is not intended to suggest any limitation as to the scope or use of functionality of the exemplary collusion resister(s) described herein. Other well known computing systems, environments, and/or configurations that are suitable for use include, but are not limited to, personal computers (PCs), server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, programmable consumer electronics, wireless phones and equipments, general- and special-purpose appliances, application-specific integrated circuits (ASICs), network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
Computer Readable Media
An implementation of an exemplary collusion resister may be stored on or transmitted across some form of computer readable media. Computer readable media can be any available media that can be accessed by a computer. By way of example, and not limitation, computer readable media may comprise “computer storage media” and “communications media.”
“Computer storage media” include volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer.
“Communication media” typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data digital good, such as carrier wave or other transport mechanism. Communication media also includes any information delivery media.
The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to embedde information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, and other wireless media. Combinations of any of the above are also included within the scope of computer readable media.
CONCLUSION
Although the invention has been described in language specific to structural features and/or methodological steps, it is to be understood that the invention defined in the appended claims is not necessarily limited to the specific features or steps described. Rather, the specific features and steps are disclosed as preferred forms of implementing the invention.

## Claims

1. A method for tracking digital goods, the method comprising:
recognizing an attempt to access a watermark embedded in a digital good; and
gathering one or more fingerprints which were inserted into the digital good as a result of the attempt, wherein the one or more fingerprints are associated with an entity and are generated at least in part from the watermark,
wherein prior to the attempt, the watermark being free from information, associated with the entity.

2. A method as recited in claim 1, wherein the recognized attempt comprises attempting to hide, alter, or remove the embedded watermark from the digital good.

3. A method as recited in claim 1, wherein the entity is a detection entity.

4. A method as recited in claim 1, wherein the one or more fingerprints identify an entity.

5. A modulated signal embodied on one or more computer-readable media and generated in accordance with an act comprising gathering one or more fingerprints which were inserted into a digital good as a result of an attempt to access a watermark embedded in the digital good, wherein the one or more fingerprints are associated with an entity and arc generated at least in part from the watermark, and wherein prior to the attempt, the watermark being free from information associated with the entity.

6. A modulated signal as recited in claim 5, wherein the attempt comprises an attempt to hide, alter, or remove the embedded watermark from the digital good.

7. A modulated signal as recited in claim 5, wherein the entity is a detection entity.

8. A modulated signal as recited in claim 5, wherein the one or more fingerprints identify an entity.

9. One or more computer-readable media having computer-executable instructions that, when executed by a computer, perform acts for tracking digital goods, the acts comprising:
recognizing an attempt to access a watermark embedded in a digital good; and
gathering one or more fingerprints which were inserted into the digital good as a result of the attempt, wherein the one or more fingerprints are associated with an entity and are generated at least in part from the watermark,
wherein prior to the attempt, the watermark being free from information associated with the entity.

10. One or more media as recited in claim 9, wherein the recognized attempt comprises attempting to hide, alter, or remove the embedded watermark from the digital good.

11. One or more media as recited in claim 9, wherein the entity is a detection entity.

12. One or more media as recited in claim 9, wherein the one or more fingerprints identify an entity.

13. A system comprising:
attack-recognition means for recognizing an attempt to access a watermark embedded in a digital good; and
fingerprint gathering means for gathering one or more fingerprints which were inserted into the digital good as a result of the attempt, wherein the one or more fingerprints are associated with an entity and are generated at least in part from the watermark,
wherein prior to the attempt, the watermark being free from information associated with the entity.

14. A system as recited in claim 13, wherein the recognized attempt comprises attempting to hide, alter, or remove the embedded watermark from the digital good.

15. A system as recited in claim 13, wherein the entity is a detection entity.

16. A system as recited in claim 13, wherein the one or more fingerprints identify an entity.