Authenticating objects using embedded data

Information

  • Patent Grant
  • 6788800
  • Patent Number
    6,788,800
  • Date Filed
    Tuesday, July 25, 2000
    24 years ago
  • Date Issued
    Tuesday, September 7, 2004
    20 years ago
Abstract
This disclosure describes a method of making a secure product using data hidden in the product itself and a method of using the hidden data to authenticate the product. The method assigns a product identifier to the product, such as a unique serial number. It also steganographically embeds security data into the product. The security data includes the product identifier (e.g., a hashed version of it). The security data is embedded such that it is machine readable and enables automated authentication of the product by comparing the security data decoded from the product with the product identifier.
Description




TECHNICAL FIELD




The invention relates to methods for authenticating objects, and in particular, relates to methods for embedding security data into products, and methods for authenticating these products using the embedded security data.




BACKGROUND AND SUMMARY




Counterfeiting and piracy have a huge economic impact. While numerous product security features have been developed, there remains a demand for cost effective security measures that inhibit counterfeiting and piracy.




Research in the field of steganography (also called “data hiding”) offers promising technology for combating counterfeiting and piracy. One form of steganography is referred to in popular literature as digital watermarking. Digital watermarking is a process for modifying a host signal or object to embed a machine-readable code into the host. The host may be modified such that the embedded code is imperceptible or nearly imperceptible to the ordinary observer upon viewing or playback, yet may be detected through an automated detection process.




Most commonly, digital watermarking is applied to media such as images, audio signals, and video signals. However, it may also be applied to other types of media, including documents (e.g., through subtle line, word or character shifting), software, multi-dimensional graphics models, and surface textures of objects.




The invention relates to methods for authenticating products using embedded security data in the product. One aspect of the invention is a method of making a secure product using data hidden in the product itself. This method assigns a product identifier to the product, such as a unique serial number. It also steganographically embeds security data into the product. The security data includes the product identifier (e.g., a hashed version of it). The security data is embedded such that it is machine readable and enables automated authentication of the product by comparing the security data decoded from the product with the product identifier.




Another aspect of the invention is a method of authenticating a product using embedded security data. This method receives a product identifier associated with the product, and decodes security data steganographically embedded into the product. It then validates the product by comparing the decoded security data with the product identifier.




Another aspect of the invention is a product that includes security data steganographically embedded into it. The product is assigned a product identifier that is related to the security data. The relationship between the product identifier is defined such that authenticity of the product may be evaluated by comparing the security data decoded from the product with the product identifier.




In this document, the term “product” broadly encompasses physical objects (e.g., goods), and other objects associated with them like packaging, tags, labels, documentation, and media supplied on, by, or with the object. Within this broad product context, the embedding process may encode security data on any of these types of products. To determine whether a product is authentic, the methods and systems described in this document can be used to evaluate security data embedded on the product itself, its packaging, labels, tags, media, etc.




One implementation of these methods and secure products employs a form of steganography referred to as digital watermarking. However, other forms of steganography may be used as well. Further features will become apparent with reference to the following detailed description and accompanying drawings.











BRIEF DESCRIPTION OF THE DRAWINGS





FIG. 1

is a flow diagram illustrating a method for embedding an object identifier into an object.





FIG. 2

is a flow diagram illustrating a method for authenticating an object using the embedded object identifier.











DETAILED DESCRIPTION




Introduction




The following sections describe a system and related methods for authenticating products. While the description illustrates the system with an example of packaged software product, it applies to a variety of types of objects. There are two principal parts of the product authentication architecture: 1) a system for embedding authentication data into the product; and 2) a system for authenticating the product.




Typically, product makers assign unique identifiers, such as product serial numbers, to each product. In the product security systems describe below, an embedder encodes the serial number as a form of machine readable security data into the product or its packaging. This embedded security data is then used to authenticate the product and/or control unauthorized use. In the case of software products, for example, the embedded security data may be used to ensure that the user is authorized during installation of the software on the user's machine. In the case of financial or access cards (e.g., debit/credit cards, key cards, corporate badges), the embedded security data may be used to activate the card. In the more general case, the embedded security data may be used to check whether a product is authentic by validating a conspicuous product identifier, such as a visible serial number, with one imperceptibly embedded in the product or its packaging. These systems are detailed further below.




Embedding Security Data Into a Product





FIG. 1

is a flow diagram illustrating a method for embedding security data into a product. The maker or distributor of the product assigns a unique identifier, such as a serial number, to the product. The embedding process takes this identifier


20


and transforms it into a form of data for embedding in the product or its packaging. While the identifier need not be modified before embedding it, there are a number of reasons for doing so. One reason is to convert it into a more compact form for embedding. Another reason is to make the embedded data more secure, i.e. more difficult for counterfeiters or pirates to replicate.





FIG. 1

depicts an example of a data conversion method called a hash


22


. The hash is a function that converts the identifier into another number. One form of hash is a checksum, but there are many others. One example of a checksum is one that converts a number or set of numbers (e.g., serial number, product code, etc.) into another number using a sequence of prime numbers. A cryptographic hash may be used to generate a new number from which the original identifier is difficult to derive. Whether hashed or not, the data to be embedded is referred to as “security data.”




The embedding process embeds the security data into a machine readable code on the product or its packaging (


24


). In particular, the process steganographically embeds the security data into the machine readable code on the product or on packaging or labels for the product. A steganographic process embeds information on the product's surface such that is imperceptible or substantially imperceptible upon ordinary inspection, yet readable by machine.




One form of steganography is called digital watermarking. A variety of digital watermarking schemes may be used to embed the watermark onto the print media. Some example watermark encoding and decoding schemes are provided in U.S. Pat. No. 5,862,260, and in co-pending application Ser. No. 09/503,881, filed Feb. 14, 2000.




In digital watermarking of images printed on physical objects, there is a tradeoff between visual perceptibility and survivability of the watermark. In this application, the watermark is embedded so as to be sufficiently robust to survive analog to digital conversion, digital to analog conversion, and possible other forms of corruption, including geometric distortion, additive noise, and compression. The watermark may be encoded by altering the luminance or one or more other color channels of an image printed on the surface of the product. Alternatively, the watermark may be encoded using clear inks that modulate the microtopology of the product's surface or that are readable when exposed to light in non-visible wavelengths, like UV or infrared. Also, the microtopology of the product surface may be altered in the process of creating the product surface so as to embed a watermark. Alternative machine readable codes may be used as well, such as data glyphs, invisible bar codes, etc.




A digital watermark embedding process typically involves several operations. For example, additional data may be appended to the security data, such as synchronization symbols, error detection codes, etc. After adding this data, the security data includes a sequence of symbols for embedding into the product. Additional operations include error correction and other forms of symbol encoding (e.g., convolution codes, turbo codes, BCH codes, Reed Solomon encoding, M sequences, gold sequences, etc.). These operations transform the original message sequence into a message signal. The message signal may then be further replicated and modulated using spread spectrum modulation techniques. For example, the message signal may be spread over a pseudorandom number or set of pseudorandom numbers and repetitively scattered throughout a host signal.




The host signal (sometimes referred to as the cover signal) is the signal in which the embedded data is hidden. This might be an image printed on an object, label or package, a layer of visible or invisible inks, line art, text, surface topology of an object, etc. The watermark signal may be replicated in several different contiguous or overlapping regions of the host signal. Each instance of the watermark at these regions can be associated with a corresponding imperceptible watermark template, synchronization or orientation signal that enables the decoder to detect the presence of the watermark and determine its orientation parameters such as translation (x, y coordinates of an origin), rotation, scale, shear, differential scale, etc.




To embed the message signal, an embedding function subtly changes the host signal. Digital watermarks usually operate on a digital form of the host signal to create a digital watermarked signal, which is then converted to analog form. However, the digital watermark may also be applied in the analog domain. A variety of embedding functions have been detailed in the literature about digital watermarking. These functions may be additive, multiplicative (adding or multiplying a message signal with the host signal), or some other function.




For enhanced security, various elements of the embedded data may be encrypted. Some or all of the watermark message, including the security data in the message may be encrypted. Various keys used to encode the watermark may be encrypted as well. For example, a key that defines the location of the watermark signal in the host signal may be encrypted. A key used to decode the spread message signal (e.g., a pseudorandom number) may also be encrypted.




