This application relates to the information processing arts. It finds particular application in the control of dissemination and use of copyrighted music and other recorded content through the use of device revocation lists, and will be described with particular reference thereto. However, the following will also find application more generally in controlling information transfer among networked devices, in providing improved property protection of music, video, software, data, and other information content, in combating proliferation of viruses and other malicious software code, and in other similar applications.
Revocation lists are known for controlling the spread of viruses, for limiting the distribution and use of copyright protection-disabling software, excluding devices that have been tampered with, and the like. Security protocols that employ revocation lists include the X.509 authentication structure and the DTCP (also known as 5C) IEEE1394 link security protocol. The revocation list identifies networked machines which are regarded as security risks or are otherwise undesirable. Networked devices receive the revocation list and henceforth refuse to communicate with devices identified on the revocation list. Preferably, the revocation list is updated or supplemented on an occasional basis to account for spreading viruses, newly identified problematic devices, or the like.
Revocation lists provide relatively straightforward and effective protection against computer viruses and other information content which is widely regarded as undesirable. Revocation lists are also employed to exclude a user from having access to certain network resources, or to exclude devices from joining a communication. In the computer environment, the users of networked devices generally are cooperative in receiving and storing the revocation lists and the occasional updates or supplements to the revocation lists.
However, in certain areas, especially in the areas of music and video copyright protection and other property protection schemes, a problem arises in using revocation lists to enforce such property rights. Certain users of networked devices who want to circumvent copyright or other property protection are unlikely to cooperate in receiving the revocation data. Rather, these users are likely to attempt to block distribution of revocation lists, or to attempt to delete revocation lists that are stored on networked devices. Moreover, even users who are indifferent or favorably disposed toward the revocation lists may not receive or retain them due to the activities of viruses or other malicious software which act to block transmission and/or storage of the revocation lists.
In the past, hostility and active opposition to revocation list distribution has been countered using various approaches. In one typical revocation list distribution method, when a connection between two devices is established, the network connection protocol calls for and requires communication and storage of the revocation list (if a new or updated revocation list is being distributed) before any other action is allowed. In this way, devices are forced to receive a revocation list. A device having received a revocation list will store it and subsequently refuse to communicate with devices on that revocation list.
However, such secured network transmission protocols are not immune to the countermeasures of hackers who continually work toward developing new techniques for overcoming these network protocol-based revocation list distribution techniques. Efforts of hackers may be successful when they can readily identify the revocation list in the data stream, and because the hackers (or users of devices which have been infected by a virus or other malicious program produced and distributed by a hacker) experience no adverse consequences when the revocation list is removed from the data stream.
The present invention contemplates an improved apparatus and method that overcomes the aforementioned limitations and others.
According to one aspect, an apparatus is disclosed, including a means for storing, transmitting, or receiving a signal representing user-desired content. The signal includes the user-desired content, and device revocation information embedded in the user-desired content.
According to another aspect, a method is provided for distributing revocation information. The revocation information is embedded into user-desired content.
One advantage resides in integrating a revocation list with content desired by the user. In this manner, the user is induced to accept the revocation list as part of the desired content.
Another advantage resides in its capacity for high rate systems to communicate large revocation lists which can contain identification information pertaining to a large number of devices.
Yet another advantage resides in distributing the revocation message over a large portion of musical content or other user-desired content. In this way, the user cannot avoid receiving the revocation message by omitting a small part of the musical or other user-desired content.
Numerous additional advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments.
The invention may take form in various components and arrangements of components, in software, and in various process operations and arrangements of process operations. The drawings are only for the purpose of illustrating preferred embodiments and are not to be construed as limiting the invention.
With reference to
The revocation list 4 can specify the device 3 in a variety of ways. The device 3 can be specifically revoked, that is, the device 3 is uniquely identified in the revocation list 4 as a revoked device. Alternatively, a model or manufacturer corresponding to the device 3 can be revoked. In yet another revocation arrangement, a content transfer protocol, pathway, or the like used to connect the device 3 with the devices 1, 2 can be revoked.
The device 1 communicates content 5 to the device 2. The communicated content 5 includes the revocation list 4 embedded in the content 5 in such a way that the embedded revocation list 4 is not easily removed from the content 5 or is removable only with substantial degradation of the content. Moreover, the revocation list 4 is preferably divided into sub-lists which are repeated throughout the length of content 5 so that the revocation list 4 is substantially received at the device 2 even if a small portion of the content 5 is discarded.
Subsequent to communication of the content 5, an attempt is made to initiate a transfer of content 6 from the device 2 to the device 3. However, the device 2 does not transfer content 6 in view of the updated revocation list 4 which the device 2 received in embedded form from the device 1 during transfer of content 5. The revocation list 4 identifies the device 3 as a revoked device (or identifies the device 3 as communicating with a revoked communication protocol or pathway, etc.), and so the device 2 does not communicate with the device 3.
Although audio content 5, 6 is described, the content can also be video content, data content, software, or the like. Moreover, the information can be represented or encoded in any suitable format, such as PCM, MPEG, AC3, DST, MLC, ATRAC, DivX, analog, or the like. The revocation list 4 can be embedded in the content in a suitable manner, such as by an embedded watermark, a designated audio or video channel, in a physical watermark, embedding in an analog signal, and so forth. The choice of revocation list embedding technique will depend on the type of content (audio, video, software, etc.), and the content format.
With reference to
A framing processor 14 frames the audio stream 10 into data frames for lossless encoding. Preferably, if the audio stream 10 includes a plurality of audio channels, each audio channel is separately framed by the framing processor 14. In one suitable embodiment, a constant frame length of 37,362 bits per frame is used. However, different frame lengths can be used to optimally balance encoding performance and other factors. For each frame output by the framing processor 14, an encoding parameters processor 16 computes suitable encoding parameters. In typical lossless encoding schemes, the encoding parameters processor 16 computes predictive parameters that are used in the encoding to approximate the frame contents. Various filtering processes are known in the art for generating a good set of predictive parameters. Such filtering is computationally intensive, and the encoding performance is not critically dependent upon using fully optimized predictive parameters. Hence, typically the encoding parameters processor 16 computes predictive parameter values that provide efficient, but not optimal encoding performance.
Because precisely optimized values of the predictive parameters is not critical, these parameters can be modified to encode watermark content 20 without substantially degrading the efficiency of the lossless encoding. The watermark content 20 includes at least the revocation list 4. Preferably, a sub-lists generator 18 divides the revocation list into sub-lists that are distributed through the watermark content 20, and hence are ultimately distributed through the DST content stream 5. The sub-lists generator 18 optionally also duplicates the revocation list (or sub-lists thereof) to ensure that the content stream 5 has embedded revocation information extending throughout the content stream 5.
A watermark encoder 22 modifies the predictive parameters in a predetermined manner to encode the watermark content 20. For example, a least significant bit of one or more of the predictive parameters can be set to one or zero corresponding to one bit of the watermark content 20. This small change in one or a few parameter values generally does not significantly change the subsequent lossless encoding efficiency. In another suitable modification, an additional dummy predictive parameter is selectively added so that the number of predictive parameters (even or odd) corresponds with one bit of the watermark content 20. Similarly, in yet another embodiment one predictive parameter is selectively deleted so that the number of predictive parameters (even or odd) corresponds with one bit of the watermark content 20. Other predetermined modifications of the predictive parameters can be used to encode the watermark content 20.
A lossless frame encoder 24 encodes the frame using the modified predictive parameters output by the watermark encoder 22. In one suitable lossless encoding scheme, a residual is computed that corresponds to a difference between the frame value and a value predicted using the predictive parameters. For good predictive parameters, this residual contains much less relevant information, and can be efficiently encoded. The residual is suitably entropy-encoded. The encoded content along with the predictive parameters are arranged into a lossless coded frame by a lossless coded frame constructer 26. Preferably, the predictive parameters are processed by a compressor 28 using an efficient compression algorithm prior to incorporation into the lossless coded frame. The lossless coded frame includes the compressed predictive parameters, the encoded content output by the frame encoder 24, and suitable control information (for example a total number of predictive parameters and/or a frame length) in a predetermined format. The lossless coded frame enters the DST stream 5 for transmission to the device 2.
With reference to
To recover the audio content, a lossless frame decoder 40 decodes the encoded data components using the predictive parameters recovered by the parameters decompressor 34 to recover the audio stream 10.
The digital watermark content 20 including the revocation list 4 are logically integrated with the high fidelity audio stream 10. Although the DST digital watermark is typically regarded as a fragile watermark, those skilled in the art will recognize that in practice modifying the integrated DST data stream to remove the watermark while retaining a valid high fidelity audio DST stream involves a substantial amount of time, effort, and cost. Moreover, the revocation list 4 is preferably broken into independently readable sub-lists, each of which is integrated into one or a few lossless coded frames. In this way, the revocation list cannot be avoided by omitting a small amount of the content stream 5.
With reference to
To embed the watermark 20 including the revocation list 4, at least one binary bit of watermark content 20 is included as an input to the MUX/encoder 46. For encoders that require paired bit input data, the watermark bit is preferably paired with one of the probability signal bits, for example paired with the bit pn. At the receiving device, the DST stream 5′ is demultiplexed and arithmetically decoded to recover the watermark 20. As with the approach of
DST digital watermarks provide a relatively large messaging bandwidth. For an exemplary 75 frames/second transfer rate with 15 bits encoded per frame (for example, corresponding to an audio stream 10 including fifteen lossless encoded audio channels with each channel having one embedded watermark bit) a watermark transfer data rate of about 1 kbit/sec is obtained.
In a three minute song, this results in a corresponding digital watermark capacity of 180 seconds times 1 kbit/second=180 kbits or about 22 kbytes. For a typical device identifier length of 8 bytes and a signature length of 128 bytes (that is, a signature of a license authority which is typically required to demonstrate authenticity of the distributed revocation list) the portion of the digital watermark corresponding to a three minute song can encode a revocation list identifying approximately 2800 devices (that is, 22 kbytes divided by 8 bytes per device identifier).
Embodiments including embedding of revocation list information in a watermark of a DST encoded audio stream, and embedding of revocation list information using a designated audio channel of an encoded multi-channel audio stream are described herein by way of example. However, those skilled in the art can readily adapt the described embodiments for use with other types of information content and other types of encoding. For example, the embedded watermark approach is readily adapted for revocation list distribution in watermarks of encoded video streams. Similarly, an unused audio or video channel of a multimedia content stream can be used to transmit embedded revocation list information. Software and data compression technologies can similarly incorporate embedded revocation lists. Revocation list information can be incorporated as a dedicated “mute” audio channel of DVD video. The mute channel is encoded using PCM, MPEG, AC3, or another audio encoding supported by DVD, and is ignored when the DVD is played. However, this approach has a disadvantage if the encoding is computationally complex in that the watermark is usually not recoverable without fully decoding the audio content. Meridian lossless packing (MLP) lossless encoding, which has been selected for DVD-audio, is readily adapted for embedding a revocation list.
In these embedding methods, the revocation list is preferably divided into revocation device sub-lists that are distributed substantially co-extensively with the video or audio content. The lists can be redundantly repeated multiple times so that the user cannot avoid the revocation list by omitting receipt, playback or other accessing of a limited portion of the user-desired programming.
With reference to
The watermark 64 is preferably substantially coextensive with the high fidelity audio content 62. In
Although an exemplary optical disk 60 is described here, revocation information can similarly be distributed by distributing other non-volatile storage media on which is stored user-desired content with the embedded revocation information. For example, solid-state non-volatile memory units, magnetic disks, and the like on which the user-desired content with embedded revocation information is stored can be distributed.
With reference to
The computed target pit length and width are used to modulate 86 a laser that records the reflective pits that encode the high fidelity audio data stream. The pits are formed 88 on a glass substrate disk to define a glass master 90. The glass master 90 is used to mass-produce 92 commercial optical compact disks, such as the disk 60, which are usually plastic disks with reflective optical coatings. Optionally, the mass-production 92 further includes formation of a conventional redbook layer for backward compatibility with older CD players.
Preferably, the revocation list 71 is updated on an occasional or more frequent basis by producing an updated glass master 90 in accordance with the relevant process operations of the method 70. The revocation list 71 is updated, for example, to include new devices that have been identified as being non-compliant with the selected content reproduction management protocol. In this manner, the compact disk manufacturer continually produces compact disks with music offerings that contain up-to-date revocation lists.
Compliant devices automatically receive an updated revocation list each time a new compact disk containing updated or supplementary revocation list information is played.
Embodiments embedding revocation information into audio streams and into physical medium watermarks have been described. However, it will be appreciated that revocation information can be similarly embedded and distributed by other devices or media which transmit, receive, or store various types of user-desired audio, video, data, software, or other content. Employment of less fragile digital watermarks than the DST watermarks described herein makes it more difficult to remove the embedded revocation list. However, less fragile digital watermarks typically have less data capacity and hence can store fewer revoked device identifications. Moreover, instead of using a digital watermark, the revocation information can be encoded in a mute channel or other pathway provided by the encoding technology and comporting with the type of content being processed.
The invention has been described with reference to the preferred embodiments. Obviously, modifications and alterations will occur to others upon reading and understanding the preceding detailed description. It is intended that the invention be construed as including all such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.
Number | Date | Country | Kind |
---|---|---|---|
60440296 | Jan 2003 | US | national |
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/IB03/06290 | 12/19/2003 | WO | 7/12/2005 |