US 8,325,916 B2Grant
Encryption scheme for streamed multimedia content protected by rights management system
Issue Date:2012-12-04
•20 Claims
•9 Drawing Sheets
Abstract
A stream of content has multiple sub-streams, where each sub-stream comprises a part of the content and is divisible into logical blocks bounded by intrinsic partitions. For each sub-stream, a specification of the logical blocks bounded by the intrinsic partitions is defined and the sub-stream is divided into the logical blocks bounded by the intrinsic partitions. Each divided logical block is encrypted and then divided into one or more portions to produce corresponding pieces of data, and each piece of data is placed into a data packet as a payload thereof. Each data packet is transmitted to a recipient thereof, and the recipient can retrieve the pieces of data from the payloads of the packets, reconstruct the encrypted logical blocks, and manipulate the sub-stream on a per-logical block basis without necessarily decrypting each encrypted logical block.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Eduardo P. Oliveira
- Geoffrey Dunbar
- James M. Alkove
Application Information
Application Number:US 12/702,148
Filing Date:2010-02-08
Priority Date:2005-05-27
Art Unit:2434
Classifications
IPC:
H04K1/00
Patent Drawings (9 sheets)
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application is a division of U.S. patent application Ser. No. 11/139,956, (now U.S. Pat. No. 7,684,566), filed May 27, 2005, which is incorporated herein by reference in its entirety.
TECHNICAL FIELD
[0002] The present invention relates to an encryption system for encrypting at least a portion of streamed digital content protected by a rights management (RM) system, whereby access to is provided only in accordance with a corresponding digital license. More particularly, the invention relates to an encryption system that allows the encrypted stream to be more easily manipulated.
BACKGROUND OF THE INVENTION
[0003] Rights management (RM) and enforcement is highly desirable in connection with digital content such as digital audio, digital video, digital text, digital data, digital multimedia, etc., where such digital content is to be distributed to one or more users. Digital content could be static, such as a text document, for example, or it could be streamed, such as the streamed audio and video of a multimedia presentation. Typical modes of distribution of such streamed content include tangible and intangible forms such as an optical disk, a cable-access feed, a feed from an electronic network such as the Internet, a feed from an over-the-air broadcast, etc. Upon being received by a user at an appropriate computing device thereof, such user renders the streamed digital content with the aid of the computing device, appropriate rendering software, and appropriate output devices such as speakers, a video monitor, etc.
[0004] In one scenario, the streamed content is distributed by a distributor as part of a subscription service, such as for example a digital television service, and the streamed content as distributed is either protected, such as for example by being encrypted, or is unprotected. If it is the case that the streamed content is indeed distributed in an unprotected form, it may be the case that the distributor primarily intends for the streamed content to be immediately consumed and rendered, and not stored in any meaningful retrievable form. For example, the streamed content may be one of many streams of content in a digital cable television signal that is to be received by a digital cable set-top box and immediately rendered thereby, and is then to be forwarded to the aforementioned appropriate output devices.
[0005] However, it is to be appreciated that storage systems exist and/or are being developed that can indeed store the streamed content for later rendering and/or re-distribution to other computing devices. With regard to such storage systems, then, the distributor of the streamed unprotected content would rather not have such unprotected content stored in the unprotected form and without any ability to restrict such re-distribution, if so desired. In particular, the distributor or the like may wish to prohibit the user from copying such streamed content to another storage system or the like, may wish to allow the user to copy with temporal and/or count restrictions, or the like. As may be appreciated, by prohibiting unlimited copying of the streamed content, the distributor can avoid the unchecked dispersal of pristine digital copies of the streamed content, where such unchecked dispersal would encourage other users from foregoing from subscribing to the subscription service offered by such distributor.
[0006] In addition, the distributor may wish to provide various users with different rendering rights. For example, the distributor may offer different tiers of service, where higher-level tiers correspondingly command higher subscription fees, and where a user subscribing at a particular tier should not be allowed to access streamed content from higher tiers in an unprotected form.
[0007] Note, though, that after the streamed content has been distributed, the distributor has very little if any real control over the streamed content. This is especially problematic in view of the fact that most any personal computer includes the software and hardware necessary to make an exact digital copy of such streamed content, and to download such exact digital copy to a re-distribution medium such as an optical disk, or to send such exact digital copy over a network such as the Internet to any destination.
[0008] Of course, as part of a transaction wherein the streamed content is subscribed to, the distributor may require the user/recipient of the streamed content to promise not to re-distribute such content in an unwelcome manner. However, such a promise is easily made and easily broken. The distributor may attempt to prevent such re-distribution through any of several known security devices, usually involving encryption and decryption. However, such security devices if especially simple pose little problem to a mildly determined user who wishes to decrypt encrypted content, save such content in an un-encrypted form, and then re-distribute same.
[0009] RM and enforcement architectures and methods have thus been provided to allow the controlled rendering of arbitrary forms of digital content including streamed content, where such control is flexible and definable by the distributor or the like of such digital content. Such architectures allow and facilitate such controlled rendering in the scenario as set forth above.
[0010] In one particular arrangement, the streamed content is one of a plurality of streams of such content provided as a combined signal to a receiver. The receiver selects a particular one of the streams upon command from a media system, and provides the selected stream to such media system for further processing. Notably, the selected stream as provided to the receiver is unprotected, but prior to being provided to the media system the selected stream is in fact protected by the receiver according to a particular RM encryption system.
[0011] Typically, in an RM encryption system, the content is protected by being encrypted according to a content key (CK). Inasmuch as symmetric encryption and decryption is easier, faster, and less expensive than asymmetric encryption and decryption, such content key (CK) is typically symmetric. Also typically, the content key (CK) is provided by an encrypting entity such as the receiver to a decrypting entity such as the media system in an encrypted form and as part of a digital license or the like that specifies license rules that must be satisfied before such content is allowed to be decrypted and rendered by the decrypting entity/media system.
[0012] Typically, a particular stream of content includes multiple sub-streams. For example, a multimedia stream may include an audio sub-stream, a video sub-stream, a text sub-stream, a metadata sub-stream, and/or the like. In addition, such stream may include multiple variations of the same type of sub-stream. For example, such stream may include multiple audio sub-streams, each in a different spoken language, multiple text sub-streams, each in a different written language, and multiple video sub-streams, each from a different angle of view of a scene.
[0013] As is known, such a stream with multiple sub-streams is typically sent as a number data packets, where each packet includes one or more payloads, and where each payload corresponds to a contiguous portion of one of the sub-streams of the stream. Thus, a particular sub-stream is re-created by locating the payloads thereof from the packets of the stream and sequentially organizing such located payloads. Note that in the case where the stream is encrypted, and as may also be known, each payload is typically formed and then encrypted as a unit, and thus re-creating the sub-stream includes decrypting each encrypted payload as a unit.
[0014] As may be appreciated, each payload from a particular sub-stream has a start boundary and an end boundary. As may also be appreciated, each sub-stream is composed of a number of sequentially organized logical blocks of information. For example, a video sub-stream may be composed of video frames, a text stream may be composed of single- or multi-byte characters, an audio sub-stream may be composed of single- or multi-bit audio units, and the like.
[0015] In the prior art, the boundaries of any particular payload were determined rather arbitrarily, and typically based on external factors. For example, to achieve a particular bit rate for a stream, the boundaries of each payload of each sub-stream of the stream were selected to achieve such bit rate, and not based on any consideration of the composition and characteristics of the sub-stream from which the payload originated. Thus, if a particular stream included a video sub-stream based on sequential video frames, such video sub-stream as divided into payloads might be broken up into portions of some arbitrary size selected to achieve the particular bit rate of the stream, where the start boundary of each payload started at some point within a particular video frame, where the payload extended over zero, one or more complete video frames, and where the end boundary of the payload ended at some point within a particular video frame.
[0016] Such arbitrary boundaries on payloads are not especially troublesome during normal transmission and rendering of a stream. However, it is to be appreciated that such arbitrary boundaries can cause considerable difficulty when the stream is to be manipulated, such as for example when the above media system wishes to re-transmit the stream to another media system, or to perform other operations on the stream. As but one example, if the payloads in a transmitted stream are defined according to a first bit rate and the stream is to be re-transmitted at a second bit-rate, the payloads should be re-configured to support the second bit-rate. However, performing such re-configuration requires essentially decrypting each payload, forming the entire stream from the decrypted payloads, forming new payloads from the formed stream according to the second bit-rate, encrypting each new payload, and the like before such re-transmission at the second bit-rate can take place. As should be appreciated, such an operation requires expending a tremendous amount of effort as necessitated by the use of arbitrary boundaries for the payloads.
[0017] Likewise, if an operation is to be performed on a particular sub-stream on a logical block by logical block basis, performing the operation preliminarily requires decrypting each payload, forming the entire stream from the decrypted payloads, and dividing the formed stream into the logical blocks. As should be appreciated here, such preliminary steps would not be absolutely necessary if the payloads were formed based on the logical blocks of the sub-stream.
[0018] A need exists, then, for a method and mechanism by which payloads in a stream of content are defined according to non-arbitrary boundaries. In particular, a need exists for a method and mechanism by which payloads in a stream of content are defined according to rational boundaries that are intrinsic to the underlying sub-stream, and that allow the stream to be manipulated without necessarily requiring the stream to be decrypted and re-encrypted.
[0019] In the prior art, the entirety of the content in a stream of content was encrypted according to the content key (CK). However, encrypting all of the content in a stream of content is at times unnecessary and perhaps not even desired. For example, there may be little to be gained by encrypting a text sub-stream in a multimedia stream, and such encryption ay in fact not be desired by the content owner or the like. Moreover, it is to be recognized that it may be desirable to encrypt different sub-streams of a stream differently, for example according to different encryption systems and/or according to different content keys (CK).
[0020] A need exists, then, for an architecture that may be employed so that each sub-stream within a stream may be protected according to a particular rights management content protect system and a particular content key (CK). In particular, a need exists for such an architecture to specify within the stream the particular rights management content protection and the particular content key (CK) for each sub-stream of the stream. Specifically, a need exists for such an architecture that describes a header object to be included with the stream that may be interpreted and employed when rendering the stream.
SUMMARY OF THE INVENTION
[0021] The aforementioned needs are satisfied at least in part by the present invention in which a method is provided to transmit a stream of content having multiple sub-streams, where each sub-stream comprises a part of the content and is divisible into logical blocks bounded by intrinsic partitions. In the method, for each sub-stream, a specification of the logical blocks bounded by the intrinsic partitions is defined and the sub-stream is divided into the logical blocks bounded by the intrinsic partitions. Each divided logical block is encrypted and then divided into one or more portions to produce corresponding pieces of data, and each piece of data is placed into a data packet as a payload thereof. Each data packet is transmitted to a recipient thereof, and the recipient can retrieve the pieces of data from the payloads of the packets, reconstruct the encrypted logical blocks, and manipulate the sub-stream on a per-logical block basis without necessarily decrypting each encrypted logical block.
[0022] The aforementioned needs are also satisfied at least in part by the present invention in which a stream of content has multiple rights management (RM) protected sub-streams therein, where each RM-protected sub-stream is protected according to a different particular protection scheme. The stream includes a data object including data representative of each sub-stream and a header object including an RM description object. The RM description object includes at least one content encryption record, where each content encryption record corresponds to a particular protection scheme and includes with regard to the protection scheme thereof an identification of the protection scheme and at least one encrypted object records. Each encrypted object record relates to a particular sub-stream protected according to the identified protection scheme of the content encryption record thereof and includes an identification of the particular sub-stream. For each RM-protected sub-stream of the stream, an identification of the sub-stream is employed to find a corresponding encrypted object record, and the protection scheme of the content encryption record of the found encrypted object record is employed to render the sub-stream.
BRIEF DESCRIPTION OF THE DRAWINGS
[0023] The foregoing summary, as well as the following detailed description of the embodiments of the present invention, will be better understood when read in conjunction with the appended drawings. For the purpose of illustrating the invention, there are shown in the drawings embodiments which are presently preferred. As should be understood, however, the invention is not limited to the precise arrangements and instrumentalities shown. In the drawings:
[0024] FIG. 1 is a block diagram representing an exemplary non-limiting computing environment in which the present invention may be implemented;
[0025] FIG. 2 is a block diagram representing an exemplary network environment having a variety of computing devices in which the present invention may be implemented;
[0026] FIG. 3 is a block diagram showing an enforcement architecture of an example of a trust-based system, including a digital license for rendering corresponding digital content in accordance with various embodiments of the present invention;
[0027] FIG. 4 is a block diagram showing an example of the trust-based system of FIG. 3 , and in particular shows a receiver forwarding an encrypted stream of content to a media system for rendering thereby in accordance with various embodiments of the present invention;
[0028] FIG. 5 is a block diagram showing a stream such as may be employed by the receiver of FIG. 4 in accordance with one embodiment of the present invention;
[0029] FIG. 6 is a flow diagram showing key steps performed in connection with transmitting and re-constructing the stream of FIG. 5 in accordance with one embodiment of the present invention, where each logical block of each sub-stream of the stream is first encrypted and then divided into payloads;
[0030] FIG. 7 is a block diagram showing an architecture employed to specify for the stream of FIG. 5 the particular rights management content protection for each sub-stream of the stream in accordance with one embodiment of the present invention; and
[0031] FIG. 8 is a flow diagram showing key steps performed in rendering each protected sub-stream in accordance with the architecture of FIG. 7 in accordance with one embodiment of the present invention.
DETAILED DESCRIPTION OF THE INVENTION
Computer Environment
[0032] FIG. 1 and the following discussion are intended to provide a brief general description of a suitable computing environment in which the invention may be implemented. It should be understood, however, that handheld, portable, and other computing devices of all kinds are contemplated for use in connection with the present invention. While a general purpose computer is described below, this is but one example, and the present invention requires only a thin client having network server interoperability and interaction. Thus, the present invention may be implemented in an environment of networked hosted services in which very little or minimal client resources are implicated, e.g., a networked environment in which the client device serves merely as a browser or interface to the World Wide Web.
[0033] Although not required, the invention can be implemented via an application programming interface (API), for use by a developer, and/or included within the network browsing software which will be described in the general context of computer-executable instructions, such as program modules, being executed by one or more computers, such as client workstations, servers, or other devices. Generally, program modules include routines, programs, objects, components, data structures and the like that perform particular tasks or implement particular abstract data types. Typically, the functionality of the program modules may be combined or distributed as desired in various embodiments. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations. Other well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers (PCs), automated teller machines, server computers, hand-held or laptop devices, multi-processor systems, microprocessor-based systems, programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network or other data transmission medium. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
[0034] FIG. 1 thus illustrates an example of a suitable computing system environment 100 in which the invention may be implemented, although as made clear above, the computing system environment 100 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing environment 100 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 100.
[0035] With reference to FIG. 1 , an exemplary system for implementing the invention includes a general purpose computing device in the form of a computer 110. Components of computer 110 may include, but are not limited to, a processing unit 120, a system memory 130, and a system bus 121 that couples various system components including the system memory to the processing unit 120. The system bus 121 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus (also known as Mezzanine bus).
[0036] Computer 110 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 110 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CDROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 110. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, and other wireless media. Combinations of any of the above should also be included within the scope of computer readable media.
[0037] The system memory 130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements within computer 110, such as during start-up, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation, FIG. 1 illustrates operating system 134, application programs 135, other program modules 136, and program data 137.
[0038] The computer 110 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only, FIG. 1 illustrates a hard disk drive 141 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 151 that reads from or writes to a removable, nonvolatile magnetic disk 152, and an optical disk drive 155 that reads from or writes to a removable, nonvolatile optical disk 156, such as a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 141 is typically connected to the system bus 121 through a non-removable memory interface such as interface 140, and magnetic disk drive 151 and optical disk drive 155 are typically connected to the system bus 121 by a removable memory interface, such as interface 150.
[0039] The drives and their associated computer storage media discussed above and illustrated in FIG. 1 provide storage of computer readable instructions, data structures, program modules and other data for the computer 110. In FIG. 1 , for example, hard disk drive 141 is illustrated as storing operating system 144, application programs 145, other program modules 146, and program data 147. Note that these components can either be the same as or different from operating system 134, application programs 135, other program modules 136, and program data 137. Operating system 144, application programs 145, other program modules 146, and program data 147 are given different numbers here to illustrate that, at a minimum, they are different copies. A user may enter commands and information into the computer 110 through input devices such as a keyboard 162 and pointing device 161, commonly referred to as a mouse, trackball or touch pad. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 120 through a user input interface 160 that is coupled to the system bus 121, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB).
[0040] A monitor 191 or other type of display device is also connected to the system bus 121 via an interface, such as a video interface 190. A graphics interface 182, such as Northbridge, may also be connected to the system bus 121. Northbridge is a chipset that communicates with the CPU, or host processing unit 120, and assumes responsibility for accelerated graphics port (AGP) communications. One or more graphics processing units (GPUs) 184 may communicate with graphics interface 182. In this regard, GPUs 184 generally include on-chip memory storage, such as register storage and GPUs 184 communicate with a video memory 186. GPUs 184, however, are but one example of a coprocessor and thus a variety of co-processing devices may be included in computer 110. A monitor 191 or other type of display device is also connected to the system bus 121 via an interface, such as a video interface 190, which may in turn communicate with video memory 186. In addition to monitor 191, computers may also include other peripheral output devices such as speakers 197 and printer 196, which may be connected through an output peripheral interface 195.
[0041] The computer 110 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 110, although only a memory storage device 181 has been illustrated in FIG. 1 . The logical connections depicted in FIG. 1 include a local area network (LAN) 171 and a wide area network (WAN) 173, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.
[0042] When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 1 illustrates remote application programs 185 as residing on memory device 181. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
[0043] One of ordinary skill in the art can appreciate that a computer 110 or other client device can be deployed as part of a computer network. In this regard, the present invention pertains to any computer system having any number of memory or storage units, and any number of applications and processes occurring across any number of storage units or volumes. The present invention may apply to an environment with server computers and client computers deployed in a network environment, having remote or local storage. The present invention may also apply to a standalone computing device, having programming language functionality, interpretation and execution capabilities.
[0044] Distributed computing facilitates sharing of computer resources and services by direct exchange between computing devices and systems. These resources and services include the exchange of information, cache storage, and disk storage for files. Distributed computing takes advantage of network connectivity, allowing clients to leverage their collective power to benefit the entire enterprise. In this regard, a variety of devices may have applications, objects or resources that may interact to implicate authentication techniques of the present invention for trusted graphics pipeline(s).
[0045] FIG. 2 provides a schematic diagram of an exemplary networked or distributed computing environment. The distributed computing environment comprises computing objects 10a, 10b, etc. and computing objects or devices 110a, 110b, 110c, etc. These objects may comprise programs, methods, data stores, programmable logic, etc. The objects may comprise portions of the same or different devices such as PDAs, televisions, MP3 players, televisions, personal computers, etc. Each object can communicate with another object by way of the communications network 14. This network may itself comprise other computing objects and computing devices that provide services to the system of FIG. 2 . In accordance with an aspect of the invention, each object 10 or 110 may contain an application that might request the authentication techniques of the present invention for trusted graphics pipeline(s).
[0046] It can also be appreciated that an object, such as 110c, may be hosted on another computing device 10 or 110. Thus, although the physical environment depicted may show the connected devices as computers, such illustration is merely exemplary and the physical environment may alternatively be depicted or described comprising various digital devices such as PDAs, televisions, MP3 players, etc., software objects such as interfaces, COM objects and the like.
[0047] There are a variety of systems, components, and network configurations that support distributed computing environments. For example, computing systems may be connected together by wire-line or wireless systems, by local networks or widely distributed networks. Currently, many of the networks are coupled to the Internet, which provides the infrastructure for widely distributed computing and encompasses many different networks.
[0048] In home networking environments, there are at least four disparate network transport media that may each support a unique protocol such as Power line, data (both wireless and wired), voice (e.g., telephone) and entertainment media. Most home control devices such as light switches and appliances may use power line for connectivity. Data Services may enter the home as broadband (e.g., either DSL or Cable modem) and are accessible within the home using either wireless (e.g., HomeRF or 802.11b) or wired (e.g., Home PNA, Cat 5, even power line) connectivity. Voice traffic may enter the home either as wired (e.g., Cat 3) or wireless (e.g., cell phones) and may be distributed within the home using Cat 3 wiring. Entertainment media may enter the home either through satellite or cable and is typically distributed in the home using coaxial cable. IEEE 1394 and DVI are also emerging as digital interconnects for clusters of media devices. All of these network environments and others that may emerge as protocol standards may be interconnected to form an intranet that may be connected to the outside world by way of the Internet. In short, a variety of disparate sources exist for the storage and transmission of data, and consequently, moving forward, computing devices will require ways of protecting content at all portions of the data processing pipeline.
[0049] The ‘Internet’ commonly refers to the collection of networks and gateways that utilize the TCP/IP suite of protocols, which are well-known in the art of computer networking TCP/IP is an acronym for “Transport Control Protocol/Interface Program.” The Internet can be described as a system of geographically distributed remote computer networks interconnected by computers executing networking protocols that allow users to interact and share information over the networks. Because of such wide-spread information sharing, remote networks such as the Internet have thus far generally evolved into an open system for which developers can design software applications for performing specialized operations or services, essentially without restriction.
[0050] Thus, the network infrastructure enables a host of network topologies such as client/server, peer-to-peer, or hybrid architectures. The “client” is a member of a class or group that uses the services of another class or group to which it is not related. Thus, in computing, a client is a process, i.e., roughly a set of instructions or tasks, that requests a service provided by another program. The client process utilizes the requested service without having to “know” any working details about the other program or the service itself. In a client/server architecture, particularly a networked system, a client is usually a computer that accesses shared network resources provided by another computer e.g., a server. In the example of FIG. 2 , computers 110a, 110b, etc. can be thought of as clients and computer 10a, 10b, etc. can be thought of as the server where server 10a, 10b, etc. maintains the data that is then replicated in the client computers 110a, 110b, etc.
[0051] A server is typically a remote computer system accessible over a remote network such as the Internet. The client process may be active in a first computer system, and the server process may be active in a second computer system, communicating with one another over a communications medium, thus providing distributed functionality and allowing multiple clients to take advantage of the information-gathering capabilities of the server.
[0052] Client and server communicate with one another utilizing the functionality provided by a protocol layer. For example, Hypertext-Transfer Protocol (HTTP) is a common protocol that is used in conjunction with the World Wide Web (WWW). Typically, a computer network address such as a Universal Resource Locator (URL) or an Internet Protocol (IP) address is used to identify the server or client computers to each other. The network address can be referred to as a Universal Resource Locator address. For example, communication can be provided over a communications medium. In particular, the client and server may be coupled to one another via TCP/IP connections for high-capacity communication.
[0053] Thus, FIG. 2 illustrates an exemplary networked or distributed environment, with a server in communication with client computers via a network/bus, in which the present invention may be employed. In more detail, a number of servers 10a, 10b, etc., are interconnected via a communications network/bus 14, which may be a LAN, WAN, intranet, the Internet, etc., with a number of client or remote computing devices 110a, 110b, 110c, 110d, 110e, etc., such as a portable computer, handheld computer, thin client, networked appliance, or other device, such as a VCR, TV, oven, light, heater and the like in accordance with the present invention. It is thus contemplated that the present invention may apply to any computing device in connection with which it is desirable to process, store or render secure content from a trusted source.
[0054] In a network environment in which the communications network/bus 14 is the Internet, for example, the servers 10 can be Web servers with which the clients 110a, 110b, 110c, 110d, 110e, etc. communicate via any of a number of known protocols such as HTTP. Servers 10 may also serve as clients 110, as may be characteristic of a distributed computing environment. Communications may be wired or wireless, where appropriate. Client devices 110 may or may not communicate via communications network/bus 14, and may have independent communications associated therewith. For example, in the case of a TV or VCR, there may or may not be a networked aspect to the control thereof. Each client computer 110 and server computer 10 may be equipped with various application program modules or objects 135 and with connections or access to various types of storage elements or objects, across which files may be stored or to which portion(s) of files may be downloaded or migrated. Thus, the present invention can be utilized in a computer network environment having client computers 110a, 110b, etc. that can access and interact with a computer network/bus 14 and server computers 10a, 10b, etc. that may interact with client computers 110a, 110b, etc. and other devices 111 and databases 20.
Rights Management (RM) Overview
[0055] As is known, and referring now to FIG. 3 , rights management (RM) and enforcement is highly desirable in connection with digital content 32 such as digital audio, digital video, digital text, digital data, digital multimedia, etc., where such digital content 32 is to be distributed or redistributed to a user. Upon being received by the user, such user renders the digital content 32 with the aid of an appropriate rendering device such as a media player, text displayer, etc. on a personal computer 34 or the like.
[0056] Typically, a content owner or developer or distributor (hereinafter ‘distributor’) distributing such digital content 32 wishes to restrict what the user can do with such distributed digital content 32, or at least ensure that the content 32 is not redistributed in an unwanted manner. For example, the content distributor may wish to restrict the user from copying and re-distributing such content 32 to a second user, or may wish to allow distributed digital content 32 to be rendered only a limited number of times, only for a certain total time, only on a certain type of machine, only on a certain type of rendering platform, only by a certain type of user, etc.
[0057] However, and as was set forth above, after distribution has occurred, such distributor has very little if any control over the digital content 32. An RM system 30, then, allows the controlled rendering of arbitrary forms of digital content 32, where such control is flexible and definable by the content distributor of such digital content. Typically, to protect the content 32, such content 32 is encrypted with a symmetric encryption/decryption key (KD), (i.e., (KD(CONTENT))), and is packaged with other information relevant to the content 32 in a package 33.
[0058] The trust-based RM system 30 allows a distributor of digital content 32 to specify at least some license rules that must be satisfied before such digital content 32 is allowed to be rendered by a computing device 34 of a user. Such license rules can include the aforementioned temporal requirement, and may be embodied within a digital license or use document (hereinafter ‘license’) 36 that the user/user's computing device 34 (hereinafter, such terms are interchangeable unless circumstances require otherwise) must be possess. Such license 36 also includes the decryption key (KD) for decrypting the digital content 32, perhaps encrypted according to a key decryptable by the user's computing device 34. As seen in FIG. 3 , such encrypting key is a public key of the user's computing device 34 (PU-C), and the user's computing device 34 presumably has the corresponding private key (PR-C) by which (PU-C(KD)) may be decrypted.
[0059] The content distributor for a piece of digital content 32 must trust that the user's computing device 34 will abide by the rules and requirements specified by such content owner in the license 36, i.e. that the digital content 32 will not be rendered unless the rules and requirements within the license 36 are satisfied. Preferably, then, the user's computing device 34 is provided with a trusted component or mechanism 38 that will not render the digital content 32 except according to the license rules embodied in the license 36 associated with the digital content 32 and obtained by the user.
[0060] The trusted component 38 typically has a license evaluator 40 that determines whether the license 36 is valid, reviews the license rules and requirements in such valid license 36, and determines based on the reviewed license rules and requirements whether the requesting user has the right to render the requested digital content 32 in the manner sought, among other things. As should be understood, the license evaluator 40 is trusted in the RM system 30 to carry out the wishes of the owner of the digital content 32 according to the rules and requirements in the license 36, and the user should not be able to easily alter such trusted element for any purpose, nefarious or otherwise.
[0061] As should be understood, the rules and requirements in the license 36 might specify whether the user has rights to render the digital content 32 based on any of several factors, including who the user is, where the user is located, what type of computing device the user is using, what rendering application is calling the RM system 30, the date, the time, etc. In addition, the rules and requirements of the license 36 may limit the license 36 to a pre-determined number of renderings, or pre-determined rendering time, for example. Thus, the trusted component 38 may need to refer to a clock 42 on the computing device 34. If such clock 42 is provided, such clock 42 may be a secure clock 42 that cannot be tampered with by a user in an effort to overcome a temporal restriction of a license 36.
[0062] The rules and requirements may be specified in the license 36 according to any appropriate language and syntax. For example, the language may simply specify attributes and values that must be satisfied (DATE must be later than X, e.g.), or may require the performance of functions according to a specified script (IF DATE greater than X, THEN DO . . . , e.g.).
[0063] Upon the license evaluator 40 determining that the license 36 is valid and that the user satisfies the rules and requirements therein, the digital content 32 can then be rendered. In particular, to render the content 32, the decryption key (KD) is obtained from the license 36 and is applied to (KD(CONTENT)) from the content package 33 to result in the actual content 32, and the actual content 32 is then in fact rendered. As set forth above, the license 36 with (PU-C(KD)) in effect authorizes an entity in possession of (PR-C) to access (KD) and thereby access the content 32 encrypted according to such (KD), presuming of course that the entity abides by all conditions as set forth in the license 36.
[0064] Note that a license 36 typically includes a digital signature for authentication/validation purposes. Likewise, other forms of digital constructs such as a piece of digital content 32 may also have such a digital signature for authentication/validation purposes. As should be known, such a digital signature may be constructed based on a first key from a pair of asymmetric keys or from a symmetric integrity key, for example by performing some sort of hash on the underlying data to which the signature is attached and then encrypting the hash with the key. Thereafter, the signature is validated by applying the second key from the pair of asymmetric keys or the integrity key, again for example by decrypting the encrypted hash and comparing the decrypted hash to another hash of the underlying data to which the signature is attached. If the hashes match, it can be presumed that the underlying data has not been altered and the underlying construct therefore can be authenticated. Typically, an RM system 30 will not honor a license 36 or the like that is not authenticated.
System for Receiving and Handling Streamed Multimedia Content 32
[0065] Turning now to FIG. 4 , a system 44 for receiving and handling multimedia content 32 is shown. As should be evident, such system 44 is particularly suited for handling an input signal comprising multiple streams of multimedia content 32, such as for example a television signal from a multi-channel distributor. However, such will be system 44 may also handle other input signals without departing from the spirit and scope of the present invention.
[0066] In the system 44, the aforementioned input signal as provided by the distributor thereof is applied to a receiver 46 which may be any appropriate receiver without departing from the spirit and scope of the present invention, presuming of course such receiver can performs the functions set forth herein. For example, the receiver 46 may be a Uni-Directional Cable Receiver (UDCR) such as is being developed to receive a digital cable television signal and forward same for further digital processing including rendering of content 32 therein. As may be appreciated, the receiver 46 upon being so commanded tunes one of the multiple streams of multimedia content 32 from the input signal and forwards same for further processing. In addition, the receiver 46 prior to forwarding the tuned stream of content 32 may if necessary convert such stream 32 from a native format to a format more amenable for such further processing.
[0067] As envisioned, each of the multiple streams of multimedia content 32 in the input signal may or may not be encrypted. Upon tuning a particular stream of content 32 within the input signal, then, the receiver 46 decrypts such stream if encrypted and re-encrypts same in a manner that will be set forth in more detail below, or merely encrypts the stream if not encrypted, again in a manner that will be set forth in more detail below. As was alluded to above, the receiver 46 encrypts the stream of content 32 as part of ensuring that the stream is RM-protected. Thus, the stream of content 32 is not available to be redistributed in an unprotected form.
[0068] As also shown in FIG. 4 , a media system 48 is provided to receive the encrypted stream of content 32 from the receiver 46 and further process same. Presumably, the media system 48 commanded the receiver 46 to tune the particular stream of content 32 from within the input signal, perhaps upon receiving a corresponding command from a user, although it maybe appreciated that such a command may be initiated by other sources without departing from the spirit and scope of the present invention. At any rate, upon receiving the stream of content 32 from the receiver 46, the media system 48 stores same in an appropriate storage device 50 for retrieval and rendering, either immediately or upon some time delay. Upon rendering of the stream 32, the media system 48 forwards appropriate signals to one or more output devices such as one or more monitors 52, speakers 54, other displays 56, and the like.
[0069] Inasmuch as the stored stream 32 is in the RM-protected form, the media system 48 includes RM components such as the trusted component 38, license evaluator 40, and clock 42 of FIG. 3 . Thus, upon retrieving a particular stream 32, the media system 38 renders same, but only in accordance with a corresponding license 36. Accordingly, the encrypted stream 32 is decrypted and rendered only in if such license 36 so allows, and with the content key (CK) set forth in the license 36. Note that inasmuch as the encrypted stream 32 is stored at least temporarily on the (first) media system 48, a user thereof may in theory copy same to another (second) media system 48 for rendering thereby. However, inasmuch as the stream is encrypted and decryptable only according to the license 36, and inasmuch as the license 36 is tied to the first media system 48, such license 36 may not be employed by the second media system 48.
[0070] As should be understood, though, it may be the case that the first media system 48 can issue a sub-license 36 for the copied stream 32 to the second media system 48, presuming the first media system 48 is in fact capable of doing so and the license 36 so allows. If so, the sub-license 36 as tied to the second media system 48 can in fact be employed by the second media system 48 to render the stream 32.
[0071] Still referring to FIG. 4 , it is seen that in addition to or as an alternative to receiving a stream 32 from the receiver 46, the media system 48 may additionally receive streams 32 from other sources, either directly or indirectly. Such other sources may for example comprise an NTSC input signal, an ATSC input signal, and the like. As seen, for each of at least some input signals received directly, it may be the case that the media system 48 includes either a hardware or software gateway 58 that acts in the manner of the receiver 46 to convert a stream 32 within the received input signal to an encrypted format more amenable to the media system 48 as necessary.
Payloads in Stream 32 Formed on Intrinsic Partitions
[0072] Turning now to FIG. 5 , and as was set forth above, a typical stream 32 includes multiple sub-streams 32s, such as for example one or more audio sub-streams 32s, one or more video sub-streams 32s, one or more text sub-streams 32s, etc., where at least some of the sub-streams 32s are intended to be synchronized with one another and rendered with one another. As is known, when forming the stream 32 for transmission, either by the receiver 46, a source providing the stream 32 to the receiver 46, a source providing the stream 32 directly to the media system 48, or otherwise, each such sub-stream 32s is divided into payloads 60, each payload 60 is encrypted if necessary and tagged with appropriate identifying information, payloads 60 are formed into packets 62, each packet 62 is tagged with appropriate identifying information, and the packets 62 are what is in fact transmitted. Forming such stream 32 into such packets 62 is known or should be apparent to the relevant public and therefore need not be set forth herein in any detail. Accordingly, any appropriate method of so forming such stream 32 into such packets 62 may be employed without departing from the spirit and scope of the present invention.
[0073] As should be appreciated, with such packets 62, the media system 48 or the like recreates the stream 32 from the packets 62 by essentially reversing the process of packet formation. In essence, then, each sub-stream 32s is re-created by locating the payloads 60 thereof from the packets 62 of the stream 32, decrypting the located payloads 60, and sequentially organizing such decrypted payloads 60. As each sub-stream 32s is re-created, the stream 32 is rendered by rendering each sub-stream 32s in a synchronous manner. As before, re-creating such stream 32 from such packets 62 is known or should be apparent to the relevant public and therefore need not be set forth herein in any detail. Accordingly, any appropriate method of so re-creating such stream 32 from such packets 62 may be employed without departing from the spirit and scope of the present invention.
[0074] As was set forth above, each payload 60 from a particular sub-stream 32s has a start boundary and an end boundary, and each sub-stream 32s is composed of a number of sequentially organized digital blocks of information, such as for example, frames of video in a video sub-stream 32s, bytes of text in text sub-stream 32s, etc. As was also set forth above, in the prior art, during formation of the payloads 60, the boundaries of any particular payload 60 were determined rather arbitrarily, and typically based on external factors such as a determined bit-rate for the stream 32. Thus, and for example, it typically was the case that a video sub-stream 32s was divided into payloads 60 such that each of the start boundary and end boundary of each payload 60 was as some point in the middle of a video frame, and not at a partition between video frames.
[0075] Again, although such arbitrary boundaries for payloads 60 are not especially troublesome during normal transmission and rendering of a stream 32 by the media system 48 or the like, it is to be appreciated that such arbitrary boundaries can cause considerable difficulty when the stream 32 is to be manipulated, such as for example when a first media system 48 re-transmits the stream 32 to a second media system 48, or when a media system 48 is being operated to perform an operation on each logical block of a sub-stream 32s of the stream 32.
[0076] Accordingly, and in one embodiment of the present invention, each payload 60 is not formed from a sub-stream 32s of a stream 32 by defining an arbitrarily bounded portion of the sub-stream 32s and then encrypting the portion to produce the data for the payload 60. Instead, in one embodiment of the present invention, a non-arbitrarily bounded logical block of the sub-stream 32s is defined and encrypted, and the encrypted logical block may then be divided into portions to produce the corresponding data for each of one or more payloads 60. Thus data of the payloads 60 of the logical blocks need not necessarily be decrypted to manipulate such logical blocks, unless of course such manipulation requires the data to be in a decrypted form.
[0077] The size and definition of each logical block of a particular sub-stream 32s can be any size and definition without departing from the spirit and scope of the present invention. Significantly, though, each logical block is based on partitions intrinsic to the sub-stream 32s. Again, such intrinsic partitions are specific to the type of content in a sub-stream 32s, and can be the dividers between frames in the case of video, bytes in the case of text, audio samples in the case of audio, etc.
[0078] Likewise, the number of payloads 60 produced from a particular encrypted logical block can be any number without departing from the spirit and scope of the present invention. For example, in the case of a text sub-stream 32s with bytes of text, the logical block may be a byte, 50 bytes, 512 bytes, a kilobyte, 10 kilobytes, or the like, and the number of payloads 60 produced from such a logical block can be 1, 10, 40, 128, 1024, or the like. Similarly, in the case of a video sub-stream 32s with frames of video, the logical block may be a frame, a pair of frames, 10 frames, or the like, and the number of payloads 60 produced from such a logical block can be 1, 3, 7, 10, 40, or the like.
[0079] Turning now to FIG. 6 , it is seen that a method for producing the payloads 60 from a particular sub-stream 32s is shown. Preliminarily, a logical block of the sub-stream 32s is defined (step 601) based on appropriate criteria. Remembering that each logical block is to be encrypted as a unit, the logical block should be defined at least partially based on a consideration of a size of the logical block that would be amenable for such encryption. For example, a particular encryption algorithm may operate better on a logical block that is about 1 kilobyte as opposed to a logical block that is about 10 bytes. However, remembering that it may be more optimal for a media system 48 or the like to manipulate particular-size pieces of a sub-stream 32s, the logical block should also be defined at least partially based on a consideration of such particular-size pieces. For example, manipulation of frames of video in a video sub-stream 32s may best be performed if each logical block is indeed a video frame.
[0080] At any rate, once a logical block is defined as at step 601, the sub-stream 32s is divided into such logical blocks (step 603), and each logical block is then encrypted (step 605). Thereafter, each encrypted logical block may itself be divided into a number of portions if so desired (step 607). As maybe appreciated, the number of portions that an encrypted logical block is divided into can be any number without departing from the spirit and scope of the present invention, if indeed such division takes place, and may indeed vary from block to block. For example, if it is deemed advisable that each payload 60 should have about 1 kilobyte of data or so and a particular encrypted logical block is about 10 kilobytes, then it may be that such block is divided into 9, 10, or 11 pieces of data.
[0081] Once divided, each portion of the encrypted logical block is then incorporated into a payload 60 as the data thereof (step 609). Of course, each payload 60 is then incorporated into a particular packet 62 (step 611), and the packets 62 may then be delivered as part of a stream 32 including the sub-stream 32s (step 613).
[0082] To reconstitute a particular sub-stream 32s of the stream 32 from the packets 62, and as should now be appreciated, each payload 60 for the sub-stream 32s is removed from the packets 62 (step 615), and each encrypted logical block portion from the sub-stream 32s is removed from each payload 60 (step 617). The encrypted logical block portions may then be correctly sequenced and combined to form the encrypted logical blocks (step 619), and each such encrypted logical block may then be decrypted as appropriate (step 621). Note that re-constituting a particular sub-stream 32 from packets 62 is known or should be apparent to the relevant public and therefore need not be set forth herein in any detail. Accordingly, any appropriate method of so re-constituting such sub-stream 32 from such packets 62 may be employed without departing from the spirit and scope of the present invention.
[0083] Note that it may not always be necessary for a media system 48 or the like to perform all of steps 615-621 when manipulating a stream 32. For example, decrypting as at step 621 may not be necessary, and sequencing and combining the encrypted logical block portions as at step 619 may also not be necessary in all circumstances. Critically, inasmuch as each logical block of a sub-stream 32s is encrypted prior to being (possibly) divided into portions that are formed into payloads 60, such sub-stream 32s may be manipulated by manipulating the encrypted logical block portions thereof, and decryption of such encrypted logical block portions can be avoided in at least some instances.
Architecture for Defining Protection of Multiple Sub-Streams 32s in Stream 32
[0084] As was pointed out above, and with regard to a stream 32 of content comprised of multiple sub-streams 32s, it would be advantageous to be able to apply different rights management and protection schemes to each sub-stream 32s of the stream 32. For example, in a stream 32 with a video sub-stream 32s, an audio sub-stream 32s, a text sub-stream 32s, and a metadata sub-stream 32s, it may be advantageous to have the video sub-stream 32s protected by a first scheme and according to a first license 36, to have the audio sub-stream 32s protected by the first scheme but according to a second license 36, to have the text sub-stream 32s protected by a second scheme, and to not have the metadata sub-stream 32s protected by any scheme whatsoever.
[0085] Presumably, the mechanics of in fact applying such schemes to the sub-streams 32s of the stream 32 in the manner desired are known or should be apparent to the relevant public and therefore need not be set forth herein in any detail. However, and significantly, an architecture describing the particular application of such schemes to such sub-streams 32s is necessary so that such a description can be provided to an entity such as a media system 48 or the like that is to reconstitute or at least manipulate such sub-streams 32s.
[0086] In one embodiment of the present invention, then, and turning now to FIG. 7 , an architecture describing the application of rights management (RM) and protections schemes to sub-streams 32s of a stream is shown. Preliminarily, and as should be appreciated, it is typical although not absolutely necessarily that the stream 32s include such RM description so that a media system 48 or the like receiving the stream 32 need not refer elsewhere for such description. For example, and as shown, the stream 32 may be at least conceptually organized into a plurality of objects 64 including a header object 64h and a data object 64d, where the header object 64h includes various data and metadata relating to the stream 32, and the data object 64d includes the actual data representative of the stream 32, including the constituent sub-streams 32s thereof and other related objects. As may be appreciated, then, such header object 64h in particular may include the RM description in an appropriate arrangement.
[0087] In one embodiment of the present invention, the RM description is set forth within the header object 64h as an RM description object 64r. As seen, the RM description object 64r principally includes for each protection scheme employed in connection with the stream 32 a content encryption record 66 describing such protection scheme. Thus, with regard to the aforementioned example where a stream 32 has a video sub-stream 32s protected by a first scheme and according to a first license 36, an audio sub-stream 32s protected by the first scheme but according to a second license 36, a text sub-stream 32s protected by a second scheme, and an unprotected metadata sub-stream 32s, it would be the case that the RM description object 64r for such stream 32 includes a first content encryption record 66 describing the first scheme and a second content encryption record 66 describing the second scheme. Such RM description object 64r might also have a third content encryption record 66 relating to the unprotected metadata sub-stream 32s, although such a third content encryption record 66 is likely unnecessary since such metadata sub-stream 32s is indeed unprotected.
[0088] In one embodiment of the present invention, each content encryption record 66 principally includes with regard to the protection scheme thereof an identification of the protection scheme and a number of encrypted object records 68, where each encrypted object record 68 relates to a particular object protected according to the identified protection scheme of the content encryption record 66, such as for example a particular sub-stream 32s, a portion of a particular sub-stream 32s, or the like. Thus, with regard to the aforementioned example where the stream 32 has the video sub-stream 32s protected by the first scheme and according to a first license 36, the audio sub-stream 32s protected by the first scheme but according to a second license 36, the text sub-stream 32s protected by the second scheme, and the unprotected metadata sub-stream 32s, it would be the case that the first content encryption record 66 describing the first scheme would include an identification of the first scheme, a first encrypted object record 68 relating to the video sub-stream 32s as protected by the identified first scheme, and a second encrypted object record 68 relating to the audio sub-stream 32s as protected by the identified first scheme. Likewise, the second content encryption record 66 describing the second scheme would include an identification of the second scheme and only a single encrypted object record 68 relating to the text sub-stream 32s as protected by the identified second scheme.
[0089] As seen in FIG. 7 , each encrypted object record 68 with regard to a particular object protected according to a particular protection scheme includes therein an identification of the particular object as the particular object resides in the data object 64d and a type of the object, such as for example a sub-stream 32s, a portion of a sub-stream 32s, etc. In addition, the encrypted object record 68 may also include with regard to the identified object related information, such as an identification of a license 36 to render the object, or an identification of where to obtain such a license 36. Alternatively, if such license-type information is common to all encrypted object records 68 of a particular content encryption record 66, such license-type information may be included with such content encryption record 66.
[0090] As may now be appreciated, with the architecture set forth in FIG. 7 , and referring now to FIG. 8 , a rendering device such as a media system 48 renders a particular stream 32 by first locating the header object 64h of the stream 32 (step 801), then locating each content encryption record 66 in the header object 64h (step 803), and then locating each encrypted object record 68 of each located content encryption record 66 in the header object 64h (step 805). With regard to a particular sub-stream 32s that is RM-protected, then, the rendering device determines an identification of the sub-stream 32s (step 807) and searches through the located encrypted object records 68 to find a record 68 having such identification of such sub-stream 32s (step 809). Thereafter, the rendering device determines the protection scheme of the content encryption record 66 of the found record 68, where such determined protection scheme is employed to protect the sub-stream 32s (step 811), and proceeds to render such sub-stream 32s in accordance with such protection scheme (step 813).
Conclusion
[0091] The programming necessary to effectuate the processes performed in connection with the present invention is relatively straight-forward and should be apparent to the relevant programming public. Accordingly, such programming is not attached hereto. Any particular programming, then, may be employed to effectuate the present invention without departing from the spirit and scope thereof.
[0092] In the present invention, a method and mechanism are provided by which payloads 60 from a sub-stream 32s of content are defined according to non-arbitrary boundaries. Thus, the payloads 60 are defined according to rational boundaries that are intrinsic to the underlying sub-stream 32s, and the sub-stream 32s can be manipulated without necessarily requiring the stream 32 to be decrypted and re-encrypted.
[0093] Also in the present invention, an architecture is provided that may be employed so that each sub-stream 32s within a stream 32 may be protected according to a particular rights management content protect system and a particular content key (CK). The architecture allows specifying within the stream 32 the particular rights management content protection scheme for each sub-stream 32s of the stream 32 with a header object 64h that is included with the stream 32 and that may be interpreted and employed when rendering the stream 32.
[0094] It should be appreciated that changes could be made to the embodiments described above without departing from the inventive concepts thereof. It should be understood, therefore, that this invention is not limited to the particular embodiments disclosed, but it is intended to cover modifications within the spirit and scope of the present invention as defined by the appended claims.
Claims
The invention claimed is:
1. A method of transmitting a stream of content having multiple sub-streams, each sub-stream comprising a part of the content and being divisible into logical blocks bounded by intrinsic partitions, the method comprising, for each sub-stream:
defining for the sub-stream a specification of the logical blocks bounded by the intrinsic partitions, wherein the intrinsic partitions are rational boundaries intrinsic to the underlying sub-stream;
dividing the sub-stream into the logical blocks bounded by the intrinsic partitions;
encrypting each divided logical block;
dividing each encrypted logical block into one or more portions to produce corresponding pieces of data;
placing each piece of data into a data packet as a payload thereof; and
transmitting each data packet to a recipient thereof, whereby the recipient retrieves the pieces of data from the payloads of the packets, reconstructs the encrypted logical blocks, and manipulates the sub-stream on a per-logical block basis prior to decrypting each encrypted logical block.
2. The method of claim 1 for transmitting a stream of content having a video sub-stream divisible into logical blocks comprising at least one frame of video each, the method comprising, for the video sub-stream:
defining for the video sub-stream a number of frames to be included in each logical block thereof; and
dividing the video sub-stream into the logical blocks each having the defined number of frames.
3. The method of claim 1 for transmitting a stream of content having an audio sub-stream divisible into logical blocks comprising at least one audio sample each, the method comprising, for the audio sub-stream:
defining for the audio sub-stream a number of samples to be included in each logical block thereof; and
dividing the audio sub-stream into the logical blocks each having the defined number of samples.
4. The method of claim 1 for transmitting a stream of content having a text sub-stream divisible into logical blocks comprising at least one byte each, the method comprising, for the text sub-stream:
defining for the text sub-stream a number of bytes to be included in each logical block thereof; and
dividing the text sub-stream into the logical blocks each having the defined number of bytes.
5. The method of claim 1 comprising defining for the sub-stream a specification of the logical blocks bounded by the intrinsic partitions based at least in part on a consideration of a size of the divided logical blocks that would be amenable for encrypting.
6. The method of claim 1 comprising defining for the sub-stream a specification of the logical blocks bounded by the intrinsic partitions based at least in part on a consideration of a size of the divided logical blocks that would be amenable to the recipient.
7. The method of claim 1 comprising dividing each encrypted logical block into a number of portions to produce corresponding pieces of data having about a particular data size.
8. A system, the system comprising:
a processor; and
a memory communicatively coupled to the processor, the memory having computer-executable instructions that when executed by the processor, provide a method for transmitting a stream of content having multiple sub-streams, each sub-stream comprising a part of the content and being divisible into logical blocks bounded by intrinsic partitions, the method comprising, for each sub-stream:
defining for the sub-stream a specification of the logical blocks bounded by the intrinsic partitions, wherein the intrinsic partitions are rational boundaries intrinsic to the underlying sub-stream;
dividing the sub-stream into the logical blocks bounded by the intrinsic partitions;
encrypting each divided logical block;
dividing each encrypted logical block into one or more portions to produce corresponding pieces of data;
placing each piece of data into a data packet as a payload thereof; and
transmitting each data packet to a recipient thereof, whereby the recipient retrieves the pieces of data from the payloads of the packets, reconstructs the encrypted logical blocks, and manipulates the sub-stream on a per-logical block basis prior to decrypting each encrypted logical block.
9. The system of claim 8 for transmitting a stream of content having a video sub-stream divisible into logical blocks comprising at least one frame of video each, the method comprising, for the video sub-stream:
defining for the video sub-stream a number of frames to be included in each logical block thereof; and
dividing the video sub-stream into the logical blocks each having the defined number of frames.
10. The system of claim 8 for transmitting a stream of content having an audio sub-stream divisible into logical blocks comprising at least one audio sample each, the method comprising, for the audio sub-stream:
defining for the audio sub-stream a number of samples to be included in each logical block thereof; and
dividing the audio sub-stream into the logical blocks each having the defined number of samples.
11. The system of claim 8 for transmitting a stream of content having a text sub-stream divisible into logical blocks comprising at least one byte each, the method comprising, for the text sub-stream:
defining for the text sub-stream a number of bytes to be included in each logical block thereof; and
dividing the text sub-stream into the logical blocks each having the defined number of bytes.
12. The system of claim 8 comprising defining for the sub-stream a specification of the logical blocks bounded by the intrinsic partitions based at least in part on a consideration of a size of the divided logical blocks that would be amenable for encrypting.
13. The system of claim 8 comprising defining for the sub-stream a specification of the logical blocks bounded by the intrinsic partitions based at least in part on a consideration of a size of the divided logical blocks that would be amenable to the recipient.
14. The system of claim 8 comprising dividing each encrypted logical block into a number of portions to produce corresponding pieces of data having a particular data size.
15. One or more computer storage media not consisting of a propagated data signal and having computer-executable instructions that when executed provide a method for transmitting a stream of content having multiple sub-streams, each sub-stream comprising a part of the content and being divisible into logical blocks bounded by intrinsic partitions, the method comprising, for each sub-stream:
defining for the sub-stream a specification of the logical blocks bounded by the intrinsic partitions, wherein the intrinsic partitions are rational boundaries intrinsic to the underlying sub-stream;
dividing the sub-stream into the logical blocks bounded by the intrinsic partitions;
encrypting each divided logical block;
dividing each encrypted logical block into one or more portions to produce corresponding pieces of data;
placing each piece of data into a data packet as a payload thereof; and
transmitting each data packet to a recipient thereof, whereby the recipient retrieves the pieces of data from the payloads of the packets, reconstructs the encrypted logical blocks, and manipulates the sub-stream on a per-logical block basis prior to decrypting each encrypted logical block.
16. The one or more computer storage media of claim 15 for transmitting a stream of content having a video sub-stream divisible into logical blocks comprising at least one frame of video each, the method comprising, for the video sub-stream:
defining for the video sub-stream a number of frames to be included in each logical block thereof; and
dividing the video sub-stream into the logical blocks each having the defined number of frames.
17. The one or more computer storage media of claim 15 for transmitting a stream of content having an audio sub-stream divisible into logical blocks comprising at least one audio sample each, the method comprising, for the audio sub-stream:
defining for the audio sub-stream a number of samples to be included in each logical block thereof; and
dividing the audio sub-stream into the logical blocks each having the defined number of samples.
18. The one or more computer storage media of claim 15 for transmitting a stream of content having a text sub-stream divisible into logical blocks comprising at least one byte each, the method comprising, for the text sub-stream:
defining for the text sub-stream a number of bytes to be included in each logical block thereof; and
dividing the text sub-stream into the logical blocks each having the defined number of bytes.
19. The one or more computer storage media of claim 15 comprising defining for the sub-stream a specification of the logical blocks bounded by the intrinsic partitions based at least in part on a consideration of a size of the divided logical blocks that would be amenable for encrypting.
20. The one or more computer storage media of claim 15 comprising defining for the sub-stream a specification of the logical blocks bounded by the intrinsic partitions based at least in part on a consideration of a size of the divided logical blocks that would be amenable to the recipient.
Patent Citations (317)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3718906(A) | 1973-02-01 | Lightner | Applicant |
| US4255811(A) | 1981-03-01 | Adler | Applicant |
| US4323921(A) | 1982-04-01 | Guillou | Applicant |
| US4528643(A) | 1985-07-01 | Freeny, Jr. | Applicant |
| US4658093(A) | 1987-04-01 | Hellman | Applicant |
| US4683553(A) | 1987-07-01 | Mollier | Applicant |
| US4827508(A) | 1989-05-01 | Shear | Applicant |
| US4916738(A) | 1990-04-01 | Chandra et al. | Applicant |
| US4926479(A) | 1990-05-01 | Goldwasser et al. | Applicant |
| US4953209(A) | 1990-08-01 | Ryder, Sr. et al. | Applicant |
| US4977594(A) | 1990-12-01 | Shear | Applicant |
| US5005170(A) | 1991-04-01 | Nelson | Applicant |
| US5050213(A) | 1991-09-01 | Shear | Applicant |
| US5103392(A) | 1992-04-01 | Mori | Applicant |
| US5103476(A) | 1992-04-01 | Waite et al. | Applicant |
| US5109413(A) | 1992-04-01 | Comerford et al. | Applicant |
| US5117457(A) | 1992-05-01 | Comerford et al. | Applicant |
| US5193573(A) | 1993-03-01 | Chronister | Applicant |
| US5222134(A) | 1993-06-01 | Waite et al. | Applicant |
| US5224166(A) | 1993-06-01 | Hartman, Jr. | Applicant |
| US5261002(A) | 1993-11-01 | Perlman et al. | Applicant |
| US5319705(A) | 1994-06-01 | Halter et al. | Applicant |
| US5410598(A) | 1995-04-01 | Shear | Applicant |
| US5410698(A) | 1995-04-01 | Danneels et al. | Applicant |
| US5473692(A) | 1995-12-01 | Davis | Applicant |
| US5490216(A) | 1996-02-01 | Richardson, III | Applicant |
| US5506932(A) | 1996-04-01 | Holmes et al. | Applicant |
| US5509070(A) | 1996-04-01 | Schull | Applicant |
| US5629980(A) | 1997-05-01 | Stefik et al. | Applicant |
| US5634012(A) | 1997-05-01 | Stefik et al. | Applicant |
| US5638443(A) | 1997-06-01 | Stefik et al. | Applicant |
| US5673316(A) | 1997-09-01 | Auerbach et al. | Applicant |
| US5691768(A) | 1997-11-01 | Civanlar et al. | Applicant |
| US5710887(A) | 1998-01-01 | Chelliah et al. | Applicant |
| US5715403(A) | 1998-02-01 | Stefik | Applicant |
| US5765152(A) | 1998-06-01 | Erickson | Applicant |
| US5805700(A) | 1998-09-01 | Nardone et al. | Applicant |
| US5809144(A) | 1998-09-01 | Sirbu et al. | Applicant |
| US5845281(A) | 1998-12-01 | Benson et al. | Applicant |
| US5892900(A) | 1999-04-01 | Ginter et al. | Applicant |
| US5917912(A) | 1999-06-01 | Ginter et al. | Applicant |
| US5953420(A) | 1999-09-01 | Matyas, Jr. et al. | Applicant |
| US6073124(A) | 2000-06-01 | Krishnan et al. | Applicant |
| US6078909(A) | 2000-06-01 | Knutson | Applicant |
| US6094487(A) | 2000-07-01 | Butler et al. | Applicant |
| US6094684(A) | 2000-07-01 | Pallman | Applicant |
| US6133912(A) | 2000-10-01 | Montero | Applicant |
| US6134243(A) | 2000-10-01 | Jones et al. | Applicant |
| US6189146(B1) | 2001-02-01 | Misra et al. | Applicant |
| US6205140(B1) | 2001-03-01 | Putzolu et al. | Applicant |
| US6219652(B1) | 2001-04-01 | Carter et al. | Applicant |
| US6226618(B1) | 2001-05-01 | Downs et al. | Applicant |
| US6233567(B1) | 2001-05-01 | Cohen | Applicant |
| US6269368(B1) | 2001-07-01 | Diamond | Applicant |
| US6275531(B1) | 2001-08-01 | Li | Applicant |
| US6278478(B1) | 2001-08-01 | Ferriere | Applicant |
| US6289452(B1) | 2001-09-01 | Arnold et al. | Applicant |
| US6330670(B1) | 2001-12-01 | England et al. | Applicant |
| US6343280(B2) | 2002-01-01 | Clark | Applicant |
| US6456967(B1) | 2002-09-01 | Yeom | Applicant |
| US6476802(B1) | 2002-11-01 | Rose et al. | Applicant |
| US6512778(B1) | 2003-01-01 | Jones et al. | Applicant |
| US6549922(B1) | 2003-04-01 | Srivastava et al. | Applicant |
| US6574609(B1) | 2003-06-01 | Downs et al. | Applicant |
| US6574612(B1) | 2003-06-01 | Baratti et al. | Applicant |
| US6587837(B1) | 2003-07-01 | Spagna et al. | Applicant |
| US6609130(B1) | 2003-08-01 | Saulpaugh et al. | Applicant |
| US6654389(B1) | 2003-11-01 | Brunherolo et al. | Applicant |
| US6681017(B1) | 2004-01-01 | Matias et al. | Applicant |
| US6700895(B1) | 2004-03-01 | Kroll | Applicant |
| US6742176(B1) | 2004-05-01 | Million et al. | Applicant |
| US6754349(B1) | 2004-06-01 | Arthan | Applicant |
| US6757913(B2) | 2004-06-01 | Knox | Applicant |
| US6832319(B1) | 2004-12-01 | Bell et al. | Applicant |
| US6856997(B2) | 2005-02-01 | Lee et al. | Applicant |
| US6885748(B1) | 2005-04-01 | Wang | Applicant |
| US6918034(B1) | 2005-07-01 | Sengodan et al. | Applicant |
| US6934467(B1) | 2005-08-01 | Herz | Applicant |
| US6944296(B1) | 2005-09-01 | Liu et al. | Applicant |
| US6961430(B1) | 2005-11-01 | Gaske et al. | Applicant |
| US6965646(B1) | 2005-11-01 | Firestone | Applicant |
| US6983049(B2) | 2006-01-01 | Wee et al. | Applicant |
| US6993137(B2) | 2006-01-01 | Fransdonk | Applicant |
| US7010032(B1) | 2006-03-01 | Kikuchi et al. | Applicant |
| US7039643(B2) | 2006-05-01 | Sena et al. | Applicant |
| US7065787(B2) | 2006-06-01 | Ganesan et al. | Applicant |
| US7080043(B2) | 2006-07-01 | Chase, Jr. et al. | Applicant |
| US7093277(B2) | 2006-08-01 | Perlman | Examiner |
| US7120250(B2) | 2006-10-01 | Candelore | Applicant |
| US7124303(B2) | 2006-10-01 | Candelore et al. | Applicant |
| US7136577(B1) | 2006-11-01 | Falco | Applicant |
| US7136945(B2) | 2006-11-01 | Gibbs et al. | Applicant |
| US7145919(B2) | 2006-12-01 | Krishnarajah et al. | Applicant |
| US7174452(B2) | 2007-02-01 | Carr | Applicant |
| US7200668(B2) | 2007-04-01 | Mak et al. | Applicant |
| US7203316(B1) | 2007-04-01 | Nolte | Applicant |
| US7209892(B1) | 2007-04-01 | Galuten et al. | Applicant |
| US7231516(B1) | 2007-06-01 | Sparrell et al. | Applicant |
| US7242766(B1) | 2007-07-01 | Lyle | Applicant |
| US7243366(B2) | 2007-07-01 | Medvinsky et al. | Applicant |
| US7257641(B1) | 2007-08-01 | VanBuskirk et al. | Applicant |
| US7325139(B2) | 2008-01-01 | Ishiguro et al. | Applicant |
| US7336791(B2) | 2008-02-01 | Ishiguro | Applicant |
| US7337320(B2) | 2008-02-01 | Tada et al. | Applicant |
| US7346160(B2) | 2008-03-01 | Michaelsen | Applicant |
| US7350238(B2) | 2008-03-01 | Abe et al. | Applicant |
| US7401100(B2) | 2008-07-01 | Jung et al. | Applicant |
| US7434052(B1) | 2008-10-01 | Rump | Applicant |
| US7437771(B2) | 2008-10-01 | Alkove et al. | Applicant |
| US7483532(B2) | 2009-01-01 | Alkove et al. | Applicant |
| US7536418(B2) | 2009-05-01 | Buchsbaum et al. | Applicant |
| US7561696(B2) | 2009-07-01 | Oliveira et al. | Applicant |
| US7574747(B2) | 2009-08-01 | Oliveira et al. | Applicant |
| US7581255(B2) | 2009-08-01 | Alkove et al. | Applicant |
| US7634816(B2) | 2009-12-01 | Alkove et al. | Applicant |
| US7636738(B2) | 2009-12-01 | Shibata et al. | Applicant |
| US7684566(B2) | 2010-03-01 | Oliveira et al. | Applicant |
| US7693280(B2) | 2010-04-01 | Evans et al. | Applicant |
| US7720096(B2) | 2010-05-01 | Klemets | Applicant |
| US7738778(B2) | 2010-06-01 | Agnihotri et al. | Examiner |
| US7769880(B2) | 2010-08-01 | Paka et al. | Applicant |
| US7801847(B2) | 2010-09-01 | Kiilerich et al. | Applicant |
| US7876896(B2) | 2011-01-01 | Alkove et al. | Applicant |
| US7882257(B2) | 2011-02-01 | Kerr et al. | Examiner |
| US2001/0052077(A1) | 2001-12-01 | Fung et al. | Applicant |
| US2001/0052135(A1) | 2001-12-01 | Balakrishnan et al. | Applicant |
| US2001/0056539(A1) | 2001-12-01 | Pavlin et al. | Applicant |
| US2002/0002674(A1) | 2002-01-01 | Grimes et al. | Applicant |
| US2002/0004773(A1) | 2002-01-01 | Xu et al. | Applicant |
| US2002/0013772(A1) | 2002-01-01 | Peinado | Applicant |
| US2002/0082845(A1) | 2002-06-01 | Sato | Applicant |
| US2002/0088136(A1) | 2002-07-01 | Tseng | Applicant |
| US2002/0107806(A1) | 2002-08-01 | Higashi et al. | Applicant |
| US2002/0138619(A1) | 2002-09-01 | Ramaley et al. | Applicant |
| US2002/0152393(A1) | 2002-10-01 | Thoma et al. | Applicant |
| US2002/0157002(A1) | 2002-10-01 | Messerges et al. | Applicant |
| US2002/0164018(A1) | 2002-11-01 | Wee et al. | Applicant |
| US2002/0174135(A1) | 2002-11-01 | Pellegrin et al. | Applicant |
| US2002/0194010(A1) | 2002-12-01 | Bergler et al. | Applicant |
| US2002/0198846(A1) | 2002-12-01 | Lao | Applicant |
| US2003/0001978(A1) | 2003-01-01 | Smith et al. | Applicant |
| US2003/0041257(A1) | 2003-02-01 | Wee et al. | Applicant |
| US2003/0056118(A1) | 2003-03-01 | Troyansky et al. | Applicant |
| US2003/0065918(A1) | 2003-04-01 | Willey | Applicant |
| US2003/0068040(A1) | 2003-04-01 | Wee et al. | Applicant |
| US2003/0070081(A1) | 2003-04-01 | Wee et al. | Applicant |
| US2003/0081592(A1) | 2003-05-01 | Krishnarajah et al. | Applicant |
| US2003/0081776(A1) | 2003-05-01 | Candelore | Applicant |
| US2003/0084306(A1) | 2003-05-01 | Abburi et al. | Applicant |
| US2003/0103243(A1) | 2003-06-01 | Watanabe et al. | Applicant |
| US2003/0126608(A1) | 2003-07-01 | Safadi et al. | Applicant |
| US2003/0131353(A1) | 2003-07-01 | Blom et al. | Applicant |
| US2003/0152223(A1) | 2003-08-01 | Yamada | Applicant |
| US2003/0159140(A1) | 2003-08-01 | Candelore | Applicant |
| US2003/0161473(A1) | 2003-08-01 | Fransdonk | Applicant |
| US2003/0182450(A1) | 2003-09-01 | Ong et al. | Applicant |
| US2003/0185542(A1) | 2003-10-01 | McVeigh et al. | Applicant |
| US2003/0194094(A1) | 2003-10-01 | Lampson et al. | Applicant |
| US2003/0217011(A1) | 2003-11-01 | Peinado et al. | Applicant |
| US2004/0001592(A1) | 2004-01-01 | Akiwumi-Assani et al. | Examiner |
| US2004/0003268(A1) | 2004-01-01 | Bourne et al. | Applicant |
| US2004/0010469(A1) | 2004-01-01 | Lenard et al. | Applicant |
| US2004/0042451(A1) | 2004-03-01 | Takaku | Applicant |
| US2004/0054930(A1) | 2004-03-01 | Walker et al. | Applicant |
| US2004/0064500(A1) | 2004-04-01 | Kolar et al. | Applicant |
| US2004/0078822(A1) | 2004-04-01 | Breen et al. | Applicant |
| US2004/0088557(A1) | 2004-05-01 | Malcolm et al. | Applicant |
| US2004/0098583(A1) | 2004-05-01 | Weber | Applicant |
| US2004/0123094(A1) | 2004-06-01 | Sprunk | Applicant |
| US2004/0125757(A1) | 2004-07-01 | Mela et al. | Applicant |
| US2004/0125791(A1) | 2004-07-01 | Hoffman | Applicant |
| US2004/0139336(A1) | 2004-07-01 | McLean et al. | Applicant |
| US2004/0143736(A1) | 2004-07-01 | Cross et al. | Applicant |
| US2004/0170277(A1) | 2004-09-01 | Iwamura et al. | Examiner |
| US2004/0181490(A1) | 2004-09-01 | Gordon et al. | Applicant |
| US2004/0186854(A1) | 2004-09-01 | Choi | Applicant |
| US2004/0193680(A1) | 2004-09-01 | Gibbs et al. | Applicant |
| US2004/0237750(A1) | 2004-12-01 | Smith et al. | Applicant |
| US2004/0242269(A1) | 2004-12-01 | Fadell | Applicant |
| US2004/0249759(A1) | 2004-12-01 | Higashi et al. | Applicant |
| US2004/0249815(A1) | 2004-12-01 | Lee | Applicant |
| US2004/0260786(A1) | 2004-12-01 | Barile | Applicant |
| US2005/0002402(A1) | 2005-01-01 | Fairman | Applicant |
| US2005/0002525(A1) | 2005-01-01 | Alkove et al. | Applicant |
| US2005/0005760(A1) | 2005-01-01 | Hull et al. | Applicant |
| US2005/0008240(A1) | 2005-01-01 | Bamerji et al. | Applicant |
| US2005/0033967(A1) | 2005-02-01 | Morino et al. | Applicant |
| US2005/0069039(A1) | 2005-03-01 | Crinon | Applicant |
| US2005/0071278(A1) | 2005-03-01 | Simelius | Applicant |
| US2005/0099869(A1) | 2005-05-01 | Crinon et al. | Applicant |
| US2005/0108746(A1) | 2005-05-01 | Futagami et al. | Applicant |
| US2005/0114664(A1) | 2005-05-01 | Davin | Applicant |
| US2005/0144470(A1) | 2005-06-01 | Takashima et al. | Applicant |
| US2005/0157727(A1) | 2005-07-01 | Date et al. | Applicant |
| US2005/0163052(A1) | 2005-07-01 | Savage et al. | Applicant |
| US2005/0163093(A1) | 2005-07-01 | Garg et al. | Applicant |
| US2005/0169303(A1) | 2005-08-01 | Toma et al. | Applicant |
| US2005/0169444(A1) | 2005-08-01 | Inon | Applicant |
| US2005/0177875(A1) | 2005-08-01 | Kamperman et al. | Applicant |
| US2005/0187879(A1) | 2005-08-01 | Zigmond et al. | Applicant |
| US2005/0216413(A1) | 2005-09-01 | Murakami | Applicant |
| US2005/0246451(A1) | 2005-11-01 | Silverman et al. | Applicant |
| US2005/0254526(A1) | 2005-11-01 | Wang et al. | Applicant |
| US2005/0265555(A1) | 2005-12-01 | Pippuri | Applicant |
| US2005/0286497(A1) | 2005-12-01 | Zataut et al. | Applicant |
| US2005/0289617(A1) | 2005-12-01 | Safadi et al. | Applicant |
| US2006/0007479(A1) | 2006-01-01 | Henry et al. | Applicant |
| US2006/0020636(A1) | 2006-01-01 | Murotani | Applicant |
| US2006/0031889(A1) | 2006-02-01 | Bennett et al. | Applicant |
| US2006/0069803(A1) | 2006-03-01 | Clark et al. | Applicant |
| US2006/0104356(A1) | 2006-05-01 | Crinon | Applicant |
| US2006/0123064(A1) | 2006-06-01 | Kim et al. | Applicant |
| US2006/0130104(A1) | 2006-06-01 | Budagavi | Applicant |
| US2006/0161635(A1) | 2006-07-01 | Lamkin et al. | Applicant |
| US2006/0167985(A1) | 2006-07-01 | Albanese et al. | Applicant |
| US2006/0184573(A1) | 2006-08-01 | Koori | Applicant |
| US2006/0184790(A1) | 2006-08-01 | Oliveira et al. | Applicant |
| US2006/0190408(A1) | 2006-08-01 | Cook et al. | Applicant |
| US2006/0227965(A1) | 2006-10-01 | Zhu et al. | Applicant |
| US2006/0242078(A1) | 2006-10-01 | Evans et al. | Applicant |
| US2006/0242079(A1) | 2006-10-01 | Evans et al. | Applicant |
| US2006/0242080(A1) | 2006-10-01 | Van Dyke et al. | Applicant |
| US2006/0262732(A1) | 2006-11-01 | Joutsenvirta et al. | Applicant |
| US2006/0268099(A1) | 2006-11-01 | Potrebic et al. | Applicant |
| US2006/0291475(A1) | 2006-12-01 | Cohen | Applicant |
| US2007/0003064(A1) | 2007-01-01 | Wiseman et al. | Applicant |
| US2007/0016594(A1) | 2007-01-01 | Visharam et al. | Applicant |
| US2007/0016784(A1) | 2007-01-01 | Vauclair | Applicant |
| US2007/0067242(A1) | 2007-03-01 | Lotspiech et al. | Applicant |
| US2007/0073747(A1) | 2007-03-01 | Jung et al. | Applicant |
| US2007/0078898(A1) | 2007-04-01 | Hayashi et al. | Applicant |
| US2007/0088727(A1) | 2007-04-01 | Kindig | Applicant |
| US2007/0104105(A1) | 2007-05-01 | MeLampy et al. | Applicant |
| US2007/0106814(A1) | 2007-05-01 | Son et al. | Applicant |
| US2007/0143346(A1) | 2007-06-01 | Matsutani | Applicant |
| US2007/0171903(A1) | 2007-07-01 | Zeng et al. | Applicant |
| US2007/0185909(A1) | 2007-08-01 | Kelin et al. | Applicant |
| US2007/0220024(A1) | 2007-09-01 | Putterman et al. | Applicant |
| US2007/0220048(A1) | 2007-09-01 | Ott | Applicant |
| US2007/0248073(A1) | 2007-10-01 | Pattavina et al. | Applicant |
| US2007/0260615(A1) | 2007-11-01 | Shen | Applicant |
| US2007/0274393(A1) | 2007-11-01 | Toma et al. | Applicant |
| US2008/0046466(A1) | 2008-02-01 | Yun | Applicant |
| US2008/0052751(A1) | 2008-02-01 | Cromarty et al. | Applicant |
| US2008/0075168(A1) | 2008-03-01 | Toma et al. | Applicant |
| US2008/0126812(A1) | 2008-05-01 | Ahmed et al. | Applicant |
| US2008/0187284(A1) | 2008-08-01 | Ikeda et al. | Applicant |
| US2008/0216116(A1) | 2008-09-01 | Pekonen et al. | Applicant |
| US2009/0070438(A1) | 2009-03-01 | Bartholomew | Applicant |
| US2009/0202079(A1) | 2009-08-01 | Puputti et al. | Applicant |
| US2009/0216776(A1) | 2009-08-01 | Carol et al. | Applicant |
| US2010/0138647(A1) | 2010-06-01 | Oliveira et al. | Applicant |
| CN1498479(A) | 2004-05-01 | Applicant | |
| CN1643474(A) | 2005-07-01 | Applicant | |
| EP715246 | 1996-06-01 | Applicant | |
| EP715247 | 1996-06-01 | Applicant | |
| EP1041823(A2) | 2000-10-01 | Applicant | |
| EP1271830(A2) | 2003-01-01 | Applicant | |
| EP1298518(A2) | 2003-04-01 | Applicant | |
| EP1175750 | 2003-10-01 | Applicant | |
| EP1494425 | 2005-01-01 | Applicant | |
| JPH-11-219329 | 1999-08-01 | Applicant | |
| JP2000-134193 | 2000-05-01 | Applicant | |
| JP2000-287192 | 2000-10-01 | Applicant | |
| JP2001-075871 | 2001-03-01 | Applicant | |
| JP2002-044135 | 2002-02-01 | Applicant | |
| JP2002-175084 | 2002-06-01 | Applicant | |
| JP2002-342518 | 2002-11-01 | Applicant | |
| JP2003-124927 | 2003-04-01 | Applicant | |
| JP2003-152544 | 2003-05-01 | Applicant | |
| JP2003-224556 | 2003-08-01 | Applicant | |
| JP2003-319322 | 2003-11-01 | Applicant | |
| JP2004-046833 | 2004-02-01 | Applicant | |
| JP2004-158936 | 2004-06-01 | Applicant | |
| JP2004-282731 | 2004-10-01 | Applicant | |
| JP2004-287937 | 2004-10-01 | Applicant | |
| JP2004-328706 | 2004-11-01 | Applicant | |
| JP2004-537191 | 2004-12-01 | Applicant | |
| JP2005-109861 | 2005-04-01 | Applicant | |
| JP2005-513664 | 2005-05-01 | Applicant | |
| KR2001-51534 | 2001-06-01 | Applicant | |
| KR1020030011837(A) | 2003-02-01 | Applicant | |
| KR2003-19398 | 2003-03-01 | Applicant | |
| KR2003-27066 | 2003-04-01 | Applicant | |
| RU2144736 | 2000-01-01 | Applicant | |
| RU2159507 | 2000-11-01 | Applicant | |
| RU2163745 | 2001-02-01 | Applicant | |
| RU2201036 | 2003-03-01 | Applicant | |
| RU2003133468 | 2005-05-01 | Applicant | |
| TW536893 | 2003-06-01 | Applicant | |
| TW200301635 | 2003-07-01 | Applicant | |
| WO93/01550 | 1993-01-01 | Applicant | |
| WO96/13013 | 1996-05-01 | Applicant | |
| WO96/24092 | 1996-08-01 | Applicant | |
| WO96/27155 | 1996-09-01 | Applicant | |
| WO97/25798 | 1997-07-01 | Applicant | |
| WO97/43761 | 1997-11-01 | Applicant | |
| WO98/09209 | 1998-03-01 | Applicant | |
| WO98/10381 | 1998-03-01 | Applicant | |
| WO98/21679 | 1998-05-01 | Applicant | |
| WO98/24037 | 1998-06-01 | Applicant | |
| WO98/37481 | 1998-08-01 | Applicant | |
| WO/11849 | 2000-03-01 | Applicant | |
| WO/15221 | 2000-03-01 | Applicant | |
| WO/58811 | 2000-10-01 | Applicant | |
| WO/59150 | 2000-10-01 | Applicant | |
| WO1/16900 | 2001-03-01 | Applicant | |
| WO1/52021(A1) | 2001-07-01 | Applicant | |
| WO2/51096(A1) | 2002-06-01 | Applicant | |
| WO3/028293(A1) | 2003-04-01 | Applicant | |
| WO2004/006559 | 2004-01-01 | Applicant | |
| WO2004/014037 | 2004-02-01 | Applicant | |
| WO2004/023717 | 2004-03-01 | Applicant | |
| WO2004/030311 | 2004-04-01 | Applicant | |
| WO2004/030364 | 2004-04-01 | Applicant | |
| WO2004/097605 | 2004-11-01 | Applicant | |
| WO2005/027404 | 2005-01-01 | Applicant |
Non-Patent Literature (289)
- “Aladdin Knowledge Systems Partners with Rights Exchange, Inc. to Develop a Comprehensive Solution for Electronic Software Distribution”, Aug. 3, 1988, 5 pages.Applicant
- “Functional Model of a Conditional Access System”; EBU Review—Technical, European Broadcasting Union. Brussels, BE, No. 266; Dec. 21, 1995, 14 pgs.Applicant
- “Rights Management in the Digital Age: Trading Bits, Not Atoms”, Spring 1997, 4, 3 pgs.Applicant
- “RTP Profile for Audio and Video Conferences with Minimal Control”, RFC 1890, available at [[http://faqs.org/rfcs/ rfc1890.html]l. accessed Jan. 7, 2004, 14 pages. (Schulzrinne et al.).Applicant
- Aladdin acquires the assets of Micro Macro Technologies, Business Wire, 1999 http://www.findarticies.com.Applicant
- Armati, D., “Tools and standards for protection, control and presentation of data,” Apr. 3, 1996, 17 pages.Applicant
- Australian First Office Action in Application 2004202538, mailed Oct. 29, 2008, 2 pgs.Applicant
- Australian Notice of Acceptance in Application 2006240480, mailed Oct. 20, 2010, 2 pgs.Applicant
- Australian Notice of Allowance in Application 2004202538, mailed Nov. 24, 2009, 3 pgs.Applicant
- Australian Notice of Allowance in Application 2005201577, mailed May 3, 2010, 3 pgs.Applicant
- Australian Office Action in Application 2005201577, mailed Dec. 23, 2009, 2 pgs.Applicant
- Australian Office Action in Application 2006240480, mailed Aug. 9, 2010, 2 pgs.Applicant
- Australian Office Action in Application 2006240484, mailed Nov. 24, 2009, 2 pgs.Applicant
- Australian Second Office Action in Application 2004202538, mailed Jul. 17, 2009, 2 pgs.Applicant
- Benjamin, R. et al., “Electronic markets and virtual value chains on the information superhighway,” Sloan Management Rev.. Winter, 1995, 62-72.Applicant
- Canadian Office Action in Application 2469830, mailed Dec. 9, 2011, 2 pgs.Applicant
- Cassidy, “A Web developers guide to content encapsulation technology,” Apr. 1997, 5 pages.Applicant
- Chilean Second Office Action in Application 15492004, mailed Jun. 18, 2008, 5 pgs.Applicant
- Chilean Third Office Action in Application 15492004, mailed Jun. 18, 2009, 6 pgs.Applicant
- Chinese First Office Action for Chinese Patent Application No. 200680029303X mailed on Apr. 24, 2009, 10 pgs.Applicant
- Chinese First Office Action in Application 200410063309.1, mailed Oct. 10, 2008, 11 pgs.Applicant
- Chinese First Office Action in Application 200510067295, mailed Jul. 31, 2009, 9 pgs.Applicant
- Chinese First Office Action in Application 200510071607X, mailed Oct. 24, 2008, 11 pgs.Applicant
- Chinese First Office Action in Application 2006800244438, mailed Oct. 12, 2010, 7 pgs.Applicant
- Chinese First Office Action in Application 2006800252913, mailed Mar. 8, 2010, 13 pgs.Applicant
- Chinese First Office Action in Application 200680029348.7, mailed Aug. 7, 2009, 14 pgs.Applicant
- Chinese Notice of Allowance in Application 2006800252913, mailed Mar. 17, 2011, 4 pgs.Applicant
- Chinese Notice of Allowance in Application 200410063309.1, mailed Dec. 3, 2010, 4 pgs.Applicant
- Chinese Notice of Allowance in Application 200510067295, mailed Feb. 5, 2010, 4 pgs.Applicant
- Chinese Notice of Allowance in Application 200680013363.2, mailed Aug. 2, 2011, 4 pgs.Applicant
- Chinese Notice of Allowance in Application 200680029303X, mailed Feb. 5, 2010, 4 pgs.Applicant
- Chinese Notice of Allowance in Application 200680029348.7, mailed Oct. 13, 2010, 4 pgs.Applicant
- Chinese Office Action in application 200680012903.5, mailed Jun. 24, 2011, 6 pgs.Applicant
- Chinese Office Action in Application 200680013363.2, mailed Sep. 14, 2010, 11 pgs.Applicant
- Chinese Second Office Action in Application 200410063309.1, mailed Apr. 28, 2010, 6 pgs.Applicant
- Chinese Second Office Action in Application 200510071607X, mailed May 22, 2009, 6 pgs.Applicant
- Chinese Second Office Action in Application 2006800244438, mailed Jan. 5, 2012, 6 pgs.Applicant
- Chinese Second Office Action in Application 2006800252913, mailed Nov. 5, 2010, 9 pgs.Applicant
- Chinese Second Office Action in Application 200680029303X, mailed Sep. 25, 2009, 8 pgs.Applicant
- Chinese Second Office Action in Application 200680029348.7, mailed May 11, 2010, 11 pgs.Applicant
- Comino, N. et al., “A Novel Data Distribution Technique for HostClient Type Parallell Applications”, IEEE Transactions on Parallel and Distributed Systems, 2002, 13(2), 97-110.Applicant
- Cox, B., “Superdistribution,” Idees Fortes. Sep. 1994, 2 pages.Applicant
- Cox, B., “What if There Is a Silver Bullet,” J Object Oriented Programm ., Jun. 1992, 8-9 and 76.Applicant
- Curet et al., “RTP Payload Format for MPEG-4 FexMultiplexed Streams”, Internet Engineering Task Force, Internet Draft, XP-001 075015, 1118/2001, 12 pages.Applicant
- European Extended Search Report, Mailed Jul. 19, 2010; Application No. 06801132.9, Filed Date: Aug. 10, 2006; 9 Pages.Applicant
- European Office Action in EP Application 04102589.1, mailed Aug. 9, 2010, 9 pgs.Applicant
- European Search Report in EP Application 04102589.1, mailed Nov. 8, 2004, 4 pgs.Applicant
- Evans, P. “DRM: Is the Road to Adoption Fraught with Potholes?” Seybold Reporting Analyzing Publishing Technologies, 2001, 1(14), 32.Applicant
- Fowler, T.B. “Technology's Changing Role in Intellectual Property Rights”, IT Professional (IEEE), 2002, 4(2), 39-44.Applicant
- From http://www.findarticles.com. “BreakerTech joins copyright management market,” Computer International, 1999.Applicant
- From PR Newswire, “Sony develops copyright protection solutions for digital music content,” 1999, http://www.findarticles.com.Applicant
- Gable, J. “The Digital Rights Conundrum”,Transform Magazine, 2001, 10(11), 27.Applicant
- Griswold, G.N. “A Method for Protecting Copyright on Networks”, IMA Intellectual Property Project Proceedings, 1994, 1(1), 169-178.Applicant
- Gunter, C.A., et al. “Models and Languages for Digital Rights”, Proceedings of the 34th Annual Hawaii International Conference on System Sciences, 2001, 1-5.Applicant
- Handley et al., “SDP: Session Description Protocol,” The Internet Society, 1998, pp. 1-42.Applicant
- Hauser, R.C., “Does licensing require new access control techniques?” Aug. 1993, 9 pages.Applicant
- Hoffman et al., “RTP Payload Format for MPEG1/MPEG2 Video”, Network Working Group, RFC 2250, Jan. 1998, pp. 1-16.Applicant
- Hong, S. et al., “On the construction of a powerful distributed authentication server without additional key management”, Computer Communications, 2000, 23, 1638-1644.Applicant
- Hudgins-Bonafield, C. “Selling Knowledge on the Net,” Network Computing. Jun. 1, 1995, 102-109.Applicant
- Hwang, C. et al., “Protection of Digital Contents on Distributed Multimedia Environment”, Proceedings of the IASTED International Conference, Internet and Multimedia Systems and Applications, Nov. 19-23, 2000, Las Vegas, Nevada, USA, pp. 127-132.Applicant
- IBM spearheading intellectual property protection technology for information on the Internet, May 1996, 3 pages.Applicant
- Indonesian Notice of Allowance in Application P00200400282, mailed Nov. 2, 2009, 4 pgs.Applicant
- Indonesian Office Action in Application P00200400282, mailed Apr. 29, 2009, 4 pgs.Applicant
- Israel Office Action in Application 162304, mailed Oct. 19, 2009, 4 pgs.Applicant
- Jakobsson, M. et al., “Proprietary Certificates”, Topics in Cryptology, 2002, 164-181.Applicant
- Japanese Notice of Allowance in Application 2005120933, mailed Jul. 26, 2011, 6 pgs.Applicant
- Japanese Notice of Allowance in Application 2008521533, mailed Oct. 14, 2011, 6 pgs.Applicant
- Japanese Notice of Allowance in JP Application 2004198165, mailed Apr. 20, 2010, 6 pgs.Applicant
- Japanese Notice of Rejection in Application 2005120933, mailed Mar. 15, 2011, 7 pgs.Applicant
- Japanese Notice of Rejection in Application 2008-520256, mailed Sep. 9, 2011, 4 pgs.Applicant
- Japanese Notice of Rejection in Application 2008521533, mailed May 20, 2011, 4 pgs.Applicant
- Japanese Notice of Rejection in JP Application 2004198165, mailed Jan. 5, 2010, 8 pgs.Applicant
- Kahn, R.E. “Deposit, Registration and Recordation in an Electronic Copyright Management System”, IMA Intellectual Property Project Proceedings, 1994, 1(1), 111-120.Applicant
- Kaplan, M.A., “IBM Cryptolopes, Super-Distribution and Digital Rights Management”, Dec. 1996, 7 pages.Applicant
- Kay, Russell, Memory Leaks and Garbage Collection, Aug. 7, 2000, Computerworld, vol. 34, Issue 32.Applicant
- Kent, S.T., “Protecting externally supplied software in small computers,” Sep. 1980, 1-42 and 250-252.Applicant
- Kim et al, “Design and Implementation of MPEG-2/DVB Scrambler Unit,” International Conference on Consumer Electronics, vol. 43, No. 3, 1997, pp. 320-321.Applicant
- Kim et al., “Protection Scheme for Secure MPEG-2 Streaming”, 2004 IEEE International Conference on MultiMedia and Expo (ICME), vol. 2, Jun. 27-30, 2004, pp. 927-930.Applicant
- Klemets, “RTP Payload Format for Video Codec 1 (VC-1),” Microsoft, Feb. 2006, pp. 1-36.Applicant
- Kohl, U. et al., “Safeguarding Digital Library Contents and Users; Protecting Documents Rather Than Channels,” D-Lib Magazine. Sep. 1997, 9 pages.Applicant
- Kumik, P. “Digital Rights Management”, Computers and Law, 2000,11 (4), 14-15.Applicant
- Landfeldt, “A Method and System for Consolidating Multimedia Object Management in Heterogenous Media Systems”, NSW 2006, Univ. of Sydney, 5 pgs, http://www.cs.usyd.edu.au/˜bjornl/research/papers/Sympotic04.pdf.Applicant
- Licenslt: kinder, gentler copyright? Copyright management system links content, authorship information, Seybold Report on Desktop Publishing. 1996, 10(11), 2 pages.Applicant
- Linn, R.J., “Copyright and Information Services in the Context of the National Research and Education Network,” IMA Intel!. Property Project Proceedings. Jan. 1994, 1(1), 1 and 10-20.Applicant
- Malaysian First Office Action in Application PI20042167, mailed Nov. 13, 2007, 3 pgs.Applicant
- Malaysian Notice of Allowance in Application PI20042167, mailed Oct. 31, 2011, 2 pgs.Applicant
- Malaysian Official Notice of Rejection for Malaysian Patent Application No. PI 20042167 Mailed on Dec. 26, 2007, 5 Pages.Applicant
- Malaysian Second Office Action in Application PI20042167, mailed Oct. 30, 2009, 2 pgs.Applicant
- Malaysian Third Office Action in Application PI20042167, mailed May 31, 2010, 2 pgs.Applicant
- Managing Digital Rights in Online Publishing, “How two publishing houses maintain control of copyright” Information Management &Technology, 2001, 34(4), 168-169.Applicant
- McNab, L., “Super-Distribution works better in practical applications”, Mar. 2, 1998, 2 pgs.Applicant
- Media Distribution Technique, NIT R&D, vol. 52, No. 1, Jan. 10, 2003, 12 pages.Applicant
- Mehaoua et al, “RTP4mux: A Novel MPEG-4 RTP Payload for Multicast Video Communications over Wireless IP”, Retrieved from the Internet Mar. 22, 2005: URL: http//www.polytech.uiv-nantes.PDF., 10 pgs.Applicant
- Moeller, M., “IBM takes charge of E-commerce; Plans client, server apps based on SET,” Apr. 1996, 4 pages.Applicant
- Moeller, M., “NetTrust lets cyberspace merchants take account”, PC Week, Nov. 20, 1995, 12(48), 1 page.Applicant
- MusicMatch, MusicMatch Jukebox Use's Guide, Feb. 7, 2003. Chapters Al-A6 and 1-9.Applicant
- Nafaa, Abdelhamid et al., “RTP4MUX: A Novel MPEG-4 RTP Payload for Multicast Video Communications over Wireless IP”,1 IEEE-PV 2003,Apr. 28, 2003, 13th International Packet Video Workshop, Apr. 28, 2003, availabe at: http://www.prism.uvsq.fr/{anaf/ Dnafaa—iscc03.pdf, 10 pages.Applicant
- New Zealand Advisory Action in Application 543135, mailed Jan. 8, 2007, 2 pgs.Applicant
- New Zealand Examination Report in Application 543135, mailed Oct. 27, 2005, 2 pgs.Applicant
- Olson, M., et al., “Concurrent access licensing,” UNIXReview. 1988, 6(9), 67-72 (from Dialog Accession No. 01254918).Applicant
- Park et al., “Contents Distribution System Based on MPEG-4 ISMA Cryp in IP Set-top Box Environments”, IEEE Transactions on Consumer Electronics, vol. 52, Issue 2, May 2006, pp. 660-668.Applicant
- Parkin, Ric, Garbage Collection and Object Lifetime, Oct. 2004, Overload, Issue 63.Applicant
- PCT International Search Report and Written Opinion for Application PCT/US2006/031185 mailed on Jan. 16, 2007, pp. 1-12, which is a counterpart of the above-captioned application.Applicant
- PCT International Search Report and Written Opinion in application PCT/US06/09650, mailed May 21, 2008, 12 pgs.Applicant
- PCT International Search Report and Written Opinion in Application PCT/US06/24293, mailed Jun. 17, 2008, 8 pgs.Applicant
- PCT International Search Report and Written Opinion in Application PCT/US06/26913, mailed Sep. 18, 2007, 5 pgs.Applicant
- PCT International Search Report and Written Opinion in Application PCT/US2006/031557, mailed Jan. 9, 2007, 7 pgs.Applicant
- PCT International Search Report and Written Opinion in Application PCT/US2006/09900, mailed Jan. 22, 2008, 9 pgs.Applicant
- PCT International Search Report and Written Opinion in Application PCT/US2006/09906, mailed Nov. 20, 2007, 8 pgs.Applicant
- Peinado, M. “Digital rights management in a multimedia environment”, SMPTE Journal, 2002, 111(3), 159-163.Applicant
- Pemberton, J., “An Online Interview with Jeff Crigler at IBM InfoMarket,” Jul. 1996, 6 pages.Applicant
- Proposed SMPTE Standard for Television: VC-1 Compressed Video Bitstream “Format and Decoding Process,” The Society of Motion Picture and Television Engineers, Aug. 23, 2005, pp. 1-480 (125 pgs).Applicant
- Rarnanujapuram, A. et al., “Digital Content & Intellectual Property Rights: A specification language and tools for rights management,” Dec. 1998, 20-23 and 26.Applicant
- Royan, B. Content creation and rights management; experiences of SCRAN (the Scottish Cultural Resources Access Network), Program, 34(2), 131-142.Applicant
- RTP Payload Format for MPEG-4 Streams, internet Engineering Task Force, Internet Draft, XP-001033580, Jul. 2001, 41 pages.Applicant
- Russian Decision on Grant for Russian Patent Application No. 2004120267 mailed on Apr. 15, 2009, 17 pgs.Applicant
- Russian First Office Action in Application 2004120267, mailed Oct. 28, 2008, 18 pgs.Applicant
- Russian Notice of Allowance in Application 2004120267, mailed Apr. 20, 2009, 17 pgs.Applicant
- Russian Notice of Allowance in Application 2005111507, mailed May 27, 2009, 8 pgs.Applicant
- Russian Notice of Allowance in Application 2008101456, mailed Oct. 6, 2010, 6 pgs.Applicant
- Russian Notice of Allowance in Application 2008104858, mailed Feb. 3, 2011, 5 pgs.Applicant
- Russian Office Action in Application 2005111507, mailed Mar. 19, 2009, 1 pg.Applicant
- Sastry et al., “Webtour: A System to Record and Playback Dynamic Multimedia Annotations on Web Document Content,” 1999, pp. 175-178, http://delivery.acm.org/10.1145/320000/319925/p175sastry.pdf?key1=319925&key2=9561680411&coll=GUIDE&dl=GUIDE&CFID=69725778&CFTOKEN=94959612.Applicant
- Schneier, Bruce, “Applied Cryptography, Protocols, Algorithms and Source Code in C”, 2nd edition, 1996 ISBN: 0471128457), p. 180.Applicant
- Schulzrinne et al., “RTP: A Transport Protocol for Real-Time Applications,” Jan. 1996, IETF.org, pp. 1-75.Applicant
- Senoh et al., “DRM Renewability & Interoperability”, Consumer Communications and Networking Conference, 2004, CCNC 2204, First IEEE Jan. 5-8, 2004, pp. 424-429.Applicant
- Sibert, O. et al., “Securing the Content, Not the Wire, for Information Commerce,” Jul. 1995, 1-11.Applicant
- Sibert, O. et al., “The DigiBox: A Self-protecting Container for Information Commerce,” First USENIX Workshop on Electronic Commerce. Jul. 11-12, 1995, 171-183.Applicant
- Singapore Written Opinion in Application 200706495-9, mailed Dec. 31, 2008, 11 pgs.Applicant
- SMPTE Standard for Television, Audio and Film—Time and Control Code, The Society of Motion Picture and D Television Engineers, Sep. 12, 1995, 19 pgs.Applicant
- Stefik, M., “Shifting the Possible: How Trusted Systems and Digital Property Rights Challenge Us to Rethink Digital Publishing,” Technical Perspective. 1997, 137-159.Applicant
- Stefik, M., “Trusted Systems,” Mar. 1997, 8 pages.Applicant
- Taiwan Notice of Allowance in Application 93115873, Apr. 19, 2011, 4 pgs.Applicant
- Taiwan Search Report from First Office Action in Application 93115873, mailed Nov. 30, 2010, 1 pg.Applicant
- Technological Solutions Rise to Complement Law's Small Stick Guarding Electronic Works, Information Law Alert. Jun. 16, 1995, 3-4 and 7.Applicant
- Thompson, C. W. et al., “Digital Licensing”, IEEE Internet Computing, 2005, 9(4).Applicant
- Thorsberg, Frank et al., New Shackles on your CD, video copying, Jan. 2002, PC World, vol. 20, Iss 1: p. 20, 2 pages.Applicant
- Torrubia, A. et al., “Cryptography regulations for E-commerce and digital rights management”, Computers & Security, 2001, 20(8), 724-738.Applicant
- Unknown, “Black box crypton defies the hackers,” Electronic Weekly, 1985, 1257, p. 26 (from DialogClassic Web™ file 27 5, Accession No. 01116377).Applicant
- Unknown, “Solution for piracy,” Which Computer, 1983, p. 29 (from DialogClassic Web™ file 275, Accession No. 01014280).Applicant
- Unknown, Finland-Data fellows secures ICSA certification, Newsbytes, 1998, (from DialogClassic Web(TM), File 9, Accession No. 01451058, 2 pages).Applicant
- Unknown, Optimising license checkouts from a floating license server, ARM the Architecture for the Digital World. http://www.arm.com/supportlfaqdev/1391.html.Applicant
- U.S. Appl. No. 10/612,851, Advisory Action mailed Aug. 15, 2008, 3 pgs.Applicant
- U.S. Appl. No. 10/612,851, Amendment and Response filed Feb. 14, 2008, 28 pgs.Applicant
- U.S. Appl. No. 10/612,851, Amendment and Response filed Aug. 7, 2008, 30 pgs.Applicant
- U.S. Appl. No. 10/612,851, Amendment and Response filed Sep. 8, 2008, 31 pgs.Applicant
- U.S. Appl. No. 10/612,851, Notice of Allowance mailed Oct. 2, 2008, 5 pgs.Applicant
- U.S. Appl. No. 10/612,851, Office Action mailed Apr. 7, 2008, 12 pgs.Applicant
- U.S. Appl. No. 10/612,851, Office Action mailed Sep. 14, 2007, 10 pgs.Applicant
- U.S. Appl. No. 10/811,030, Advisory Action mailed May 19, 2008, 3 pgs.Applicant
- U.S. Appl. No. 10/811,030, Amendment and Response filed Dec. 13, 2007, 22 pgs.Applicant
- U.S. Appl. No. 10/811,030, Amendment and Response filed Dec. 18, 2008, 22 pgs.Applicant
- U.S. Appl. No. 10/811,030, Amendment and Response filed May 9, 2008, 22 pgs.Applicant
- U.S. Appl. No. 10/811,030, Office Action mailed Jan. 9, 2008, 11 pgs.Applicant
- U.S. Appl. No. 10/811,030, Office Action mailed Feb. 9, 2009, 12 pgs.Applicant
- U.S. Appl. No. 10/811,030, Office Action mailed Sep. 11, 2007, 17 pgs.Applicant
- U.S. Appl. No. 10/811,030, Office Action mailed Sep. 18, 2008, 10 pgs.Applicant
- U.S. Appl. No. 10/827,167, Advisory Action mailed Jan. 31, 2008, 3 pgs.Applicant
- U.S. Appl. No. 10/827,167, Amendment and Response filed Jan. 17, 2008, 13 pgs.Applicant
- U.S. Appl. No. 10/827,167, Amendment and Response filed Oct. 2, 2007, 12 pgs.Applicant
- U.S. Appl. No. 10/827,167, Notice of Allowance mailed Aug. 8, 2008, 9 pgs.Applicant
- U.S. Appl. No. 10/827,167, Office Action mailed Dec. 11, 2007, 22 pgs.Applicant
- U.S. Appl. No. 10/827,167, Office Action mailed Jul. 2, 2007, 21 pgs.Applicant
- U.S. Appl. No. 11/112,325, Amendment and Response filed Jul. 6, 2009, 14 pgs.Applicant
- U.S. Appl. No. 11/112,325, Notice of Allowance mailed Nov. 16, 2009, 6 pgs.Applicant
- U.S. Appl. No. 11/112,325, Office Action mailed Apr. 14, 2009, 17 pgs.Applicant
- U.S. Appl. No. 11/113,160, Amendment and Response filed Nov. 3, 2010, 12 pgs.Applicant
- U.S. Appl. No. 11/113,160, Amendment and Response filed Dec. 17, 2009, 8 pgs.Applicant
- U.S. Appl. No. 11/113,160, Amendment and Response filed Jun. 1, 2009, 12 pgs.Applicant
- U.S. Appl. No. 11/113,160, Amendment and Response filed Jun. 9, 2010, 9 pgs.Applicant
- U.S. Appl. No. 11/113,160, Amendment and Response filed Aug. 11, 2008, 10 pgs.Applicant
- U.S. Appl. No. 11/113,160, Office Action mailed Dec. 1, 2008, 11 pgs.Applicant
- U.S. Appl. No. 11/113,160, Office Action mailed Mar. 26, 2010, 10 pgs.Applicant
- U.S. Appl. No. 11/113,160, Office Action mailed Apr. 29, 2008, 10 pgs.Applicant
- U.S. Appl. No. 11/113,160, Office Action mailed Sep. 1, 2010, 13 pgs.Applicant
- U.S. Appl. No. 11/113,160, Office Action mailed Sep. 17, 2009, 8 pgs.Applicant
- U.S. Appl. No. 11/113,215, Advisory Action mailed Oct. 3, 2006, 4 pgs.Applicant
- U.S. Appl. No. 11/113,215, Advisory Action mailed Feb. 2, 2009, 2 pgs.Applicant
- U.S. Appl. No. 11/113,215, Amendment and Response filed Jan. 7, 2009, 11 pgs.Applicant
- U.S. Appl. No. 11/113,215, Amendment and Response filed Oct. 29, 2007, 14 pgs.Applicant
- U.S. Appl. No. 11/113,215, Amendment and Response filed Apr. 11, 2006, 16 pgs.Applicant
- U.S. Appl. No. 11/113,215, Amendment and Response filed Apr. 25, 2008, 12 pgs.Applicant
- U.S. Appl. No. 11/113,215, Amendment and Response filed Apr. 7, 2009, 11 pgs.Applicant
- U.S. Appl. No. 11/113,215, Amendment and Response filed May 29, 2007, 13 pgs.Applicant
- U.S. Appl. No. 11/113,215, Amendment and Response filed Sep. 14, 2006, 13 pgs.Applicant
- U.S. Appl. No. 11/113,215, Office Action mailed Jan. 28, 2008, 7 pgs.Applicant
- U.S. Appl. No. 11/113,215, Office Action mailed Oct. 7, 2008, 11 pgs.Applicant
- U.S. Appl. No. 11/113,215, Office Action mailed Feb. 27, 2006, 5 pgs.Applicant
- U.S. Appl. No. 11/113,215, Office Action mailed Feb. 28, 2007, 9 pgs.Applicant
- U.S. Appl. No. 11/113,215, Office Action mailed Jun. 17, 2009, 11 pgs.Applicant
- U.S. Appl. No. 11/113,215, Office Action mailed Jul. 28, 2006, 6 pgs.Applicant
- U.S. Appl. No. 11/113,215, Office Action mailed Aug. 15, 2007, 9 pgs.Applicant
- U.S. Appl. No. 11/113,216, Amendment and Response filed Dec. 23, 2009, 13 pgs.Applicant
- U.S. Appl. No. 11/113,216, Amendment and Response filed Dec. 5, 2011, 9 pgs.Applicant
- U.S. Appl. No. 11/113,216, Amendment and Response filed Apr. 28, 2009, 15 pgs.Applicant
- U.S. Appl. No. 11/113,216, Amendment and Response filed Apr. 8, 2011, 13 pgs.Applicant
- U.S. Appl. No. 11/113,216, Office Action mailed Jan. 28, 2009, 10 pgs.Applicant
- U.S. Appl. No. 11/113,216, Office Action mailed Dec. 30, 2010, 13 pgs.Applicant
- U.S. Appl. No. 11/113,216, Office Action mailed Feb. 17, 2012, 14 pgs.Applicant
- U.S. Appl. No. 11/113,216, Office Action mailed Sep. 1, 2009, 12 pgs.Applicant
- U.S. Appl. No. 11/113,216, Office Action mailed Sep. 7, 2011, 13 pgs.Applicant
- U.S. Appl. No. 11/139,951, Advisory Action mailed Apr. 22, 2008, 3 pgs.Applicant
- U.S. Appl. No. 11/139,951, Amendment and Response filed Oct. 25, 2007, 13 pgs.Applicant
- U.S. Appl. No. 11/139,951, Amendment and Response filed Dec. 17, 2008, 11 pgs.Applicant
- U.S. Appl. No. 11/139,951, Amendment and Response filed Apr. 8, 2008, 11 pgs.Applicant
- U.S. Appl. No. 11/139,951, Amendment and Response filed May 12, 2009, 7 pgs.Applicant
- U.S. Appl. No. 11/139,951, Notice of Allowance mailed Apr. 3, 2009, 5 pgs.Applicant
- U.S. Appl. No. 11/139,951, Office Action mailed Jan. 9, 2008, 14 pgs.Applicant
- U.S. Appl. No. 11/139,951, Office Action mailed Jul. 27, 2007, 13 pgs.Applicant
- U.S. Appl. No. 11/139,951, Office Action mailed Sep. 18, 2008, 10 pgs.Applicant
- U.S. Appl. No. 11/139,956, Amendment and Response filed Jan. 12, 2010, 5 pgs.Applicant
- U.S. Appl. No. 11/139,956, Notice of Allowance mailed Oct. 13, 2009, 8 pgs.Applicant
- U.S. Appl. No. 11/139,956, USPTO Response mailed Feb. 25, 2010, 2 pgs.Applicant
- U.S. Appl. No. 11/176,058, Amendment and Response filed Jan. 23, 2009, 22 pgs.Applicant
- U.S. Appl. No. 11/176,058, Amendment and Response filed Nov. 1, 2007, 13 pgs.Applicant
- U.S. Appl. No. 11/176,058, Amendment and Response filed May 1, 2009, 17 pgs.Applicant
- U.S. Appl. No. 11/176,058, Amendment and Response filed Jun. 25, 2008, 16 pgs.Applicant
- U.S. Appl. No. 11/176,058, Amendment and Response filed Sep. 29, 2009, 18 pgs.Applicant
- U.S. Appl. No. 11/176,058, Notice of Allowance mailed Jan. 13, 2010, 14 pgs.Applicant
- U.S. Appl. No. 11/176,058, Notice of Allowance mailed Mar. 22, 2010, 8 pgs.Applicant
- U.S. Appl. No. 11/176,058, Office Action mailed Jan. 25, 2008, 10 pgs.Applicant
- U.S. Appl. No. 11/176,058, Office Action mailed Oct. 27, 2008, 9 pgs.Applicant
- U.S. Appl. No. 11/176,058, Office Action mailed Apr. 2, 2009, 10 pgs.Applicant
- U.S. Appl. No. 11/176,058, Office Action mailed Jul. 2, 2007, 10 pgs.Applicant
- U.S. Appl. No. 11/176,058, Office Action mailed Aug. 5, 2009, 11 pgs.Applicant
- U.S. Appl. No. 11/179,206, Amendment and Response filed Jan. 9, 2008, 16 pgs.Applicant
- U.S. Appl. No. 11/179,206, Amendment and Response filed Oct. 15, 2008, 14 pgs.Applicant
- U.S. Appl. No. 11/179,206, Amendment and Response filed Mar. 31, 2009, 16 pgs.Applicant
- U.S. Appl. No. 11/179,206, Notice of Allowance mailed May 14, 2009, 6 pgs.Applicant
- U.S. Appl. No. 11/179,206, Office Action mailed Oct. 31, 2008, 8 pgs.Applicant
- U.S. Appl. No. 11/179,206, Office Action mailed Apr. 16, 2008, 7 pgs.Applicant
- U.S. Appl. No. 11/179,206, Office Action mailed Aug. 9, 2007, 7 pgs.Applicant
- U.S. Appl. No. 11/201,751, Amendment and Response filed Jan. 5, 2011, 14 pgs.Applicant
- U.S. Appl. No. 11/201,751, Amendment and Response filed Mar. 31, 2009, 19 pgs.Applicant
- U.S. Appl. No. 11/201,751, Amendment and Response filed Mar. 4, 2010, 17 pgs.Applicant
- U.S. Appl. No. 11/201,751, Amendment and Response filed Jun. 27, 2011, 13 pgs.Applicant
- U.S. Appl. No. 11/201,751, Amendment and Response filed Sep. 23, 2009, 23 pgs.Applicant
- U.S. Appl. No. 11/201,751, Amendment and Response filed Sep. 27, 2010, 14 pgs.Applicant
- U.S. Appl. No. 11/201,751, Notice of Allowance mailed Jan. 25, 2012, 9 pgs.Applicant
- U.S. Appl. No. 11/201,751, Notice of Allowance mailed Oct. 13, 2011, 5 pgs.Applicant
- U.S. Appl. No. 11/201,751, Office Action mailed Jan. 26, 2011, 9 pgs.Applicant
- U.S. Appl. No. 11/201,751, Office Action mailed Dec. 31, 2008, 12 pgs.Applicant
- U.S. Appl. No. 11/201,751, Office Action mailed Dec. 9, 2009, 10 pgs.Applicant
- U.S. Appl. No. 11/201,751, Office Action mailed Jun. 25, 2010, 11 pgs.Applicant
- U.S. Appl. No. 11/201,751, Office Action mailed Jul. 21, 2009, 11 pgs.Applicant
- U.S. Appl. No. 11/202,430, Amendment and Response filed Oct. 7, 2009, 8 pgs.Applicant
- U.S. Appl. No. 11/202,430, Amendment and Response filed Mar. 20, 2009, 17 pgs.Applicant
- U.S. Appl. No. 11/202,430, Notice of Allowance mailed Oct. 1, 2009, 5 pgs.Applicant
- U.S. Appl. No. 11/202,430, Office Action mailed Feb. 11, 2009, 12 pgs.Applicant
- U.S. Appl. No. 11/202,430, USPTO Response filed Oct. 23, 2009, 2 pgs.Applicant
- U.S. Appl. No. 11/389,992, Advisory Action mailed Dec. 15, 2008, 3 pgs.Applicant
- U.S. Appl. No. 11/389,992, Amendment and Response filed Jan. 22, 2010, 13 pgs.Applicant
- U.S. Appl. No. 11/389,992, Amendment and Response filed Dec. 3, 2008, 12 pgs.Applicant
- U.S. Appl. No. 11/389,992, Amendment and Response filed Apr. 29, 2010, 17 pgs.Applicant
- U.S. Appl. No. 11/389,992, Amendment and Response filed May 8, 2008, 13 pgs.Applicant
- U.S. Appl. No. 11/389,992, Amendment and Response filed Jul. 1, 2009, 19 pgs.Applicant
- U.S. Appl. No. 11/389,992, Notice of Allowance mailed Jul. 8, 2010, 15 pgs.Applicant
- U.S. Appl. No. 11/389,992, Office Action mailed Nov. 10, 2009, 17 pgs.Applicant
- U.S. Appl. No. 11/389,992, Office Action mailed Feb. 2, 2010, 19 pgs.Applicant
- U.S. Appl. No. 11/389,992, Office Action mailed Mar. 6, 2008, 13 pgs.Applicant
- U.S. Appl. No. 11/389,992, Office Action mailed Apr. 1, 2009, 18 pgs.Applicant
- U.S. Appl. No. 11/389,992, Office Action mailed Sep. 3, 2008, 14 pgs.Applicant
- U.S. Appl. No. 12/360,099, Amendment and Response filed Jul. 30, 2010, 12 pgs.Applicant
- U.S. Appl. No. 12/360,099, Notice of Allowance mailed Sep. 29, 2010, 8 pgs.Applicant
- U.S. Appl. No. 12/360,099, Office Action mailed May 26, 2010, 16 pgs.Applicant
- Valimaki, M. et al., “Digital rights management on open and semiopen networks”, WIAPP, 2001, 154-155.Applicant
- Van Der Meer, “Network Working Group”, retrieved Apr. 9, 2008 at http://www.networksorcery.com/enp/rfc/rfc3640.txt, The Internet Society, Nov. 2003, pp. 1-37.Applicant
- Weber, R., “Digital Right Management Technology”, Oct. 1995, 35 pgs.Applicant
- White, Ron, “How Computers Work,” millennium ed., Que Corporation, Sep. 1999.Applicant
- White, S.R. et al., “Abyss: A trusted architecture for software protection,” IEEE Symposium on Security and Privacy. Apr. 27-29, 1987, 38-51.Applicant
- White, S.R. et al., “ABYSS: An Architecture for Software Protection,” IEEE Trans. On Software Engineering. Jun. 1990, 16(6), 619-629.Applicant
- Won-Ho Kim, “Design and Implementation of MPEG-2/DVB Scrambler Unit and VLSI Chip” 1997 International Conference on Consumer Electronics vol. 43 No. 3. pp. 320-321, Jun. 1997.Applicant
- Xin et al., “Bit Allocation for Joint Transcoding of Multiple MPEG Coded Video Streams,” 22001 IEEE International Conference on Multimedia and Expo, pp. 9-12, http://ieeexplore.ieee.org/iel5/8766/27769/01237642.pdf?isNumber=.Applicant
- Yu, H. “Digital multimedia at home and content rights management”, IEEE, Proceedings 2002 IEEE 4th International Workshop on Networked Appliances, 2002, 49-56.Applicant
- Zwollo, K. “Digital document delivery and digital rights management”, Information Services & Use, 2001, 9-11.Applicant
- Canadian Office Action in Application 2469830, mailed Mar. 28, 2012, 2 pgs.Applicant
- Chinese Notice on the First Office Action mailed Mar. 21, 2012, in Application No. 200680010120 (6 pages).Applicant
- European Search Report in EP Application 05102770.4, mailed Apr. 4, 2012, 5 pgs.Applicant
- Freier, Alan et al. “The SSL Protocol Version 3.0,” draft-ietf-tls-ssl-version3-00.tzt, vol. tls, Nov. 18, 1996 (66 pages).Applicant
- Rescorla, E. et al. “Guidelines for Writing RCE Text on Security Consideration,” draft-rescorla-sec-cons-03.txt, No. 3, Mar. 1, 2001 (28 pages).Applicant
- U.S. Appl. No. 11/113,216, Amendment and Response filed Apr. 27, 2012, 9 pgs.Applicant
- U.S. Appl. No. 11/201,751, Notice of Allowance mailed May 17, 2012, 7 pgs.Applicant
- Japanese Notice of Allowance mailed Jun. 1, 2012, in Application No. 2008-520256 (6 pages).Applicant
- Chinese Third Office Action in Application 2006800244438, mailed Aug. 3, 2012, 10 pgs.Applicant
- Taiwan Search Report dated Aug. 3, 2012, in Application No. 095107801 (1 page).Applicant
- Korean Preliminary Rejection mailed Aug. 14, 2012, in Applicaton No.10-2007-7024113 (1 page).Applicant
- U.S. Appl. No. 11/201,751, Notice of Allowance mailed Jul. 27, 2012 (7 pgs).Applicant
- U.S. Appl. No. 11/113,216, Non-Final Office Action mailed Aug. 16, 2012 (13 pgs).Applicant
- U.S. Appl. No. 11/113,160, Notice of Allowance mailed Jul. 23, 2012 (9 pgs).Applicant