In implementations where instances of the watermark signal are repeated in the host signal, a key in the message payload of one instance of a watermark signal may be used to decrypt a message, such as the security data, in other instance of the watermark signal. The key may be included in a message payload by appending the key to the message or combining it with the message using some function such as an XOR, or multiplication operation that combines the key with the message to create a composite message.




Keys used to decode the watermark or its message payload may also be derived from the host signal itself or from another watermark in the host signal.




Digital watermarks provide a low cost, yet secure method of embedding security data into a product or its packaging. The embedding process can be integrated into the process of printing the object or its packaging. For example, for each product, the printing process may be adapted to print an image embedded with the product's identifier or hashed form of it. This process may be integrated in the mass production of a variety of printable objects, like packaging, containers, labels, product documentation, credit cards, etc.




Authenticating a Product Using Embedded Security Data





FIG. 2

is a flow diagram illustrating a process for authenticating a product using embedded security data. The authentication system includes a user interface, scanner and embedded data decoder. In the case where the embedded data is encoded in a digital watermark, the system may be implemented in a personal computer equipped with an imaging device, such as a CCD camera or scanner.




Authentication begins by prompting the user for the product identifier (


30


). Typically, this identifier is a product serial number in plain view on the product, its packaging or documentation. The user may enter the product number by simply typing it on a keyboard, or using some other user input device (voice recognition, bar code scanner, etc.) In response to receiving the product identifier, the system prompts the user to present the product for scanning (


32


). The user then scans the product with a sensor device, such as a CCD camera, to capture a product scan.




Next, the system decodes the embedded data from the product scan (


34


). In the case of security data embedded in digital watermark on the product, the system scans one or more image frames of the product. It then proceeds to detect the watermark in this image signal. Finding a watermark, it decodes the watermark message, including any security data.




To validate the security data (


36


), the authentication system re-computes the security data from the product identifier entered by the user. It then compares the computed security data with the decoded security data. If the two sets of security data match, then the system deems the product to be valid.




A variety of actions may be triggered by the outcome of the validation process


36


. One action is to convey the output of the validation process to the user via a user interface, such as audio output, graphical user interface, etc. This type of operation could be used to authenticate any type of product using an authentication system implemented in a personal computer with an image sensor and software for executing the authentication operations.




In the case of a software product, the validation process (


36


) can automatically launch installation of the software on the user's computer. A variety of additional post-validation actions may be triggered automatically, such as establishing a connection to another computer (e.g., web server) to facilitate on line registration of the product, downloading of additional software or other content, retrieval of one or more keys that enable the software's operation, etc.




The same actions also apply to other types of products that execute machine instructions from a machine readable memory device. For example, hardware devices with embedded software or firmware could be authenticated in a similar fashion. In particular, the user would enter a product number into a user interface of the device, or another device in communication with it (a nearby PC connected via a wire or wireless port-USB, Firewire, Bluetooth, Infrared link, etc.). The user interface then would prompt the user to scan the product with a camera connected directly to the device being authenticated or indirectly through another device (e.g., the nearby PC). An embedded data decoder would then detect and decode any security data and take actions triggered by the result of the validation process. One action would be to install software to the device being authenticated from a nearby device or computer network. Another action would be to load one or more keys or other instructions that enable functionality of the device being authenticated.




The application of the authentication system to the registration and installation of software and embedded systems may be extended more generally to many forms of digital content, such as software, music, movies, games, etc. In each of these applications, the authentication method and system is similar. The digital content being authenticated may be packaged on a variety of storage media, such as an optical disk, magnetic disk, flash memory card, etc. The storage media or its packaging (e.g., a DVD case) includes embedded security data that is readable by machine and that is validated against a product identifier. The validation process may trigger actions relating to the digital content stored on the storage medium, such as control rendering of the content, control transfer of the content from the storage medium to another device, control usage of the content (e.g., number of copies, transfers, etc. allowed), linking to a network to retrieve related information or actions (e.g., linking to a product web site to get more information, license rights or purchase products or services).




The method depicted in

FIG. 2

is also applicable to activation of financial and access cards like credit/debit cards, card keys, corporate badges that include keys for accessing buildings, computer systems (including access to a single machine or access to network resources), etc. To illustrate this application, consider an implementation of the authentication system on a network. First, the user receives a new card along with an identifier. This identifier might be one printed conspicuously on the card or given to the user separately (e.g., such as a corporate personnel number). The user enters this identifier and scans the card with an image sensor (e.g., a PC camera, flatbed scanner, etc.) An embedded data decoding process extracts security data, if any, from the scanned image, and validates it against the data entered by the user. If the embedded data is valid, then the authentication system activates the card.




While the system for activating cards can be implemented on a stand alone computer system, it may be more commonly implemented in a network configuration. The system might be implemented in a client server architecture where a client computer at the user's location performs object scanning and decoding functions, and the server at a remote location validates the embedded data against data supplied by the user. The locations of computer processes that perform the various card activation operations (prompting for user input, scanning, decoding and validation) can be distributed between the client and one or more server computers.




The process of validating a product identifier with embedded security data can be extended in various ways. The embedded data and product identifier entered by the user may be used to form a key to decrypt data supplied in or by the product (e.g., software or multimedia content stored on a CD, DVD, etc.). In this case, the data supplied in or by the product is encrypted and the embedded data is used to convey one element of the key. Other elements of the key may be a product identifier, such as a serial number on the product, and a password of the user. Typically, the data supplied in the product is encrypted by the publisher when the product is made (e.g., burning of a CD, DVD, etc.). However, the encryption and security data embedding processes may be performed whenever data is transferred onto the product (e.g., transfer of data onto a writable storage device).




An additional enhancement is to use the cryptographic key formed from the embedded data and the user entered data (e.g., product identifier, password, etc.) to decrypt yet another key. This additional key can then be used to decrypt content supplied on or by the product. The product may be a storage device such as optical disk, magnetic storage device, flash memory, etc. that carries encrypted data, or some other type of device that supplies encrypted content.




Some examples of such devices are receivers of scrambled content like computers, set-top boxes, personal digital assistants, audio and video players, etc. Consider an example where a user wishes to watch a pay per view movie. The cable provider distributes promotional cards that enable the card holder to access the movie. To access the movie, which is provided in encrypted form via a set-top box or other cable receiver, the user displays the card to a camera connected to the set-top box through a wire or wireless connection. The set-top box decodes embedded security data on the card and combines it with other user and/or product information, such as the user's password, set-top box serial number, card number printed on the card, etc. to form a decryption key that is used to decrypt the movie, which streamed to the set-top box. A similar approach may be applied to other digital content that is downloaded or streamed in an encrypted form over a network, like the Internet, wireless phone network, cable television network, etc.




The security of the embedded data can be enhanced through the use of copy detection technology. Copy detection technology can be used to detect whether a counterfeiter has made a copy of the object bearing the embedded security data. For example, a counterfeiter might try to circumvent the authentication system by making a high quality copy of the image bearing the embedded security data using a scanner or copy machine, and then printing that image on a counterfeit product or its packaging.




The copy detection technology may be used to embed the security data (e.g., a watermark that is used to detect copying and convey security data) or may be separate from the security data (a separate watermark or other auxiliary data that is used to evince copying). One form of copy detection technology is a digital watermark that is altered in a predictable way when copied with a scanner, copy machine, or other imaging device. Such imaging devices apply a transformation to an image (e.g., an analog to digital sampling, color transformation, etc.) that can be detected by a watermark designed to change in a predictable way to such a transformation.




An example of copy detection technology is a “fragile” watermark. The watermark is called fragile because the strength of the watermark signal in a copy of the watermarked original object is less than the strength in the original object. To detect copying, the embedded data decoder attempts to detect the fragile watermark. If the fragile watermark is not present, or has a measured strength that falls below a threshold, then the decoder deems the object to be an invalid copy. There are a variety of ways to measure strength of a watermark signal. One way is to measure the extent of the correlation between an image of the suspect object and a reference fragile watermark signal.




Rather than using a separate fragile watermark, the authentication system may detect copying based on attributes of the watermark used to carry the embedded data. For example, the watermark may include a synchronization or orientation signal used to detect the presence of the watermark and determine its orientation. Copying of a watermarked object may be detected by measuring changes in the watermark orientation signal.




Since the watermark carrying the embedded data is made to survive distortion due to normal scanning operations required to read the watermark from an object, a fragile watermark may not accurately discern copying by a counterfeiter from these normal transformations. However, the watermark payload may be embedded in ways that survive these normal operations, yet still carries information from which copying can be discerned. For example, the payload of the watermark may be robustly encoded to withstand transformations due to scanning, geometric distortion, etc., yet convey information from which copying can be discerned.




