The invention relates to a communications technique, and more particularly to a technique for securely communicating programming material originating in a cable TV network to a device outside the network.
A set-top terminal (STT) serves as a gateway between a user's television and a cable TV network delivering programming content. Such programming content may be delivered as a broadcast. It may also be delivered on an on-demand basis, for which services such as video on demand (VOD), subscription VOD, movies on demand, etc., are offered. In addition, a “network personal video recorder (NPVR)” service has been developed, allowing the user to perform trick mode functions (rewind, fast-forward, pause, etc.) on a presentation of programming content through use of a network. In fact, a network architecture and functionalities for implementing the NPVR service are described, e.g., in International Publication Number WO 2003/093944 published on Nov. 13, 2003. The NPVR service also allows a user to “reserve” past and future programs for his/her review, even if such reserved programs were not identified by the user before their broadcast.
An STT receives, through the cable TV network, programming content which may be encrypted, e.g., in accordance with the data encryption standard (DES) technique, to secure its delivery. DES is a well known symmetrical cipher which utilizes a single key for both encryption and decryption of messages. Because the DES algorithm is publicly known, learning the DES key would allow an encrypted message to be read by anyone. As such, both the message sender and receiver must keep the DES key a secret from others. A DES key typically is a sequence of eight bytes, each containing eight bits. To enhance the DES integrity, the DES algorithm may be applied successive times. With this approach, the DES algorithm enciphers and deciphers data, e.g., three times in sequence, using multiple keys, resulting in a so-called triple DES (3DES) technique.
In contrast to the DES technique, a public key encryption technique, e.g., an RSA technique (named for its developers, Rivest, Shamir, and Adleman), uses two different keys. A first key, referred to as a private key, is kept secret by a user. The other key, referred to as a public key, is available to anyone wishing to communicate with the user in a confidential manner. The two keys uniquely match each other, collectively referred to as a “public key-private key pair.” However, the private key cannot be easily derived from the public key. A party wishing to send a message to the user may utilize the public key to encrypt a message before transmitting it. The user then utilizes the private key to decrypt the message. Conversely, the private key may be used to encrypt a message, in which case the message can subsequently be decrypted with the public key. For example, the keys for the RSA algorithm are mathematically generated, in part, by combining prime numbers. The security of the RSA algorithm, and the like, depends on the use of very large numbers for its keys, which typically are 512 bits long.
Public key encryption methodologies may often be utilized for authentication purposes. For example, a first party wishing to authenticate a data file may apply a well-known hash function (such as the SHA-1 algorithm) to the file, producing a hash value, and encode the hash value using its private key, producing an encoded value. An encoded value generated in this manner is sometimes referred to as a digital signature. The first party transmits the data file, and the digital signature, to a second party. The second party may then utilize the first party's known public key to decode the digital signature, generating a decoded value. The second party additionally applies the known hash function to the data file received from the first party, generating a verification value. The decoded value is compared with the verification value; if the decoded value and the verification value match, the first party may be confident of the sender's identity.
The authentication technique described above is useful when the second party has knowledge of the first party's public key. However, in many instances, the second party may not have such knowledge, and therefore cannot perform the steps necessary to authenticate the first party's identity. A common solution to this problem is to use a registration message issued by a commonly-known, trusted entity. A registration message may be, for example, a digital certificate generated in accordance with the ISO/X.509 standards published by the International Organization for Standardization. A registration message has value if both the first and second parties trust the trusted entity and have knowledge of the trusted entity's public key. In such case, the first party may generate an “unsigned” message containing its public key, and provide the message to the trusted entity with a request that the trusted entity “sign” the message. The trusted entity applies a well-known hash function to all or a portion of the message, and uses its private key to encode the resulting hash value, generating a digital signature. The trusted entity appends the signature to the message, and returns the resulting registration message to the first party. The first party may subsequently provide the signed registration message to a second party, who utilizes the trusted entity's public key to verify the registration message and extract the first party's public key therefrom. A trusted entity which issues registration messages in the manner described above is sometimes referred to as a “trusted licensing authority.”
A licensing “hierarchy” may also be established with a trusted licensing authority as the highest (and trusted) authority. In a system using such a licensing hierarchy, a party may be required to maintain multiple registration messages establishing a chain of authority up to the licensing authority. To authenticate its identity, a party provides to the second party as many registration messages as is necessary to demonstrate that its identity is recognized within the licensing hierarchy.
In prior art, programming content may be encrypted using a DES key, in accordance with a DES algorithm, to secure its delivery from a headend of a cable TV system to an STT. In order for the STT to decrypt the encrypted programming content, the DES key is transmitted from the headend to the STT in an entitlement control message (ECM), which is encrypted using a 3DES key in accordance with a 3DES algorithm. The 3DES key (also known as a “multi-session key (MSK)”) is sent to the STT in a separate entitlement management message (EMM), which is encrypted using an STT public key in accordance with a public key algorithm, whose private key counterpart is securely maintained in the STT. Thus, after receiving the encrypted EMM and ECM, the STT decrypts the encrypted EMM using the STT private key to obtain the 3DES key therein. Using such a 3DES key, the STT decrypts the encrypted ECM to obtain the DES key therein. Using such a DES key, the STT can decrypt the encrypted programming content it received.
Recently, some STTs for cable TV were improved to incorporate digital video recorder (DVR) functions (“DVR STTs”). Like a DVR, e.g., a Tivo or ReplayTV device, a DVR STT typically includes a hard drive, e.g., a disk, for digitally recording TV programs. Also like a DVR, a DVR STT allows a cable TV subscriber to record his/her favorite TV programs for later review, and exercise a season-pass-like option to record every episode of his/her favorite program for a period. It may automatically record programs for the user based on his/her viewing habit and preferences. The presentation of the recorded programming content can be manipulated by exercising rewind, pause and fast-forward functions.
However, cable operators have observed that providing to subscribers unrestricted recording of content might result in an unacceptable amount of unauthorized copying and/or distribution. Accordingly, there is a continuing need for a strategy that allows content to be stored by a subscriber, but at the same time prevents (or controls) copying and distributing the content to unauthorized parties. A number of techniques have been developed to address this need. One such technique involves use of an indicator, e.g., an encryption mode indicator (EMI), which may be inserted into a data stream used to transmit content from a source device to a destination device. The EMI provides to the destination device information concerning the status of the content; the status may indicate that the content can be freely copied, copied once, never copied, etc. The destination device reads the EMI and determines whether or not the content may be copied. If copying is permitted, the destination device may then copy the content. For details on such a content protection technique, one may refer to: “5C Digital Transmission Content Protection White Paper,” Hitachi, Ltd et al., Revision 1.0, Jul. 14, 1998.
Another technique requires a device intending to transmit protected content to determine whether or not the receiving device is authorized to receive such content. One such technique is disclosed in “High-Bandwidth Digital Content Protection System,” Digital Content Protection LLC, Revision 1.1, Jun. 9, 2003. In accordance with the disclosed technique, both the transmitting device and the receiving device have a valid array of secret device keys and a corresponding key selection vector. During an authentication process, the two devices exchange key selection vectors. The receiving device uses the transmitting device's key selection vector to generate a selection of its own secret device keys, and then calculates a value Km by adding the selected secret device keys using 56-bit binary addition. The transmitting device calculates a corresponding value Km′ using the receiving device's key selection vector. If each device has a valid set of secret device keys, Km=Km′. Only after the receiving device has established its legitimacy does the transmitting device deliver the content.
Another strategy used to control the usage and distribution of protected content is to employ a digital rights management (DRM) system. An example of a DRM system is the Microsoft Windows Media digital rights management system (MS-DRM). According to this system, a digital media file is encrypted and locked with a “license key.” The license key is stored in a license file which is distributed separately from the media file. A customer may obtain the encrypted media file by, e.g., downloading it from a web site, purchasing it on a disk, etc. To play the digital media file, the customer must first acquire the license file containing the corresponding license key. The customer acquires the license key by accessing a pre-delivered license; alternatively, when the customer plays the file for the first time, a procedure is activated for retrieving the license via the Internet. After obtaining the license with the license key, the customer can play the media file according to the rules or rights specified in the license.
Another example of a DRM system is described in “Real System Media Commerce Suite (Technical White Paper),” which is incorporated herein by reference in its entirety. A content file is encrypted by the system operator to become a secured content file, requiring a key to play the content in the file. The key is imported into a retailer's database, and the secured content file is provided to consumers by, e.g., offline distribution of CDs. The retailer sets usage rules for licensing content. A customer obtains the secured content file and contacts the retailer's web server through a trusted client to obtain a license to play the content. The retailer's web server requests rights from the operator's license server, which creates a license containing the key for the respective content file, and provides the license to the retailer's web server. The retailer's web server delivers the license to the trusted client. The trusted client receives the license with the key, retrieves the content file, and uses the key to play the content.
In recent years, numerous systems for providing interconnectivity among devices in a home have been developed, allowing home networks to include cable STTs, personal computers, cellphones, PDA devices, etc. An example of a system for interconnecting various devices in a home is described in International Publication No. WO 02/21841, published on Mar. 14, 2003. Because of the increasing popularity of home networking, there is a growing need for a strategy that enables a user to perform authorized transfer of protected content, e.g., transferring content from an STT to a second device in a home network, and at the same time prevents unauthorized distribution of the protected content.
In addition, in the cable industry, a CableCARD (also known as a “a point-of-deployment (POD) module”) has been developed to satisfy certain security requirements to allow retail availability of host devices, e.g., set-top boxes, digital cable ready televisions, DVRs, personal computers (PCs), integrated digital televisions, etc., for receiving cable services. The CableCARD, comprising a PCMCIA device, can be inserted into a host device, allowing a viewer to receive cable systems' secure digital video services, e.g., pay per view TV, electronic program guides, premium subscription channels, etc.
Specifically, the CableCARD contains conditional access functionality, as well as the capability of converting messages to a common format. Thus, the CableCARD provides a cable operator with a secure device at the subscriber premises, and acts as a translator so that the host device needs to understand a single protocol, regardless of the type of the network to which it is connected.
For example, with the CableCARDs provided by cable operators, host devices which run, e.g., on an OpenCable Applications Platform (OCAP), may be sold in retail outlets. (For details on such a platform, one may refer, e.g., to: “OpenCable Application Platform Specification,” OCAP 2.0 Profile, OC-SP-OCAP2.0-I01-020419, Cable Television Laboratories, Inc., Apr. 19, 2002.) The OCAP allows applications to be built to a common middleware layer for deployment on host devices interoperable across cable systems in North America. (For details on the functional requirements of one such host device, one may refer, e.g., to: “OpenCable™ Host Device Core Functional Requirements,” OC-SP-HOSR-CFR-I13-030707, Cable Television Laboratories, Inc., Jul. 7, 2003.) With a common interface to the CableCARD, a host can be moved from one place to another, provided that the user of the host device contact his/her new cable operator to obtain a new CableCARD. (For details on such an interface, one may refer, e.g., to: “OpenCable™ HOST-POD Interface Specification,” OC-SP-HOSTPOD-IF-I13-030707, Cable Television Laboratories, Inc. Jul. 7, 2003. To provision a new CableCARD and host device, an initialization and authorization process needs to be performed while the host device, with the CableCARD inserted therein, is connected to the cable network. The initialization and authorization process begins with the user's providing an ID(s) of the CableCARD and/or the host device (e.g., serial number(s)) to the cable operator. The cable operator looks up in a database a MAC address of the CableCARD which typically is hard-coded in the CableCARD, and is associated with the CableCARD ID. During the authorization process, the cable operator may, for example, assign an IP address to the CableCARD for its identification in the cable network. The cable operator may also collect from the host device data concerning the make, model, and ID of the host device (e.g., its serial number). The cable operator may associate the CableCARD's MAC address (and/or IP address) with the user information, e.g., his/her name, address, etc. for billing purposes.
The invention overcomes the prior art limitations by instituting a multi-layered rights arrangement to prevent unauthorized use and transfer of protected content, especially in a home network. For example, in accordance with the invention, the home network may be considered to comprise multiple layers. One such layer may be a “trusted domain,” described in aforementioned U.S. application Ser. No. 10/894,884, filed on Jul. 20, 2004. For example, in a cable TV system, the trusted domain includes not only the system portion where programming content traditionally is secured by, and within total control of, a cable operator, including, e.g., the headend, delivery network, etc., but also user devices, e.g., STTs, at subscribers' premises which are capable of receiving and securely storing programming content in a prescribed manner. The cable operator can control certain subscriber access and usage with respect to content held within the trusted domain. For example, movie content held within a cable operator's trusted domain (e.g., on a hard drive of an STT) cannot be distributed over the Internet in viewable form and cannot become a source for duplication of multiple viewable copies.
A second layer may be defined as being outside the trusted domain. In accordance with the invention, a device in the second layer is assigned an indicator indicating an extent of security of the device. For example, when the device in the second layer requests transfer of protected content from a device in the first layer, the first layer device authenticates the second layer device to determine legitimacy of the device for receiving the protected content. After the second layer device is authenticated, the first layer device transfers not only the protected content, but also a set of rules associated with the protected content. At least some of the rules in the set are associated with the indicator and applicable to the second layer device with respect to use of the protected content.
The invention broadly encompasses the concept of the multi-layered rights arrangement including the trusted domain for preventing unauthorized use of protected content. The invention is not limited to use of specific devices in the arrangement. For example, the invention equally applies to a host device connected to a CableCARD module, jointly realizing, e.g., the functionalities of a DVR STT. In an embodiment of the invention, the host device has programming content, which is encrypted, stored in storage therein. The module may receive a request from the device for accessing the programming content. The request includes a data package stored in association with the encrypted programming content in the storage. In response to the request, the module may determine that the device is allowed to access the programming content based on information (e.g., usage rights information) in the first data package. The module may then provide the host device at least data concerning a cryptographic element (e.g., an encryption key) for decrypting the encrypted programming content in the storage, thereby providing the device with access to the programming content.
In one aspect of the present disclosure, a method is disclosed. In one embodiment thereof, the method is for protecting data content within a trusted domain, and the method includes: receiving one or more protected data content from a device of a first domain that is outside of the trusted domain, the one or more protected data content associated with a minimum security level of compliance of the first domain; invoking a mutual authentication process including registering with a trusted network entity, the trusted network entity being known commonly to (i) the device of the first domain and (ii) a first device of the trusted domain; causing a creation of a rights file indicating an extent of sharing permissions within the trusted domain, based at least on the minimum security level of compliance assigned to the device of the first domain; and responsive to receiving a request to transfer the one or more protected data content within the trusted domain: verifying that the request to transfer the one or more protected data content complies with the extent of sharing permissions and with a minimum security level of compliance assigned to the device of the first domain; and based at least on successful completion of the verifying, causing transmitting of the one or more protected data content.
In one variant, the first domain includes a first multi-layered rights arrangement, and the trusted domain includes a second multi-layered rights arrangement different from the first multi-layered rights arrangement of the first domain, the minimum security level of compliance including a set of rights selected from a plurality of sets of rights of the first multi-layered rights arrangement.
In one implementation, all devices of the trusted domain are configured to enable consumption of the one or more protected data content within the extent of sharing permissions.
In another aspect of the present disclosure, a device is disclosed. In one embodiment thereof, the device is configured to protect data content within a trusted domain, and the device includes a first interface in data communication with a first domain outside of the trusted domain; a trusted interface in data communication with the trusted domain; a processor apparatus in data communication with the first interface and the trusted interface; and a non-transitory computer readable medium in data communication with the processor apparatus.
In one variant, the non-transitory medium includes at least one computer program having one or more instructions which, when executed by the processor apparatus, cause the device to: receive one or more protected data content from a client device of the first domain; invoke a mutual authorization process, the mutual authorization process including a registration of the device with a trusted network entity, the trusted network entity being known commonly to (i) the device and (ii) the client device of the first domain outside of the trusted domain; and cause the creation of a rights file indicating an extent of sharing permissions within the trusted domain, based at least on the minimum security level of compliance supported on the client device of the first domain.
In one implementation, the one or more protected data content is/are associated with a minimum security level of compliance, including prescribed one or more rights of a plurality of rights, where only the prescribed one or more rights is supported on the client device of the first domain.
In another implementation, the prescribed one or more rights supported on the client device are determined by the rights file indicating the extent of sharing permissions.
In another aspect of the present disclosure, a non-transitory computer-readable storage medium is disclosed. In one embodiment thereof, the non-transitory computer-readable storage medium has at least one computer program including a plurality of instructions stored therein. In one variant, the plurality of instructions are configured to, when executed by a processor apparatus, cause a first computerized device to: receive protected data content from a second computerized device, the second computerized device being disposed in an outside domain that is not within a trusted domain, the protected data content being associated with a minimum security level of compliance of the outside domain; invoke a mutual authorization process, including a registration of the first computerized device with a computerized trusted network entity, the computerized trusted network entity being known commonly to (i) the first computerized device and (ii) the second computerized device operative within the outside domain; cause a creation of a rights data file indicating an extent of sharing permissions within the trusted domain, based at least on the minimum security level of compliance assigned to the second computerized device of the outside domain; and based on receipt of a request to transfer the protected data content within the trusted domain: verify that the request to transfer the one or more protected data content complies with the extent of sharing permissions and with the minimum security level of compliance assigned to the second computerized device of the outside domain; and based at least on successful verification, cause transmission of the protected data content.
In one implementation, the outside domain includes a first multi-layered rights arrangement, the trusted domain includes a second multi-layered rights arrangement different from the first multi-layered rights arrangement of the first domain, and the minimum security level of compliance includes a set of rights selected from a plurality of sets of rights of the first multi-layered rights arrangement.
In another implementation, all computerized devices of the trusted domain are configured to enable consumption of the protected data content within the extent of sharing permissions.
Further objects, features and advantages of the invention will become apparent from the following detailed description taken in conjunction with the accompanying drawing showing illustrative embodiments of the invention, in which:
The invention is directed to a technique for securely transferring protected programming content from one protective layer to another to prevent unauthorized access and copying of the protected content. One such protective layer is referred to as a “trusted domain.” In a cable TV system, the trusted domain includes not only the system portion where programming content traditionally is secured by, and within total control of, a cable operator, including, e.g., the headend, delivery network, etc., but also user devices at subscribers' premises which are capable of receiving and storing programming content, e.g., a DVR STT, and which implement a conditional access mechanism described below. For the sake of convenience, a DVR STT which implements the conditional access mechanism hereinafter is referred to as a “secure DVR STT (SDVR STT).”
The cable operator can control certain subscriber access and usage with respect to content held within the trusted domain. For example, a motion picture held within a cable operator's trusted domain (e.g., on a hard drive of an SDVR STT) cannot be distributed over the Internet in viewable form and cannot become a source for duplication of multiple viewable copies. In accordance with the invention, a multi-layered rights arrangement is instituted to facilitate secure transfer of content from one protective layer (e.g., the trusted domain) to another (e.g., outside the trusted domain). In an illustrative embodiment, a first device within the trusted domain is allowed to transmit protected content to a second device outside the trusted domain, provided that the second device recognize and function pursuant to the multi-layered rights arrangement with respect to the protected content. In other words, although the second device outside the trusted domain may receive protected content from the first device in the trusted domain, use and distribution by the second device of the protected content are subject to the rights and restrictions specified by the multi-layered rights arrangement.
In accordance with the multi-layered rights arrangement, a receiving device may be assigned a security level indicative of the security of the device. In one embodiment, a receiving device may be assigned a security level 1 (low level of trust), 2 (medium level of trust), or 3 (high level of trust). A receiving device's security level determines the set of rights that are accorded to it with respect to the received content.
By way of example, suppose that a personal media device (PMD) outside the trusted domain requests a copy of a movie from an SDVR STT within the trusted domain. A PMD may be, e.g., a digital video player, personal computer (PC), personal digital assistant (PDA), mobile telephone, etc. If the PMD is a Security Level 1 device, it may not be authorized to receive the movie content. If the PMD is a Security Level 2 device, it may be authorized to receive the movie content, but its rights to play the movie, and to transfer the movie content to other devices, may be restricted. If the PMD is a Level 3 device, it may be authorized to receive the movie content, and additionally may have unlimited rights to play the movie and to transfer it to other devices (which in turn are bound by the respective rights specified by the multi-layered rights arrangement).
In implementing the multi-layered rights arrangement, a content file containing protected content, e.g., content of a movie, is associated with a “rights” file which may define the rights of a receiving device to use the protected content, and may also specify the minimum security level of the devices allowed to receive the protected content in the first place. In one embodiment, when a PMD outside the trusted domain requests an STT in the trusted domain to transfer protected movie content thereto, the STT authenticates the PMD and identifies its security level. The STT examines the rights file to determine if the PMD meets the minimum security level requirement. If it does, the STT transfers the movie content file along with the rights file to the PMD. The PMD then examines the received rights file to determine its own rights with respect to the movie content. For example, if the PMD is a Security Level 2 device, it will use the movie content pursuant to the set of rights in the rights file prescribed for Security Level 2 devices. In another embodiment, the STT transfers the content and rights files to the PMD as soon as the PMD is authenticated, without determining its security level or whether the PMD meets the minimum security level requirement. It is up to the PMD to observe autonomously the rights associated with its security level prescribed in the rights file, including whether it is allowed to receive and keep the protected content in the first place.
In a conventional manner, headend 120 delivers programming content downstream to SDVR STTs 158-1 through 158-M in a service area or neighborhood, where M represents an integer. As shown in
Programming content is delivered downstream from headend 120 to SDVR STTs 158 through “in-band” transmission channels. In one embodiment, these transmission channels may be 6 MHz bands populating a forward passband, e.g., 350-750 MHz band, of a coaxial cable. QAM modulator bank 137 in hub 130 modulates the transport streams containing the programming content onto selected in-band channels, in accordance with a QAM scheme.
In addition, downstream data, e.g., control messages, emergency information, etc., may be communicated from headend 120 to SDVR STTs 158 via one or more forward data channels (FDCs), sometimes referred to as “out-of-band” channels. The FDCs may occupy the 70-130 MHz band of a coaxial cable. QPSK modem pool 138 in hub 130 modulates downstream data onto selected FDCs, in accordance with a QPSK scheme.
Upstream data, e.g., application data, file requests, etc., may be transmitted from SDVR STTs 158 to headend 120 via one or more reverse data channels (RDCs), which occupy a reverse passband, e.g., 5-40 MHz band, of a coaxial cable. The data traversing the RDCs is modulated in accordance with a QPSK scheme. QPSK modem pool 138 in hub 130 receives the QPSK signals containing the data from the RDCs and performs any necessary demodulation before transmitting the underlying data to headend 120. Using a contention-based access mechanism established by the Digital Audio Visual Council (DAVIC), a standard setting organization, each STT can share an RDC with other STTs in the network. This mechanism enables an STT, e.g., SDVR STT 158-1, to transmit upstream messages without a dedicated connection to a QPSK demodulator. The mechanism also provides equal access to the STTs that share the RDC, and enables detection and recovery from reverse path collisions that occur when two or more of the STTs transmit an upstream message simultaneously. As also specified by DAVIC, for communications purposes, each STT and network controller 209 are identified by the Internet protocol (IP) addresses assigned thereto. However, these IP addresses may be randomly assigned each time the broadband communication system is reconfigured. As a result, the IP address of an STT or that of network controller 209 may change after a system reconfiguration. Nevertheless, each STT and network controller 209 are also assigned a media access control (MAC) address on a permanent basis, surviving any system reconfiguration.
Headend 120 includes, among others, program material processing unit 231, application server 220, network controller 209, and switching unit 230. In a well-known manner, program material processing unit 231 receives programming content from various sources attributed to different program channels, and generates transport streams containing the programming content, e.g., in accordance with a well known MPEG-2 scheme. Under control of network controller 209, the transport streams are switched by switching unit 230 to appropriate modulators in QAM modulator bank 137 in hub 130, where the transport streams are modulated onto the corresponding in-band transmission channels for delivery to STTs over network 150.
Application server 220 may include one or more server systems that provide software applications and services for STT users. For example, application server 220 may contain one or more software applications for providing database services, network management services, interactive program guide services, billing services, etc. Server 220 may maintain in memory 220 a subscriber registry, denoted 360 in
In this instance, application server 220 also incorporates access control manager 225 for realizing the trusted domain including therein the SDVR STTs at the subscribers' premises, which are subject to the aforementioned conditional access mechanism. To that end, manager 225 maintains access control related data pertaining to the SDVR STTs and/or subscribers. For example, manager 225 may maintain in memory 222 a library of device public keys associated with the SDVR STTs in the cable TV system. When an SDVR STT is provided to a subscriber, a “public key-private key pair” has been assigned to the SDVR STT in anticipation of data encryption in accordance with a public key algorithm. The “device private key” of the SDVR STT is stored in a secure memory therein while the “device public key” may be transmitted to manager 225 through an RDC during an initialization process of the SDVR STT. Alternatively, during registration of the SDVR STT, the subscriber may provide the cable operator with the serial number of the SDVR STT, if the cable operator has not already had it, for the cable operator to look up the public key associated with the SDVR STT. The library of device public keys is illustrated in the form of a table, denoted 273 in
Each subscriber associated with an SDVR STT is also assigned a public key-private key pair in anticipation of another data encryption in accordance with a public key algorithm. Manager 225 may maintain a subscriber key table, denoted 283 in
Memory 210 stores a variety of software applications and data including, e.g., an operating system (not shown) which provides the basic functionality for SDVR STT 158-1, and STID 214 for identifying SDVR STT 158-1, which is its MAC address MAC-1 in this instance. Memory 210 may be, e.g., a non-volatile random-access memory.
The aforementioned device private key assigned to STT 158-1, namely, DPRIKEY-1, is stored in secure memory 212 in encryption module 165 in such a manner that it cannot be discovered or tampered with easily and certainly not without notice. On the other hand, the device public key assigned to SDVR STT 158-1, namely, DPUBKEY-1, a copy of which is registered in table 273 in headend 120 as discussed before, is stored in memory 210, and which may be contained in a registration message (the “STT Registration Message”). Memory 210 also stores a public key associated with the cable operator, OPUBKEY 6222, for implementing the multi-layered rights arrangement in accordance with the invention.
Storage 610 is used for storing programming content, which in this instance may be a removable hard disk drive. It will be appreciated that storage 610 may comprise other forms of memory including, e.g., a digital video disk (DVD) drive, memory sticks, network-based storage, etc. Processor 330 may also perform such DVR functions as recording selected programming content in one or more media files, and storing them in storage 610. In this instance, a media file comprises a content file and a rights file associated therewith. The term “content file” here refers to a container that holds a distinct quantity of programming content. A content file may contain, e.g., a digitally recorded version of a movie such as “Citizen Kane.” The rights file may be an Extensible Markup Language (XML) file, a binary file, a text file, etc., which may form part of a “header” of the media file. The rights file, fully described below, contains a specification of rights to use the associated programming content. The rights specification may be generated by the cable operator, in which case it is inserted by program material processing unit 231 into the program stream containing the associated programming content. Alternatively, the rights specification is generated by the source of the programming content, e.g., a TV broadcasting company, in which case the rights specification and the associated programming content are both contained in the program stream received by unit 231. In either case, the programming content is accompanied by the associated rights specification when it is provided to STT 158-1. Cable operators have observed that providing to subscribers an unrestricted right to save programming content often results in an unacceptable amount of unauthorized copying.
Accordingly, the aforementioned conditional access mechanism is implemented to create a trusted domain in which such unauthorized copying is precluded. In accordance with this mechanism, encryption module 165 generates a content key, e.g., a 3DES key for encrypting, in accordance with a 3DES algorithm, a media file provided by processor 330 before its storage. In this illustrative embodiment, a different content key is generated for encrypting each respective media file. However, it will be appreciated that a single content key may be used to encrypt all media files in the same storage. It will also be appreciated that multiple content keys may be used to encrypt a single media file.
In addition, module 165 encrypts each generated content key to form “encrypted content key version 1 (V-1),” and “encrypted content key version 2 (V-2)”, and stores the encrypted content key versions (denoted 603 and 604 respectively in
By way of example, subscriber S-1 may direct SDVR STT 158-1 to record specified programming content, say, the “Citizen Kane” movie as it is broadcast over cable network 150. Accordingly, processor 330 generates a media file containing the specified movie content and the associated rights specification received from interface 250.
To generate the encrypted content key V-2, denoted 604, module 165 retrieves from storage 610 the encrypted content key V-1, from secure memory 212 device private key DPRIKEY-1, and from memory 210 STID 214 which is MAC-1 in this instance. Module 165 uses DPRIKEY-1 to decrypt the encrypted content key V-1, thereby recovering the content key in the clear. Module 165 then transmits the content key to headend 120 via an RDC in a secure manner. The secure transmission of a content key from STT 158-1 to headend 120 may be accomplished using a prior art encryption technique, e.g., a prior art public key encryption technique where a system private key is stored in headend 120, and the corresponding system public key is made public to, and stored in, all STTs including SDVR STT 158-1. In this instance, module 165 in SDVR STT 158-1 transmits, to control access manager 225 in application server 220, a message containing STID 214 and the content key encrypted using the system public key, in accordance with the prior art public key encryption technique.
After receiving the encrypted content key V-2 from manager 225, module 165 stores the encrypted content key V-2, denoted 604 in storage 610. In one embodiment, the encrypted content key V-2 is stored in the form of metadata associated with the encrypted media file 606. To decrypt the encrypted content file 602 for viewing the “Citizen Kane” movie content, module 165 may decrypt the associated encrypted content key V-1 (603) using DPRIKEY-1 in memory 212, thereby recovering the content key in the clear. Module 165 then applies the recovered content key to decrypt the encrypted content file 602.
Alternatively, STT 158-1 may be provided with the subscriber public key SPUBKEY-1. In a similar process used to create encrypted content key V-1, module 165 may use SPUBKEY-1 to generate encrypted content key V-2.
To show the portability of the encrypted media file 606 within the trusted domain, supposing that subscriber S-1 has purchased SDVR STT 158-2 for use as a second STT in his or her home, he or she may wish to transfer the media file to SDVR STT 158-2 and watch the program on a television set connected to SDVR STT 158-2. Alternatively, supposing that SDVR STT 158-1 is broken or is no longer functional for any reason, subscriber S-1 may wish to use SDVR STT 158-2 to view the stored programming content. To permit subscriber S-1 to copy the programming content for limited purposes such as these, the conditional access mechanism relies on encrypted content key V-2 (604), which is not associated with any particular device, to “migrate” programming content stored on a first device (e.g., STT 158-1) to a second device (e.g., STT 158-2) within the trusted domain. Specifically, in order for the second device to obtain the content key to decrypt the copy of the encrypted media file in STT 158-2, the latter needs an encrypted content key V-1 associated therewith. The content key V-1 associated with STT 158-2 can be successfully derived from the encrypted content key V-2 (604) provided that the subscriber associated with STT 158-2 be also S-1, which is the case here and reflected by subscriber registry 360 in
Assuming that SDVR STT 158-2 in
At headend 120, the encrypted content key V-2 (604) is utilized to generate an encrypted content key V-1 associated with the SDVR STT 158-2, which is needed for STT 158-2 to derive the content key for decrypting the encrypted media file 606 including content file 602.
At step 576, manager 225 consults device key table 273 and retrieves the device public key DPUBKEY-2 associated with STID 914 which is MAC-2 in this instance. At step 577, manager 225 uses the device public key DPUBKEY-2 associated with STT 158-2 to encrypt the content key. The resulting encrypted version of the content key is referred to as the “new-device (ND) encrypted content key version 1 (V-1).” At step 579, manager 225 transmits the ND encrypted content key V-1 to STT 158-2 through an FDC.
Module 965 in SDVR STT 158-2 receives the ND encrypted content key V-1 from headend 120. Module 965 stores the ND content key V-1 in storage 910. At a subsequent point in time, module 965 may retrieve device private key DPRIKEY-2 from memory 912, and use it to decrypt the ND encrypted content key V-1 and recover the content key. Module 965 may then utilize the content key to decrypt the encrypted media file 606 and, in particular, encrypted content file 602 for viewing the “Citizen Kane” movie content.
In order for a device outside the trusted domain (e.g., a PMD) to receive protected content from another device in the trusted domain (e.g., an SDVR STT), both devices need to be provisioned to comport with the multi-layered rights arrangement in accordance with the invention. For example, under the multi-layered rights arrangement, each such PMD is assigned a security level indicative of the security of the device. A PMD may be assigned a security level of “1” (low level of trust), in which case the PMD is referred to as a “Security Level 1” device. Similarly, a “Security Level 2” device is associated with a medium level of trust, and a “Security Level 3” device is associated with a high level of trust. A device's security level determines the set of rights that are accorded to it with respect to a given protected content.
The security level assigned to a particular device may be determined, for example, by agreement between the cable operator and the manufacturer of the device, and represents the level of trust which the cable operator accords the respective device. Thus, a cable operator may assign, e.g., a Security Level 3 to a device which utilizes advanced encryption techniques when receiving and transmitting content, and which maintains content files in a secure memory. On the other hand, a cable operator may assign a Security Level 1 to a high-definition television set which does not ordinarily use encryption methods when receiving or transmitting content.
By way of example, suppose that a user wishes to transfer a copy of the movie “Citizen Kane” from STT 158-1 in the trusted domain to a PMD which is outside the trusted domain. In this example, if the PMD is a Security Level 1 device, it is not authorized to receive the movie content. If the PMD is a Security Level 2 device, it is authorized to receive the movie content, but its right to play the movie, and its right to transfer the movie to other devices, are restricted. If the PMD is a Level 3 device, it is authorized to receive the movie content, and additionally has unlimited rights to play the movie and to transfer it to other devices (subject to the rights of the other devices' associated with their respective security levels).
Suppose that a user at PMD 1260 requests to transfer thereto a copy of the movie “Citizen Kane” from SDVR STT 158-1. In response, SDVR STT 158-1 and PMD 1260 perform an authentication procedure using their respective registration messages. STT 158-1 and PMD 1260 maintain the STT Registration Message and PMD Registration Message containing not only their respective public keys, but also digital signatures to be verified. One device (STT 158-1 or PMD 1260) sends its registration message in a communication to the other device (PMD 1260 or STT 158-1), and the device receiving the communication decrypts the digital signature contained in the registration message using the cable operator's public key, to verify the sending device's identity and authority. The receiving device also obtains the public key of the sending device from the registration message. There may be two or more registration messages enclosed with the communication, forming a hierarchical message chain, where one registration message testifies to the authenticity of the previous message. At the end of a licensing hierarchy is a top-level licensing authority (e.g., the cable operator), which is trusted without a registration message from any other licensing authority.
When PMD 1260 submits to SDVR STT 158-1 a request for the movie “Citizen Kane,” processor 330 in SDVR STT 158-1 requests that PMD 1260 authenticate itself. In response, processor 1262 in PMD 1260 transmits the PMD Registration Message containing PMD-PUBKEY 1279 to SDVR STT 158-3. Processor 330 in SDVR STT 158-1 retrieves OPUBKEY 6222 from memory 210, uses it to decrypt the PMD Registration Message, thereby authenticating the message through the licensing hierarchy. SDVR STT 158-1 additionally obtains PMD-PUBKEY 1279 from the PMD Registration Message.
After authenticating PMD 1260 through the licensing hierarchy, processor 330 in SDVR STT 158-1 transmits the STT Registration Message containing its own public key, DPUBKEY-1, to PMD 1260. Processor 1262 in PMD 1260 retrieves OPUBKEY 1271 from memory 1266 and uses it to decrypt the digital signature contained within the STT Registration Message, thereby authenticating it through the licensing hierarchy and obtaining DPUBKEY-1.
In accordance with an alternative embodiment, the PMD Registration Message contains a unique device identifier (the “PMD Device ID”) as well as PMD-PUBKEY 1279 and data concerning the security level of PMD 1260. In this embodiment, when SDVR STT 158-1 receives the PMD Registration Message, SDVR STT 158-1 transmits the message to network controller 209 in headend 120. Controller 209 consults a stored table which includes a list of valid device identifiers, and the public key of each associated device. Controller 209 confirms whether the PMD Device ID and PMD PUBKEY 1279 contained in the registration message are valid, and reports the status of PMD 1260 to SDVR STT 158-1. Assuming PMD 1260 is determined to be an authorized device, processor 330 in SDVR STT 158-1 transmits the STT Registration Message containing its own public key, DPUBKEY-1, to PMD 1260.
In addition to the PMD's public key, SDVR STT 158-1 obtains data concerning the security level of PMD 1260 from the PMD Registration Message. In this example, let's suppose that SDVR STT 158-1 determines from the PMD Registration Message that PMD 1260 is a Security Level 2 device. Processor 330 causes encryption module 165 to decrypt encrypted media file 606 in storage 610 in the manner described above, yielding a content file containing the requested movie content and the associated rights file in the clear. However, before any content and rights files are transmitted to PMD 1260, these files are again encrypted using a random session key generated in SDVR STT 158-1, resulting in “session-encrypted” content and rights files. Encryption module 165 additionally encrypts the session key using the PMD-PUBKEY 1279. SDVR STT 158-1 transmits the encrypted Session Key to PMD 1260, along with the session-encrypted content and rights files. Processor 1262 in PMD 1260 retrieves PMD-PRIKEY 1285 from secure memory 1282, and uses it to decrypt the received, encrypted session key. Encryption module 1280 uses the recovered session key to decrypt the received session-encrypted content and rights files, resulting in content file 1525 and rights file 1550 in storage 1293, which are in the clear. Thus, in this instance, content file 1525 contains a digital version of the requested movie “Citizen Kane.” Rights file 1550 defines one or more sets of rights accorded to various devices with respect to content file 1525.
Data in field 5190 defines the transfer rights accorded to an STT, e.g., SDVR STT 158-1. In this example, field 5190 contains “2, 3” indicating that an STT is authorized to transfer the content to Security Level 2 devices and to Security Level 3 devices.
Data in fields 5210-5430 define three distinct sets of rights associated with the associated content, i.e., content file 1525: a first set of rights for Security Level 1 devices, a second set of rights for Security Level 2 devices, and a third set of rights for Security Level 3 devices. In this example, a Security Level 1 device obtains no rights with respect to the associated; thus, a Security Level 1 device cannot transfer the content to another device (field 5210), and cannot play the content for any length of time (field 5220). The number of times a Security Level 1 device is allowed to transfer the content to other devices is zero (field 5230).
Fields 5310-5330 define the set of rights accorded to a Security Level 2 Device. Field 5310 specifies those devices to which a Security Level 2 device is allowed to transfer the associated content. In this instance, field 5310 contains values “2, 3,” indicating that a Security Level 2 device may transfer the associated content to a Security Level 2 device or to a Security Level 3 device. Play Time field 5320 indicates a duration during which a Security Level 2 device may play the associated content. This duration starts running when PMD 1260 receives a copy of content file 1525. In this instance, a Security Level 2 device can play the content for a seventy-two hour period after the content is received. According to field 5330, a Security Level 2 device is allowed to transfer the associated content to other devices up to three times.
Fields 5410-5430 define the rights accorded to a Security Level 3 device. A Security Level 3 device is authorized to transfer the content to a Security Level 3 device but not to Security Level 1 devices or to Security Level 2 devices (field 5410). There is no time limit regarding how long a Security Level 3 device can play the content (field 5420). According to field 5430, a Security Level 3 device may transfer the content an unlimited number of times to other devices.
At step 1740, SDVR STT 158-1 examines the rights file associated with the requested content, after it decrypts file 601 with the content key in the manner described above, to determine whether SDVR STT 158-1 itself is authorized to transfer the movie content in file 602 to PMD 1260. Referring to field 5190 of
To ensure that its activities concerning content file 1525 conform to the rights set forth in rights file 1550, PMD 1260 maintains content activity database 1274 in memory 1266. After receiving and storing files 1525 and 1550, PMD 1260 creates in content activity database 1274 a content activity record such as that shown in
Processor 1262 additionally records, in field 1772, the date and time when the content was received, i.e., when the content file 1525 was received in storage 1293. Processor 1262 additionally calculates an END TIME LIMIT value representing the end of the time limit specified in field 1773, by adding the PLAY TIME value in field 1758 to the DATE/TIME RECEIVED value in field 1772. The result is recorded in field 1773, and is used subsequently to ensure that content file 1525 is not played beyond the time limit accorded in rights file 1550. Processor 1262 also initializes a TRANSFER COUNT value by entering a zero value in field 1776; this value is subsequently increased by one each time PMD 1260 transfers content file 1525 to another device.
Thus, PMD 1260 uses content activity record 1720 to regulate its activities pertaining to content file 1525. At the same time, each time PMD 1260 performs an action pertaining to content file 1525, processor 1262 updates record 1720. By way of example, suppose that after receiving content file 1525, a user directs PMD 1260 to play the movie “Citizen Kane.” Referring to
Suppose the user wishes to transfer a copy the movie “Citizen Kane” to another device, say, a personal computer (PC). In this case, after authenticating the PC and determines its security level, processor 1262 in PMD 1260 accesses content activity record 1720, examines the TRANSFER RIGHTS value in field 1756, and verifies that the PC is authorized to receive the movie content. Processor 1262 then compares the TRANSFER COUNT value in field 1776 to the # TRANSFERS LIMIT specified in field 1759. If the TRANSFER COUNT is less than the # TRANSFERS LIMIT, PMD 1260 transfers content file 1525, together with rights file 1550, to the PC, and increases by one the TRANSFER COUNT value in field 1776. The PC in turn observes its rights to use content file 1525 as specified in rights file 1550. Otherwise, if the TRANSFER COUNT value has reached (i.e., is equal to) the # TRANSFERS LIMIT, processor 1262 informs the user that PMD 1260 is not authorized to transfer the content.
CableCARD and Host STT DVR Embodiment of the Invention
The invention broadly encompasses the concept of the multi-layered rights arrangement including the trusted domain for preventing unauthorized use of protected content, as fully described before. The invention certainly is not limited to specific devices (e.g., SDVR STT, PMD, etc.) used in the arrangement. In fact, an embodiment where a host STT DVR device connected with a CableCARD replacing the above-described SDVR STT (e.g., 158-1) in the inventive arrangement to perform similar functions will now be described. In this embodiment, the functionalities of the above-described SDVR STT simply are partitioned across the host STT DVR device and the CableCARD.
M-CARD 1705 includes interface 1701 for connection with interface 1707 of device 1703, in accordance with the PCMCIA standard. As mentioned before, M-CARD 1705 is responsible for the content key generation and control of access by device 1703 to protected content from network 150. Communications in which device 1703 requests such access and obtains such a content key generated from M-CARD 1705 will now be described. Like the SDVR STT, device 1703 needs to encrypt a content file using the content key before the content file is stored in storage 1711. However, like a PMD (e.g., 1260), device 1703 needs to be authenticated by M-CARD 1705 before the content file from network 150 can be recorded, and also needs to request recording privileges from M-CARD 1705.
In response to a recording event which may be initiated by a user at device 1703 or automatically by device 1703, processing unit 1713 issues a Record request to M-CARD 1705. This Record request includes, among others, an index identifying the desired program to be recorded.
After receiving the Record reply, processing unit 1713 in device 1703 determines whether recording of the program content in question is permitted based on the value in the Record_Enable field in the reply. If not, unit 1713 may generate a message to inform the user of the denial of the Record request. Otherwise, unit 1713 verifies M-CARD signatures 1905 and 2005 in respective PSP 1900 and TSP 2000 using M-CARD public signing key 1723 stored in memory 1709. In addition, unit 1713 verifies that the host ID in field 2008 in TSP 2000 matches the ID of device 1703, which may be stored in memory 1709. Once PSP 1900 and TSP 2000 are verified, unit 1713 initiates the recording of the program content, and causes encryption module 1720 to decrypt the encrypted content key in field 2013 using host private key 1724 in secure memory 1722, which is the counterpart to host public key 1733. Unit 1713 causes encryption module 1720 to use the recovered content key to encrypt the recorded content. The resulting encrypted content file and the received PSP 1900 associated therewith are then stored in storage 1711.
In response to an event of playback of a stored content file in storage 1711, e.g., initiated by a user at device 1703, unit 1713 issues to M-CARD 1705 a Playback request, which contains PSP 1900 associated with the stored content file.
After receiving the Playback reply, processing unit 1713 in device 1703 determines whether playback of the program content in question is permitted based on the value in the Playback_Enable field in the reply. If not, unit 1713 may generate a message to inform the user of the denial of the Playback request. Otherwise, unit 1713 verifies M-CARD signatures 1905 and 2005 in respective PSP 1900 and TSP 2000 using M-CARD public signing key 1723. In addition, unit 1713 verifies that the host ID in field 2008 in TSP 2000 matches the ID of device 1703. Once PSP 1900 and TSP 2000 are verified, unit 1713 replaces the currently stored PSP associated with the encrypted content file to be played back with the received PSP. Unit 1713 causes encryption module 1720 to decrypt the encrypted content key in field 2013 of the received TSP using host private key 1724 in secure memory 1722, which is the counterpart to host public key 1733. Unit 1713 causes encryption module 1720 to use the recovered content key to decrypt the encrypted content file in question in storage 1711, and initiates a playback of the content file in the clear.
The foregoing merely illustrates the principles of the invention. It will thus be appreciated that those skilled in the art will be able to devise numerous other arrangements which embody the principles of the invention and are thus within its spirit and scope.
For example, the devices (e.g., trusted domain devices and/or PMDs) in the multi-layered rights arrangement in accordance with the invention may be connected to one another by a network, e.g., a home network whose technology has been employed to connect multiple STTs in different rooms of a home.
In addition, the devices in the multi-layered rights arrangement in accordance with the invention may not have internal storage for storing programming content therein. However, such devices may be connected to auxiliary storage to which the devices may deliver the content by transferring or streaming.
Further, in the embodiment shown in
Finally, the system components of
The present application is a continuation of and claims the benefit of priority to U.S. patent application Ser. No. 13/674,866, of the same title, filed on Nov. 12, 2012, issued as U.S. Pat. No. 9,313,530 on Apr. 12, 2016, which is a divisional of U.S. patent application Ser. No. 11/006,404 of the same title, filed on Dec. 7, 2004, and which issued as U.S. Pat. No. 8,312,267 on Nov. 13, 2012, which is a continuation-in-part of U.S. patent application Ser. No. 10/894,884, filed on Jul. 20, 2004, and which issued as U.S. Pat. No. 8,266,429 on Sep. 11, 2012, each of which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5369707 | Follendore, III | Nov 1994 | A |
5528284 | Iwami et al. | Jun 1996 | A |
5577209 | Boyle et al. | Nov 1996 | A |
5708961 | Hylton et al. | Jan 1998 | A |
5715403 | Stefik | Feb 1998 | A |
5787172 | Arnold | Jul 1998 | A |
5818438 | Howe et al. | Oct 1998 | A |
5828832 | Holden et al. | Oct 1998 | A |
5870474 | Wasilewski et al. | Feb 1999 | A |
5897635 | Torres et al. | Apr 1999 | A |
5982412 | Nulty | Nov 1999 | A |
6009103 | Woundy | Dec 1999 | A |
6148400 | Arnold | Nov 2000 | A |
6154844 | Touboul et al. | Nov 2000 | A |
6157719 | Wasilewski et al. | Dec 2000 | A |
6167432 | Jiang | Dec 2000 | A |
6167521 | Smith et al. | Dec 2000 | A |
6181697 | Nurenberg et al. | Jan 2001 | B1 |
6212636 | Boyle et al. | Apr 2001 | B1 |
6219710 | Gray et al. | Apr 2001 | B1 |
6233341 | Riggins | May 2001 | B1 |
6233687 | White | May 2001 | B1 |
6256393 | Safadi et al. | Jul 2001 | B1 |
6259701 | Shur et al. | Jul 2001 | B1 |
6266421 | Domyo et al. | Jul 2001 | B1 |
6456716 | Arnold | Sep 2002 | B1 |
6519062 | Yoo | Feb 2003 | B1 |
6523696 | Saito et al. | Feb 2003 | B1 |
6601171 | Carter et al. | Jul 2003 | B1 |
6640145 | Hoffberg et al. | Oct 2003 | B2 |
6657991 | Akgun et al. | Dec 2003 | B1 |
6694145 | Riikonen et al. | Feb 2004 | B2 |
6742116 | Matsui et al. | May 2004 | B1 |
6760768 | Holden et al. | Jul 2004 | B2 |
6782475 | Sumner | Aug 2004 | B1 |
6782550 | Cao | Aug 2004 | B1 |
6785810 | Lirov et al. | Aug 2004 | B1 |
6788676 | Partanen et al. | Sep 2004 | B2 |
6807573 | Saito et al. | Oct 2004 | B2 |
6813505 | Walley et al. | Nov 2004 | B2 |
6859535 | Tatebayashi et al. | Feb 2005 | B1 |
6898708 | Hori et al. | May 2005 | B2 |
6910064 | Astarabadi et al. | Jun 2005 | B1 |
6925257 | Yoo | Aug 2005 | B2 |
6944150 | McConnell et al. | Sep 2005 | B1 |
6948183 | Peterka | Sep 2005 | B1 |
6954632 | Kobayashi | Oct 2005 | B2 |
6957261 | Lortz | Oct 2005 | B2 |
6957328 | Goodman et al. | Oct 2005 | B2 |
6973576 | Giobbi | Dec 2005 | B2 |
6975730 | Kuroiwa et al. | Dec 2005 | B1 |
6985355 | Allirot | Jan 2006 | B2 |
6996544 | Sellars et al. | Feb 2006 | B2 |
7006881 | Hoffberg et al. | Feb 2006 | B1 |
7007170 | Morten | Feb 2006 | B2 |
7009972 | Maher et al. | Mar 2006 | B2 |
7016963 | Judd et al. | Mar 2006 | B1 |
7017189 | Demello et al. | Mar 2006 | B1 |
7027460 | Iyer et al. | Apr 2006 | B2 |
7039048 | Monta et al. | May 2006 | B1 |
7054443 | Jakubowski et al. | May 2006 | B1 |
7054902 | Toporek et al. | May 2006 | B2 |
7055040 | Klemba et al. | May 2006 | B2 |
7065216 | Benaloh et al. | Jun 2006 | B1 |
7068639 | Varma et al. | Jun 2006 | B1 |
7069449 | Weaver et al. | Jun 2006 | B2 |
7069578 | Prus et al. | Jun 2006 | B1 |
7072950 | Toft | Jul 2006 | B2 |
7073199 | Raley | Jul 2006 | B1 |
7092397 | Chandran et al. | Aug 2006 | B1 |
7099308 | Merrill et al. | Aug 2006 | B2 |
7103181 | Ananth | Sep 2006 | B2 |
7106382 | Shiotsu | Sep 2006 | B2 |
7107326 | Fijolek et al. | Sep 2006 | B1 |
7149772 | Kalavade | Dec 2006 | B1 |
7154912 | Chong et al. | Dec 2006 | B2 |
7165268 | Moore et al. | Jan 2007 | B1 |
7174126 | McElhatten et al. | Feb 2007 | B2 |
7174127 | Otten et al. | Feb 2007 | B2 |
7174371 | Elo et al. | Feb 2007 | B2 |
7174385 | Li | Feb 2007 | B2 |
7194756 | Addington et al. | Mar 2007 | B2 |
7209458 | Ahvonen et al. | Apr 2007 | B2 |
7225333 | Peinado et al. | May 2007 | B2 |
7228427 | Fransdonk | Jun 2007 | B2 |
7237112 | Ishiguro et al. | Jun 2007 | B1 |
7242960 | van Rooyen et al. | Jul 2007 | B2 |
7248694 | Husemann et al. | Jul 2007 | B2 |
7254608 | Yeager et al. | Aug 2007 | B2 |
7257227 | Chen et al. | Aug 2007 | B2 |
7266726 | Ladd et al. | Sep 2007 | B1 |
7289534 | Bailey et al. | Oct 2007 | B1 |
7299502 | Schmeling et al. | Nov 2007 | B2 |
7305460 | Park | Dec 2007 | B2 |
7313611 | Jacobs et al. | Dec 2007 | B1 |
7324531 | Cho | Jan 2008 | B2 |
7325073 | Shao et al. | Jan 2008 | B2 |
7330483 | Peters, Jr. et al. | Feb 2008 | B1 |
7330967 | Pujare et al. | Feb 2008 | B1 |
7353543 | Ohmori et al. | Apr 2008 | B2 |
7373506 | Asano et al. | May 2008 | B2 |
7376386 | Phillips et al. | May 2008 | B2 |
7376976 | Fierstein et al. | May 2008 | B2 |
7397825 | Woodward et al. | Jul 2008 | B2 |
7409546 | Platt | Aug 2008 | B2 |
7457520 | Rosetti et al. | Nov 2008 | B2 |
7472280 | Giobbi | Dec 2008 | B2 |
7486869 | Alexander et al. | Feb 2009 | B2 |
7487363 | Alve et al. | Feb 2009 | B2 |
7506367 | Ishibashi | Mar 2009 | B1 |
7592912 | Hasek et al. | Sep 2009 | B2 |
7602820 | Helms et al. | Oct 2009 | B2 |
7673004 | Sherstinsky et al. | Mar 2010 | B1 |
7690020 | Lebar | Mar 2010 | B2 |
7693171 | Gould | Apr 2010 | B2 |
7707644 | Choi et al. | Apr 2010 | B2 |
7721314 | Sincaglia et al. | May 2010 | B2 |
7730321 | Gasparini et al. | Jun 2010 | B2 |
7742074 | Minatogawa | Jun 2010 | B2 |
7752617 | Blinick et al. | Jul 2010 | B2 |
7757101 | Nonaka et al. | Jul 2010 | B2 |
7783891 | Perlin et al. | Aug 2010 | B2 |
7809942 | Baran et al. | Oct 2010 | B2 |
7865440 | Jaquette | Jan 2011 | B2 |
7870599 | Pemmaraju | Jan 2011 | B2 |
7925592 | Issa et al. | Apr 2011 | B1 |
7930558 | Hori | Apr 2011 | B2 |
7954131 | Cholas et al. | May 2011 | B2 |
7983418 | Oyama et al. | Jul 2011 | B2 |
8166508 | Mitsuji et al. | Apr 2012 | B2 |
8181262 | Cooper et al. | May 2012 | B2 |
8234387 | Bradley et al. | Jul 2012 | B2 |
8280982 | La Joie et al. | Oct 2012 | B2 |
8332370 | Gattegno et al. | Dec 2012 | B2 |
8332657 | Eskicioglu et al. | Dec 2012 | B1 |
8472627 | Denning et al. | Jun 2013 | B2 |
8761402 | McAvoy et al. | Jun 2014 | B2 |
9215423 | Kimble et al. | Dec 2015 | B2 |
9300919 | Cholas et al. | Mar 2016 | B2 |
20010004768 | Hodge et al. | Jun 2001 | A1 |
20010014946 | Ichinoi et al. | Aug 2001 | A1 |
20010019614 | Madoukh et al. | Sep 2001 | A1 |
20010029581 | Knauft | Oct 2001 | A1 |
20010053223 | Ishibashi et al. | Dec 2001 | A1 |
20010053226 | Akins et al. | Dec 2001 | A1 |
20010056541 | Matsuzaki et al. | Dec 2001 | A1 |
20020013772 | Peinado | Jan 2002 | A1 |
20020026575 | Wheeler et al. | Feb 2002 | A1 |
20020027883 | Belaiche | Mar 2002 | A1 |
20020032754 | Logston et al. | Mar 2002 | A1 |
20020048367 | Maillard | Apr 2002 | A1 |
20020056125 | Hodge et al. | May 2002 | A1 |
20020059619 | Lebar | May 2002 | A1 |
20020062440 | Akama | May 2002 | A1 |
20020066033 | Dobbins et al. | May 2002 | A1 |
20020077984 | Ireton | Jun 2002 | A1 |
20020126654 | Preston et al. | Sep 2002 | A1 |
20020129358 | Buehl et al. | Sep 2002 | A1 |
20020144067 | Jeong | Oct 2002 | A1 |
20020147771 | Traversat et al. | Oct 2002 | A1 |
20020152299 | Traversat et al. | Oct 2002 | A1 |
20020152393 | Thoma et al. | Oct 2002 | A1 |
20020183985 | Hori et al. | Dec 2002 | A1 |
20020184154 | Hori et al. | Dec 2002 | A1 |
20020188744 | Mani | Dec 2002 | A1 |
20020188869 | Patrick | Dec 2002 | A1 |
20020199105 | Ishiguro et al. | Dec 2002 | A1 |
20030009681 | Harada et al. | Jan 2003 | A1 |
20030021421 | Yokota et al. | Jan 2003 | A1 |
20030041336 | Del Sordo et al. | Feb 2003 | A1 |
20030046560 | Inomata et al. | Mar 2003 | A1 |
20030048380 | Tamura | Mar 2003 | A1 |
20030056217 | Brooks | Mar 2003 | A1 |
20030069965 | Ma et al. | Apr 2003 | A1 |
20030074571 | Fujiwara et al. | Apr 2003 | A1 |
20030084003 | Pinkas et al. | May 2003 | A1 |
20030097340 | Okamoto et al. | May 2003 | A1 |
20030115267 | Hinton et al. | Jun 2003 | A1 |
20030140227 | Asano et al. | Jul 2003 | A1 |
20030163697 | Pabla et al. | Aug 2003 | A1 |
20030163739 | Armington et al. | Aug 2003 | A1 |
20030165241 | Fransdonk | Sep 2003 | A1 |
20030166401 | Combes et al. | Sep 2003 | A1 |
20030174838 | Bremer | Sep 2003 | A1 |
20030187799 | Sellars et al. | Oct 2003 | A1 |
20030205763 | Park et al. | Nov 2003 | A1 |
20030208763 | McElhatten et al. | Nov 2003 | A1 |
20030208767 | Williamson et al. | Nov 2003 | A1 |
20030217137 | Roese et al. | Nov 2003 | A1 |
20030217365 | Caputo | Nov 2003 | A1 |
20040024688 | Bi et al. | Feb 2004 | A1 |
20040034877 | Nogues | Feb 2004 | A1 |
20040045032 | Cummings et al. | Mar 2004 | A1 |
20040045035 | Cummings et al. | Mar 2004 | A1 |
20040045037 | Cummings et al. | Mar 2004 | A1 |
20040052377 | Mattox et al. | Mar 2004 | A1 |
20040078602 | Rothbarth et al. | Apr 2004 | A1 |
20040088558 | Candelore | May 2004 | A1 |
20040109569 | Ellison et al. | Jun 2004 | A1 |
20040117836 | Karaoguz et al. | Jun 2004 | A1 |
20040123129 | Ginter | Jun 2004 | A1 |
20040128499 | Peterka et al. | Jul 2004 | A1 |
20040133923 | Watson et al. | Jul 2004 | A1 |
20040137918 | Varonen et al. | Jul 2004 | A1 |
20040177369 | Akins | Sep 2004 | A1 |
20040181800 | Rakib et al. | Sep 2004 | A1 |
20040184616 | Morten | Sep 2004 | A1 |
20040190721 | Barrett et al. | Sep 2004 | A1 |
20040193609 | Phan et al. | Sep 2004 | A1 |
20040193680 | Gibbs et al. | Sep 2004 | A1 |
20040224425 | Gjerde et al. | Nov 2004 | A1 |
20040237100 | Pinder et al. | Nov 2004 | A1 |
20040250273 | Swix et al. | Dec 2004 | A1 |
20040260798 | Addington et al. | Dec 2004 | A1 |
20040261093 | Rebaud et al. | Dec 2004 | A1 |
20040268386 | Logan et al. | Dec 2004 | A1 |
20050005287 | Claussen | Jan 2005 | A1 |
20050015810 | Gould et al. | Jan 2005 | A1 |
20050021985 | Ono et al. | Jan 2005 | A1 |
20050022227 | Shen et al. | Jan 2005 | A1 |
20050034171 | Benya | Feb 2005 | A1 |
20050039212 | Baran et al. | Feb 2005 | A1 |
20050049886 | Grannan et al. | Mar 2005 | A1 |
20050055220 | Lee et al. | Mar 2005 | A1 |
20050065888 | Benaloh | Mar 2005 | A1 |
20050086683 | Meyerson | Apr 2005 | A1 |
20050091173 | Alve | Apr 2005 | A1 |
20050097006 | Nyako | May 2005 | A1 |
20050108763 | Baran et al. | May 2005 | A1 |
20050114686 | Ball et al. | May 2005 | A1 |
20050114900 | Ladd et al. | May 2005 | A1 |
20050138357 | Swenson et al. | Jun 2005 | A1 |
20050169468 | Fahrny et al. | Aug 2005 | A1 |
20050172127 | Hartung et al. | Aug 2005 | A1 |
20050177740 | Athaide et al. | Aug 2005 | A1 |
20050177741 | Chen et al. | Aug 2005 | A1 |
20050177855 | Maynard et al. | Aug 2005 | A1 |
20050182931 | Robert et al. | Aug 2005 | A1 |
20050188210 | Perlin et al. | Aug 2005 | A1 |
20050190912 | Hopkins et al. | Sep 2005 | A1 |
20050195975 | Kawakita | Sep 2005 | A1 |
20050198693 | Choi et al. | Sep 2005 | A1 |
20050210500 | Stone | Sep 2005 | A1 |
20050268107 | Harris et al. | Dec 2005 | A1 |
20050273629 | Abrams et al. | Dec 2005 | A1 |
20050278259 | Gunaseelan et al. | Dec 2005 | A1 |
20050289618 | Hardin | Dec 2005 | A1 |
20060002551 | Brown et al. | Jan 2006 | A1 |
20060004662 | Nadalin et al. | Jan 2006 | A1 |
20060008256 | Khedouri et al. | Jan 2006 | A1 |
20060015352 | Wynn et al. | Jan 2006 | A1 |
20060020786 | Helms et al. | Jan 2006 | A1 |
20060020950 | Ladd et al. | Jan 2006 | A1 |
20060021004 | Moran et al. | Jan 2006 | A1 |
20060036750 | Ladd et al. | Feb 2006 | A1 |
20060041903 | Kahn et al. | Feb 2006 | A1 |
20060041905 | Wasilewski | Feb 2006 | A1 |
20060047801 | Haag et al. | Mar 2006 | A1 |
20060047957 | Helms et al. | Mar 2006 | A1 |
20060064583 | Birnbaum et al. | Mar 2006 | A1 |
20060095940 | Yearwood | May 2006 | A1 |
20060130099 | Rooyen | Jun 2006 | A1 |
20060130107 | Gonder et al. | Jun 2006 | A1 |
20060130113 | Carlucci et al. | Jun 2006 | A1 |
20060136964 | Diez et al. | Jun 2006 | A1 |
20060137005 | Park | Jun 2006 | A1 |
20060137015 | Fahrny et al. | Jun 2006 | A1 |
20060148362 | Bridges | Jul 2006 | A1 |
20060149850 | Bowman | Jul 2006 | A1 |
20060161635 | Lamkin et al. | Jul 2006 | A1 |
20060168219 | Ahluwalia et al. | Jul 2006 | A1 |
20060179138 | Van Gassel et al. | Aug 2006 | A1 |
20060184972 | Rafey et al. | Aug 2006 | A1 |
20060187900 | Akbar | Aug 2006 | A1 |
20060200856 | Salowey et al. | Sep 2006 | A1 |
20060206712 | Dillaway et al. | Sep 2006 | A1 |
20060209799 | Gallagher et al. | Sep 2006 | A1 |
20060212400 | Kamperman et al. | Sep 2006 | A1 |
20060218604 | Riedl et al. | Sep 2006 | A1 |
20060218647 | Hars et al. | Sep 2006 | A1 |
20060236131 | Vauclair | Oct 2006 | A1 |
20060248553 | Mikkelson et al. | Nov 2006 | A1 |
20060259927 | Acharya et al. | Nov 2006 | A1 |
20060291506 | Cain | Dec 2006 | A1 |
20070011335 | Burns et al. | Jan 2007 | A1 |
20070019645 | Menon | Jan 2007 | A1 |
20070022459 | Gaebel et al. | Jan 2007 | A1 |
20070022469 | Cooper et al. | Jan 2007 | A1 |
20070033531 | Marsh | Feb 2007 | A1 |
20070046791 | Wang et al. | Mar 2007 | A1 |
20070049245 | Lipman | Mar 2007 | A1 |
20070067851 | Fernando et al. | Mar 2007 | A1 |
20070079381 | Hartung et al. | Apr 2007 | A1 |
20070094691 | Gazdzinski | Apr 2007 | A1 |
20070098178 | Raikar | May 2007 | A1 |
20070121678 | Brooks et al. | May 2007 | A1 |
20070124488 | Baum et al. | May 2007 | A1 |
20070124602 | Wald et al. | May 2007 | A1 |
20070157295 | Mangalore et al. | Jul 2007 | A1 |
20070174888 | Rubinstein | Jul 2007 | A1 |
20070192615 | Varghese et al. | Aug 2007 | A1 |
20070204314 | Hasek et al. | Aug 2007 | A1 |
20070206799 | Wingert et al. | Sep 2007 | A1 |
20070209059 | Moore et al. | Sep 2007 | A1 |
20070217436 | Markley et al. | Sep 2007 | A1 |
20070219910 | Martinez | Sep 2007 | A1 |
20070220024 | Putterman et al. | Sep 2007 | A1 |
20070250872 | Dua | Oct 2007 | A1 |
20070250880 | Hainline | Oct 2007 | A1 |
20070261116 | Prafullchandra et al. | Nov 2007 | A1 |
20070276925 | La Joie et al. | Nov 2007 | A1 |
20070276926 | Lajoie et al. | Nov 2007 | A1 |
20070294178 | Pinder et al. | Dec 2007 | A1 |
20080008321 | Gagnon et al. | Jan 2008 | A1 |
20080008371 | Woods et al. | Jan 2008 | A1 |
20080021836 | Lao | Jan 2008 | A1 |
20080022012 | Wang | Jan 2008 | A1 |
20080059804 | Shah et al. | Mar 2008 | A1 |
20080066112 | Bailey et al. | Mar 2008 | A1 |
20080091805 | Malaby et al. | Apr 2008 | A1 |
20080091807 | Strub et al. | Apr 2008 | A1 |
20080098212 | Helms et al. | Apr 2008 | A1 |
20080103976 | Read et al. | May 2008 | A1 |
20080103977 | Khosravy et al. | May 2008 | A1 |
20080112405 | Cholas et al. | May 2008 | A1 |
20080117920 | Tucker | May 2008 | A1 |
20080123862 | Rowley | May 2008 | A1 |
20080133551 | Wensley et al. | Jun 2008 | A1 |
20080141353 | Brown | Jun 2008 | A1 |
20080148362 | Gilder et al. | Jun 2008 | A1 |
20080154626 | Gounares et al. | Jun 2008 | A1 |
20080155059 | Hardin et al. | Jun 2008 | A1 |
20080162353 | Tom et al. | Jul 2008 | A1 |
20080165460 | Whitby-Strevens | Jul 2008 | A1 |
20080177998 | Apsangi et al. | Jul 2008 | A1 |
20080212945 | Khedouri et al. | Sep 2008 | A1 |
20080222684 | Mukraj et al. | Sep 2008 | A1 |
20080235746 | Peters et al. | Sep 2008 | A1 |
20080256510 | Auerbach | Oct 2008 | A1 |
20080270307 | Olson et al. | Oct 2008 | A1 |
20080273591 | Brooks et al. | Nov 2008 | A1 |
20080282299 | Koat et al. | Nov 2008 | A1 |
20080288618 | Vardi et al. | Nov 2008 | A1 |
20090007234 | Birger et al. | Jan 2009 | A1 |
20090025075 | Chow et al. | Jan 2009 | A1 |
20090031371 | Munsell et al. | Jan 2009 | A1 |
20090083813 | Dolce et al. | Mar 2009 | A1 |
20090098861 | Kalliola et al. | Apr 2009 | A1 |
20090100459 | Riedl et al. | Apr 2009 | A1 |
20090102983 | Malone et al. | Apr 2009 | A1 |
20090151006 | Saeki et al. | Jun 2009 | A1 |
20090182815 | Czechowski, III et al. | Jul 2009 | A1 |
20090185576 | Kisel et al. | Jul 2009 | A1 |
20090201917 | Maes et al. | Aug 2009 | A1 |
20090210912 | Cholas et al. | Aug 2009 | A1 |
20090225760 | Foti | Sep 2009 | A1 |
20090265750 | Jones et al. | Oct 2009 | A1 |
20090282241 | Prafullchandra et al. | Nov 2009 | A1 |
20090282449 | Lee | Nov 2009 | A1 |
20090290711 | Bloom et al. | Nov 2009 | A1 |
20090292922 | Park | Nov 2009 | A1 |
20090293101 | Carter et al. | Nov 2009 | A1 |
20100017627 | Princen et al. | Jan 2010 | A1 |
20100030578 | Siddique et al. | Feb 2010 | A1 |
20100031299 | Harrang et al. | Feb 2010 | A1 |
20100042478 | Reisman | Feb 2010 | A1 |
20100082983 | Shah et al. | Apr 2010 | A1 |
20100083329 | Joyce et al. | Apr 2010 | A1 |
20100088236 | Karabulut et al. | Apr 2010 | A1 |
20100088292 | Tirpak et al. | Apr 2010 | A1 |
20100106846 | Noldus et al. | Apr 2010 | A1 |
20100131973 | Dillon et al. | May 2010 | A1 |
20100138900 | Peterka et al. | Jun 2010 | A1 |
20100169977 | Dasher et al. | Jul 2010 | A1 |
20100185855 | Margolus et al. | Jul 2010 | A1 |
20100198888 | Blomstedt et al. | Aug 2010 | A1 |
20100217837 | Ansari et al. | Aug 2010 | A1 |
20100287609 | Gonzalez et al. | Nov 2010 | A1 |
20100310076 | Barzilai et al. | Dec 2010 | A1 |
20100313225 | Cholas et al. | Dec 2010 | A1 |
20100313226 | Cholas et al. | Dec 2010 | A1 |
20110071841 | Fomenko et al. | Mar 2011 | A1 |
20110078721 | Wang et al. | Mar 2011 | A1 |
20110093900 | Patel et al. | Apr 2011 | A1 |
20110103374 | Lajoie et al. | May 2011 | A1 |
20110164753 | Dubhashi et al. | Jul 2011 | A1 |
20110169977 | Masuda | Jul 2011 | A1 |
20110179196 | Friedman | Jul 2011 | A1 |
20110197070 | Mizrah | Aug 2011 | A1 |
20110213688 | Santos et al. | Sep 2011 | A1 |
20110219229 | Cholas et al. | Sep 2011 | A1 |
20110252236 | De Atley et al. | Oct 2011 | A1 |
20110252243 | Brouwer et al. | Oct 2011 | A1 |
20120008786 | Cronk et al. | Jan 2012 | A1 |
20120011567 | Cronk et al. | Jan 2012 | A1 |
20120159603 | Queck | Jun 2012 | A1 |
20120167173 | Nadalin et al. | Jun 2012 | A1 |
20120260346 | Carey et al. | Oct 2012 | A1 |
20120291062 | Pearson et al. | Nov 2012 | A1 |
20130347089 | Bailey et al. | Dec 2013 | A1 |
20140281489 | Peterka et al. | Sep 2014 | A1 |
20140283137 | Rebaud et al. | Sep 2014 | A1 |
20160165650 | Kim et al. | Jun 2016 | A1 |
20160165651 | Pathuri et al. | Jun 2016 | A1 |
20160301525 | Canard et al. | Oct 2016 | A1 |
Number | Date | Country |
---|---|---|
1139198 | Oct 2001 | EP |
2113860 | Nov 2009 | EP |
2381709 | May 2003 | GB |
H08263440 | Oct 1996 | JP |
2000156676 | Jun 2000 | JP |
2000332746 | Nov 2000 | JP |
2001243707 | Sep 2001 | JP |
2001274786 | Oct 2001 | JP |
2001274788 | Oct 2001 | JP |
2001285821 | Oct 2001 | JP |
2002163396 | Jun 2002 | JP |
2002352094 | Dec 2002 | JP |
2003058657 | Feb 2003 | JP |
2003162600 | Jun 2003 | JP |
2003233690 | Aug 2003 | JP |
2003248508 | Sep 2003 | JP |
2003296484 | Oct 2003 | JP |
2003348508 | Dec 2003 | JP |
2004030111 | Jan 2004 | JP |
2004072721 | Mar 2004 | JP |
2004120736 | Apr 2004 | JP |
2004120738 | Apr 2004 | JP |
2004303111 | Oct 2004 | JP |
2005506627 | Mar 2005 | JP |
2005519365 | Jun 2005 | JP |
2005519501 | Jun 2005 | JP |
2005339093 | Dec 2005 | JP |
2006185473 | Jul 2006 | JP |
2006311267 | Nov 2006 | JP |
2007020144 | Jan 2007 | JP |
2007534030 | Nov 2007 | JP |
2007336553 | Dec 2007 | JP |
2008005047 | Jan 2008 | JP |
2008015936 | Jan 2008 | JP |
2008021293 | Jan 2008 | JP |
2008507905 | Mar 2008 | JP |
2008167018 | Jul 2008 | JP |
2008186272 | Aug 2008 | JP |
2008206039 | Sep 2008 | JP |
2008539631 | Nov 2008 | JP |
2009071786 | Apr 2009 | JP |
2009515238 | Apr 2009 | JP |
2009176060 | Aug 2009 | JP |
2009211632 | Sep 2009 | JP |
2010502109 | Jan 2010 | JP |
2010079902 | Apr 2010 | JP |
2012505436 | Mar 2012 | JP |
2012523614 | Oct 2012 | JP |
WO-0103410 | Jan 2001 | WO |
WO-0110125 | Feb 2001 | WO |
WO-0137479 | May 2001 | WO |
WO-0169842 | Sep 2001 | WO |
WO-0177778 | Oct 2001 | WO |
WO-0213032 | Feb 2002 | WO |
WO-0221841 | Mar 2002 | WO |
WO-0242966 | May 2002 | WO |
WO-02080556 | Oct 2002 | WO |
WO-03038704 | May 2003 | WO |
WO-03087799 | Oct 2003 | WO |
WO-03093944 | Nov 2003 | WO |
WO-2004027622 | Apr 2004 | WO |
WO-2005015422 | Feb 2005 | WO |
WO-2006020141 | Feb 2006 | WO |
WO-2008070062 | Jun 2008 | WO |
WO-2008080556 | Jul 2008 | WO |
WO-2009020476 | Feb 2009 | WO |
WO-2012021245 | Feb 2012 | WO |
Entry |
---|
5C Digital Transmission Content Protection White Paper, Hitachi, Ltd., et al., dated Jul. 14, 1998, 15 pages. |
Cantor, et al., Assertions and Protocols for the OASIS Security Assertion Markup Language (SAML) V2.0, OASIS Standard, Mar. 15, 2005. Document ID: saml-core-2.0-os (http://docs.oasis-open.org/securit/saml/v2.0/saml-core-2.0-os.pdf). |
Cantor, et al., Bindings for the OASIS Security Assertion Markup Language (SAML) V2.0, OASIS Standard, Mar. 2005 (http://docs.oasis-open.org/security/saml/v2.0/). |
DCAS Authorized Service Domain, Version 1.2, dated Nov. 30, 2005, 54 pages. |
DCAS Licensed Specification Abstracts, CableLabs Confidential Information, Jan. 12, 2006, 4 pages. |
Digital Video Broadcasting (DVB); DVB SimulCrypt; Part 1: “Head-end architecture and synchronization” Technical Specification—ETSI TS 101 197 V1.2.1 (Feb. 2002), 40 pages. |
DVB (Digital Video Broadcasting), DVB Document A045 Rev. 3, Jul. 2004, “Head-end Implementation of SimulCrypt,” 289 pages. |
Federal Information Processing Standards Publication, US FIPS PUB 197, Nov. 26, 2001, “Advanced Encryption Standards (AES),” 47 pages. |
High-bandwidth Digital Content Protection System, Revision 1.091, dated Apr. 22, 2003, Digital Content Protection LLC Draft, 78 pages. |
Marusic, et al., “Share it!—Content Transfer in Home-to-Home Networks.” IEEE Melecon 2004, May 12-15, 2004, Dubrovnik, Croatia. |
Media Server; 1 Device Template Version 1.01 Jun. 25, 2002. |
OpenCable Application Platform Specification, OCAP 2.0 Profile, OC-SP-OCAP2.0-I01-020419, Apr. 19, 2002. |
OpenCable Application Platform Specifications, OCAP Extensions, OC-SP-OCAP—HNEXT-I03-080418, 2005-2008. |
OpenCable Host Device, Core Functional Requirements, OC-SP-HOST-CFR-I13-030707, Jul. 7, 2003. |
OpenCable, HOST-POD Interface Specification, OC-SP-HOSTPOD-IF-113-030707, Jul. 7, 2003. |
OpenCable Specification, Home Networking Protocol 2.0, OC-SP-HNP2.0-I01-08418, 2007. |
OpenCable Specifications, Home Networking Security Specification, OC-SP-HN-SEC-DO1-081027, draft (Oct. 27, 2008). |
Primergy BX300 Switch Blade user's manual, Fujitsu Corp., Sep. 30, 2002, first edition, pp. 1 to 20. |
Van Moffaert, K., et al. (“Digital Rights Management: DRM is a key enabler for the future growth of the broadband access market and the telecom/networking market in general”, Alcatel Telecommunications Review, Alcatel, Paris Cedex FR, Apr. 1, 2003, XP007005930ISSN; 8 pages. |
Zhang, et al., A Flexible Content Protection System for Media-on-Demand, ISM China Research Lab, Proceedings of the IEEE Fourth International Symposium on Multimedia Software Engineering (MSE'02), 6 pages. |
RealSystem Media Commerce Suite Technical White Paper, .Copyrgt, 2001 RealNetworks, Inc., http://www.realnetworks.com, 16 pages. |
DCAS Authorized Service Domain, Version 1.2, Nov. 30, 2005, 56 pages. |
Number | Date | Country | |
---|---|---|---|
20160301962 A1 | Oct 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11006404 | Dec 2004 | US |
Child | 13674866 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13674866 | Nov 2012 | US |
Child | 15096019 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10894884 | Jul 2004 | US |
Child | 11006404 | US |