US 7,155,012 B2Grant
Slice mask and moat pattern partial encryption
Issue Date:2006-12-26
•26 Claims
•13 Drawing Sheets
Abstract
A selective encryption encoder consistent with certain embodiments of the invention has vertical and/or horizontal stripes encrypted. In one embodiment, packets are examined in the digital video signal to identify a specified packet type, the specified packet type being both packets carrying intra-coded data representing a pattern of horizontal stripes across an image and packets carrying intra-coded data representing a pattern of vertical stripes across an image. The packets identified as being of the specified packet type are encrypted using a first encryption method to produce first encrypted packets. These first encrypted packets are then used to replace the unencrypted packets in the digital video signal to produce a partially encrypted video signal. The packets of the specified type can also be multiple encrypted and replaced in the data stream to produce a multiple encrypted video data stream.
Metadata
Assignees
- Sony Corporation
- Sony Electronics Inc.
Inventors
- Brant L. Candelore
- Henry Derovanessian
- Leo M. Pedlow, Jr.
Application Information
Application Number:US 10/274,084
Filing Date:2002-10-18
Priority Date:2002-01-02
Art Unit:2132
Classifications
IPC:
H04N7/176
Patent Drawings (13 sheets)
Description
Cross Reference to Related Documents
[0001] This application is a continuation in part of patent applications entitled “Critical Packet Partial Encryption” to Unger et al., Ser. No. 10/038,217; “Time Division Partial Encryption” to Candelore et al., Ser. No. 10/038,032; “Elementary Stream Partial Encryption” to Candelore, Ser. No. 10/037,914; “Partial Encryption and PID Mapping” to Unger et al., Ser. No. 10/037,499; and “Decoding and Decrypting of Partially Encrypted Information” to Unger et al., Ser. No. 10/037,498 all of which were filed on Jan. 2, 2002 and are hereby incorporated by reference herein.
[0002] This application is also related to and claims priority benefit of U.S. Provisional patent application Ser. No. 60/372,855 filed Apr. 16, 2002 to Candelore, et al. entitled “Method for Partially Scrambling Content by Encrypting Selected Macroblocks to Create Vertical and Horizontal ‘Moats’ to Make Recovery of Other Macroblocks More Difficult When Certain Anchor Information is Missing”, and U.S. Provisional patent application Ser. No. 60/409,675, filed Sep. 9, 2002, entitled “Generic PID Remapping for Content Replacement”, to Candelore which are hereby incorporated by reference.
Copyright Notice
[0003] A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
Field of the Invention
[0004] This invention relates generally to the field of encryption. More particularly, this invention relates to a encryption method and apparatus particularly useful for scrambling packetized video content such as that provided by cable and satellite television systems.
Background of the Invention
[0005] The above-referenced commonly owned patent applications describe inventions relating to various aspects of methods generally referred to herein as partial encryption or selective encryption. More particularly, systems are described therein wherein selected portions of a particular selection of digital content are encrypted using two (or more) encryption techniques while other portions of the content are left unencrypted. By properly selecting the portions to be encrypted, the content can effectively be encrypted for use under multiple decryption systems without the necessity of encryption of the entire selection of content. In some embodiments, only a few percent of data overhead is needed to effectively encrypt the content using multiple encryption systems. This results in a cable or satellite system being able to utilize Set-top boxes or other implementations of conditional access (CA) receivers from multiple manufacturers in a single system—thus freeing the cable or satellite company to competitively shop for providers of Set-top boxes.
Brief Description of the Drawings
[0006] The features of the invention believed to be novel are set forth with particularity in the appended claims. The invention itself however, both as to organization and method of operation, together with objects and advantages thereof, may be best understood by reference to the following detailed description of the invention, which describes certain exemplary embodiments of the invention, taken in conjunction with the accompanying drawings in which:
[0007] FIG. 1 is a block diagram of an exemplary cable system head end consistent with certain embodiments of the present invention.
[0008] FIG. 2 is an illustration of sample transport stream PSI consistent with certain embodiments of the present invention.
[0009] FIG. 3 is a further illustration of sample transport stream PSI consistent with certain embodiments of the present invention.
[0010] FIG. 4 is a block diagram of an illustrative control processor 100 consistent with certain embodiments of the present invention.
[0011] FIG. 5 illustrates the slice structure of a frame of video data consistent with certain embodiments of the present invention.
[0012] FIG. 6 illustrates a video frame with encryption of odd numbered slices consistent with certain embodiments of the present invention.
[0013] FIG. 7 illustrates a video frame with encryption of even numbered slices consistent with certain embodiments of the present invention.
[0014] FIG. 8 illustrates a sequence of slice masks used to produce alternating odd and even numbered encrypted slices in a manner consistent with certain embodiments of the present invention.
[0015] FIG. 9 illustrates a sequence of slice masks used to produce random encryption of frame slices in a manner consistent with certain embodiments of the present invention.
[0016] FIG. 10 illustrates a pattern of horizontal moats and vertical motes forming a checkerboard pattern representing encrypted portions of video.
[0017] FIG. 11 illustrates a television Set-top box that decrypts and decodes in a manner consistent with certain embodiments of the present invention.
[0018] FIG. 12 is a flow chart broadly illustrating an encryption process consistent with embodiments of the present invention.
Detailed Description of the Invention
[0019] While this invention is susceptible of embodiment in many different forms, there is shown in the drawings and will herein be described in detail specific embodiments, with the understanding that the present disclosure is to be considered as an example of the principles of the invention and not intended to limit the invention to the specific embodiments shown and described. In the description below, like reference numerals are used to describe the same, similar or corresponding parts in the several views of the drawings.
[0020] The terms “scramble” and “encrypt” and variations thereof are used synonymously herein. Also, the term “television program” and similar terms can be interpreted in the normal conversational sense, as well as a meaning wherein the term means any segment of A/V content that can be displayed on a television set or similar monitor device. The term “video” is often used herein to embrace not only true visual information, but also in the conversational sense (e.g., “video tape recorder”) to embrace not only video signals but associated audio and data. The term “legacy” as used herein refers to existing technology used for existing cable and satellite systems. The exemplary embodiments disclosed herein are decoded by a television Set-Top Box (STB), but it is contemplated that such technology will soon be incorporated within television receivers of all types whether housed in a separate enclosure alone or in conjunction with recording and/or playback equipment or Conditional Access (CA) decryption module or within a television set itself. The present document generally uses the example of a “dual partial encryption” embodiment, but those skilled in the art will recognize that the present invention can be utilized to realize multiple partial encryption without departing from the invention. Partial encryption and selective encryption are used synonymously herein.
[0021] Turning now to FIG. 1 , a head end 100 of a cable television system suitable for use in practicing a dual encryption embodiment of the present invention is illustrated. Those skilled in the art will appreciate that the present invention could also be implemented using more than two encryptions systems without departing from the present invention. The illustrated head end 100 implements the dual partial encryption scenario of the present invention by adapting the operation of a conventional encryption encoder 104 (such as those provided by Motorola, Inc. and Scientific-Atlanta, Inc., and referred to herein as the primary encryption encoder) with additional equipment.
[0022] Head end 100 receives scrambled content from one or more suppliers, for example, using a satellite dish antenna 108 that feeds a satellite receiver 110. Satellite receiver 110 operates to demodulate and descramble the incoming content and supplies the content as a stream of clear (unencrypted) data to a selective encryption encoder 114. The selective encryption encoder 114, according to certain embodiments, uses two passes or two stages of operation, to encode the stream of data. Encoder 114 utilizes a secondary conditional access system (and thus a second encryption method) in conjunction with the primary encryption encoder 104 which operates using a primary conditional access system (and thus a primary encryption method). A user selection provided via a user interface on a control computer 118 configures the selective encryption encoder 114 to operate in conjunction with either a Motorola or Scientific Atlanta cable network (or other cable or satellite network).
[0023] It is assumed, for purposes of the present embodiment of the invention, that the data from satellite receiver 110 is supplied as MPEG (Moving Pictures Expert Group) compliant packetized data. In the first stage of operation the data is passed through a Special Packet Identifier 122. Special Packet Identifier 122 identifies specific programming that is to be dual partially encrypted according to the present invention. The Special Packet Identifier 122 signals the Special Packet Duplicator 126 to duplicate special packets. The Packet Identifier (PID) Remapper 130, under control of the computer 118, remaps the PIDs of the elementary streams (ES) (i.e., audio, video, etc.) of the programming that shall remain clear and the duplicated packets to new PID values. The payload of the elementary stream packets are not altered in any way by Special Packet Identifier 122, Special Packet Duplicator 126, or PID remapper 130. This is done so that the primary encryption encoder 104 will not recognize the clear unencrypted content as content that is to be encrypted.
[0024] The packets may be selected by the special packet identifier 122 according to one of the selection criteria described in the above-referenced applications or may use another selection criteria such as those which will be described later herein. Once these packets are identified in the packet identifier 122, packet duplicator 126 creates two copies of the packet. The first copy is identified with the original PID so that the primary encryption encoder 104 will recognize that it is to be encrypted. The second copy is identified with a new and unused PID, called a “secondary PID” (or shadow PID) by the PID Remapper 130. This secondary PID will be used later by the selective encryption encoder 114 to determine which packets are to be encrypted according to the secondary encryption method. FIG. 2 illustrates an exemplary set of transport PSI tables 136 after this remapping with a PAT 138 defining two programs (10 and 20) with respective PID values 0100 and 0200. A first PMT 140 defines a PID=0101 for the video elementary stream and PIDs 0102 and 0103 for two audio streams for program 10. Similarly, a second PMT 142 defines a PID=0201 for the video elementary stream and PIDs 0202 and 0203 for two audio streams for program 20.
[0025] As previously noted, the two primary commercial providers of cable head end encryption and modulation equipment are (at this writing) Motorola, Inc. and Scientific-Atlanta, Inc. While similar in operation, there are significant differences that should be discussed before proceeding since the present selective encryption encoder 114 is desirably compatible with either system. In the case of Motorola equipment, the Integrated Receiver Transcoder (IRT), an unmodulated output is available and therefore there is no need to demodulate the output before returning a signal to the selective encryption encoder 114, whereas no such unmodulated output is available in a Scientific-Atlanta device. Also, in the case of current Scientific-Atlanta equipment, the QAM, the primary encryption encoder carries out a PID remapping function on received packets. Thus, provisions are made in the selective encryption encoder 114 to address this remapping.
[0026] In addition to the above processing, the Program Specific Information (PSI) is also modified to reflect this processing. The original, incoming Program Association Table (PAT) is appended with additional Program Map Table (PMT) entries at a PMT inserter 134. Each added PMT entry contains the new, additional streams (remapped & shadow PIDs) created as part of the selective encryption (SE) encoding process for a corresponding stream in a PMT of the incoming transport. These new PMT entries will mirror their corresponding original PMTs. The program numbers will be automatically assigned by the selective encryption encoder 114 based upon open, available program numbers as observed from the program number usage in the incoming stream. The selective encryption System 114 system displays the inserted program information (program numbers, etc) on the configuration user interface of control computer 118 so that the Multiple System Operator (MSO, e.g., the cable system operator) can add these extra programs into the System Information (SI) control system and instruct the system to carry these programs in the clear.
[0027] The modified transport PSI is illustrated as 144 in FIG. 3 with two additional temporary PMTs 146 and 148 appended to the tables of transport PSI 136. The appended PMTs 146 and 148 are temporary. They are used for the primary encryption process and are removed in the second pass of processing by the secondary encryption encoder. In accordance with the MPEG standard, all entries in the temporary PMTs are marked with stream type “user private” with an identifier of 0×F0. These PMTs describe the remapping of the PIDs for use in later recovery of the original mapping of the PIDs in the case of a PID remapping in the Scientific-Atlanta equipment. Of course, other identifiers could be used without departing from the present invention.
[0028] In order to assure that the Scientific-Atlanta PID remapping issue is addressed, if the selective encryption encoder 114 is configured to operate with a Scientific-Atlanta system, the encoder adds a user private data descriptor to each elementary stream found in the original PMTs in the incoming data transport stream (TS) per the format below (of course, other formats may also be suitable):
[0029]
| Syntax | value | # of bits | |
|---|---|---|---|
| private_data_indicator_descriptor( ) { | |||
| descriptor_tag | 0xF0 | 8 | |
| descriptor_length | 0x04 | 8 | |
| private_data_indicator( ) { | |||
| orig_pid | 0x???? | 16 | |
| stream_type | 0x?? | 8 | |
| reserved | 0xFF | 8 | |
| } | |||
| } | |||
[0030] The selective encryption encoder 114 of the current embodiment also adds a user private data descriptor to each elementary stream placed in the temporary PMTs created as described above per the format below:
[0031]
| Syntax | value | # of bits | |
|---|---|---|---|
| private_data_indicator_descriptor( ) { | |||
| descriptor_tag | 0xF0 | 8 | |
| descriptor_length | 0x04 | 8 | |
| private_data_indicator( ) { | |||
| orig_pid | 0x???? | 16 | |
| stream_type | 0x?? | 8 | |
| reserved | 0xFF | 8 | |
| } | |||
| } | |||
[0032] The in “????” the tables above is the value of the “orig_pid” which is a variable while the“??” is a “stream_type” value. The data field for “orig_pid” is a variable that contains the original incoming PID or in the case of remap or shadow PIDs, the original PID that this stream was associated with. The data field “stream_type” is a variable that describes the purpose of the stream based upon the chart below:
[0033]
| Stream Type | Value | |
|---|---|---|
| Legacy ES | 0x00 | |
| Remapped ES | 0x01 | |
| Shadow ES | 0x02 | |
| Reserved | 0x03–0xFF | |
[0034] These descriptors will be used later to re-associate the legacy elementary streams, which are encrypted by the Scientific-Atlanta, Inc. primary encryption encoder 104, with the corresponding shadow and remapped clear streams after PID remapping in the Scientific-Atlanta, Inc. modulator prior to the second phase of processing of the Selective Encryption Encoder. Those skilled in the art will appreciate that the above specific values should be considered exemplary and other specific values could be used without departing from the present invention.
[0035] In the case of a Motorola cable system being selected in the selective encryption encoder configuration GUI, the original PAT and PMTs can remain unmodified, providing the system does not remap PIDs within the primary encryption encoder. The asterisks in FIG. 1 indicate functional blocks that are not used in a Motorola cable system.
[0036] The data stream from selective encryption encoder 114 is passed along to the input of the primary encryption encoder 104 which first carries out a PID filtering process at 150 to identify packets that are to be encrypted. At 152, in the case of a Scientific-Atlanta device, a PID remapping may be carried out. The data are then passed along to an encrypter 154 that, based upon the PID of the packets encrypts certain packets (in accord with the present invention, these packets are the special packets which are mapped by the PID Remapper 130 to the original PID of the incoming data stream for the current program). The remaining packets are unencrypted. The data then passes through a PSI modifier 156 that modifies the PSI data to reflect changes made at the PID remapper. The data stream is then modulated by a quadrature amplitude modulation (QAM) modulator 158 (in the case of the Scientific-Atlanta device) and passed to the output thereof. This modulated signal is then demodulated by a QAM demodulator 160. The output of the demodulator 160 is directed back to the selective encryption encoder 114 to a PSI parser164.
[0037] The second phase of processing of the transport stream for selective encryption is to recover the stream after the legacy encryption process is carried out in the primary encryption encoder 104. The incoming Program Specific Information (PSI) is parsed at 164 to determine the PIDs of the individual elementary streams and their function for each program, based upon the descriptors attached in the first phase of processing. This allows for the possibility of PID remapping, as seen in Scientific-Atlanta primary encryption encoders. The elementary streams described in the original program PMTs are located at PSI parser 164 where these streams have been reduced to just the selected packets of interest and encrypted in the legacy CA system format in accord with the primary encryption method at encoder 104. The elementary streams in the temporary programs appended to the original PSI are also recovered at elementary stream concatenator 168. The packets in the legacy streams are appended to the remapped content, which is again remapped back to the PID of the legacy streams, completing the partial, selective encryption of the original elementary streams.
[0038] The temporary PMTs and the associated PAT entries are discarded and removed from the PSI. The user private data descriptors added in the first phase of processing are also removed from the remaining original program PMTs in the PSI. For a Motorola system, no PMT or PAT reprocessing is required and only the final secondary encryption of the transport stream occurs.
[0039] During the second phase of processing, the SE encoder 114 creates a shadow PSI structure that parallels the original MPEG PSI, for example, having a PAT origin at PID 0×0000. The shadow PAT will be located at a PID specified in the SE encoder configuration as indicated by the MSO from the user interface. The shadow PMT PIDs will be automatically assigned by the SE encoder 114 dynamically, based upon open, available PID locations as observed from PID usage of the incoming stream. The PMTs are duplicates of the original PMTs, but also Conditional Access (CA) descriptors added to the entire PMT or to the elementary streams referenced within to indicate the standard CA parameters and optionally, shadow PID and the intended operation upon the associated elementary stream. The CA descriptor can appear in the descriptor1( ) or descriptor2( ) loops of the shadow PMT. If found in descriptor1( ), the CA_PID called out in the CA descriptor contains the non-legacy ECM PID which would apply to an entire program. Alternatively, the ECM PID may be sent in descriptor2( ). The CA descriptor should not reference the selective encryption elementary PID in the descriptor1( ) area.
[0040]
| CA_PID Definition | Secondary_CA_private_data Value | |
|---|---|---|
| ECM PID | 0x00 | |
| Replacement PID | 0x01 | |
| Insertion PID | 0x02 | |
| ECM PID | undefined (default) | |
[0041] This shadow PSI insertion occurs regardless of whether the selective encryption operation is for a Motorola or Scientific Atlanta cable network. The elementary streams containing the duplicated packets of interest that were also assigned to the temporary PMTs are encrypted during this second phase of operation at secondary packet encrypter 172 in the secondary CA format based upon the configuration data of the CA system attached using the DVB (Digital Video Broadcasting) Simulcrypt™ standard.
[0042] The data stream including the clear data, primary encrypted data, secondary encrypted data and other information are then passed to a PSI modifier 176 that modifies the transport PSI information by deletion of the temporary PMT tables and incorporation of remapping as described above. The output of the PSI modifier 176 is modulated at a QAM modulator 180 and delivered to the cable plant 184 for distribution to the cable system's customers.
[0043] The control processor 100 may be a personal computer based device that is used to control the selective encryption encoder as described herein. An exemplary personal computer based controller 100 is depicted in FIG. 4 . Control processor 100 has a central processor unit (CPU) 210 with an associated bus 214 used to connect the central processor unit 210 to Random Access Memory 218 and Non-Volatile Memory 222 in a known manner. An output mechanism at 226, such as a display and possibly printer, is provided in order to display and/or print output for the computer user as well as to provide a user interface such as a Graphical User Interface (GUI). Similarly, input devices such as keyboard and mouse 230 may be provided for the input of information by the user at the MSO. Computer 100 also may have disc storage 234 for storing large amounts of information including, but not limited to, program files and data files. Computer system 100 also has an interface 238 for connection to the selective encryption encoder 114. Disc storage 234 can store any number of encryption methods that can be downloaded as desired by the Multi-Service Operator (MSO) to vary the encryption on a regular basis to thwart hackers. Moreover, the encryption methods can be varied according to other criteria such as availability of bandwidth and required level of security.
[0044] The partial encryption process described above utilizes any suitable conditional access encryption method at encrypters 154 and 172. However, these encryption techniques are selectively applied to the data stream using a technique such as those described below or in the above-referenced patent applications. In general, but without the intent to be limiting, the selective encryption process utilizes intelligent selection of information to encrypt so that the entire program does not have to undergo dual encryption. By appropriate selection of appropriate data to encrypt, the program material can be effectively scrambled and hidden from those who desire to hack into the system and illegally recover commercial content without paying. The MPEG (or similar format) data that are used to represent the audio and video data does so using a high degree of reliance on the redundancy of information from frame to frame. Certain data can be transmitted as “anchor” data representing chrominance and luminance data. That data is then often simply moved about the screen to generate subsequent frames by sending motion vectors that describe the movement of the block. Changes in the chrominance and luminance data are also encoded as changes rather than a recoding of absolute anchor data.
[0045] In accordance with certain embodiments of the present invention, a method of dual encrypting a digital video signal involves examining unencrypted packets of data in the digital video signal to identify at least one specified packet type, the specified packet type comprising packets of data as will be described hereinafter; encrypting packets identified as being of the specified packet type using a first encryption method to produce first encrypted packets; encrypting the packets identified as being of the specified packet type using a second encryption method to produce second encrypted packets; and replacing the unencrypted packets of the specified packet type with the first encrypted packets and the second encrypted packets in the digital video signal to produce a partially dual encrypted video signal.
[0046] The MPEG specification defines a slice as “ . . . a series of an arbitrary number of consecutive macroblocks. The first and last macroblocks of a slice shall not be skipped macroblocks. Every slice shall contain at least one macroblock. Slices shall not overlap. The position of slices may change from picture to picture. The first and last macroblock of a slice shall be in the same horizontal row of macroblocks. Slices shall occur in the bitstream in the order in which they are encountered, starting at the upper-left of the picture and proceeding by raster-scan order from left to right and top to bottom . . . . ”
[0047] By way of example, to represent an entire frame of NTSC information, for standard resolution, the frame (picture) is divided into 30 slices (but in general j slices may make up a full frame). Each slice contains 33 variable length macroblocks (but in general can include k variable length macroblocks) of information representing a 16×16 pixel region of the image. This is illustrated as standard definition frame 250 of FIG. 5 with each slice starting with a slice header (SH1–SH30) and each slice having 33 macroblocks (MB1–MB33). By appropriate selection of particular data representing the frame, the image can be scrambled beyond recognition in a number of ways as will be described below. By variation of the selection criteria for selective encryption, hackers can be thwarted on a continuing basis. Moreover, the selection criteria can be changed to adapt to bandwidth requirements as well as need for security of particular content (or other criteria).
[0048] Several techniques are described below for encryption of the selected data. In each case, for the current embodiment, it will be understood that selection of a particular type of information implies that the payload of a packet carrying such data is encrypted. However, in other environments, the data itself can be directly encrypted. Those skilled in the art will appreciate that such variations as well as others are possible without departing from the present invention. Moreover, those skilled in the art will appreciate that many variations and combinations of the encryption techniques described hereinafter can be devised and used singularly or in combination without departing from the present invention.
Slice Mask Encryption
[0049] In accordance with one embodiment consistent with the invention referred to herein as “slice mask encryption”, a different set of slice headers are encrypted from frame to frame. When a slice header is encrypted, the content for that slice is “frozen” on the screen, while content on adjoining slices is updated. This has the effect of breaking up the image on the screen. In certain embodiments, certain slices can be encrypted more often than others to thus deny the decoder the ability to update the content in those slices.
[0050] One embodiment of slice mask encryption is illustrated in FIG. 6 and FIG. 7 . In FIG. 6 , a frame of video 270 is illustrated as 30 slices with each slice having a slice header and 33 macroblocks with alternating odd numbered slices being encrypted. In certain embodiments, the entire slice can be encrypted while in others, only key information in the slice is encrypted (e.g., the slice header, or slice header and first macroblock, or slice header and all intra-coded macroblocks in the slice). Frame 280 of FIG. 7 , by contrast, has all even numbered slices encrypted. As with frame 270, in certain embodiments, the entire slice can be encrypted while in others, only key information in the slice is encrypted (e.g., the slice header, or slice header and first macroblock, or slice header and all intra-coded macroblocks in the slice). In one embodiment, odd slice encryption as in frame 270 can be alternated with even slice encryption as in frame 280. In connection with the present embodiment, alternating video frames can be encrypted with odd or even slice encryption, with alternating video frames meaning every other frame or every other I, P or B frame.
[0051] The slice that is to be encrypted can be coded or represented using a slice mask as shown in FIG. 8 . The slice masks of FIG. 8 are simply binary one dimensional arrays that contain a 1 to indicate that a slice is to be encrypted and a 0 to indicate that the slice is to be unencrypted (or similar code designation). Thus, for example, slice masks 282, 284 and 286 represent odd slice encryption while slice masks 292 and 294 represent even slice encryption. Such arrays can be stored or generated, in one embodiment, for use in determining which slice is to be encrypted. These masks may be applied to any of the following: only I frames, both I frames and P frames, or only P frames. Moreover, different masks may be used for I frames than P frames. In this illustrative example, fifteen packets/frame can be encrypted to encrypt the slice headers of the slices corresponding to 1 in the slice mask. This results in a low percentage of the actual data in a video frame actually being encrypted.
[0052] The encryption of a slice can depend on any of the following:
-
- [0053] The location of the slice in the frame (with higher density towards the “active” part of the screen)
- [0054] Whether found in an I, P or B frame (higher to lower priority)
- [0055] # of patterns or masks used before they are repeated
[0056] Encrypting I frame slices eliminates anchor chrominance/luminance data used by the other types of frames. Encrypting P frame slices eliminates both anchor chrominance/luminance as well as motion vector data. Anchor chrominance/luminance can come in the form of scene changes, and if the content is Motorola encoded, then “progressive” I slices. The effect of Frame Mask encryption can be very effective. Experiments have shown that for a Motorola encoded program, encrypting only 3% of the packets can make it difficult to identify any objects in an image.
[0057] In variations of the embodiment described above, slice masks can be varied according to any suitable algorithm. For example, FIG. 9 illustrates random variation in the slice masks from frame to frame. Each of the slice masks 302, 304, 306, 308 and 310 is randomly (or equivalently, pseudo-randomly) generated so that a random array of slices is encrypted (e.g., by encryption of the payload of a packet containing the slice header) at each frame.
[0058] In another variation, it is noted that selected portions of the frame can be deemed the “active region” of the image. This region is somewhat difficult to define and is somewhat content dependent. But, generally speaking it is approximately a central area of the frame. More commonly, it is approximately an upper central portion of the frame of approximately half (say, one third to ¾) of the overall area of the frame centered at approximately the center of the frame horizontally and approximately the tenth to fifteenth slice. In accordance with this variation, random or pseudo-random slices are encrypted (e.g., by encryption of packets containing the slice header) with a weighting function applied to cause the active region of the image to be encrypted with greater frequency than other portions of the image. By way of example, and not limitation, assume that the center of the image is the active region. In this case, for example, a linear or a bell shaped weighting function can be applied to the random selection of slices to encrypt so that slices near the center are more frequently encrypted than those at the top or bottom of the image. In another example, assume that slices 8–22 of a 30 slice frame are deemed to bound the active region. Slices can then be randomly selected in each frame for encryption with a multiplication factor used to increase the likelihood that slices 8–22 will be encrypted. For example, those slices can be made twice or three times as likely to be encrypted as other slices. Equivalently, slices 1–7 and 23–30 can be made less likely to be encrypted. Any suitable pattern of macroblocks within a slice can be encrypted in order to encrypt the slice. Other variations will occur to those skilled in the art upon consideration of the present teachings.
Moat Pattern Encryption
[0059] The above slice mask encryption technique can be viewed as creating horizontal “moats” of encrypted information in the video frame, with each moat corresponding to a single slice in width. The moat width can be varied by encrypting multiple adjacent slices. In a similar manner, vertical “moats” can be generated by selecting macroblocks of data to be encrypted in a particular frame of data. This is depicted in FIG. 1 0 by an array of binary data 320 that represents encryption of slices 1–5,11–15 and 21–25 to create three horizontal moats 322, 324 and 326 respectively (each being 5 slices in width) in a video frame. This array may be referred to as a horizontal moat mask or slice mask. In a similar manner, an array of binary data 330 represents a vertical moat mask for encryption of macroblocks numbered 1–3, 7–9, 13–15, 19–21, 24–27 and 31–33 to create six vertical moats 332, 334, 336, 338, 340 and 342 respectively (each being three macroblocks in width). Of course, other patterns of horizontal and/or vertical moats can also be generated, for example, with greater or lesser density, greater or lesser moat width, greater emphasis on an active portion of the image or randomly generated moats, without departing from the present invention.
[0060] To create the moats in accordance with preferred embodiments, intra-coded macroblocks in the vertical and horizontal stripe through the image are encrypted. By encrypting the intra-coded macroblocks, inter-coded macroblocks are left without reference data and become meaningless, thus effectively scrambling the video image. In other embodiments, the horizontal stripes can be encrypted by any suitable technique including, but not limited to, encryption of the slice header, encryption of the slice header plus the first macroblock, encryption of all macroblocks in the slice or any other suitable technique. Similarly, the vertical stripes can be encrypted by encryption of intra-coded macroblocks or all macroblocks in the stripe without departing from the invention.
[0061] It should be noted that to encrypt certain macroblocks generally suggests that the payload of a packet carrying the macroblock is encrypted. This further implies that, in fact, more data on one side, the other or both of the target macroblock will also be encrypted. This results in even greater amounts of data being encrypted and thus greater encryption security.
[0062] In one embodiment of this encryption mode, it is assumed that the first macroblock with absolute DC luminance and chrominance information is encrypted. Each macroblock after that is encrypted differentially from the macroblock to the left to produce the horizontal stripes.
[0063] By breaking up the image up into a checker board pattern as illustrated, the vertical moats prevent the direct calculation of all the macroblocks on a slice with one good known value anywhere on the slice. Although a known value may be obtained by correlation of macroblocks from previous frames of the same slice or clear intracoded macroblocks from another part of the slice, this is generally inadequate to provide an effective hack to the encryption method. By use of the checkerboard pattern of encryption, the correlated macroblock would only “fix” the macroblocks in the particular checkerboard square in which that macroblock is located . . . not the entire slice. Thus, the vertical moat creates a discontinuity which increases distortion in the image.
[0064] Likewise for horizontal encrypted moats. This encryption technique prevents intracoded macroblocks from slices below or above the encrypted slice from being used to correct information in macroblocks above or below. The horizontal stripe or moat creates a discontinuity that disrupts a hacker's ability to obtain enough reference data to effectively decrypt the image. This checker board pattern produces a bandwidth savings in a dual or multiple encryption scenario which is substantially reduced compared with 100 % encryption of the slice.
[0065] Multiple combinations of the encryption techniques are possible to produce encryption that has varying bandwidth requirements, varying levels of security and varying complexity. Such encryption techniques can be selected by control computer 118 in accordance with the needs of the MSO. The above-described encryption techniques can provide several additional choices to enrich a pallette of encryption techniques that can thus be selected by control computer 118 to vary the encryption making hacking more difficult.
[0066] Numerous other combinations of the above encryption techniques as well as those described in the above-referenced patent applications and other partial encryption techniques can be combined to produce a rich pallette of encryption techniques from which to select. In accordance with certain embodiments of the present invention, a selection of packets to encrypt can be made by the control computer 118 in order to balance encryption security with bandwidth and in order to shift the encryption technique from time to time to thwart hackers.
[0067] An authorized set-top box such as 300 illustrated in FIG. 11 operating under the secondary CA system decrypts and decodes the incoming program by recognizing both primary and secondary PIDs associated with a single program. The multiplexed video data stream containing both PIDs is directed to a demultiplexer 304. When a program is received that contains encrypted content that was encrypted by any of the above techniques, the demultiplexer directs encrypted packets containing encrypted content and secondary PIDS to a secondary CA decrypter 308. These packets are then decrypted at 308 and passed to a PID remapper 312. As illustrated, the PID remapper 312 receives packets that are unencrypted and bear the primary PID as well as the decrypted packets having the secondary PID. The PID remapper 312 combines the decrypted packets from decrypter 308 with the unencrypted packets having the primary PID to produce an unencrypted data stream representing the desired program. PID remapping is used to change either the primary or secondary PID or both to a single PID. This unencrypted data stream can then be decoded normally by decoder 316. Some or all of the components depicted in FIG. 11 can be implemented and/or controlled as program code running on a programmed processor, with the code being stored on an electronic storage medium.
[0068] FIG. 12 is a flow chart 400 that broadly illustrates the encryption process consistent with certain embodiments of the present invention starting at 404. At 408 the packet type that is to be encrypted is specified. In accordance with certain embodiments consistent with the present invention, the selected packet type may be packets containing data representing vertical and/or horizontal stripes in a video frame. Packets are then examined at 412 to identify packets of the specified type. At 416, the identified packets are duplicated and at 420 one set of these packets is encrypted under a first encryption method. The other set of identified packets is encrypted at 424 under a second encryption method. The originally identified packets are then replaced in the data stream with the two sets of encrypted packets at 430 and the process ends at 436.
[0069] While the above embodiments describe encryption of packets containing the selected data type, it is also possible to encrypt the raw data prior to packetizing without departing from this invention and such encryption is considered equivalent thereto.
[0070] Those skilled in the art will recognize that the present invention has been described in terms of exemplary embodiments based upon use of a programmed processor (e.g., processor 118, processors implementing any or all of the elements of 114 or implementing any or all of the elements of 300). However, the invention should not be so limited, since the present invention could be implemented using hardware component equivalents such as special purpose hardware and/or dedicated processors which are equivalents to the invention as described and claimed. Similarly, general purpose computers, microprocessor based computers, micro-controllers, optical computers, analog computers, dedicated processors and/or dedicated hard wired logic may be used to construct alternative equivalent embodiments of the present invention.
[0071] Those skilled in the art will appreciate that the program steps and associated data used to implement the embodiments described above can be implemented using disc storage as well as other forms of storage such as for example Read Only Memory (ROM) devices, Random Access Memory (RAM) devices; optical storage elements, magnetic storage elements, magneto-optical storage elements, flash memory, core memory and/or other equivalent storage technologies without departing from the present invention. Such alternative storage devices should be considered equivalents.
[0072] The present invention, as described in embodiments herein, is implemented using a programmed processor executing programming instructions that are broadly described above form that can be stored on any suitable electronic storage medium or transmitted over any suitable electronic communication medium or otherwise be present in any computer readable or propagation medium. However, those skilled in the art will appreciate that the processes described above can be implemented in any number of variations and in many suitable programming languages without departing from the present invention. For example, the order of certain operations carried out can often be varied, additional operations can be added or operations can be deleted without departing from the invention. Error trapping can be added and/or enhanced and variations can be made in user interface and information presentation without departing from the present invention. Such variations are contemplated and considered equivalent.
[0073] Software code and/or data embodying certain aspects of the present invention may be present in any computer readable medium, transmission medium, storage medium or propagation medium including, but not limited to, electronic storage devices such as those described above, as well as carrier waves, electronic signals, data structures (e.g., trees, linked lists, tables, packets, frames, etc.) optical signals, propagated signals, broadcast signals, transmission media (e.g., circuit connection, cable, twisted pair, fiber optic cables, waveguides, antennas, etc.) and other media that stores, carries or passes the code and/or data. Such media may either store the software code and/or data or serve to transport the code and/or data from one location to another. In the present exemplary embodiments, MPEG compliant packets, slices, tables and other data structures are used, but this should not be considered limiting since other data structures can similarly be used without departing from the present invention.
[0074] While the invention has been described in conjunction with specific embodiments, it is evident that many alternatives, modifications, permutations and variations will become apparent to those skilled in the art in light of the foregoing description. Accordingly, it is intended that the present invention embrace all such alternatives, modifications and variations as fall within the scope of the appended claims.
Claims
What is claimed is:
1. A selective encryption encoder, comprising:
a packet identifier that identifies packets of a specified packet type, the specified packet type comprising packets carrying data representing a pattern of horizontal stripes across an image;
a packet duplicator that duplicates the identified packets to produce first and second sets of the identified packets;
means for sending and receiving packets to and from a primary encryption encoder to encrypt the first set of identified packets under a first encryption method; and
a secondary encrypter for encrypting the second set of identified packets under a second encryption method.
2. The selective encryption encoder according to claim 1, wherein the horizontal stripes are encrypted by encryption of slice headers in the horizontal stripes.
3. The selective encryption encoder according to claim 2, wherein the horizontal stripes are encrypted by encryption of slice headers plus the first macroblock in each slice of the horizontal stripes.
4. The selective encryption encoder according to claim 1, wherein the horizontal stripes are encrypted by encryption of macroblocks containing intra-coded data in the horizontal stripes.
5. The selective encryption encoder according to claim 1, wherein the horizontal stripes are encrypted by encryption of all macroblocks in the horizontal stripes.
6. The selective encryption encoder according to claim 1, wherein the horizontal stripes are encrypted by encryption of a predefined pattern of macroblocks in the horizontal stripes.
7. The selective encryption encoder according to claim 1, wherein the horizontal stripes are encrypted by encryption of a predefined pattern of packets in the horizontal stripes.
8. The selective encryption encoder according to claim 1, wherein the horizontal stripes are encrypted according to a binary array fanning a slice mask, and wherein the binary array provides a code for encryption of slices within the image.
9. The selective encryption encoder according to claim 8, wherein the binary array is 2 -dimensional with one dimension representing the slice number, and other dimension representing either one of packets and macroblocks in each slice.
10. The selective encryption encoder according to claim 8, wherein the horizontal stripes are encrypted by encryption of slice headers for slices coded for encryption.
11. The selective encryption encoder according to claim 8, wherein the slices are encrypted by encryption of slice headers plus a first macroblock For slices coded for encryption.
12. The selective encryption encoder according to claim 8, wherein the slices are encrypted by encryption of macroblocks containing intra-coded data for slices coded for encryption.
13. The selective encryption encoder according to claim 1, wherein the pattern of horizontal stripes corresponds to odd numbered slices and even numbered slices on alternating video frames.
14. A selective encryption encoder, comprising:
a packet identifier that identifies packets of a specified packet type, the specified packet type comprising packets carrying data representing a pattern of horizontal stripes across an image;
a packet duplicator that duplicates the identified packets to produce first and second sets of the identified packets;
means for sending and receiving packets to and from a primary encryption encoder to encrypt the first set of identified packets under a first encryption method;
a secondary encrypter for encrypting the second set of identified packets under a second encryption method; and
wherein the horizontal stripes are encrypted according to a two-dimensional binary array with one dimension representing the slice number, and other dimension representing either one of packets and macroblocks in each slice, and wherein the binary array provides a code for encryption of the packets or macroblocks comprising the slices within the image.
15. A method of partially encrypting a digital video signal, comprising:
examining unencrypted packets of data in the digital video signal to identify a specified packet type, the specified packet type comprising packets carrying data representing a pattern of horizontal stripes across an image;
encrypting packets identified as being of the specified packet type using a first encryption method to produce first encrypted packets; and
replacing the unencrypted packets of the specified packet type with the first encrypted packets in the digital video signal to produce a partially encrypted video signal; and
wherein the horizontal stripes are encrypted according to a two-dimensional binary array with one dimension representing the slice number, and other dimension representing either one of packets and macroblocks in each slice, and wherein the binary array provides a code for encryption of the packets or macroblocks comprising the slices within the image.
16. A computer readable tangible electronic storage device storing instructions which, when executed on a programmed processor, carry out the method of encrypting a digital video signal according to claim 15.
17. A method of partially dual encrypting a digital video signal, comprising:
examining unencrypted packets of data in the digital video signal to identify a specified packet type, the specified packet type comprising both packets carrying data representing a pattern of horizontal stripes across an image and packets carrying data representing a pattern of vertical stripes across the image;
encrypting packets identified as being of the specified packet type using a first encryption method to produce first encrypted packets;
encrypting the packets identified as being of the specified packet type using a second encryption method to produce second encrypted packets; and
replacing the unencrypted packets of the specified packet type with the first encrypted packets and the second encrypted packets in the digital video signal to produce a partially dual encrypted video signal; and
wherein the horizontal stripes are encrypted according to a two-dimensional binary ray with one dimension representing the slice number, and other dimension representing either one of packets and macroblocks in each slice, and wherein the binary array provides a code for encryption of the packets or macroblocks comprising the slices within the image.
18. A computer readable tangible electronic storage device storing instructions which, when executed on a programmed processor, carry out the method of encrypting a digital video signal according to claim 17.
19. A selective encryption encoder, comprising:
a packet identifier that identifies packets of a specified packet type, the specified packet type comprising both packets carrying data representing a pattern of horizontal stripes across an image and packets carrying data representing a pattern of vertical stripes across an image;
a packet duplicator that duplicates the identified packets to produce first and second sets of the identified packets;
means for sending and receiving packets to and from a primary encryption encoder to encrypt the first set of identified packets under a first encryption method;
a secondary encrypter for encrypting the second set of identified packets under a second encryption method; and
wherein the horizontal stripes are encrypted according to a two-dimensional binary array with one dimension representing the slice number, and other dimension representing either one of packets and macroblocks in each slice, and wherein the binary array provides a code for encryption of the packets or macroblocks comprising the slices within the image.
20. A method of partially encrypting a digital video signal, comprising:
examining unencrypted packets of data in the digital video signal to identify a specified packet type, the specified packet type comprising both packets carrying data representing a pattern of horizontal stripes across an image and packets carrying data representing a pattern of vertical stripes across an image;
encrypting packets identified as being of the specified packet type using a first encryption method to produce first encrypted packets; and
replacing the unencrypted packets of the specified packet type with the first encrypted packets in the digital video signal to produce a partially encrypted video signal; and
wherein the horizontal stripes are encrypted according to a two-dimensional binary array with one dimension representing the slice number, and other dimension representing either one of packets and macroblocks in each slice, and wherein the binary array provides a code for encryption of the packets or macroblocks comprising the slices within the image.
21. A computer readable tangible electronic storage device storing instructions which, when executed on a programmed processor, carry out the method of encrypting a digital video signal according to claim 20.
22. A television set-top box, comprising:
a receiver receiving a digital television signal comprising:
a plurality of unencrypted packets;
a plurality of encrypted packets, wherein certain of the encrypted packets represent at least one of a pattern of horizontal stripes across an image and a pattern of vertical stripes across the image; and
wherein the plurality of encrypted packets comprise a plurality of pairs of redundant packets containing redundant information encrypted, where one of each pair is encrypted under a first encryption method and the other of the pair is encrypted using a second encryption method:
a decrypter that decrypts the encrypted packets encrypted under the first encryption method; and
a decoder, that decodes the unencrypted packets and the decrypted packets to produce a signal suitable for play on a television set.
23. A selective encryption decoder, for decrypting and decoding a selectively encrypted digital video signal, comprising:
a demultiplexer that receives packets of digital video, certain of the packets being unencrypted and certain of the packets being encrypted, wherein certain of the encrypted packets represent at least one of a pattern of horizontal stripes across an image and a pattern of vertical stripes across the image;
the unencrypted packets having a first packet identifier (PID) and the encrypted packets having a second packet identifier (PID);
a decrypter receiving the encrypted packets having the second PID and decrypting the encrypted packets using a first encryption method to produce decrypted packets;
a PID remapper that changes at least one of the first and second PIDs so that the unencrypted packets and the decrypted packets have the same PID; and
a decoder that decodes the unencrypted and decrypted packets to produce a decoded video signal.
24. A method of decrypting and decoding a selectively encrypted digital video signal, comprising:
receiving packets of digital video, certain of the packets being unencrypted and certain of the packets being encrypted, wherein certain of the encrypted packets represent at least one of a pattern of horizontal stripes across an image and a pattern of vertical stripes across the image;
the unencrypted packets having a first packet identifier (PID) and the encrypted packets having a second packet identifier (PID); decrypting the encrypted packets having the second PID to produce decrypted packets; remapping at least one of the first and second PIDs so that the unencrypted packets and the decrypted packets have the same PID; and
decoding the unencrypted and decrypted packets to produce a decoded video signal.
25. A computer readable tangible electronic storage device storing instructions which, when executed on a programmed processor, carry out the method of decoding and decrypting a digital video signal according to claim 24.
26. A computer readable tangible electronic storage device that carries instructions that when executed on a programmed processor facilitates operation of a video receiver device to decrypt and decode a selectively encoded digital video signal wherein the instructions comprise:
a code segment that controls a demultiplexer that receives packets of digital video, certain of the packets being unencrypted and certain of the packets being encrypted, wherein certain of the encrypted packets represent at least one of a pattern of horizontal stripes across an image and packets representing a pattern of vertical stripes across the image;
the unencrypted packets having a first packet identifier (PID) and the encrypted packets having a second packet identifier (PID);
a code segment that controls decryption of the encrypted packets to produce decrypted packets;
a code segment that controls remapping at least one of the first and second PIDs so that the unencrypted packets and the decrypted packets have the same BID; and
a code segment that controls decoding the unencrypted and decrypted packets to produce a decoded video signal.
Patent Citations (319)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3852519(A) | 1974-12-01 | Court | Applicant |
| US4381481(A) | 1983-04-01 | Kuppers et al. | Applicant |
| US4381519(A) | 1983-04-01 | Wilkinson et al. | Applicant |
| US4419693(A) | 1983-12-01 | Wilkinson | Applicant |
| US4521853(A) | 1985-06-01 | Guttag | Applicant |
| US4634808(A) | 1987-01-01 | Moerder | Applicant |
| US4700387(A) | 1987-10-01 | Hirata | Applicant |
| US4703351(A) | 1987-10-01 | Kondo | Applicant |
| US4703352(A) | 1987-10-01 | Kondo | Applicant |
| US4710811(A) | 1987-12-01 | Kondo | Applicant |
| US4712238(A) | 1987-12-01 | Gilhousen et al. | Applicant |
| US4722003(A) | 1988-01-01 | Kondo | Applicant |
| US4739510(A) | 1988-04-01 | Jeffers et al. | Applicant |
| US4772947(A) | 1988-09-01 | Kono | Applicant |
| US4785361(A) | 1988-11-01 | Brotby | Applicant |
| US4788589(A) | 1988-11-01 | Kondo | Applicant |
| US4815078(A) | 1989-03-01 | Shimura | Applicant |
| US4845560(A) | 1989-07-01 | Kondo et al. | Applicant |
| US4887296(A) | 1989-12-01 | Horne | Applicant |
| US4890161(A) | 1989-12-01 | Kondo | Applicant |
| US4924310(A) | 1990-05-01 | von Brandt | Applicant |
| US4944006(A) | 1990-07-01 | Citta et al. | Applicant |
| US4953023(A) | 1990-08-01 | Kondo | Applicant |
| US4989245(A) | 1991-01-01 | Bennett | Applicant |
| US4995080(A) | 1991-02-01 | Bestler et al. | Applicant |
| US5018197(A) | 1991-05-01 | Jones et al. | Applicant |
| US5023710(A) | 1991-06-01 | Kondo et al. | Applicant |
| US5091936(A) | 1992-02-01 | Katznelson et al. | Applicant |
| US5122873(A) | 1992-06-01 | Golin | Applicant |
| US5138659(A) | 1992-08-01 | Kelkar et al. | Applicant |
| US5142537(A) | 1992-08-01 | Kutner et al. | Applicant |
| US5144662(A) | 1992-09-01 | Welmer | Applicant |
| US5144664(A) | 1992-09-01 | Esserman et al. | Applicant |
| US5159452(A) | 1992-10-01 | Kinoshita et al. | Applicant |
| US5196931(A) | 1993-03-01 | Kondo | Applicant |
| US5208816(A) | 1993-05-01 | Seshardi et al. | Applicant |
| US5237424(A) | 1993-08-01 | Nishino et al. | Applicant |
| US5237610(A) | 1993-08-01 | Gammie et al. | Applicant |
| US5241381(A) | 1993-08-01 | Kondo | Applicant |
| US5247575(A) | 1993-09-01 | Sprague et al. | Applicant |
| US5258835(A) | 1993-11-01 | Kato | Applicant |
| US5319707(A) | 1994-06-01 | Wasilewski et al. | Applicant |
| US5319712(A) | 1994-06-01 | Finkelstein et al. | Examiner |
| US5325432(A) | 1994-06-01 | Gardeck et al. | Applicant |
| US5327502(A) | 1994-07-01 | Katata et al. | Applicant |
| US5341425(A) | 1994-08-01 | Wasilewski et al. | Applicant |
| US5359694(A) | 1994-10-01 | Concordel | Applicant |
| US5379072(A) | 1995-01-01 | Kondo | Applicant |
| US5398078(A) | 1995-03-01 | Masuda et al. | Applicant |
| US5400401(A) | 1995-03-01 | Wasilewski et al. | Applicant |
| US5416651(A) | 1995-05-01 | Uetake et al. | Applicant |
| US5416847(A) | 1995-05-01 | Boze | Applicant |
| US5420866(A) | 1995-05-01 | Wasilewski | Applicant |
| US5428403(A) | 1995-06-01 | Andrew et al. | Applicant |
| US5434716(A) | 1995-07-01 | Sugiyama et al. | Applicant |
| US5438369(A) | 1995-08-01 | Citta et al. | Applicant |
| US5444491(A) | 1995-08-01 | Lim | Applicant |
| US5455862(A) | 1995-10-01 | Hoskinson | Applicant |
| US5469216(A) | 1995-11-01 | Takahashi et al. | Applicant |
| US5471501(A) | 1995-11-01 | Parr et al. | Applicant |
| US5473692(A) | 1995-12-01 | Davis | Applicant |
| US5481554(A) | 1996-01-01 | Kondo | Applicant |
| US5481627(A) | 1996-01-01 | Kim | Applicant |
| US5485577(A) | 1996-01-01 | Eyer et al. | Applicant |
| US5491748(A) | 1996-02-01 | Auld, Jr. et al. | Applicant |
| US5518934(A) | 1996-05-01 | Forrest et al. | Applicant |
| US5528608(A) | 1996-06-01 | Shimizume | Applicant |
| US5535276(A) | 1996-07-01 | Ganesan | Applicant |
| US5539823(A) | 1996-07-01 | Martin | Applicant |
| US5539828(A) | 1996-07-01 | Davis | Applicant |
| US5555305(A) | 1996-09-01 | Robinson et al. | Applicant |
| US5561713(A) | 1996-10-01 | Suh | Applicant |
| US5568552(A) | 1996-10-01 | Davis | Applicant |
| US5574787(A) | 1996-11-01 | Ryan | Applicant |
| US5582470(A) | 1996-12-01 | Yu | Applicant |
| US5583576(A) | 1996-12-01 | Perlman et al. | Applicant |
| US5583863(A) | 1996-12-01 | Darr, Jr. et al. | Applicant |
| US5590202(A) | 1996-12-01 | Bestler et al. | Applicant |
| US5598214(A) | 1997-01-01 | Kondo et al. | Applicant |
| US5600721(A) | 1997-02-01 | Kitazato | Applicant |
| US5606359(A) | 1997-02-01 | Youden et al. | Applicant |
| US5608448(A) | 1997-03-01 | Smoral et al. | Applicant |
| US5615265(A) | 1997-03-01 | Coutrot | Applicant |
| US5617333(A) | 1997-04-01 | Oyamada et al. | Applicant |
| US5625715(A) | 1997-04-01 | Trew et al. | Applicant |
| US5629981(A) | 1997-05-01 | Nerlikar | Applicant |
| US5652795(A) | 1997-07-01 | Dillon et al. | Applicant |
| US5663764(A) | 1997-09-01 | Kondo et al. | Applicant |
| US5666293(A) | 1997-09-01 | Metz et al. | Applicant |
| US5699429(A) | 1997-12-01 | Tamer et al. | Applicant |
| US5703889(A) | 1997-12-01 | Shimoda et al. | Applicant |
| US5717814(A) | 1998-02-01 | Abecassis | Applicant |
| US5726711(A) | 1998-03-01 | Boyce | Applicant |
| US5732346(A) | 1998-03-01 | Lazaridis et al. | Applicant |
| US5742680(A) | 1998-04-01 | Wilson | Applicant |
| US5742681(A) | 1998-04-01 | Giachetti et al. | Applicant |
| US5751280(A) | 1998-05-01 | Abbott et al. | Applicant |
| US5751743(A) | 1998-05-01 | Takizawa | Applicant |
| US5751813(A) | 1998-05-01 | Dorenbos | Applicant |
| US5754650(A) | 1998-05-01 | Katznelson | Applicant |
| US5754658(A) | 1998-05-01 | Aucsmith | Examiner |
| US5757417(A) | 1998-05-01 | Aras et al. | Applicant |
| US5757909(A) | 1998-05-01 | Park | Applicant |
| US5768539(A) | 1998-06-01 | Metz et al. | Applicant |
| US5796786(A) | 1998-08-01 | Lee | Applicant |
| US5796829(A) | 1998-08-01 | Newby et al. | Applicant |
| US5796840(A) | 1998-08-01 | Davis | Applicant |
| US5802176(A) | 1998-09-01 | Audebert | Applicant |
| US5805700(A) | 1998-09-01 | Nardone et al. | Applicant |
| US5805712(A) | 1998-09-01 | Davis | Applicant |
| US5805762(A) | 1998-09-01 | Boyce et al. | Applicant |
| US5809147(A) | 1998-09-01 | De Lange et al. | Applicant |
| US5815146(A) | 1998-09-01 | Youden et al. | Applicant |
| US5818934(A) | 1998-10-01 | Cuccia | Applicant |
| US5825879(A) | 1998-10-01 | Davis | Applicant |
| US5850218(A) | 1998-12-01 | LaJoie et al. | Applicant |
| US5852290(A) | 1998-12-01 | Chaney | Applicant |
| US5852470(A) | 1998-12-01 | Kondo et al. | Applicant |
| US5870474(A) | 1999-02-01 | Wasilewski et al. | Applicant |
| US5894320(A) | 1999-04-01 | Vancelette | Applicant |
| US5894516(A) | 1999-04-01 | Brandenburg | Applicant |
| US5915018(A) | 1999-06-01 | Aucsmith | Applicant |
| US5922048(A) | 1999-07-01 | Emura | Applicant |
| US5923755(A) | 1999-07-01 | Birch | Applicant |
| US5930361(A) | 1999-07-01 | Hayashi et al. | Applicant |
| US5933500(A) | 1999-08-01 | Blatter et al. | Applicant |
| US5940738(A) | 1999-08-01 | Rao | Applicant |
| US5949877(A) | 1999-09-01 | Traw et al. | Applicant |
| US5949881(A) | 1999-09-01 | Davis | Applicant |
| US5973679(A) | 1999-10-01 | Abbott et al. | Applicant |
| US5973722(A) | 1999-10-01 | Wakai et al. | Applicant |
| US5999622(A) | 1999-12-01 | Yasukawa et al. | Applicant |
| US5999698(A) | 1999-12-01 | Nakai et al. | Applicant |
| US6005561(A) | 1999-12-01 | Hawkins et al. | Applicant |
| US6011849(A) | 2000-01-01 | Orrin | Applicant |
| US6012144(A) | 2000-01-01 | Pickett | Applicant |
| US6021199(A) | 2000-02-01 | Ishibashi | Applicant |
| US6021201(A) | 2000-02-01 | Bakhle et al. | Applicant |
| US6026164(A) | 2000-02-01 | Sakamoto et al. | Applicant |
| US6028932(A) | 2000-02-01 | Park | Applicant |
| US6049613(A) | 2000-04-01 | Jakobsson | Applicant |
| US6055314(A) | 2000-04-01 | Spies et al. | Applicant |
| US6055315(A) | 2000-04-01 | Doyle et al. | Applicant |
| US6057872(A) | 2000-05-01 | Candelore | Applicant |
| US6058186(A) | 2000-05-01 | Enari | Applicant |
| US6058192(A) | 2000-05-01 | Guralnick et al. | Applicant |
| US6061451(A) | 2000-05-01 | Muratani et al. | Applicant |
| US6064748(A) | 2000-05-01 | Hogan | Applicant |
| US6065050(A) | 2000-05-01 | DeMoney | Applicant |
| US6069647(A) | 2000-05-01 | Sullivan et al. | Applicant |
| US6070245(A) | 2000-05-01 | Murphy, Jr. et al. | Applicant |
| US6072872(A) | 2000-06-01 | Chang et al. | Applicant |
| US6072873(A) | 2000-06-01 | Bewick | Applicant |
| US6073122(A) | 2000-06-01 | Wool | Applicant |
| US6088450(A) | 2000-07-01 | Davis et al. | Applicant |
| US6105134(A) | 2000-08-01 | Pinder et al. | Applicant |
| US6108422(A) | 2000-08-01 | Newby et al. | Applicant |
| US6115821(A) | 2000-09-01 | Newby et al. | Applicant |
| US6118873(A) | 2000-09-01 | Lotspiech et al. | Applicant |
| US6134551(A) | 2000-10-01 | Aucsmith | Applicant |
| US6138237(A) | 2000-10-01 | Ruben et al. | Applicant |
| US6148082(A) | 2000-11-01 | Slattery et al. | Examiner |
| US6154206(A) | 2000-11-01 | Ludtke | Applicant |
| US6157719(A) | 2000-12-01 | Wasilewski et al. | Applicant |
| US6181334(B1) | 2001-01-01 | Freeman et al. | Applicant |
| US6185369(B1) | 2001-02-01 | Ko et al. | Applicant |
| US6185546(B1) | 2001-02-01 | Davis | Applicant |
| US6189096(B1) | 2001-02-01 | Haverty | Applicant |
| US6192131(B1) | 2001-02-01 | Geer, Jr. et al. | Applicant |
| US6199053(B1) | 2001-03-01 | Herbert et al. | Applicant |
| US6204843(B1) | 2001-03-01 | Freeman et al. | Applicant |
| US6209098(B1) | 2001-03-01 | Davis | Applicant |
| US6215484(B1) | 2001-04-01 | Freeman et al. | Applicant |
| US6226618(B1) | 2001-05-01 | Downs et al. | Applicant |
| US6229895(B1) | 2001-05-01 | Son et al. | Applicant |
| US6230194(B1) | 2001-05-01 | Frailong et al. | Applicant |
| US6230266(B1) | 2001-05-01 | Perlman et al. | Applicant |
| US6236727(B1) | 2001-05-01 | Ciacelli et al. | Applicant |
| US6240553(B1) | 2001-05-01 | Son et al. | Applicant |
| US6246720(B1) | 2001-06-01 | Kutner et al. | Applicant |
| US6256747(B1) | 2001-07-01 | Inohara et al. | Applicant |
| US6263506(B1) | 2001-07-01 | Ezaki et al. | Applicant |
| US6266416(B1) | 2001-07-01 | Sigbj.o slashed.rnsen et al. | Applicant |
| US6266480(B1) | 2001-07-01 | Ezaki et al. | Applicant |
| US6272538(B1) | 2001-08-01 | Holden et al. | Applicant |
| US6278783(B1) | 2001-08-01 | Kocher et al. | Applicant |
| US6289455(B1) | 2001-09-01 | Kocher et al. | Applicant |
| US6292568(B1) | 2001-09-01 | Akins, III et al. | Applicant |
| US6292892(B1) | 2001-09-01 | Davis | Applicant |
| US6307939(B1) | 2001-10-01 | Vigarie | Applicant |
| US6311012(B1) | 2001-10-01 | Cho et al. | Applicant |
| US6324288(B1) | 2001-11-01 | Hoffman | Applicant |
| US6351538(B1) | 2002-02-01 | Uz | Applicant |
| US6378130(B1) | 2002-04-01 | Adams | Applicant |
| US6389533(B1) | 2002-05-01 | Davis et al. | Applicant |
| US6389537(B1) | 2002-05-01 | Davis et al. | Applicant |
| US6415031(B1) | 2002-07-01 | Colligan et al. | Applicant |
| US6415101(B1) | 2002-07-01 | deCarmo et al. | Applicant |
| US6430361(B1) | 2002-08-01 | Lee | Applicant |
| US6445738(B1) | 2002-09-01 | Zdepski et al. | Applicant |
| US6449718(B1) | 2002-09-01 | Rucklidge et al. | Applicant |
| US6453115(B1) | 2002-09-01 | Boyle | Applicant |
| US6456985(B1) | 2002-09-01 | Ohtsuka | Applicant |
| US6459427(B1) | 2002-10-01 | Mao et al. | Applicant |
| US6463152(B1) | 2002-10-01 | Takahashi | Applicant |
| US6466671(B1) | 2002-10-01 | Maillard et al. | Applicant |
| US6505032(B1) | 2003-01-01 | McCorkle et al. | Applicant |
| US6505299(B1) | 2003-01-01 | Zeng et al. | Applicant |
| US6510554(B1) | 2003-01-01 | Gordon et al. | Applicant |
| US6519693(B1) | 2003-02-01 | Debey | Applicant |
| US6529526(B1) | 2003-03-01 | Schneidewend | Applicant |
| US6543053(B1) | 2003-04-01 | Li et al. | Applicant |
| US6549229(B1) | 2003-04-01 | Kirby et al. | Applicant |
| US6557031(B1) | 2003-04-01 | Mimura et al. | Applicant |
| US6587561(B1) | 2003-07-01 | Sered et al. | Applicant |
| US6640145(B1) | 2003-10-01 | Hoffberg et al. | Applicant |
| US6650754(B1) | 2003-11-01 | Akiyama et al. | Applicant |
| US6654389(B1) | 2003-11-01 | Brunheroto et al. | Applicant |
| US6678740(B1) | 2004-01-01 | Rakib et al. | Applicant |
| US6681326(B1) | 2004-01-01 | Son et al. | Applicant |
| US6684250(B1) | 2004-01-01 | Anderson et al. | Applicant |
| US6697944(B1) | 2004-02-01 | Jones et al. | Applicant |
| US6754276(B1) | 2004-06-01 | Harumoto et al. | Applicant |
| US6772340(B1) | 2004-08-01 | Peinado et al. | Applicant |
| US6788690(B1) | 2004-09-01 | Harri | Applicant |
| US6826185(B1) | 2004-11-01 | Montanaro et al. | Applicant |
| US6891565(B1) | 2005-05-01 | Dieterich | Applicant |
| US6904520(B1) | 2005-06-01 | Rosset et al. | Applicant |
| US6976166(B1) | 2005-12-01 | Herley et al. | Examiner |
| US2001/0030959(A1) | 2001-10-01 | Ozawa et al. | Applicant |
| US2002/0026587(A1) | 2002-02-01 | Talstra et al. | Applicant |
| US2002/0046406(A1) | 2002-04-01 | Chelehmai et al. | Applicant |
| US2002/0047915(A1) | 2002-04-01 | Misu | Applicant |
| US2002/0059425(A1) | 2002-05-01 | Belfiore et al. | Applicant |
| US2002/0083317(A1) | 2002-06-01 | Ohta et al. | Examiner |
| US2002/0083438(A1) | 2002-06-01 | So et al. | Applicant |
| US2002/0097322(A1) | 2002-07-01 | Monroe et al. | Applicant |
| US2002/0108035(A1) | 2002-08-01 | Herley et al. | Applicant |
| US2002/0129243(A1) | 2002-09-01 | Nanjundiah | Applicant |
| US2002/0150239(A1) | 2002-10-01 | Carny et al. | Applicant |
| US2002/0170053(A1) | 2002-11-01 | Peterka et al. | Applicant |
| US2002/0184506(A1) | 2002-12-01 | Perlman | Applicant |
| US2002/0194613(A1) | 2002-12-01 | Unger | Applicant |
| US2002/0196939(A1) | 2002-12-01 | Unger et al. | Applicant |
| US2003/0002854(A1) | 2003-01-01 | Belknap et al. | Applicant |
| US2003/0009669(A1) | 2003-01-01 | White et al. | Applicant |
| US2003/0021412(A1) | 2003-01-01 | Candelore et al. | Applicant |
| US2003/0026423(A1) | 2003-02-01 | Unger et al. | Applicant |
| US2003/0046686(A1) | 2003-03-01 | Candelore et al. | Applicant |
| US2003/0063615(A1) | 2003-04-01 | Luoma et al. | Applicant |
| US2003/0072555(A1) | 2003-04-01 | Yap et al. | Applicant |
| US2003/0077071(A1) | 2003-04-01 | Lin et al. | Applicant |
| US2003/0081630(A1) | 2003-05-01 | Mowery et al. | Applicant |
| US2003/0081776(A1) | 2003-05-01 | Candelore | Applicant |
| US2003/0084284(A1) | 2003-05-01 | Ando et al. | Applicant |
| US2003/0097662(A1) | 2003-05-01 | Russ et al. | Applicant |
| US2003/0112333(A1) | 2003-06-01 | Chen et al. | Applicant |
| US2003/0118243(A1) | 2003-06-01 | Sezer et al. | Applicant |
| US2003/0123664(A1) | 2003-07-01 | Pedlow et al. | Applicant |
| US2003/0123849(A1) | 2003-07-01 | Nallur et al. | Applicant |
| US2003/0126086(A1) | 2003-07-01 | Safadi | Applicant |
| US2003/0133570(A1) | 2003-07-01 | Candelore et al. | Applicant |
| US2003/0140257(A1) | 2003-07-01 | Peterka et al. | Applicant |
| US2003/0145329(A1) | 2003-07-01 | Candelore | Applicant |
| US2003/0152224(A1) | 2003-08-01 | Candelore et al. | Applicant |
| US2003/0152226(A1) | 2003-08-01 | Candelore et al. | Applicant |
| US2003/0156718(A1) | 2003-08-01 | Candelore et al. | Applicant |
| US2003/0159139(A1) | 2003-08-01 | Candelore et al. | Applicant |
| US2003/0159140(A1) | 2003-08-01 | Candelore et al. | Applicant |
| US2003/0159152(A1) | 2003-08-01 | Lin et al. | Applicant |
| US2003/0174837(A1) | 2003-09-01 | Candelore et al. | Applicant |
| US2003/0188154(A1) | 2003-10-01 | Dallard | Applicant |
| US2003/0193973(A1) | 2003-10-01 | Takashimizu et al. | Applicant |
| US2003/0198223(A1) | 2003-10-01 | Mack et al. | Applicant |
| US2003/0204717(A1) | 2003-10-01 | Kuehnel | Applicant |
| US2003/0226149(A1) | 2003-12-01 | Chun et al. | Applicant |
| US2003/0228018(A1) | 2003-12-01 | Vince | Applicant |
| US2004/0003008(A1) | 2004-01-01 | Wasilewski et al. | Applicant |
| US2004/0010717(A1) | 2004-01-01 | Simec et al. | Applicant |
| US2004/0028227(A1) | 2004-02-01 | Yu | Applicant |
| US2004/0047470(A1) | 2004-03-01 | Candelore | Applicant |
| US2004/0049688(A1) | 2004-03-01 | Candelore et al. | Applicant |
| US2004/0049690(A1) | 2004-03-01 | Candelore et al. | Applicant |
| US2004/0049691(A1) | 2004-03-01 | Candelore et al. | Applicant |
| US2004/0049694(A1) | 2004-03-01 | Candelore | Applicant |
| US2004/0078575(A1) | 2004-04-01 | Morten et al. | Applicant |
| US2004/0081333(A1) | 2004-04-01 | Grab et al. | Applicant |
| US2004/0091109(A1) | 2004-05-01 | Son et al. | Applicant |
| US2004/0123094(A1) | 2004-06-01 | Sprunk | Applicant |
| US2004/0139337(A1) | 2004-07-01 | Pinder et al. | Applicant |
| US2004/0165586(A1) | 2004-08-01 | Read et al. | Applicant |
| US2004/0187161(A1) | 2004-09-01 | Cao | Applicant |
| US2004/0193550(A1) | 2004-09-01 | Siegal | Applicant |
| US2005/0004875(A1) | 2005-01-01 | Kontio et al. | Applicant |
| US2005/0071669(A1) | 2005-03-01 | Medvinsky et al. | Applicant |
| US2005/0169473(A1) | 2005-08-01 | Candelore | Applicant |
| US2005/0192904(A1) | 2005-09-01 | Candelore | Applicant |
| EP471373 | 1992-02-01 | Applicant | |
| EP527611 | 1992-07-01 | Applicant | |
| EP558016 | 1993-02-01 | Applicant | |
| EP596826 | 1993-04-01 | Applicant | |
| EP610587 | 1993-12-01 | Applicant | |
| EP6802090 | 1995-04-01 | Applicant | |
| EP674440 | 1995-09-01 | Applicant | |
| EP674441 | 1995-09-01 | Applicant | |
| EP674441(A1) | 1995-09-01 | Examiner | |
| EP833517 | 1998-04-01 | Applicant | |
| EP866615 | 1998-09-01 | Applicant | |
| EP1187483(A2) | 2002-03-01 | Applicant | |
| EP1187483 | 2002-03-01 | Applicant | |
| JP67028 | 1995-03-01 | Applicant | |
| JP11243534 | 2002-10-01 | Applicant | |
| WO86/07224 | 1986-12-01 | Applicant | |
| WO94/10775 | 1994-05-01 | Applicant | |
| WO97/38530 | 1997-10-01 | Applicant | |
| WO/31964 | 2000-06-01 | Applicant | |
| WO1/65762 | 2001-09-01 | Applicant | |
| WO1/78386 | 2001-10-01 | Applicant | |
| WO1/78386(A2) | 2001-10-01 | Applicant |
Non-Patent Literature (68)
- Alattar et al; “Improved Selective Encryption Techniques for Secure Transmission of MPEG Video Bit-Streams”; 1999; IEEE; pp. 256-260.Examiner
- Liu, et al. Motion Vector Encryption in Multimedia Streaming, 2004, IEEE, pp. 64-71.Applicant
- Alattar, A.M. et al., Improved selective encryption techniques for secure transmission of MPEG video bitstreams, Oct. 24, 1999, Digimarc Corp., Lake Oswego, OR, USA, IEEE, pp. 256-260.Applicant
- Kunkelmann T. et al., A scalable security architecture for multimedia communication standards, Darmstard Univ. of Technology, ITO, Germany, 1997, pp. 660-661.Applicant
- Yip, Kun-Wah, Partial-encryption technique for intellectual property protection of FPGA-Based products, Dec. 15, 1999, IEEE, pp. 183-190.Applicant
- International Search Report for application No. PCT/US2004/032228.Applicant
- “A Report on Security Issues in Multimedia” by Gulwani, pp. 10-14, Apr. 30, 2000, Course Notes, Department of Computer Science and Engineering, Indian Institute of Technology Kanpur.Applicant
- “Ad Agencies and Advertisers To Be Empowered with Targeted Ads Delivered by Television's Prevailing Video Servers” Article Business Section of The New York Times, Updated Thursday, Dec. 20, 2001.Applicant
- “An Efficient MPEG Video Encryption Algorithm” by Shi and Bhargava, pp. 381-386, 1998 IEEE.Applicant
- “An Empirical Study of Secure MPEG Video Transmissions” by Agi and Gong, pp. 137-144, 1996, IEEE, Proceedings of SNDSS '96.Applicant
- “Applying Encryption to Video Communication” by Kunkelmann, pp. 41-47, Sep. 1998, Multimedia and Security Workshop at ACM Multimedia '98, Bristol, U.K.Applicant
- “Comparison of MPEG Encryption Algorithms” by Qiao and Nahrstedt, Jan. 17, 1998, Preprint submitted to Elsevier Science.Applicant
- “Coral Consortium Aims to Make DRM Interoperable”, by Bill Rosenblatt, Oct. 7, 2004, online at http://www.drmwatch.com/standards/article.php/3418741.Applicant
- “DVD Demystified—The Guidebook for DVD-Video and DVD-ROM” by Jim Taylor, Pub. McGraw-Hill, 1998, ISBN: 0-07-064841-7, pp. 134-147.Applicant
- “Dynamic-Customized TV Advertising Creation and Production Tools” by SeaChange International, Web Site Literature.Applicant
- “Efficient Frequency Domain Video Scrambling for Content Access Control” by Zeng and Lei, Nov. 1999, In Proc. ACM Multimedia.Applicant
- “Evaluation of Selective Encryption Techniques for Secure Transmission of MPEG-Compressed Bit-Streams” by Alattar and Al-Regib, pp. IV-340 to IV-343, 1999, IEEE.Applicant
- “Fast Encryption Methods for Audiovisual Data Confidentiality” by Wu and Kuo, Nov. 2000, SPIE International Symposia on Information Technologies 2000, (Boston, MA., USA).Applicant
- “Improved Selective Encryption Techniques for Secure Transmission of MPEG Video Bit-Streams” by Alattar, Al-Regib and Al-Semari, pp. 256-260, 1999, IEEE.Applicant
- Metro Media ™ PVR-DVD-MP3-Web—Internet publication from www.metrolink.com, undated.Applicant
- “Multimedia and Security Workshop at ACM Multimedia” '98. Bristol. U.K., Sep. 1998.Applicant
- “Passage ™, Freedom to Choose”, 2003, Sony Electronics Inc.Applicant
- “Performance Study of a Selective Encryption Scheme for the Security of Networked, Real-Time Video” by Spanos and Maples, pp. 2-10, 1995, IEEE.Applicant
- “Pre-Encryption Profiles—Concept Overview and Proposal”, Rev. 1.2 as submitted to the Open CAS consortium on Dec. 28, 2000.Applicant
- “Run-Time Performance Evalulation for a Secure MPEG System Supporting Both Selective Watermarking and Encryption” by Wu and Wu, Mar. 1, 1997, submitted to JSAC special issue on Copyright and Privacy Protection.Applicant
- “Selective Encryption and Watermarking of MPEG Video (Extended Abstract)” by Wu and Wu, Feb. 17, 1997, submitted to International Conference on Image Science, Systems, and Technology, CISST'97.Applicant
- “The Long March to Interoperable Digital Rights Management” by Koenen et al., pp. 1-17, 2004, IEEE.Applicant
- “Transport Streams Insertion of Video in the Compressed Digital Domain” by SeaChange International, Web Site Literature, 2000.Applicant
- “Visible World—A High Impact Approach to Customized Television Advertising” by Haberman, Dec. 2001.Applicant
- ANONYMOUS, Message Authentication with Partial Encryption, Research dicosure RD 296086, Dec. 10, 1998.Applicant
- McCormac Hack Over Cablemodem, HackWatch, Aug. 10, 1998.Applicant
- ANONYMOUS, New Digital Copy Protection Proposal Would Secure Authorized Copies, PR Newswire, Nov. 1998, pp. 1-3.Applicant
- Aravind, H. , et al., “Image and Video Coding Standards”, AT&T Technical Journal, (Jan./Feb. 1993),67-68.Applicant
- Gonzalez, R.C., et al., “Digital Image Processing”, Addison Wesley Publishing Company, Inc., (1992),346-348.Applicant
- Kim, et al., “Bit Rate Reduction Algorithm for a Digital VCR”, IEEE Transactions on Consumer Electronics, vol. 37, No. 3, (Aug. 1, 1992),267-274.Applicant
- Kondo, et al., “A New Concealment Method for Digital VCRs”, IEEE Visual Signal Processing and Communication, Melbourne, Australia,(Sep. 1993),20-22.Applicant
- Kondo, et al., “Adaptive Dynamic Range Coding Scheme for Future Consumer Digital VTR”, 219-226.Applicant
- Kondo, et al., “Adaptive Dynamic Range Coding Scheme for Future HDTV Digital VTR”, Sony Corporation, (1991).Applicant
- Lakshiminath, et al., “A Dual Protocol for Scalable Secure Multicasting”, 1999 International Symposium on Computers and Communication, Jul. 6-8, 1999.Applicant
- Lookabaugh et al., “Selective Encryption and MPEG-2”, ACM Multimedia '03, Nov. 2003.Applicant
- Menezes, Alfred J., et al., “Handbook of Applied Cryptography”, CRC Press, 551-553.Applicant
- NHK Laboratories Note, “Error Correction, Concealment and Shuffling”, No. 424, (Mar. 1994),29-44.Applicant
- Park, et al., “A Simple Concealment for ATM Bursty Cell Loss”, IEEE Transactions on Consumer Electronics, No. 3, (Aug. 1993).Applicant
- Robert et al., “Digital Cable: The Key to Your Content”, Access Intelligence's Cable Group, Feb. 2002, online at http:www.cableworld.com/ct/archives/0202/0202digitalrights.htm.Applicant
- Tom, et al., “Packet Video for Cell Loss Protection Using Deinterleaving and Scrambling”, ICASSP 91: 1991 International Conference on Acoustics, Speech and Signal Processing, vol. 4, (Apr. 1991),2857-2860.Applicant
- Zhu, et al., “Coding and Cell-Loss Recovery in DCT-Based Packet Video”, IEEE Transactions on Circuits and Systems for Video Technology,Applicant
- “ClearPlay: The Technology of Choice”, from web site, ClearPlay 2001-2003.Applicant
- ANONYMOUS, Message Authentication with Partial Encryption, Research disclosure RD 296086, Dec. 10, 1988.Applicant
- “Performance Study of a Selective Encryption Scheme for the Security of Networked, Real-Time Video” by Spanos and Maples, pp. 2-10, 1995, IEEE.Applicant
- “An Empirical Study of Secure MPEG Video Transmissions” by Agi and Gong, pp. 137-144, 1996, IEEE, Proceedings of SNDSS '96.Applicant
- “Selective Encryption and Watermarking of MPEG Video (Extended Abstract)” by Wu and Wu, Feb. 1997, submitte to International Conference on Image Science, Systems, and Technology, CISST '97.Applicant
- “Run-Time Performance Evaluation for a Secure MPEG System Supporting Both Selective Watermarking and Encryption” by Wu and Wu, Mar. 1, 1997, submitted to JSAC special issue on Copyright and Privacy Protection.Applicant
- “DVD Demystified—The Guidebook for DVD-Video and DVD-ROM” by Jim Taylor, Pub. McGraw-Hill, 1998, ISBN: 0-07-064841-7, pp. 134-147.Applicant
- “An Efficient MPEG Video Encryption Algorithm” by Shi and Bhargava, pp. 381-386, 1998 IEEE.Applicant
- “Multimedia and Security Workshop at ACM Multimedia” '98, Bristol, U.K., Sep. 1998.Applicant
- “Comparison of MPEG Encryption Algorithms” by Qiao and Nahrstedt, Jan. 17, 1998, Preprint submitted to Elsevier Science.Applicant
- “Applying Encryption to Video Communication” by Kunkelmann, pp. 41-47, Sep. 1998, Multimedia and Security Workshop at ACM Multimedia '98. Bristol, U.K.Applicant
- “Evaluation of Selective Encryption Techniques for Secure Transmission of MPEG-Compressed Bit-Streams” by Alattar and Al-Regib, pp. IV-340 to IV-343, 1999, IEEE.Applicant
- “Improved Selective Encryption Techniques for Secure Transmission of MPEG Video Bit-Streams” by Alattar, Al-Regib and Al-Semari, pp. 256-260, 1999, IEEE.Applicant
- “Efficient Frequency Domain Video Scrambling for Content Access Control” by Zeng and Lei, Nov. 1999, In Proc. ACM Multimedia.Applicant
- “Transport Streams Insertion of Video in the Compressed Digital Domain” by SeaChange International, Web Site Literature, 2000.Applicant
- “A Report on Security Issues in Multimedia” by Gulwani, Apr. 30, 2000, Course Notes, Department of Computer Science and Engineering, Indian Institute of Technology Kanpur.Applicant
- “Fast Encryption Methods for Audiovisual Data Confidentiality” by Wu and Kuo, Nov. 2003, SPIE International Symposia on Information Technologies 2000, (Boston, Ma., USA).Applicant
- “Visible World—A High Impact Approach to Customized Television Advertising” by Haberman, Dec. 2001.Applicant
- “Ad Agencies and Advertisers To Be Empowered with Targeted Ads Delivered by Television's Prevailing Video Servers” Article Business Section of The New York Times, Updated Thursday, Dec. 20, 2001.Applicant
- “Pre-Encryption Profiles—Concept Overview and Proposal”, Rev. 1.2 as submitted to the Open CAS consortium on Dec. 28, 2000.Applicant
- “Dynamic-Customized TV Advertising Creation and Production Tools” by SeaChange International, Web Site Literature.Applicant
- “How Networks Work—Milennium Edition”—pp. 88-89, Que Corporation, 2000.Applicant