One type of copy detection payload is an identifier that is related to some other characteristic of the object (another machine readable code, like a bar code, magnetic stripe, hologram, etc.).




Another form of copy detection is to scramble or encrypt part or all of the watermark payload in a predictable, yet different manner from one product to the next. This may be accomplished using a cryptographic hash that scrambles the payload using the product number or some other product specific attribute as a seed.




Another way is to scramble the location of the watermark or the relationship between different parts of the watermark using a cryptographic function. For example, the watermark may be replicated in blocks of an image, where each block encodes a similar payload, yet encodes that payload in a different manner based on a secret key. Each block may include an orientation signal that enables the decoder to properly align the image data for that block. In each block, the watermark payload may be scrambled differently, such as using a seed for a cryptographic scrambling function based on block location, block number, or data from the payload of another block, etc.




While the decoding process can use the orientation signal to align each block, it may not be able to discern the precise alignment of blocks in the scanned image relative to blocks in the original watermarked image. As such, the decoder may only be able to recover the relative location of blocks to each other, but not their absolute location in the original image. To address this challenge, the variation of the watermark or its payload across the image can be made in a relative manner from one block to the next using a secret key that defines the relationship between blocks. Relative changes between neighboring blocks enable the decoder to extract the payload from one block using information from one or more neighboring blocks. For example, the payload of one block may be altered using the payload of one or more adjacent blocks. The relationship between the payloads of adjacent blocks may be defined according to a cryptographic function. For example, the payload of one block may be used as a key to decoding an adjacent block.




A related enhancement is to use keys for decoding the watermark, the watermark payload, or digital content that are dependent on the host signal. This type of host signal dependent key makes it difficult to copy the embedded security data from one object to another. To illustrate this enhancement, consider embedded security data in an image watermark on a product, packaging, or label. One form of image dependent key is a key that is derived from a property of the image that is insensitive to the changes due to the watermark embedding process and recoverable in a watermark decoding operation on the embedded product.




An example of this type of key is a number that is derived from statistical properties of the image that are insensitive to the watermark embedding process, like the relative power differences between blocks of the image. The key could be, for instance, a binary number computed by comparing the power of a given block with a set of other blocks, such as those in a predetermined neighborhood around the given block. The comparison operations yield a one or zero depending on whether the power of the given block is greater or less than the selected neighbors. Each comparison operation yields a single bit in the key. The key may then be appended or combined with the watermark payload.




At the time of authentication, the watermark decoding process employs a synchronization or orientation signal to align the image data. Then it re-computes the image dependent key by repeating the key derivation operation as computed in the embedding process. The key computed at the time of decoding may be compared with the embedded key to check authenticity of the embedded data. Other properties that are insensitive to the watermark process may be used as well.




Another enhancement that can be used as a form of authentication and copy detection is to embed two or more different watermarks that have a known relationship with respect to each other. One such relationship is a predetermined offset in the spatial image domain, or some other transform domain, like a Discrete Fourier Transform, Discrete Cosine Transform, Discrete Wavelet Transform, or some re-sampling of one of these domains, like a log, log-log, or log-polar re-sampling. This known relationship changes in a predictable way when the watermarked object is copied. Thus, during the authentication process, a watermark decoding process detects the watermarks and computes this relationship between the watermarks. It then compares the computed relationship with the known relationship to determine whether some unauthorized transform likely occurred, such as copying.




The above sections refer to encryption and decryption operations. A variety of cryptographic technologies may be used to implement these operations. Some examples of encryption technologies include RSA, DES, IDEA (International Data Encryption Algorithm), skipjack, discrete log systems (e.g., El Gamal Cipher), elliptic curve systems, cellular automata, etc.




The above sections also refer to hash operations and in some cases, cryptographic hashes. Cryptographic hashes are functions used to convert a first number into a relatively unique second number in a manner that makes it difficult to derive the first number from the second number. Examples of hashing functions include MD


5


, MD


2


, SHA, SHA


1


.




Concluding Remarks




Having described and illustrated the principles of the technology with reference to specific implementations, it will be recognized that the technology can be implemented in many other, different, forms. To provide a comprehensive disclosure without unduly lengthening the specification, applicants incorporate by reference the patents and patent applications referenced above.




The methods, processes, and systems described above may be implemented in hardware, software or a combination of hardware and software. For example, the auxiliary data encoding processes may be implemented in a programmable computer or a special purpose digital circuit. Similarly, auxiliary data decoding may be implemented in software, firmware, hardware, or combinations of software, firmware and hardware. The methods and processes described above may be implemented in programs executed from a system's memory (a computer readable medium, such as an electronic, optical or magnetic storage device).




The particular combinations of elements and features in the above-detailed embodiments are exemplary only; the interchanging and substitution of these teachings with other teachings in this and the incorporated-by-reference patents/applications are also contemplated.



Claims
  • 1. A method for authenticating a product comprising:receiving a product identifier associated with the product; decoding security data steganographically embedded into the product; and validating the product by comparing the decoded security data with the product identifier, and in response to validating the product, enabling use or transfer of software or content associated with the product.
  • 2. The method of claim 1 wherein the security data is embedded in a digital watermark that is decoded from an image scanned of the product.
  • 3. The method of claim 1 wherein the security data is decoded from a scan of product packaging for the product.
  • 4. The method of claim 1 wherein the embedded security data comprises a hash of the product identifier.
  • 5. A computer readable medium having software for performing the method of claim 1.
  • 6. The method of claim 1 wherein the product comprises a physical storage medium and the software or content is stored on the physical storage medium.
  • 7. A methods for authenticating a product comprising:receiving a product identifier associated with the product; decoding security data steganographically embedded into the product; and validating the product by comparing the decoded security data with the product identifier; wherein the product comprises software and including: controlling installation of software in response to validating the product.
  • 8. A method for authenticating a product comprising:receiving a product identifier associated with the product; decoding security data steganographically embedded into the product; and validating the product by comparing the decoded security data with the product identifier; wherein the product comprises a financial or access card and including: controlling activation of the card in response to validating the product.
  • 9. A method for authenticating a product comprising:receiving a product identifier associated with the product, including prompting a user to enter the product identifier; prompting the user to scan the product to capture a scan of the embedded security data; decoding security data steganographically embedded into the product; and validating the product by comparing the decoded security data with the product identifier.
  • 10. A method for authenticating a product comprising:receiving a product identifier associated with the product; decoding security data steganographically embedded into the product; and validating the product by comparing the decoded security data with the product identifier; wherein a copy detection feature is printed on the product; and further including: using the copy detection feature to determine whether the product has been counterfeited.
  • 11. The method of claim 10 wherein the copy detection feature comprises a watermark from which copying is detectable from analysis of a payload of the watermark.
  • 12. A method for authenticating a product comprising:receiving a product identifier associated with the product; decoding security data steganographically embedded into the product; and validating the product by comparing the decoded security data with the product identifier; wherein a copy detection feature is included on the product; and the copy detection feature is used to determine whether the product has been counterfeited; wherein the copy detection feature comprises a watermark that changes when copied in a manner that enables copying of the product to be detected.
  • 13. A product including:security data steganographically embedded into the product; the product being assigned a product identifier that is related to the security data such that authenticity of the product is evaluated by comparing the security data decoded from the product with the product identifier, wherein successful authentication of the product based on comparing the security data with the product identifier enables use or transfer of software or content associated with the product.
  • 14. The method of claim 13 wherein the product comprises a physical storage medium and the software or content is stored on the physical storage medium.
  • 15. A method of making a product comprising:assigning a product identifier to the product; steganographically embedding security data into the product, the security data including the product identifier; wherein the security data is machine readable and enables automated authentication of the product by comparing the security data decoded from the product with the product identifier; wherein successful authentication of the product based on comparing the security data with the product identifier enables use or transfer of software or content associated with the product.
  • 16. The method of claim 15 wherein the product comprises a physical storage medium and the software or content is stored on the physical storage medium.
  • 17. A method of authenticating a product comprising:extracting embedded information steganographically encoded on a physical storage medium, the embedded information being carried in a code that is machine readable when exposed to visible, UV or infrared illumination; and using the embedded information to enable use or transfer of software or media content stored on the medium.
  • 18. The method of claim 17 wherein the embedded information is carried in a watermark on the physical storage medium.
  • 19. The method of claim 18 wherein the physical storage medium comprises an optical disk.
  • 20. The method of claim 19 wherein the watermark is embedded on the disk by altering the surface microtopology on the disk to carry machine readable information.
  • 21. The method of claim 17 wherein the embedded information is compared with information on the storage medium to enable use or transfer of software or media content stored on the medium.
  • 22. The method of claim 21 wherein the embedded information is carried in a watermark on the physical storage medium.
  • 23. The method of claim 22 wherein the watermark is embedded on the storage medium by altering the surface microtopology on the storage medium to carry machine readable information.
  • 24. The method of claim 17 wherein the embedded information is used to form a key for decrypting software or media content stored on the medium.
  • 25. The method of claim 24 wherein the embedded information is carried in a watermark on the physical storage medium.
  • 26. The method of claim 25 wherein the watermark is embedded on the storage medium by altering the surface microtopology on the storage medium to carry machine readable information.
  • 27. A product including:security data steganographically embedded into the product; the product being assigned a product identifier that is related to the security data such that authenticity of the product is evaluated by comparing the security data decoded from the product with the product identifier; wherein the security data is carried in a digital watermark that is machine readable when illuminated by non-visible wavelengths; and wherein successful authentication of the product based on comparing the security data with the product identifier enables use or transfer of software or content associated with the product.
  • 28. The product of claim 27 wherein the product comprises a physical storage medium and the software or content is stored on the physical storage medium.
  • 29. The product of claim 28 wherein the security data is used to form a key for decrypting software or content stored on the storage medium.
RELATED APPLICATION DATA

The subject matter of the present application is related to that disclosed in U.S. Pat. No. 5,862,260, and in co-pending application Ser. No. 09/503,881, filed Feb. 14, 2000; which are hereby incorporated by reference.

US Referenced Citations (350)
Number Name Date Kind
3493674 Houghton Feb 1970 A
3569619 Simijian Mar 1971 A
3576369 Wick et al. Apr 1971 A
3585290 Sanford Jun 1971 A
3655162 Yamamoto et al. Apr 1972 A
3703628 Philipson, Jr. Nov 1972 A
3809806 Walker et al. May 1974 A
3838444 Loughlin et al. Sep 1974 A
3914877 Hines Oct 1975 A
3922074 Ikegami et al Nov 1975 A
3971917 Maddox et al. Jul 1976 A
3977785 Harris Aug 1976 A
3982064 Barnaby Sep 1976 A
3984624 Waggener Oct 1976 A
4025851 Haselwood et al. May 1977 A
4184700 Greenaway Jan 1980 A
4225967 Miwa et al. Sep 1980 A
4230990 Lert, Jr. et al. Oct 1980 A
4231113 Blasbalg Oct 1980 A
4238849 Gassmann Dec 1980 A
4252995 Schmidt et al. Feb 1981 A
4262329 Bright et al. Apr 1981 A
4313197 Maxemchuk Jan 1982 A
4367488 Leventer et al. Jan 1983 A
4379947 Warner Apr 1983 A
4380027 Leventer et al. Apr 1983 A
4389671 Posner et al. Jun 1983 A
4395600 Lundy et al. Jul 1983 A
4416001 Ackerman et al. Nov 1983 A
4423415 Goldman Dec 1983 A
4425642 Moses et al. Jan 1984 A
4476468 Goldman Oct 1984 A
4528588 Löfberg Jul 1985 A
4532508 Ruell Jul 1985 A
4547804 Greenberg Oct 1985 A
4553261 Froessl Nov 1985 A
4590366 Rothfjell May 1986 A
4595950 Lofberg Jun 1986 A
4637051 Clark Jan 1987 A
4639779 Greenberg Jan 1987 A
4647974 Butler et al. Mar 1987 A
4654867 Labedz et al. Mar 1987 A
4660221 Dlugos Apr 1987 A
4663518 Borror et al. May 1987 A
4665431 Cooper May 1987 A
4672605 Hustig et al. Jun 1987 A
4675746 Tetrick et al. Jun 1987 A
4677435 D'Agraives et al. Jun 1987 A
4682794 Margolin Jul 1987 A
4703476 Howard Oct 1987 A
4712103 Gotanda Dec 1987 A
4718106 Weinblatt Jan 1988 A
4723149 Harada Feb 1988 A
4739377 Allen Apr 1988 A
4750173 Blüthgen Jun 1988 A
4765656 Becker et al. Aug 1988 A
4775901 Nakano Oct 1988 A
4776013 Kafri et al. Oct 1988 A
4805020 Greenberg Feb 1989 A
4807031 Broughton et al. Feb 1989 A
4811357 Betts et al. Mar 1989 A
4811408 Goldman Mar 1989 A
4820912 Samyn Apr 1989 A
4835517 van der Gracht et al. May 1989 A
4855827 Best Aug 1989 A
4864618 Wright et al. Sep 1989 A
4866771 Bain Sep 1989 A
4874936 Chandler et al. Oct 1989 A
4876617 Best et al. Oct 1989 A
4879747 Leighton et al. Nov 1989 A
4884139 Pommier Nov 1989 A
4885632 Mabey et al. Dec 1989 A
4888798 Earnest Dec 1989 A
4903301 Kondo et al. Feb 1990 A
4908836 Rushforth et al. Mar 1990 A
4908873 Philibert et al. Mar 1990 A
4918484 Ujiie et al. Apr 1990 A
4920503 Cook Apr 1990 A
4921278 Shiang et al. May 1990 A
4939515 Adelson Jul 1990 A
4941150 Iwasaki Jul 1990 A
4943973 Werner Jul 1990 A
4943976 Ishigaki Jul 1990 A
4944036 Hyatt Jul 1990 A
4947028 Gorog Aug 1990 A
4963998 Maufe Oct 1990 A
4965827 McDonald Oct 1990 A
4967273 Greenberg Oct 1990 A
4969041 O'Grady et al. Nov 1990 A
4972471 Gross et al. Nov 1990 A
4972475 Sant'Anselmo Nov 1990 A
4972476 Nathans Nov 1990 A
4977594 Shear Dec 1990 A
4979210 Nagata et al. Dec 1990 A
4996530 Hilton Feb 1991 A
5003590 Lechner et al. Mar 1991 A
5010405 Schreiber et al. Apr 1991 A
5023907 Johnson et al. Jun 1991 A
5027401 Soltesz Jun 1991 A
5034982 Heninger et al. Jul 1991 A
5036513 Greenblatt Jul 1991 A
5053956 Donald Oct 1991 A
5063446 Gibson Nov 1991 A
5073899 Collier et al. Dec 1991 A
5073925 Nagata et al. Dec 1991 A
5075773 Pullen et al. Dec 1991 A
5077608 Dubner Dec 1991 A
5077795 Rourke et al. Dec 1991 A
5079648 Maufe Jan 1992 A
5091966 Bloomberg et al. Feb 1992 A
5095196 Miyata Mar 1992 A
5103459 Gilhousen et al. Apr 1992 A
5113437 Best et al. May 1992 A
5113445 Wang May 1992 A
5128525 Stearns et al. Jul 1992 A
5144660 Rose Sep 1992 A
5146457 Veldhuis et al. Sep 1992 A
5148498 Resnikoff et al. Sep 1992 A
5150409 Elsner Sep 1992 A
5161210 Druyvesteyn et al. Nov 1992 A
5166676 Milheiser Nov 1992 A
5168147 Bloomberg Dec 1992 A
5181786 Hujink Jan 1993 A
5185736 Tyrrell et al. Feb 1993 A
5199081 Saito et al. Mar 1993 A
5200822 Bronfin et al. Apr 1993 A
5212551 Conanan May 1993 A
5213337 Sherman May 1993 A
5228056 Schilling Jul 1993 A
5243411 Shirochi et al. Sep 1993 A
5243423 DeJean et al. Sep 1993 A
5245165 Zhang Sep 1993 A
5245329 Gokcebay Sep 1993 A
5247364 Banker et al. Sep 1993 A
5253078 Balkanski et al. Oct 1993 A
5257119 Funada et al. Oct 1993 A
5259025 Monroe Nov 1993 A
5267334 Normille et al. Nov 1993 A
5280537 Sugiyama et al. Jan 1994 A
5288976 Citron Feb 1994 A
5293399 Hefti Mar 1994 A
5295203 Krause et al. Mar 1994 A
5299019 Pack et al. Mar 1994 A
5305400 Butera Apr 1994 A
5315098 Tow May 1994 A
5319453 Copriviza et al. Jun 1994 A
5319724 Blonstein et al. Jun 1994 A
5319735 Preuss et al. Jun 1994 A
5325167 Melen Jun 1994 A
5327237 Gerdes et al. Jul 1994 A
5337362 Gormish et al. Aug 1994 A
5349655 Mann Sep 1994 A
5351302 Leighton et al. Sep 1994 A
5354097 Tel Oct 1994 A
5371792 Asai et al. Dec 1994 A
5374976 Spannenburg Dec 1994 A
5379345 Greenberg Jan 1995 A
5387941 Montgomery et al. Feb 1995 A
5394274 Kahn Feb 1995 A
5396559 McGrew Mar 1995 A
5398283 Virga Mar 1995 A
5404160 Schober et al. Apr 1995 A
5404377 Moses Apr 1995 A
5408542 Callahan Apr 1995 A
5416307 Danek et al. May 1995 A
5418853 Kanota et al. May 1995 A
5422963 Chen et al. Jun 1995 A
5422995 Aoki et al. Jun 1995 A
5425100 Thomas et al. Jun 1995 A
5428606 Moskowitz Jun 1995 A
5428607 Hiller et al. Jun 1995 A
5428731 Powers Jun 1995 A
5432542 Thibadeau et al. Jul 1995 A
5432870 Schwartz Jul 1995 A
5442433 Hoshino et al. Aug 1995 A
5446488 Vogel Aug 1995 A
5450122 Keene Sep 1995 A
5450490 Jensen et al. Sep 1995 A
5461426 Limberg et al. Oct 1995 A
5463209 Figh Oct 1995 A
5469222 Sprague Nov 1995 A
5469506 Berson et al. Nov 1995 A
5473631 Moses Dec 1995 A
5479168 Johnson et al. Dec 1995 A
5481294 Thomas et al. Jan 1996 A
5488664 Shamir Jan 1996 A
5493677 Balogh Feb 1996 A
5495581 Tsai Feb 1996 A
5496071 Walsh Mar 1996 A
5499294 Friedman Mar 1996 A
5502576 Ramsay et al. Mar 1996 A
5515081 Vasilik May 1996 A
5521722 Colvill et al. May 1996 A
5524933 Kunt et al. Jun 1996 A
5530751 Morris Jun 1996 A
5530759 Braudaway et al. Jun 1996 A
5530852 Meske, Jr. et al. Jun 1996 A
5532920 Hartrick et al. Jul 1996 A
5537223 Curry Jul 1996 A
5539471 Myhrvold et al. Jul 1996 A
5539735 Moskowitz Jul 1996 A
5541662 Adams et al. Jul 1996 A
5544255 Smithies et al. Aug 1996 A
5548646 Aziz et al. Aug 1996 A
5557333 Jungo et al. Sep 1996 A
5559559 Jungo et al. Sep 1996 A
5568179 Diehl et al. Oct 1996 A
5568550 Ur Oct 1996 A
5568570 Rabbani Oct 1996 A
5572010 Petrie Nov 1996 A
5572247 Montgomery et al. Nov 1996 A
5576532 Hecht Nov 1996 A
5579124 Aijala et al. Nov 1996 A
5582103 Tanaka et al. Dec 1996 A
5587743 Montgomery et al. Dec 1996 A
5590197 Chen et al. Dec 1996 A
5594226 Steger Jan 1997 A
5598526 Daniel et al. Jan 1997 A
5602920 Bestler et al. Feb 1997 A
5606609 Houser et al. Feb 1997 A
5611575 Petrie Mar 1997 A
5613004 Cooperman et al. Mar 1997 A
5613012 Hoffman et al. Mar 1997 A
5614940 Cobbley et al. Mar 1997 A
5617119 Briggs et al. Apr 1997 A
5617148 Montgomery Apr 1997 A
5629770 Brassil et al. May 1997 A
5629980 Stefik et al. May 1997 A
5636292 Rhoads Jun 1997 A
5638443 Stefik et al. Jun 1997 A
5638446 Rubin Jun 1997 A
5640193 Wellner Jun 1997 A
5646999 Saito Jul 1997 A
5652626 Kawakami et al. Jul 1997 A
5659164 Schmid et al. Aug 1997 A
5661574 Kawana Aug 1997 A
5663766 Sizer, II Sep 1997 A
5664018 Leighton Sep 1997 A
5665951 Newman et al. Sep 1997 A
5666487 Goodman et al. Sep 1997 A
5668636 Beach et al. Sep 1997 A
5671282 Wolff et al. Sep 1997 A
5673316 Auerbach et al. Sep 1997 A
5687236 Moskowitz et al. Nov 1997 A
5710636 Curry Jan 1998 A
5719939 Tel Feb 1998 A
5721788 Powell et al. Feb 1998 A
5727092 Sandford, II et al. Mar 1998 A
5735547 Morelle et al. Apr 1998 A
5740244 Indeck et al. Apr 1998 A
5742845 Wagner Apr 1998 A
5745604 Rhoads Apr 1998 A
5761686 Bloomberg Jun 1998 A
5768426 Rhoads Jun 1998 A
5778102 Sandford, II et al. Jul 1998 A
5790693 Graves et al. Aug 1998 A
5790697 Munro et al. Aug 1998 A
5804803 Cragun et al. Sep 1998 A
5809160 Powell et al. Sep 1998 A
5809317 Kogan et al. Sep 1998 A
5817205 Kaule Oct 1998 A
5818441 Throckmorton et al. Oct 1998 A
5819289 Sanford, II et al. Oct 1998 A
5825871 Mark Oct 1998 A
5825892 Braudaway et al. Oct 1998 A
5838458 Tsai Nov 1998 A
5841886 Rhoads Nov 1998 A
5841978 Rhoads Nov 1998 A
5848144 Ahrens Dec 1998 A
5848413 Wolff Dec 1998 A
5852673 Young Dec 1998 A
5857038 Owada et al. Jan 1999 A
5862218 Steinberg Jan 1999 A
5862260 Rhoads Jan 1999 A
5869819 Knowles et al. Feb 1999 A
5871615 Harris Feb 1999 A
5872589 Morales Feb 1999 A
5875249 Mintzer et al. Feb 1999 A
5892900 Ginter et al. Apr 1999 A
5893101 Balogh et al. Apr 1999 A
5898779 Squilla et al. Apr 1999 A
5900608 Iida May 1999 A
5902353 Reber et al. May 1999 A
5903729 Reber et al. May 1999 A
5905248 Russell et al. May 1999 A
5905251 Knowles May 1999 A
5905810 Jones et al. May 1999 A
5905819 Daly May 1999 A
5913210 Call Jun 1999 A
5915027 Cox et al. Jun 1999 A
5930767 Reber et al. Jul 1999 A
5932863 Rathus et al. Aug 1999 A
5933798 Linnartz Aug 1999 A
5933829 Durst et al. Aug 1999 A
5938726 Reber et al. Aug 1999 A
5938727 Ikeda Aug 1999 A
5939695 Nelson Aug 1999 A
5940595 Reber et al. Aug 1999 A
5943422 Van Wie et al. Aug 1999 A
5949055 Fleet et al. Sep 1999 A
5950173 Perkowski Sep 1999 A
5963916 Kaplan Oct 1999 A
5971277 Cragun et al. Oct 1999 A
5974141 Saito Oct 1999 A
5974150 Kaish et al. Oct 1999 A
5974548 Adams Oct 1999 A
5978773 Hudetz et al. Nov 1999 A
5979757 Tracy et al. Nov 1999 A
5983218 Syeda-Mahmoo Nov 1999 A
5991426 Cox et al. Nov 1999 A
5995625 Sudia et al. Nov 1999 A
6005501 Wolosewicz Dec 1999 A
6021196 Sandford et al. Feb 2000 A
6024287 Takai et al. Feb 2000 A
6035177 Moses et al. Mar 2000 A
6052486 Knowlton et al. Apr 2000 A
6064764 Bhaskaran et al. May 2000 A
6122403 Rhoads Sep 2000 A
6166750 Negishi Dec 2000 A
6185683 Ginter et al. Feb 2001 B1
6188787 Ohmae et al. Feb 2001 B1
6208746 Musgrave Mar 2001 B1
6243480 Zhao et al. Jun 2001 B1
6246777 Agarwal et al. Jun 2001 B1
6266430 Rhoads Jul 2001 B1
6282654 Ikeda et al. Aug 2001 B1
6301360 Bocionek et al. Oct 2001 B1
6311214 Rhoads Oct 2001 B1
6321648 Berson et al. Nov 2001 B1
6321981 Ray et al. Nov 2001 B1
6324573 Rhoads Nov 2001 B1
6332031 Rhoads et al. Dec 2001 B1
6343204 Yang Jan 2002 B1
6345104 Rhoads Feb 2002 B1
6359985 Koch et al. Mar 2002 B1
6389151 Carr et al. May 2002 B1
20010017709 Murakami et al. Aug 2001 A1
20010021144 Oshima et al. Sep 2001 A1
20010024510 Iwamura Sep 2001 A1
20010026629 Oki Oct 2001 A1
20010030759 Hayashi et al. Oct 2001 A1
20010037455 Lawandy et al. Nov 2001 A1
20010049662 Linnartz et al. Dec 2001 A1
20010053299 Matsunoshita et al. Dec 2001 A1
20010054144 Epstein et al. Dec 2001 A1
20010055258 Carson et al. Dec 2001 A1
20020001095 Kawakami et al. Jan 2002 A1
20020003891 Hoshino Jan 2002 A1
20020018228 Torigoe Feb 2002 A1
20020051237 Ohara May 2002 A1
Foreign Referenced Citations (55)
Number Date Country
2235002 Dec 1998 CA
3806411 Sep 1989 DE
19521969 Feb 1997 DE
366381 Oct 1989 EP
372 601 Jun 1990 EP
411 232 Feb 1991 EP
418 964 Mar 1991 EP
441 702 Aug 1991 EP
493 091 Jul 1992 EP
058 482 Aug 1992 EP
551 016 Jul 1993 EP
581 317 Feb 1994 EP
605 208 Jul 1994 EP
649 074 Apr 1995 EP
705 025 Apr 1996 EP
711061 May 1996 EP
0789480 Aug 1997 EP
872995 Oct 1998 EP
0642060 Apr 1999 EP
991047 Apr 2000 EP
1122939 Aug 2001 EP
1158514 Nov 2001 EP
2063018 May 1981 GB
2067871 Jul 1981 GB
2196167 Apr 1988 GB
2204984 Nov 1988 GB
4-248771 Feb 1992 JP
5242217 Sep 1993 JP
8-30759 Feb 1996 JP
WO 8908915 Sep 1989 WO
WO 9325038 Dec 1993 WO
WO9427228 Nov 1994 WO
WO9504665 Feb 1995 WO
WO9510813 Apr 1995 WO
WO 9510835 Apr 1995 WO
WO 9514289 May 1995 WO
WO 9520291 Jul 1995 WO
WO9603286 Feb 1996 WO
WO 9626494 Aug 1996 WO
WO 9627259 Sep 1996 WO
WO 96 36163 Nov 1996 WO
WO9740619 Oct 1997 WO
WO9743736 Nov 1997 WO
WO9814887 Apr 1998 WO
WO9820642 May 1998 WO
WO9824050 Jul 1998 WO
WO9840823 Sep 1998 WO
WO9849813 Nov 1998 WO
WO9934277 Jul 1999 WO
WO9936876 Jul 1999 WO
WO0044131 Jul 2000 WO
WO0062258 Oct 2000 WO
WO 0108405 Feb 2001 WO
WO 0180169 Oct 2001 WO
WO0203328 Jan 2002 WO
Non-Patent Literature Citations (140)
Entry
Amano et al., “A Feature Calibration Method for Watermarking of Document Images”, ICDAR 1999, pp. 91-94.*
Szepanski, “A Signal Theoretic Method for Creating Forgery-Proof Documents for Automatic Verification,” Proceedings 1979 Carnahan Conference on Crime Countermeasures, May 16, 1979, pp. 101-109.
Dautzenberg, “Watermarking Images,” Department of Microelectronics and Electrical Engineering, Trinity College Dublin, 47 pages, Oct. 1994.
Szepanski, “Additive Binary Data Transmission for Video Signals,” Conference of the Communications Engineering Society, 1980, NTG Technical Reports, vol. 74, pp. 343-351. (German text and English translation enclosed).
Audio Watermarking Architectures for Secure Digital Music Distribution, A Proposal to the SDMI Portable Devices Working Group by ARIS Technologies, Inc, Mar. 26, 1999, pp. 1-11.
Audio Watermarking Architectures for Persistent Protection, Presentation to SDMI PDWG, Mar. 29, 1999, J. Winograd, Aris Technologies, pp. 1-16.
Audio Watermarking System to Screen Digital Audio Content for LCM Acceptance, A Proposal Submitted in Response to PDWG990050504—Transition CfP by ARIS Technologies, Inc., May 23, 1999, Document Version 1.0, 15 pages.
Boland et al., “Watermarking Digital Images for Copyright Protection”, Fifth Int'l Conference on Image Processing and it's Application, Jul. 1995, pp. 326-330.
Levy, “AIPL's Proposal for SDMI: An Underlying Security System” (slide presentation), Mar. 29, 1999, 23 slides.
Microsoft Response to CfP for Technology Solutions to Screen Digital Audio Content for LCM Acceptance, SDMI, PDWG Tokyo, May 23, 1999, 9 pages.
Response to CfP for Technology Solutions to Screen Digital Audio Content for LCM Acceptance, NTT Waveless Radio Consotium, May 23, 1999, 9 pages.
Sandford II et al., “The Data Embedding Method”, Processing of the SPIE vol. 2615, pp. 226-259, 1996.
Thomas, Keith, Screening Technology for Content from Compact Discs, May 24, 1999, 11 pages.
Tirkel et al., “Electronic Water Mark,” Dicta-93, Marquarie University, Sydney, Australia, Dec., 1993, pp. 666-672.
Vidal et al., “Non-Noticeable Information Embedding in Color Images: Marking and Detection”, IEEE 1999, pp. 293-297.
Wolfgang et al., “A Watermark for Digital Images,” Computer Vision and Image Processing Laboratory, Purdue University, Sep. 1996, pp. 219-222.
U.S. patent application Ser. No. 60/071,983, Levy, filed Jan. 20, 1998.
U.S. patent application Ser. No. 09/404,291, Levy, filed Sep. 23, 1999.
U.S. patent application Ser. No. 60/114,725, Levy, filed Dec. 31, 1998.
U.S. patent application Ser. No. 09/234,780, Rhoads et al., filed Jan. 20, 1999.
U.S. patent application Ser. No. 60/116,641, Cookson, filed Jan. 21, 1999.
U.S. patent application Ser. No. 09/478,713, Cookson, filed Jan. 6, 2000.
Cookson, Chris, General Principles of Music Uses on Portable Devices, presented to SDMI, Mar. 5, 1999.
Winograd, J.M., “Audio Watermarking Architecture for Secure Digital Music Distribution,” a Proposal to the SDMI Portable Devices Working Group, by Aris Technologies, Inc., Mar. 26, 1999.
Mintzer et al., “Safeguarding Digital Library Contents and Users: Digital Watermarking,” D-Lib Magazine, Dec. 1997, 12 pages.
Tirkel et al., “Electronic Water Mark,” DICTA-93, Macquarie University, Sydney, Australia, Dec., 1993, pp. 666-673.
Weber et al., “Correlative Image Registration,” Seminars in Nuclear Medicine, vol XXIV, No. 4, Oct., 1994, pp. 311-323.
Brassil et al., Electronic Marking and Identification Techniques to Discourage Document Copying, Proceedings of the INFOCOM '94 Conference on Computer, IEEE Commun. Soc Conference, Jun. 12-16, 1994, 1278-1287.
Bruckstein, A.M.; Richardson, T.J., A holographic transform domain image watermarking method, Circuits, Systems, and Signal Processing vol. 17, No. 3, p. 361-89, 1998. This paper includes an appendix containing an internal memo of Bell Labs, which according to the authors of the paper, was dated Sep. 1994.
“High Water FBI Limited Presentation Image Copyright Protection Software,” FBI Ltd brochure, Jul., 1995, 17 pages.
Koch et al., “Copyright Protection for Multimedia Data,” Fraunhofer Institute for Computer Graphics, Dec. 16, 1994, 15 pages.
Koch et al., “Towards Robust and Hidden Image Copyright Labeling,” Proc. of 1995 IEEE Workshop on Nonlinear Signal and Image Processing, Jun. 20-22, 1995, 4 pages.
Kurak et al., “A Cautionary Note On Image Downgrading,” 1992 IEEE, pp. 153-159.
Mintzer et al., “Safeguarding Digital library Contents and Users” Digital Watermarking, D-Lib Magazine, Dec. 1997: ISSN 1082-9873.
Rindfrey, “Towards an Equitable System for Access Control and Copyright Protection in Broadcast Image Services: The Equicrypt Approach,” Intellectual Property Rights and New Technologies, Proc. of the Conference, R. Oldenbourg Verlag Wien Munchen 1995, 12 pages.
Schreiber et al., “A Compatible High-Definition Television System Using the Noise-Margin Method of Hiding Enhancement Information,” SMPTE Journal, Dec. 1989, pp. 873-879.
SDMI Example Use Scenarios (Non-Exhaustive), Version 1.2, Jun. 16, 1999.
Szepanski, “A Signal Theoretic Method for Creating Forgery-Proof Documents for Automatic Verification,” Proceedings 1979 Carnahan Conference on Crime Countermeasures, May 16, 1979, pp. 101-109.
Szepanski, “Additive Binary Data Transmission for Video Signals,” Papers Presented at Conf. Of Comm. Engineering Soc. Sep. 30-Oct. 3, 1980, Technical Reports vol. 74, pp. 342-352.
Tanaka et al., “A Visual Retrieval System with Private Information for Image Database,” Proceeding International Conference on DSP Applications and Technology, Oct. 1991, pp. 415-421.
Tanaka et al., “New Integrated Coding Schemes for Computer-Aided Facsimile,” Proc. IEEE Int'l Conf. on Sys. Integration, Apr. 1990, pp. 275-281.
U.S. patent application Ser. No. 60/000,442, Hudetz, filed Jun. 6, 1995.
U.S. patent application Ser. No. 60/082,228, Rhoads, filed Apr. 16, 1998.
U.S. patent application Ser. No. 60/141,763, Davis, filed Jun. 30, 1999.
U.S. patent application Ser. No. 60/158,015, Davis et al., filed Oct. 6, 1999.
U.S. patent application Ser. No. 09/314,648, Rodriguez et al., filed May 19, 1999.
U.S. patent application Ser. No. 60/198,138, Alattar, filed Apr. 17, 2000.
U.S. patent application Ser. No. 60/198,849, Carr et al., filed Apr. 21, 2000.
U.S. patent application Ser. No. 09/198,022, Rhoads, filed Nov. 23, 1998.
U.S. patent application Ser. No. 09/498,223, Rhoads et al., filed Feb. 3, 2000.
U.S. patent application Ser. No. 09/525,865, Davis et al., filed Mar. 15, 2000.
U.S. patent application Ser. No. 09/571,422, Rhoads et al., filed May 15, 2000.
U.S. patent application Ser. No. 09/585,678, Ellingson, filed Jun. 1, 2000.
“Access Control and COpyright Protection for Images, WorkPackage 8: Watermarking,” Jun. 30, 1995, 46 pages.
“Access Control and COpyright Protection for Images, WorkPackage 3: Evaluation of Existing Systems,” Apr. 19, 1995, 68 pages.
“Access Control and COpyright Protection for Images, WorkPackage 1: Access Control and Copyright Protection for Images Need Evaluation,” Jun., 1995, 21 pages.
“Access Control and COpyright Protection for Images, Conditional Access and Copyright Protection Based on the Use of Trusted Third Parties,” 1995, 43 pages.
Arachelian, “White Noise Storm,” Apr. 11, 1994, Internet reference, 13 pages.
Arazi, et al., “Intuition, Perception, and Secure Communication,” IEEE Transactionson Systems, Man, and Cybernetics, vol. 19, No. 5, Sep./Oct. 1989, pp. 1016-1020.
Arthur, “Digital Fingerprints Protect Artwork,” New Scientist, Nov. 12, 1994, p. 24.
Aura, “Invisible Communication,” Helsinki University of Technology, Digital Systems Laboratory, Nov. 5, 1995, 13 pages.
Bender et al, “Techniques for Data Hiding,” Draft Preprint, Private Correspondence, dated Oct. 30, 1995.
Bender et al., “Techniques for Data Hiding,” Massachusetts Institute of Technology, Media Laboratory, Jan. 1995, 10 pages.
Boneh, “Collusion-Secure Fingerprinting for Digital Data,” Department of Computer Science, Princeton University, 1995, 31 pages.
Boney et al., “Digital Watermarks for Audio Signals,” Proceedings of Multimedia '96, 1996 IEEE, pp. 473-480.
Boucqueau et al., Equitable Conditional Access and Copyright Protection for Image Based on Trusted Third Parties, Teleservices & Multimedia Communications, 2nd Int. Cost 237 Workshop, Second International Cost 237 Workshop, Nov., 1995; published 1996, pp. 229-243.
Brassil et al., “Hiding Information in Document Images,” Nov., 1995, 7 pages.
Brown, “S-Tools for Windows, Version 1.00, .COPYRGT. 1994 Andy Brown, What is Steganography,” Internet reference, Mar. 6, 1994, 6 pages.
Bruyndonckx et al., Neural Network Post-Processing of Coded Images Using Perceptual Masking, 1994, 3 pages.
Bruyndonckx et al., “Spatial Method for Copyright Labeling of Digital Images,” 1994, 6 pages.
Burgett et al., “A Novel Method for Copyright Labeling Digitized Image Data,” requested by e-mail from author (unavailable/password protected on IGD WWW site); received Sep. 18, 1995, 12 pages.
Caronni, “Assuring Ownership Rights for Digital Images,” Published in the Proceedings of Reliable IT Systems, VIS '95, HH. Bruggemann and W. Gerhardt-Hackl (Ed.), Vieweg Publishing Company, Germany, 1995, Jun. 14, 1994, 10 pages.
Caruso, “Digital Commerce, 2 plans for watermarks, which can bind proof of authorship to electronic works.” New York Times, Aug. 7, 1995, one page.
Castro et al., “Registration of Translated and Rotated Images Using Finite Fourier Transforms,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-9, No. 5, Sep. 1987, pp. 700-703.
Choudhury, et al., “Copyright Protection for Electronic Publishing over Computer Networks,” IEEE Network Magazine, Jun. 1994, 18 pages.
Clarke, “Invisible Code Tags Electronic Images,” Electronic Engineering Times, Jun. 12, 1995, n. 852, p. 42.
“Copyright Protection for Digital Images, Digital Fingerprinting from FBI,” Highwater FBI brochure, 1995, 4 pages.
“The Copyright Can of Worms Opened Up By The New Electronic Media,” Computergram Internations, pCGN07170006, Jul. 17, 1995 and “The Copyright Can of Worms Opened Up By the New Electronic Media—2,” Computergram Internations, pCGN07210008, Jul. 21, 1995, 3 pages total.
Cox et al., “Secure Spread Spectrum Watermarking for Multimedia,” NEC Research Institute Technical Report, Dec. 5, 1995, 33 pages.
Cox et al., “A Secure, Imperceptable Yet Perceptually Salient, Spread Spectrum Watermark for Multimedia,” IEEE, Southcon/96, Conference Record, pp. 192-197, 1996.
“Cyphertech Systems: Introduces Digital Encoding Device to Prevent TV Piracy,” Hollywood Reporter, Oct. 20, 1993, p. 23.
Delaigle et al., “Digital Watermarking,” Proc. SPIE—Int. Soc. Opt. Eng., vol. 2659, pp. 99-110, 1996.
Delaigle et al., “A Psychovisual Approach for Digital Picture Watermarking,” 1995, 20 pages.
DICE Digital Watermark System, Q&A, Dec., 1995, 12 pages.
Digimarc presentation at RSA Conference, approximately Jan. 17, 1996, 4 pages.
Fimmerstad, “The Virtual Art Museum,” Ericsson Connexion, Dec., 1995, pp. 29-31.
Fitzgerald, “Invisible Digital Copyright ID,” Editor & Publisher, Jun. 25, 1994, p. 62.
“Foiling Card Forgers With Magnetic Noise,” Wall Street Journal, Feb. 8, 1994.
Frequently Asked Questions About Digimarc Signature Technology, Aug. 1, 1995, HTTP:WWW.DIGIMARC.COM, 9 pages.
Friedman, “The Trustworthy Digital Camera: Restoring Credibility to the Photographic Image,” IEEE Transactions on Consumer Electronics, vol. 39, No. 4, Nov., 1993, pp. 905-910.
Gabor, et al., “Theory of Communication,” J. Inst. Elect. Eng. 93, 1946, pp. 429-441.
Hartung et al., Digital Watermarking of Raw and Compressed Video, Proc. SPIE 2952, Digital Compression Technologies and Systems for Video Communications, Oct., 1996, pp 205-213.
Hecht, “Embedded Data Glyph Technology for Hardcopy Digital Documents,” SPIE vol. 2171, Feb. 1994, pp. 341-352.
“Holographic signatures for digital images,” The Seybold Report on Desktop Publishing, Aug. 1995, one page.
Humphrey, “Stamping Out Crime,” Hollywood Reporter, Jan. 26, 1994, p. S48.
Jain, “Image Coding Via a Nearest Neighbors Image Model,” IEEE Transactions on Communications, vol. COM-23, No. 3, Mar. 1975, pp. 318-331.
Johhnson, “Steganography,” Dec. 10, 1995, 32 pages.
JPEG Group's JPEG Software (release 4), FTP.CSUA.BEREKELEY.EDU/PUB/CYPHERPUNKS/APPLICATIONS/JSTEG/JPEG.ANNOUNCEMENT.GZ.
Kassam, Signal Detection in Non-Gaussian Noise, Dowden & Culver, 1988, pp. 1-96.
Koch et al., “Digital Copyright Labeling: Providing Evidence of Misuse and Tracking Unauthorized Distribution of Copyrighted Materials,” Oasis Magazine, Dec. 1995, 3 pages.
Luc, “Analysis of Spread Spectrum System Parameters for Design of Hidden Transmission,” Radioengineering, vol. 4, No. 2, Jun. 1995, pp. 26-29.
Machado, “Announcing Stego 1.0a2, The First Steganography Tool for the Macintosh,” Internet reference, Nov. 28, 1993, 3 pages.
Macq, “Cryptology for Digital TV Broadcasting,” Proceedings of the IEEE, vol. 83, No. 6, Jun. 1995, pp. 944-957.
Matthews, “When Seeing is Not Believing,” New Scientist, Oct. 16, 1993, pp. 13-15.
Matsui et al., “Video-Steganography: How to Secretly Embed a Signature in a Picture,” IMA Intellectual Property Project Proceedings, Jan. 1994, vol. 1, Issue 1, pp. 187-205.
Mintzer et al., “Toward on-line, Worldwide Access to Vatican Library Materials,” IBM J. Res. Develop. vol. 40 No. 2, Mar., 1996, pp. 139-162.
Moller, et al., “Rechnergestutzte Steganographie: Wie sie Funktioniert und warum folglich jede Reglementierung von Verschlusselung unsinnig ist,” DuD, Datenschutz und Datensicherung, Jun. 18, 1994 318-326.
“NAB—Cyphertech Starts Anti-Piracy Broadcast Tests,” Newsbytes, NEW03230023, Mar. 23, 1994.
Nakamura et al., “A Unified Coding Method of Image and Text Data Using Discrete Orthogonal Transform,” Systems and Computers in Japan, vol. 21, No. 3, 1990, pp. 87-92.
Nakamura et al., “A Unified Coding Method of Dithered Image and Text Data Using Micropatterns,” Electronics and Communications in Japan, Part 1, vol. 72, No. 4, 1989, pp. 50-56.
New Product Information, “FBI at AppleExpo” (Olympia, London), Nov., 1995, 2 pages.
Ohnishi et al., Embedding a Seal into a Picture Under Orthogonal Wavelet Transform, Proceedings of Multimedia '96, 1996, IEEE, pp. 514-421.
ORuanaidh et al, “Watermarking Digital Images for Copyright Protection,” http://www.kalman.mee.tcd.ie/people/jjr/eva.sub.—pap.html, Feb. 2, 1996, 8 pages. (Also published Aug., 1996, IEE Proceedings-Vision, Image and Signal Processing, vol. 143, No. 4, pp. 250-256.).
Pennebaker et al., JPEG Still Image Data Compression Standard, Chapter 3, “Aspects of the Human Visual System,” pp. 23-27, 1993, Van Nostrand Reinhold, New York.
Pickholtz et al., “Theory of Spread-Spectrum Communications—A Tutorial,” Transactions on Communications, vol. COM-30, No. 5, May, 1982, pp. 855-884.
Pitas et al., “Applying Signatures on Digital Images,” IEEE Workshop on Nonlinear Image and Signal Processing, Neos Marmaras, Greece, pp. 460-463, Jun., 1995.
Port, “Halting Highway Robbery on the Internet,” Business Week, Oct. 17, 1994, p. 212.
Roberts, “Picture Coding Using Pseudorandom Noise,” IRE Trans. on Information Theory, vol. 8, No. 2, Feb., 1962, pp. 145-154.
Sapwater et al., “Electronic Copyright Protection,” Photo<Electronic Imaging, vol. 37, No. 6, 1994, pp. 16-21.
Schneier, “Digital Signatures, Cryptographic Algorithms Can Create Nonforgeable Signatures for Electronic Documents, Making Them Valid Legal Instruments” BYTE, Nov. 1993, pp. 309-312.
shaggy@phantom.com, “Hide and Seek v. 4.0,” Internet reference, Apr. 10, 1994, 3 pages.
Short, “Stepts Toward Unmasking Secure Communications,” International Journal of Bifurcation and Chaos, vol. 4, No. 4, 1994, pp. 959-977.
Simmons, “Subliminal Channels; Past and Present,” ETT, vol. 5, No. 4, Jul.-Aug. 1994, pp. 45-59.
Sheng et al., “Experiments on Pattern Recognition Using Invariant Fourier-Mellin Descriptors,” Journal of Optical Society of America, vol. 3, No. 6, 1986, pp. 771-776.
Sklar, “A Structured Overview of Digital Communications—a Tutorial Review—Part I,” IEEE Communications Magazine, Aug., 1983, pp. 1-17.
Sklar, “A Structured Overview of Digital Communications—a Tutorial Review—Part II,” IEEE Communications Magazine, Oct., 1983, pp. 6-21.
“Steganography,” Intellectual Property and the National Information Infrastructure The Report of the Working Group on Intellectual Property Rights, Sep. 1995, pp. 212-213.
Tanaka et al., “Embedding Secret Information Into a Dithered Multi-Level Image,” Proc. IEEE Military Comm. Conf., Sep. 1990, pp. 216-220.
Tanaka, “Embedding the Attribute Information Into a Dithered Image,” Systems and Computers in Japan, vol. 21, No. 7, 1990, pp. 43-50.
Tirkel et al., “A Two-Dimensional Digital Watermark,” 1995, 6 pages.
Toga et al., “Registration Revisted,” Journal of Neuroscience Methods, 48 (1993), pp. 1-13.
van Schyndel et al., “Towards a Robust Digital Watermark,” ACCV '95, vol. 2, Dec., 1995, pp. 504-508.
Wagner, “Fingerprinting,” 1983 IEEE, pp. 18-22.
Walton, “Image Authentication for a Slippery New Age,” Dr. Dobb's Journal, Apr. 1995, pp. 18-26, 82-87.
“Watermarking & Digital Signature: Protect Your Work!” Published on Internet 1996, http://Itswww.epfl.ch/.about.jordan/watermarking.html.
Wise, “The History of Copyright, Photographers' Rights Span Three Centuries,” Photo<Electronic Imaging, vol. 37, No. 6, 1994.
van Schyndel et al., “A Digital Watermark,” IEEE International Conference on Image Processing, Nov. 13-16, 1994, pp. 86-90.
Zhao et al., “Embedding Robust Labels Into Images for Copyright Protection,” Proc. of the International Congress on Intellectual Property Rights for Specialized Information, Knowledge and new Technologies (Vienna, Austria) Aug. 21-25, 1995, 10 pages.
Bender, “Applications for Data Hiding,” IBM Systems Journal, vol. 39, No. 3-4, pp. 547-68, 2000.
Gruhl et al., “Information Hiding to Foil the Casual Counterfeiter,” Proc. 2d Information Hiding Workshop, LNCS vol. 1525, pp. 1-15 (Apr. 15, 1998).