Issuing a publisher use license off-line in a digital rights management (DRM) system

Description

TECHNICAL FIELD

This invention relates to a digital rights management (DRM) system. More particularly, the invention relates to employing a DRM system to publish digital content in an organization such as an office or corporation or the like such that rendering and use of the content within the organization may be constrained according to corresponding use or license terms. Even more particularly, the present invention relates to publishing content without contacting a server for approval and issuing oneself a publisher use license to render the published content without contacting the server for approval.

BACKGROUND OF THE INVENTION

Digital rights management 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/video of a live event. Typical modes of distribution include tangible devices such as a magnetic (floppy) disk, a magnetic tape, an optical (compact) disk (CD), etc., and intangible media such as an electronic bulletin board, an electronic network, the Internet, etc. Upon being received by the user, such user renders or ‘plays’ the digital content with the aid of an appropriate rendering device such as a media player on a personal computer or the like.

In one scenario, a content owner or rights-owner such as an author, a publisher, a broadcaster, etc., wishes to distribute such digital content to each of many users or recipients in exchange for a license fee or some other consideration. In such scenario, then, the content may be a song, an album of songs, a movie, etc., and the purpose of the distribution is to generate the license fees. Such content owner, given the choice, would likely wish to restrict what the user can do with such distributed digital content. For example, the content owner would like to restrict the user from copying and re-distributing such content to a second user, at least in a manner that denies the content owner a license fee from such second user.

In addition, the content owner may wish to provide the user with the flexibility to purchase different types of use licenses at different license fees, while at the same time holding the user to the terms of whatever type of license is in fact purchased. For example, the content owner may wish to allow distributed digital content to be played 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 media player, only by a certain type of user, etc.

In another scenario, a content developer, such as an employee in or member of an organization, wishes to distribute such digital content to one or more other employees or members in the organization or to other individuals outside the organization, but would like to keep others from rendering the content. Here, the distribution of the content is more akin to organization-based content sharing in a confidential or restricted manner, as opposed to broad-based distribution in exchange for a license fee or some other consideration.

In such scenario, then, the content may be a document presentation, spreadsheet, database, email, or the like, such as may be exchanged within an office setting, and the content developer may wish to ensure that the content stays within the organization or office setting and is not rendered by non-authorized individuals, such as for example competitors or adversaries. Again, such content developer wishes to restrict what a recipient can do with such distributed digital content. For example, the content owner would like to restrict the user from copying and re-distributing such content to a second user, at least in a manner that exposes the content outside the bounds of individuals who should be allowed to render the content.

In addition, the content developer may wish to provide various recipients with different levels of rendering rights. For example, the content developer may wish to allow protected digital content to be viewable and not printable with respect to one class of individual, and viewable and printable with respect to another class of individual.

However, and in either scenario, after distribution has occurred, such content owner/developer has very little if any control over the digital content. This is especially problematic in view of the fact that practically every personal computer includes the software and hardware necessary to make an exact digital copy of such digital content, and to download such exact digital copy to a writeable magnetic or optical disk, or to send such exact digital copy over a network such as the Internet to any destination.

Of course, as part of a transaction wherein the content is distributed, the content owner/developer may require the user/recipient of the digital content to promise not to re-distribute such digital content in an unwelcome manner. However, such a promise is easily made and easily broken. A content owner/developer may attempt to prevent such re-distribution through any of several known security devices, usually involving encryption and decryption. However, there is likely very little that prevents a mildly determined user from decrypting encrypted digital content, saving such digital content in an un-encrypted form, and then re-distributing same.

A need exists, then, for providing a digital rights management (DRM) and enforcement architecture and method that allows the controlled rendering or playing of arbitrary forms of digital content, where such control is flexible and definable by the content owner/developer of such digital content. More specifically, a need exists for such an architecture that allows and facilitates such controlled rendering, especially in an office or organization environment or the like where documents are to be shared amongst a defined group of individuals or classes of individuals. Even more specifically, a need exists for such an architecture that allows content to be published without first gaining approval from a server and that allows the publishing individual to issue itself a use license to render the published content without contacting the server for approval.

SUMMARY OF THE INVENTION

The aforementioned needs are satisfied at least in part by the present invention in which a publishing user publishes digital content and issues to itself a corresponding digital publisher license to allow itself to render the published digital content. The publishing user is supplied with a publishing certificate from a digital rights management (DRM) server, where the publishing certificate has a public key (PU-OLP) and a corresponding private key (PR-OLP) encrypted by a public key associated with the publishing user (PU-ENTITY) to form (PU-ENTITY(PR-OLP)).

The content is developed and encrypted according to a content key (CK), and a rights label is created for the encrypted content with (CK) encrypted by a public key of the DRM server (PU-DRM) to form (PU-DRM(CK)). (PU-ENTITY(PR-OLP)) is retrieved from the publishing certificate, a private key (PR-ENTITY) corresponding to (PU-ENTITY) is applied to (PU-ENTITY(PR-OLP)) to obtain (PR-OLP), and the created rights label is signed with (PR-OLP) to create a signed rights label (SRL). The created SRL and the publishing certificate are then concatenated to the encrypted content to form a content package distributable to another user which has to contact the DRM server to obtain a corresponding license with (CK) to render the encrypted content therein. Significantly, only such DRM server has a private key (PR-DRM) corresponding to (PU-DRM) and is able to apply (PR-DRM) to (PU-DRM(CK)) to obtain (CK).

License data corresponding to the content package is also created and has (CK) encrypted by a (PU-ENTITY) to form (PU-ENTITY(CK)), the created license data is signed with (PR-OLP) to create the publisher license, and the publishing certificate is attached to the publisher license. Only the publishing user having (PR-ENTITY) corresponding to (PR-ENTITY) can apply such (PR-ENTITY) to (PU-ENTITY(CK)) from the publisher license to obtain (CK) and thereby decrypt the encrypted content therewith for rendering.

In particular, the publishing user verifies the publishing certificate based on the chain of certificates, obtains (PU-OLP) from the publishing certificate, and employs the obtained (PU-OLP) to verify the signature of the publisher license. Thereafter, the publishing user retrieves (PU-ENTITY(CK)) from the verified publisher license, applies to (PU-ENTITY(CK)) a private key (PR-ENTITY) corresponding to (PU-ENTITY) to obtain (CK), and applies (CK) to (CK(content)) to result in the content. The content is then forwarded to a rendering application for actual rendering.

BRIEF DESCRIPTION OF THE DRAWINGS

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:

FIG. 1 is a block diagram representing an exemplary non-limiting computing environment in which the present invention may be implemented;

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;

FIG. 3 is a functional block diagram of a preferred embodiment of a system and method according to the invention for publishing digital content;

FIG. 4 is a flowchart of a preferred embodiment of a method according to the invention for publishing rights managed digital content;

FIG. 4A is a block diagram showing the structure of a signed rights label as produced by the method of FIG. 4;

FIG. 5 is a block diagram of a preferred embodiment of a system and method according to the invention for licensing rights managed digital content;

FIGS. 6A and 6B are flowcharts of a preferred embodiment of a method according to the invention for licensing rights managed digital content;

FIG. 7 is a block diagram showing a certificate issued by a DRM server to a user to allow the user to perform off-line publishing in accordance with one embodiment of the present invention;

FIG. 8 is a block diagram showing the certificate of FIG. 7 along with a publisher license that allows a publishing user to render content off-line published thereby in accordance with one embodiment of the present invention;

FIG. 9 is a flow chart showing key steps performed by the publishing user to obtain the publishing license of FIG. 8 in accordance with one embodiment of the present invention;

FIG. 10 is a flow chart showing key steps performed by the publishing user to employ the obtained publishing license of FIG. 9 to render the corresponding content in accordance with one embodiment of the present invention;

FIG. 11 is a block diagram showing an enforcement architecture of an example of a trust-based system;

FIG. 12 is a block diagram showing a plurality of DRM servers such as may exist in the architecture of the present invention, where each (entering) DRM server is enrolled or sub-enrolled into the architecture by another (enrolling) DRM server issuing same an enrollment certificate;

FIG. 13 is a block diagram showing the enrollment certificate of FIG. 12 along with a vouching certificate presented in at least some instances by an entering DRM server to an enrolling DRM server; and

FIGS. 14 and 15 are flow diagrams showing key steps performed by the enrolling and entering DRM servers of FIGS. 13 and 14 to enroll (FIG. 14) or sub-enroll (FIG. 15) the entering DRM server.

DETAILED DESCRIPTION OF THE INVENTION

Computer Environment

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.

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.

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.

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).

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.

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.

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.

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).

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.

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.

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.

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.

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).

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).

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.

There are a variety of systems, components, and network configurations that support distributed computing environments. For example, computing systems may be connected together by wireline 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.

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.

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.

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.

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.

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.

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.

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.

Digital Rights Management (DRM) Overview

As is known, and referring now to FIG. 11, digital rights management (DRM) and enforcement is highly desirable in connection with digital content 12 such as digital audio, digital video, digital text, digital data, digital multimedia, etc., where such digital content 12 is to be distributed to users. Upon being received by the user, such user renders or ‘plays’ the digital content with the aid of an appropriate rendering device such as a media player on a personal computer 14 or the like.

Typically, a content owner or developer (hereinafter ‘owner’) distributing such digital content 12 wishes to restrict what the user can do with such distributed digital content 12. For example, the content owner may wish to restrict the user from copying and re-distributing such content 12 to a second user, or may wish to allow distributed digital content 12 to be played 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 media player, only by a certain type of user, etc.

However, after distribution has occurred, such content owner has very little if any control over the digital content 12. A DRM system 10, then, allows the controlled rendering or playing of arbitrary forms of digital content 12, where such control is flexible and definable by the content owner of such digital content. Typically, content 12 is distributed to the user in the form of a package 13 by way of any appropriate distribution channel. The digital content package 13 as distributed may include the digital content 12 encrypted with a symmetric encryption/decryption key (KD), (i.e., (KD(CONTENT))), as well as other information identifying the content, how to acquire a license for such content, etc.

The trust-based DRM system 10 allows an owner of digital content 12 to specify license rules that must be satisfied before such digital content 12 is allowed to be rendered on a user's computing device 14. Such license rules can include the aforementioned temporal requirement, and may be embodied within a digital license or use document (hereinafter ‘license’) 16 that the user/user's computing device 14 (hereinafter, such terms are interchangeable unless circumstances require otherwise) must obtain from the content owner or an agent thereof. Such license 16 also includes the decryption key (KD) for decrypting the digital content, perhaps encrypted according to a key decryptable by the user's computing device.

The content owner for a piece of digital content 12 must trust that the user's computing device 14 will abide by the rules and requirements specified by such content owner in the license 16, i.e. that the digital content 12 will not be rendered unless the rules and requirements within the license 16 are satisfied. Preferably, then, the user's computing device 14 is provided with a trusted component or mechanism 18 that will not render the digital content 12 except according to the license rules embodied in the license 16 associated with the digital content 12 and obtained by the user.

The trusted component 18 typically has a license evaluator 20 that determines whether the license 16 is valid, reviews the license rules and requirements in such valid license 16, and determines based on the reviewed license rules and requirements whether the requesting user has the right to render the requested digital content 12 in the manner sought, among other things. As should be understood, the license evaluator 20 is trusted in the DRM system 10 to carry out the wishes of the owner of the digital content 12 according to the rules and requirements in the license 16, and the user should not be able to easily alter such trusted element for any purpose, nefarious or otherwise.

As should be understood, the rules and requirements in the license 16 can specify whether the user has rights to render the digital content 12 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 DRM system, the date, the time, etc. In addition, the rules and requirements of the license 16 may limit the license 16 to a pre-determined number of plays, or pre-determined play time, for example.

The rules and requirements may be specified in the license 16 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.).

Upon the license evaluator 20 determining that the license 16 is valid and that the user satisfies the rules and requirements therein, the digital content 12 can then be rendered. In particular, to render the content 12, the decryption key (KD) is obtained from the license 12 and is applied to (KD(CONTENT)) from the content package 13 to result in the actual content 12, and the actual content 12 is then in fact rendered.

Publishing Digital Content

FIG. 3 is a functional block diagram of a system and method for publishing digital content. “Publishing,” as that term is used herein, refers to a process that an application or service follows to establish with a trusted entity a set of rights and conditions that the entity can issue for that content, as well as to whom those rights and conditions can be issued. According to the invention, the publishing process includes encrypting the digital content and associating a list of persistent enforceable rights that the author of the content intended for all possible users of the content. This process can be carried out in a secure way to prohibit access to any of the rights or to the content unless intended by the author of the content.

Three entities in particular are employed to publish secure digital content: a content preparation application 302 that executes on the client 300 and prepares the content for publishing, a digital rights management (DRM) applications program interface (API) 306 that also resides on the client device 300, and a DRM server 320 that is communicatively coupled to the client 300 via a communication network 330 such as the Internet, a local or wide area network, or a combination thereof.

The content preparation application 302 can be any application that produces digital content. For example, the application 302 can be a word processor or other publisher that produces digital text files, digital music, video, or other such content. The content could also include streamed content, such as streamed audio/video of a live or taped event, or example. The application 302 is provided with a cryptographic key to encrypt the digital content, thus forming an encrypted digital content file 304, and the user provides rights data to be tightly associated with the encrypted content in the digital content file 304. The rights data includes an identity for each entity that has rights in the digital content, and a set of rights and conditions for each identified entity.

Such an entity can be, for example, an individual, a class of individuals, or a device. Such rights can include the right to read, edit, copy, print, etc, the digital content. Conditions may include minimum system requirements, date and time limitations, play counts, and the like.

The client API 306 passes the encrypted digital content and the rights data to the DRM server 320. Using a process that is described in detail below, the DRM server 320 determines whether it can enforce the rights data and if so the DRM server 320 signs the rights data to form a signed rights label (SRL) 308. In general, however, any trusted entity can sign the rights data, preferably using a key trusted by the DRM server 320. For example, a client can sign the rights data using a key provided to it by the DRM server 320.

The rights label 308 can include data representing the rights description, the encrypted content key, and the digital signature over the rights description and the encrypted content key. If the DRM server 320 is signing the right label, it passes the signed rights label 308 back to the client through the client API 306, which stores the signed rights label 308 on the client device 300. The content preparation application 302 then associates the signed rights label 308 with the encrypted digital content file 304, such as for example by concatenation to form a rights managed content file 310. Note, though, that the SRL 308 could be stored in a known location separate from the content file 304 with a reference to the SRL 308 concatenated to the content file 304 to form the content file 310.

Referring now to FIG. 4, one method for publishing rights managed digital content is shown. At step 402, the application 302 generates a content key (CK) that is used to encrypt the digital content. The content key (CK) is typically a symmetric key although any key can be used to encrypt the digital content. As is known, a symmetric key is employed by a symmetric key algorithm both to encrypt and decrypt. Accordingly, (CK) should be well-hidden when shared between a sender and a receiver.

At step 404, the application 302 encrypts the digital content with (CK) to form encrypted digital content 304 (i.e., (CK(content))). Additionally, rights data corresponding to (CK(content)) is generated, either by the publisher of the content or by another entity. Note that such rights data may be custom rights data or rights data as obtained from a pre-defined template. As was discussed above, the rights data can include a list of entities that will be entitled to consume the content, the specific rights that each of the entities possesses with respect to the content, and any conditions that may be imposed on those rights.

At step 406, the API 306 generates a second encryption key (K2), which is used to encrypt the content key (CK). Preferably, (K2) is also a symmetric key. At step 408, the API 306 encrypts (CK) with (K2) to result in (K2(CK)). At step 410, the API 306 discards (CK), with the result being that (CK) can now be obtained only by decrypting (K2(CK)). To ensure that (CK(content)) is protected to a central DRM server 320 and that all “license requests” for the content are done centrally in accordance with the rights data, the API 306, at step 412, contacts the provided DRM server 320 and retrieves the public key (PU-DRM) thereof. At step 414, the API 306 encrypts (K2) with (PU-DRM) to result in (PU-DRM (K2)). Thus, (CK) can be protected to (PU-DRM)) to ensure that the DRM server 320 is the only entity that will be able to get access to (CK), as is required to decrypt (CK(content)). At step 416, the API 306 encrypts the rights data (i.e., the list of authorized entities and the respective rights and conditions associated with each authorized entities in the list) with (K2) to result in (K2(rightsdata)).

In an alternative embodiment, (CK) can be used to directly encrypt the rights data to result in (CK(rightsdata)), and (PU-DRM) can be used to directly encrypt (CK) to result in (PU-DRM(CK)), thereby foregoing the use of (K2) completely. However, using (K2) to encrypt the rights data and (CK) allows such (K2) to conform to any particular algorithm that might be amenable to the DRM server, whereas (CK) might be specified by an entity independent from the DRM server and might not be as amenable thereto.

At step 418, the content protection application 302 submits (PU-DRM(K2)) and (K2(rightsdata)) to the DRM server 320 as a rights label for signing. Alternatively, the client itself can sign the rights data in the manner set forth below. If the rights data is being submitted to the server for signing, then, at step 420, the DRM server 320 accesses the rights data and verifies that it can enforce the rights and conditions in the submitted rights label. To verify that it can enforce the rights data, the DRM server 320 applies the private key (PR-DRM) corresponding to (PU-DRM) to (PU-DRM(K2)) to result in (K2), and then applies (K2) to (K2(rightsdata)) to result in the rights data in the clear. The server 320 can then do any policy checks to verify that the users, rights, and conditions specified in the rights data are within any policy enforced by the server 320. The server 320 signs the originally submitted rights label including (PU-DRM(K2)) and (K2(rightsdata)) to result in the signed rights label (SRL) 308, where the signature is based on the private key of the DRM server 320 (PR-DRM), and returns the SRL 308 back to the API 306, which then presents the returned SRL 308 to the client application 302.

The SRL 308 is a digitally signed document, which makes it tamper-resistant. Additionally, the SRL 308 is independent of the actual key type and algorithm used to encrypt the content but maintains the strong 1-1 relation to the content it is protecting. Referring now to FIG. 4A, in one embodiment of the present invention, the SRL 308 may include information on the content that is the basis of the SRL 308, including perhaps an ID of the content; information on the DRM server that signs the SRL 308, including (PU-DRM(K2)) and referral information such as a URL for locating the DRM server on a network and fall-back information if the URL fails; information describing the SRL 308 itself; (K2(rightsdata)): (K2(CK)); and a digital signature (S(PR-DRM)), among other things.

By ensuring that a trusted entity signs the rights data to create a signed rights label 308, the DRM server 320 is asserting that it will issue licenses for the content in accordance with the terms set forth by the publisher as described in the rights data of the rights label 308. As should be appreciated, a user is required to obtain a license to render the content, especially inasmuch as the license contains the content key (CK). When a user wants to obtain a license for the encrypted content, the user can present a license request including the SRL 308 for the content and a certificate verifying the user's credentials to the DRM server 320 or other license issuing entity. The license issuing entity can then decrypt (PU-DRM(K2)) and (K2(rightsdata)) to produce the rights data, list all the rights granted by the author (if any) to the license requesting entity, and construct a license with only those specific rights.

As set forth above, upon the application 302 receiving the SRL 308, such application 302 concatenates the signed rights label 308 with the corresponding (CK(content)) 304 to form rights managed digital content. Alternatively, the rights data is stored in a known location, with a reference to that location provided with the encrypted digital content. Thus, a rendering application that is DRM-enabled can discover the signed rights label 308 via the piece of content the rendering application is attempting to render. This discovery triggers the rendering application to initiate a license request against the DRM licensing server 320. Publishing application 302 can store a URL to the DRM licensing server 320, for example, or the DRM licensing server 320 can embed its own URL as a piece of metadata into the rights label before digitally signing it, so that the DRM client API 306 called by the rendering application can identify the correct DRM licensing server 320.

Obtaining a License for the Published Content

Referring now to FIG. 5, a system and method for licensing rights managed digital content is shown. “Licensing,” as that term is used herein, refers to a process that an application or service follows to request and receive a license that will enable an entity named in the license to consume the content in accordance with the terms specified in the license. Inputs to the licensing process can include the signed rights label (SRL) 308 associated with the content for which a license is being requested, and the public key certificate(s) of the entity(s) for which the license is being requested. Note that the entity requesting a license need not necessarily be the entity for which the license is being requested. Typically, a license includes the rights description from the SRL 308, an encrypted key that can decrypt the encrypted content, and a digital signature over the rights description and the encrypted key to assert legitimacy and prevent tampering.

Preliminarily, the client API 306 forwards the signed rights label 308 of the rights managed content 310 to the DRM server 320 via the communication network 330. As described above, the rights label 308 contains the content key (CK) encrypted according to the public key of the DRM server 320 (PU-DRM) (i.e., (PU-DRM(CK))). In the process of issuing a license, then, the DRM server 320 applies (PR-DRM) to (PU-DRM(CK)) to obtain (CK). It then uses the public key (PU-ENTITY) in the public key certificate that is passed up in the license request to re-encrypt (CK) (i.e., (PU-ENTITY(CK))). The newly encrypted (PU-ENTITY(CK)) is then placed into the license. Thus, the license can be returned to the caller without risk of exposing (CK), since only the holder of the private key (PR-ENTITY) corresponding to (PU-ENTITY) can recover (CK) from (PU-ENTITY(CK)). The client API 306 then uses (CK) to decrypt the encrypted content to form decrypted digital content 312. The client application 302 can then use the decrypted digital content 312 according to the rights that are provided in the license.

Alternatively, and as set forth below in more detail, a client such as the publishing client can for example issue a use license to itself to consume the content.

Turning now to FIGS. 6A and 6B, a method for licensing rights managed digital content is shown. At step 602, a license issuing entity such as a DRM server 320 receives a license request including either a public key certificate or an identity for each of one or more requested licensees. Presumably, if am identity is specified, the DRM server 320 can procure a corresponding public key certificate from a directory, a database, or the like. If a license is requested for only one licensee, only one certificate or identity is named. If a license is requested for a plurality of licensees, a certificate or an identity can be named for each potential licensee. At step 604, the requesting entity (i.e., the entity making the license request) is authenticated, if desired. At step 606, it is determined whether the entity is allowed to request a license, again if desired.

If, at step 608, the issuing entity determines that the public key certificate is not included in the license request, then the issuing entity uses the specified identity to perform a lookup in a directory service or database for the appropriate public key certificate. If, at step 610, the issuing entity determines that the certificate is in the directory, then, at step 612, the certificate is retrieved. If a certificate cannot be found for a given potential licensee, either in the request or in the directory, then the license server does not generate a license for that potential licensee and, at step 614, an error is returned to the requesting entity.

Assuming the DRM server 320 has a public key certificate for at least one potential licensee, then, at step 616, such DRM server 320 validates the trust of each licensee certificate. If not validated, the DRM server 320 determines that the issuer of the licensee certificate is not in the list of trusted issuers, then the request fails for that licensee, and an error is generated at step 614. Thus, any potential licensee whose certificate is not issued by a trusted issuer would not receive a license.

Additionally, the DRM server 320 preferably performs digital signature validation on all entities in the certificate chain going from the trusted issuer certificates to the individual licensee public key certificates. The process of validating the digital signatures in a chain is a well-known algorithm. If the public key certificate for a given potential licensee does not validate, or a certificate in the chain does not validate, the potential licensee is not trusted, and a license, therefore, is not issued to that potential licensee. Otherwise, at step 618, a license can issue. The process repeats at step 620 until all entities for which a license has been requested have been processed.

As shown in FIG. 6B, the DRM server 320 proceeds to validate the signed rights label 308 that is received in the license request. In one embodiment, the DRM server 320 has a master copy of every rights label signed thereby. At license time (at step 622), then, the DRM server 320 may retrieve a copy of the master rights label. The master rights label could be more up to date than the copy of the rights label sent in the license request, and therefore will be the rights label employed to produce the requested license. If no master rights label is found the DRM server 320, at step 624, determine according to pre-defined policy whether to issue a license based on the rights label in the request. If the policy does not allow, the license request fails at step 626, and an error is returned to the API 306 at step 628.

At step 630, the DRM server 320 validates the SRL 308 and specifically the digital signature thereof. If the SRL 308 does not validate, the license request fails at step 626, and an error is returned to the API 306 at step 628.

After all the validations have occurred, the DRM server constructs a license for each approved license based on the SRL 308. At step 632, the DRM server 320 generates a respective rights description for the license to be issued to each licensee. For each licensee, the DRM server 320 evaluates the identity named in the public key certificate of that licensee against the identities named in the rights description in the rights label. At step 636, the DRM server 320 obtains (PU-DRM(K2)) and (K2(CK)) from the SRL 308 and applies (PR-DRM) to obtain (CK). The issuing entity then re-encrypts (CK) using (PU-ENTITY) from the licensee's public key certificate to result in (PU-ENTITY(CK)). At step 638, the DRM server 320 concatenates the generated rights description with (PU-ENTITY(CK)) and digitally signs the resulting data structure using (PR-DRM) (i.e., S (PR-DRM)). The signed data structure is thus the license for this particular licensee.

At step 640, the DRM server 320 determines that there are no more licenses to generate for the particular request. The generated licenses are then returned to the requesting entity, at step 642, along with an appropriate certificate chain that ties the licenses back to a trusted authority.

Self-Publishing the Signed Rights Label 308

In one embodiment of the present invention, the SRL 308 may be signed by the requesting/publishing user itself. Accordingly, such user need not contact the DRM server 320 to obtain an SRL 308 for an associated piece of content. As a result, self-publishing may also be referred to as off-line publishing. In such embodiment, the publishing user should also be able to issue itself a publisher license, especially inasmuch as the self-published content is now DRM-protected and such a publisher license is required to allow the publishing user to render the now-protected content. It should also be understood that a publishing user may be enabled to issue licenses to other users.

In particular, and referring now to FIG. 7, in the embodiment, an off-line publishing user is first provisioned to off-line publish by receiving from a DRM server 320 an off-line publishing (OLP) certificate 810 including a public key (PU-OLP) and a corresponding private key (PR-OLP) encrypted according to a public key directly or indirectly accessible to the trusted component 18 (FIG. 11) of the user (PU-ENTITY) to result in (PU-ENTITY(PR-CERT)). Note that (PU-ENTITY) may for example be the public key of the trusted component 18, or may be a public key of the user which is accessible by way of the public key of the trusted component 18. The OLP certificate 810 should be signed by the private key of the DRM server 320 (PR-DRM) so that such DRM server 320 can verify such OLP certificate, as will be discussed in more detail below.

In addition, the OLP certificate 810 should include a certificate chain from (PU-DRM) back to a trusted authority that is trusted by the trusted component 18 of the publishing user or of another user so that such trusted component 18 can verify such OLP certificate 810 and any other certificate or license that is associated with such OLP certificate 810, as will be discussed below. Briefly, and as should be understood, a chain of certificates begins with a root certificate signed by the private key of a trusted authority and having the public key of the next certificate in the chain. Each intermediate certificate in the chain, then, is signed by the private key corresponding to the public key of the previous certificate in the chain, and has the public key of the next certificate in the chain. Finally, the certificate or license to which the chain is attached is signed by the private key corresponding to the public key of the last certificate in the chain.

Thus, to verify the certificate or license to which the chain is attached, knowledge of the public key corresponding to the private key of the trusted authority is gained, and such public key of the trusted authority is employed to verify the signature of the root certificate in the chain. Presuming the root certificate signature verifies, then, the public key from the root certificate is obtained and employed to verify the signature of the first intermediate certificate in the chain. The process repeats serially through the chain until every signature thereof is verified, and then the public key from the last intermediate certificate in the chain is obtained and employed to verify the signature of the certificate or license to which the chain is attached.

As should be appreciated, the OLP certificate 810 creates a link in the chain of trust between content 304 that is to be published off-line and the DRM server 320 that will issue a license for the content 304. The OLP certificate 810 may be created based on an XML/XrML language or any other appropriate language.

As should also be appreciated, the OLP certificate 810 and attached certificate chain authorizes the publishing user to self-publish. As may further be appreciated, the key pair (PU-OLP, PR-OLP) are separate from (PU-ENTITY, PR-ENTITY), and are employed specifically for self-publishing. Note that the key pair (PU-OLP, PR-OLP) may be dispensed with, in which case the DRM certificate 810 includes only the public key of the user (PU-ENTITY) and is signed by the private key of the DRM server 320 (PR-DRM) so that such DRM server 320 can verify same.

Self-publishing differs from publishing as shown in FIG. 4 in that the user essentially takes the place of the DRM server 320 with regard to steps performed thereby. Significantly, the user signs the submitted rights label including (PU-DRM(K2)) and (K2(rightsdata)) or including (PU-DRM(CK)) and (CK(rightsdata)) (the latter being shown in FIGS. 7 and 8) with (PR-OLP) as obtained from the DRM certificate 810 (i.e., S (PR-OLP)) to result in the signed rights label (SRL) 308. The trusted component 18 client in using the OLP certificate 810 typically verifies same based on the attached certificate chain. As should be appreciated, the trusted component 18 of the user obtains (PR-OLP) from the OLP certificate 810 by obtaining (PU-ENTITY(PR-OLP)) from such OLP certificate 810 and applying (PR-ENTITY) thereto. Note, though, that the publishing user cannot verify that the DRM server 320 can enforce the rights in a self-published SRL 308. Accordingly, the DRM server 320 itself should perform the verification at the time a license is requested based on the self-published SRL 308.

Once the publishing user self-publishes the SRL 308, the user concatenates such self-published SRL 308 and the OLP certificate 810 employed to produce same to the content 304, and such content 304 with SRL 308 and DRM certificate 810 is distributed as the rights managed content 310 to another user. Thereafter, the other user requests and obtains a license for the content 304/310 from the DRM server 320 in substantially the same manner as shown in FIGS. 6A and 6B. Here, though, the license-requesting user submits to the DRM server 320 both the self-published SRL 308 and the OLP certificate 810 as concatenated to the content 304. The DRM server 320 then verifies S (PR-DRM) in the OLP certificate 810 based on the corresponding (PU-DRM), and obtains (PU-OLP) from the DRM certificate 810. The DRM server 320 then verifies S (PR-OLP) in the SRL 308 based on the obtained (PU-CERT), and continues as before. Note, though, that since the publishing user did not verify that the DRM server 320 can enforce the rights in the SRL 308, and as was set forth above, the DRM server 320 itself should perform the verification at this time.

Note, too, that the DRM server 320 need only verify S (PR-DRM) in the OLP certificate 810, since presumably it trusts itself. Accordingly, the associated certificate chain from the OLP certificate 810 need not necessarily be sent to the DRM server 320 along with such OLP certificate 810, unless of course the chain is otherwise necessary, such as for example if the chain itself is at least partially the basis for S (PR-DRM).

Importantly, though, the publishing user ought to be able to render the now-protected content 304/310 without having to go to the DRM server 320 for a license. Put another way, a publishing user that off-line publishes content 304/310 without going to the DRM server 320 based on an OLP certificate 810 ought to be able to also issue itself a license in an off-line manner without going to the DRM server 320 so that such user can render the off-line published content 304/310. Accordingly, a publishing user can continue to work with self-published content 310 without any connectivity to a DRM server 320.

In one embodiment of the present invention, then, and turning now to FIG. 8, a publishing user issues itself an off-line publisher license 820 signed by (PR-OLP) and based on the self-published SRL 308, and including the OLP certificate 810 and certificate chain thereof. Presumably, the publisher license 820 grants the publishing user full access to the self-published content 310, although a lesser amount of access could also be granted. The publisher license 820 may be written in an XML/XrML language or another language, as is the case with other DRM licenses. As should be appreciated, the publisher license 820 includes the content key (CK) encrypted according to (PU-ENTITY), which may be obtained by the trusted component 18 of the user's computing device 14, to form (PU-ENTITY(CK)).

The chain for the publisher license 820 thus goes from such license 820 to the OLP certificate 810 and then back to a root certificate from a trusted authority, perhaps by way of one or more intermediate certificates. Since the trusted component 18 of the user presumably can gain the public key corresponding to the private key of the trusted authority that was employed to sign the root certificate, the trusted component 18 can itself verify the publisher license 820 by way of the certificate chain thereof, and upon verification can then obtain (PU-ENTITY(CK)) therefrom, apply (PR-ENTITY) thereto to obtain (CK), and apply (CK) to (CK(content)) to result in the content 304 for purposes of rendering thereof. As a result, the publishing user can continue to work with content 310 off-line published thereby while remaining offline.

In accordance with the above, then, and referring now to FIG. 9, a publishing user off-line publishes content 304/310 and issues itself an off-line publisher license 820 for such content 304/310 in the following manner.

Preliminarily, and as should be appreciated, the content 304 is developed in an appropriate manner and encrypted according to a content key (CK) (step 901), and the publishing user creates a rights label for the content 304 with appropriate information {(PU-DRM(CK)) and (CK(rightsdata)), e.g.} (step 903). Thereafter, the publishing user, which presumably is already in possession of an OLP certificate 810 from the DRM server 320, obtains such OLP certificate 810 (step 905) and verifies same based on the signature thereof and the chain of certificates that lead back to the root authority (step 907). As should be appreciated, such verification is actually performed by a trusted component 18 on a computing device 14 of the publishing user. Assuming the verification is successful, then, the publishing user/trusted component 18 (hereinafter ‘the publishing user’) retrieves (PU-ENTITY(PR-OLP)) from the OLP certificate 810 step 909), applies (PR-ENTITY) to (PU-ENTITY(PR-OLP)) to obtain (PR-OLP) (step 911), and then signs the created rights label with such (PR-OLP) to create an SRL 308 (step 913).

Thereafter, the publishing user concatenates such SRL 308 and the OLP certificate 810 employed to produce same to the content 304 to form the self-published content 310 (step 915), and such rights managed content 310 is therefore able to be distributed to another user. For the publishing user to continue using or rendering the content 310, however, such publishing user must issue itself a corresponding off-line publisher license 820.

Thus, the publishing user creates a publisher license 820 by defining appropriate rights data for itself and encrypting same according to the content key (CK) to result in (CK(rightsdata)) (step 917). Note here that such rights data may be obtained from the SRL 308 from the content 310, may be some default set of rights data granting the publishing user partial or full access to the self-published content 310, or may be derived from another source. In addition, the publishing user encrypts the content key (CK) according to (PU-ENTITY) to form (PU-ENTITY(CK)) (step 919). Such (CK(rightsdata)) and (PU-ENTITY(CK)) are then formatted into the publisher license 820 (step 921), the OLP certificate 810 and chain of certificates thereof is attached (step 923) and such publisher license 820 is signed based on (PR-OLP) as was obtained in step 911 (step 925). Note here that the content 304 (i.e., (CK(content))), the publishing license 820, and the OLP certificate in combination form a chain 830 of digital items back to the trusted authority.

For the publishing user to render the published content 310, then, and turning now to FIG. 10, such publishing user need not contact the DRM server 320, but instead gains the public key corresponding to the private key of the trusted authority that was employed to sign the root certificate (step 1001), verifies the root certificate (step 1003), and then verifies each intermediate certificate in the chain (step 1005) by, for each such intermediate certificate, obtaining the public key from the previous certificate and employing same to verify the signature of such certificate. Thereafter, (PU-DRM) from the last certificate in the chain is employed to verify the signature of the OLP certificate 810 (i.e., S (PR-DRM)) (step 1007), (PU-OLP) is obtained from the OLP certificate 810 (step 1009), and such (PU-OLP) is employed to verify the signature of the publisher license 820 (i.e., S (PR-OLP)) (step 1010).

Once the publisher license 820 is verified, then, (CK(rightsdata)) and (PU-ENTITY(CK)) are retrieved from same (step 1011), (PR-ENTITY) is applied to (PU-ENTITY(CK)) to result in (CK) (step 1013), and (CK) is applied to (CK(rightsdata)) to result in the rights data (step 1015). As should now be appreciated, the rights data is reviewed by the trusted component 18 of the computing device 14 of the publishing user to determine that such rights data allows rendering in the manner sought (step 1017), such trusted component 18 thus applies (CK) to (CK(content)) from the content 310 to result in the content (step 1019), and such content is then forwarded to an appropriate rendering application for actual rendering (step 1021). Thus, the steps of FIG. 10 in effect traverse the chain 830 of digital items from the trusted authority to the content 304.

Note that the trusted component 18 could conceivably apply (CK) to (CK(content)) to result in the content without first reviewing the rights data and regardless of what the rights data may allow or disallow, but is trusted and has been constructed to in fact produce the content only after reviewing the rights data and satisfying itself that the rights data allows the rendering of such content. Once again, as a result of having the publisher license 820, the publishing user can continue to work with content 310 off-line published thereby while remaining offline inasmuch as the DRM server 320 need not be contacted.

Enrollment and Sub-Enrollment of DRM Servers

In the architecture as seen in FIG. 3, only a single DRM server 320 is shown. However, and as may be appreciated, such architecture can and likely does include multiple DRM servers 320. In particular, and in one embodiment of the present invention, such architecture includes a distributed network of DRM servers 320. Each of such DRM servers 320 may have any particular function and all of the DRM servers 320 may be organized in any appropriate manner without departing from the spirit and scope of the present invention.

For example, and turning now to FIG. 12, a particular organization may have one or more user-level DRM servers 320 for the purpose of signing rights labels to produce SRLs 308, issuing licenses 16, granting publishing licenses 320, issuing certificates to users, issuing certificates to computing devices 14, and the like. Each such user-level DRM server 320 may be geographically assigned or may be assigned based on function or load, for example. Likewise, to oversee multiple user-level DRM servers 320, an organization may have one or more management DRM servers 320. Such organization-based DRM servers 320 may be located behind an organization firewall if so desired.

In addition to organization-based DRM servers 320, there may also be trans-organization DRM servers 320 that facilitate inter-organization DRM functionality. For example, such trans-organization DRM servers 320 may allow a pair of organizations to share certain DRM content 12. Also, there may be a network of overseer DRM servers 320 that enable all other DRM servers 320. For example, such overseer DRM servers 320 may oversee and maintain all other DRM servers 320 and provide appropriate linkage for all other DRM servers 320 back to the root or trusted authority that is the basis for the chain of certificates set forth previously. Such non-organization-based DRM servers 320 are likely not located behind any organization firewall.

Critically, each DRM server 320 in the architecture of FIG. 12 must be able to prove that it is to be trusted. Thus, and as should now be appreciated from the above chain of certificates discussion, each DRM server 320 upon entering the architecture is provided with an enrollment certificate 1310, as is seen from FIG. 13. Significantly, and in one embodiment of the present invention, the enrollment certificate 1310 is provided to the entering DRM server 320 (hereinafter “the DRM-E server 320”) by another ‘enrolling’ DRM server 320 already in the architecture (hereinafter “the DRM-R server 320”). Also significantly, attached to the provided enrollment certificate 1310 from the enrolling DRM-R server 320 is a chain of certificates 1320 including the enrollment certificate 1310 of the enrolling DRM server 320, the enrollment certificate 1310 of the DRM server 320 that enrolled the enrolling DRM-R server 320, and so on all the way back to a root DRM server 320. Such root DRM server 320 may represent the root or trusted authority, or the chain of certificates 1320 may extend beyond to reach the root or trusted authority. As should now be appreciated, such enrollment certificate 1310 and the chain of certificates 1320 in combination form the chain of certificates that are attached to an OLP certificate 810 provided by an enrolled or entered DRM-E server 320 to a publishing user, such as that shown in FIG. 8.

In one embodiment of the present invention, the enrollment certificate 1310 provided to a DRM-E server 320 by a DRM-R server 320 is in a form such as an XrML 1.2 based certificate. As may be appreciated, such type of certificate 1310 is not independently proffered by any third party, and thus such type of certificate 1310 does not represent any sort of independent vouching by a third party for the holder of such certificate 1310.

In one embodiment of the present invention, the method with which a particular DRM-E server 320 is enrolled into the architecture depends on whether the enrolling DRM-R server 320 knows or has reason to trust the entering DRM-E server 320. If not, the DRM-E server 320 should be required to prove to the DRM-R server 320 that it is trustworthy and will enforce the DRM architecture. If so, the DRM-E server 320 should not be required to prove to the DRM-R server 320 that it is trustworthy, at least not to the same degree. Thus, a non-trusting/non-knowing DRM-R server 320 ‘enrolls’ a DRM-E server 320, while a knowing/trusting DRM-R server 320 ‘sub-enrolls’ a DRM-E server 320.

Typically, a DRM-R server 320 knows/trusts a DRM-E server 320 if both are operated by or for the benefit of the same organization, although knowledge/trust may also arise from other situations without departing from the spirit and scope of the present invention. Thus, the method with which a particular DRM-E server 320 is enrolled into the architecture typically depends on whether the enrolling DRM-R server 320 is organizationally based or non-organizationally based. As a result, a non-organizationally based DRM-R server 320 ‘enrolls’ a DRM-E server 320, while an organizationally based DRM-R server 320 ‘sub-enrolls’ a DRM-E server 320.

Enrollment

In one embodiment of the present invention, and turning now to FIG. 14, a non-knowing/non-trusting DRM-R server 320 enrolls a DRM-E server 320 in the following manner.

Preliminary, it is to be appreciated that the DRM-E server 320 wishing to be enrolled by the non-knowing/non-trusting DRM-R server 320 is likely not known to such DRM-R server 320. Accordingly, and in one embodiment of the present invention, the DRM-E server 320 must procure a vouching certificate 1330 from a third party willing to vouch for such DRM-E server 320 (step 1401). Typically, such third party is an independent certificate-issuing agent that is trusted by the DRM-R server 320 to perform such vouching, such as for example VERISIGN Corporation of Mountain view, Calif. Such vouching certificate 1330 may for example be in a form such as an X.509 certificate. Note that in the DRM-R server 320 relying on the trusted third party to vouch for the DRM-E server 320, the liability of such DRM-R server 320 for any bad acts of the DRM-E server 320 is mitigated.

As should be appreciated and as is typical, and as is also seen in FIG. 13, the vouching certificate 1330 incorporates therein a public key (PU-V) and a corresponding private key (PR-V), is signed by the trusted third party, and may be accompanied by a chain of certificates leading to a known root for purposes of validation. As is also typical, (PR-V) within the vouching certificate 1330 is protected in a manner accessible to the vouched-for DRM-E server 320 that is the basis of the vouching certificate 1330. For example, and as seen in FIG. 13, (PR-V) could be encrypted according to an appropriate public key.

Within the DRM architecture, the entering DRM-E server 320 must have a unique identity. Here it is to be understood that the DRM identity is likely apart from (PU-V, PR-V), although the DRM identity may also coincide with such (PU-V, PR-V) without departing from the spirit and scope of the present invention. Accordingly, to establish such identity, such DRM-E server 320 generates or obtains a new public/private key pair (PU-E, PR-E) (step 1403). Also, within the DRM architecture, the enrolling DRM-E server 320 should decide which entities can revoke the authority thereof to participate. Accordingly, such DRM-E server 320 identifies each such revoking entity in a list, perhaps by way of a public key thereof (step 1405).

The DRM-E server 320 should be able to establish to the enrolling DRM-R server 320 that such DRM-E server in fact owns the vouching certificate 1330 that was obtained at step 1401. Accordingly, the DRM-E server 320 either employs (PR-V) from the vouching certificate 1330 to encrypt (PU-E) to result in (PR-V(PU-E)) as an ownership indicia, or signs (PU-E) with (PR-V) to result in (PU-E) S (PR-V) as the ownership indicia (step 1407). In either instance, applying (PU-V) to decrypt (PU-E) or verify the signature establishes possession of (PR-V) and therefore the vouching certificate 1330.

Thus far, the DRM-E server 320 has the vouching certificate 1330, (PU-E) and (PR-E), the revocation authority list, and (PR-V(PU-E)) or (PU-E) S (PR-V) as the ownership indicia. To request enrollment, then, such DRM-E server 320 sends the vouching certificate 1330, (PU-E), the revocation authority list, and (PR-V(PU-E)) or (PU-E) S (PR-V) as the ownership indicia to the DRM-R server 320 (step 1409), and the DRM-R server 320 proceeds to enroll such requesting DRM-E server 320. Note that the request or a part thereof may be in the form of a certificate signed by (PR-E).

In particular, the DRM-R server 320 validates the vouching certificate 1330 based on the signature thereof by the trusted third party and the chain of certificates leading to the known root (step 1411). Thus, the DRM-R server 320 establishes that the DRM-E server 320 has been vouched for. Also, the DRM-R server 320 verifies the ownership indicia by applying (PU-V) from the request to either decrypt (PU-E) or verify the signature and thus establish possession of (PR-V) and therefore the vouching certificate 1330 in the request (step 1410). In addition, and significantly, the DRM-R server 320 performs any custom logic necessary to decide whether to honor the request (step 1413). Such custom logic may be any appropriate logic without departing from the spirit and scope of the present invention, and may for example include a background check on the DRM-E server 320 and/or its operator, a determination of whether the DRM-E server 320 has a current trusted component 18 and/or operating system or the like, a determination of whether the DRM-E server 320 is on a revocation list or other watch list, and the like.

Assuming the custom logic permits the request to be honored, then, and in one embodiment of the present invention, the DRM-R server 320 generates the enrollment certificate 1310 for the DRM-E server 320 (step 1415). In particular, and as seen in FIG. 13. the DRM-R server 320 incorporates within the enrollment certificate 1310:

- an identifier of the DRM-R server 320, such as a public key thereof (PU-R);
- an identifier of the DRM-E server 320, such as (PU-E);
- identifying indicia from the vouching certificate 1330 including the trusted third party that issued same, a serial number from the vouching certificate 1330, and the issuee as identified within the vouching certificate 1330;
- any validity range information specifying a range during which the enrollment certificate 1310 is valid, such as for example a date range;
- the revocation authority list;
- a signature based on a private key of the DRM-R server 320 (PR-R) corresponding to (PU-R);
- and any other appropriate information.

Such other appropriate information may include but is not limited to: the time the certificate was issued; an indication of what sort of DRM activities an enrolled server is allowed to perform such as for example all activities, account activation only, sign rights labels only, issue content licenses only, and combinations thereof; and an allowed time-range for performing DRM activities. Note that the allowed time-range is different from the validity range in that the current time must lie within the validity range to honor any certificate that includes the enrollment certificate 1310 in the certificate chain. In contrast, the issued time of child certificates must fall within allowed time-range of the parent certificate to perform DRM activities.

As should be appreciated, in generating the enrollment certificate 1310, the DRM-R server 320 may initially generate certificate information and then allow custom logic to generate additional information or modify existing information. Such custom logic may for example ensure that the DRM-R server 320 includes appropriate information, or may enforce pre-defined DRM architecture policy. Of course, the signature of the enrollment certificate 1310 is created after any such custom logic is performed. As should also be appreciated, the DRM-R server 320 attaches the chain of certificates 1320 that leads back to the trusted root authority to the generated enrollment certificate 1310 so that the generated enrollment certificate 1310 may be validated based on such chain of certificates 1320.

Note in particular that the identifying indicia from the vouching certificate 1330 as placed within the enrollment certificate 1310 will always travel with such enrollment certificate 1310 and acts as a bridge to the vouching certificate 1330. Thus, and again, such identifying indicia shows to the world that the DRM-R server 320 is relying on the trusted third party issuer of the vouching certificate 1330 to vouch for the DRM-E server 320, and the liability of such DRM-R server 320 for any bad acts of the DRM-E server 320 is mitigated.

Once the DRM-R server 320 has successfully generated the enrollment certificate 1310 with the attached chain of certificates 1320, the DRM-R server 320 then returns same to the requesting DRM-E server 320 (step 1417), and the now-enrolled DRM-E server 320 stores same in an appropriate location for future use (step 1419). As was alluded to above, (PU-E) in the enrollment certificate 1310 and the corresponding (PR-E) are the public I private key pair that the DRM-E server 320 will use as (PU-DRM) and (PR-DRM) when signing a rights label to produce an SRL 308, issuing an OLP certificate 810, and otherwise participating within the DRM architecture. Accordingly, such enrollment certificate 1310 and the chain of certificates 1320 in combination form the chain of certificates that are attached to such OLP certificate 810 and the like.

Sub-Enrollment

In one embodiment of the present invention, and turning now to FIG. 15, a knowing/trusting DRM-R server 320 sub-enrolls a DRM-E server 320 in the following manner.

Preliminary, it is to be appreciated that the DRM-E server 320 wishing to be sub-enrolled by the knowing/trusting DRM-R server 320 should still be required to identify itself to such DRM-R server 320 inasmuch as such knowledge or trust may not be complete. However, such identification requirement need not rise to the level of a proffer by a trusted third party inasmuch as the DRM-R server 320 does have some knowledge/trust of the DRM-E server. Accordingly, and in one embodiment of the present invention, the DRM-E server 320 obtains or is provided with some sort of credentials 1340 (FIG. 13) that are recognizable by and expected to be honored by the DRM-R server 320, and that identify the DRM-E server 320 to the satisfaction of the DRM-R server 320 (step 1501).

If both the DRM-R and DRM-E servers 320 are within the same organization, such credentials 1340 may be organization-based credentials, such as for example a network ID if both servers 320 are on a common network, a domain ID if both servers 320 share a common domain, or the like. If both the DRM-R and DRM-E servers 320 are not within the same organization, such credentials 1340 may still be a network ID if both servers 320 are on a common network, a domain ID if both servers 320 share a common domain, or the like, or may be other credentials such as for example credentials issued by a third party and recognized by the DRM-R server 320.

Note that in the present situation, the DRM-R server 320 is not relying on a trusted third party to vouch for the DRM-E server 320, and therefore the liability of such DRM-R server 320 for any bad acts of the DRM-E server 320 is not as mitigated. Nevertheless, the DRM-R server 320 is willing to take such a risk based on knowledge of or trust in the DRM-E server 320 to not in fact perform such bad acts.

As before, within the DRM architecture, the entering DRM-E server 320 must have a unique identity. Here it is to be understood that the DRM identity is likely apart from the credentials 1340, although the DRM identity may also coincide with the credentials 1340 without departing from the spirit and scope of the present invention. Accordingly, to establish such identity, such DRM-E server 320 generates or obtains a new public/private key pair (PU-E, PR-E) (step 1503). Also as before, within the DRM architecture, the sub-enrolling DRM-E server 320 should decide which entities can revoke the authority thereof to participate. Accordingly, such DRM-E server 320 identifies each such revoking entity in a list, perhaps by way of a public key thereof (step 1505).

Thus far, the DRM-E server 320 has the credentials 1340, (PU-E) and (PR-E), and the revocation authority list. To request sub-enrollment, then, such DRM-E server 320 sends the credentials 1340, (PU-E), and the revocation authority list to the DRM-R server 320 (step 1507), and the DRM-R server 320 proceeds to sub-enroll such requesting DRM-E server 320. Note that as before, the request or a part thereof may be in the form of a certificate signed by (PR-E).

In particular, the DRM-R server 320 validates the credentials 1340 based on whatever logic or resources are necessary and available to so validate (step 1509). Thus, the DRM-R server 320 establishes based on the validated credentials 1340 that the DRM-E server 320 is to be trusted to honor and obey the DRM architecture. In addition, and as before, the DRM-R server 320 performs any custom logic necessary to decide whether to honor the request (step 1511).

Assuming the custom logic permits the request to be honored, then, and in one embodiment of the present invention, the DRM-R server 320 generates a sub-enrollment certificate 1310 for the DRM-E server 320 (step 1513). In particular, and as seen in FIG. 13. the DRM-R server 320 incorporates within the sub-enrollment certificate 1310:

- an identifier of the DRM-R server 320, such as a public key thereof (PU-R);
- an identifier of the DRM-E server 320, such as (PU-E);
- the credentials 1340 or a reference thereto;
- any validity range information specifying a range during which the sub-enrollment certificate 1310 is valid, such as for example a date range;
- the revocation authority list;
- a signature based on a private key of the DRM-R server 320 (PR-R) corresponding to (PU-R);
- and any other appropriate information.

As before, in generating the sub-enrollment certificate 1310, the DRM-R server 320 may initially generate certificate information and then allow custom logic to generate additional information or modify existing information. Again, the signature of the sub-enrollment certificate 1310 is created after any such custom logic is performed. As before, the DRM-R server 320 attaches the chain of certificates 1320 that leads back to the trusted root authority to the generated sub-enrollment certificate 1310 so that the generated sub-enrollment certificate 1310 may be validated based on such chain of certificates 1320.

Note here that the credentials 1340 or reference thereto are not believed to be especially necessary, but may nevertheless be included for completeness. Note too that the sub-enrollment certificate 1310 contains no identifying indicia from a vouching certificate 1330 inasmuch as no vouching certificate was required in the present sub-enrollment scenario.

Once the DRM-R server 320 has successfully generated the sub-enrollment certificate 1310 with the attached chain of certificates 1320, the DRM-R server 320 then returns same to the requesting DRM-E server 320 (step 1515), and the now-sub-enrolled DRM-E server 320 stores same in an appropriate location for future use (step 1517). As before, (PU-E) in the sub-enrollment certificate 1310 and the corresponding (PR-E) are the public/private key pair that the DRM-E server 320 will use as (PU-DRM) and (PR-DRM) when signing a rights label to produce an SRL 308, issuing an OLP certificate 810, and otherwise participating within the DRM architecture. Accordingly, such sub-enrollment certificate 1310 and the chain of certificates 1320 in combination form the chain of certificates that are attached to such OLP certificate 810 and the like.

Conclusion

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.

In the present invention, a digital rights management (DRM) and enforcement architecture and method allow the controlled rendering or playing of arbitrary forms of digital content, where such control is flexible and definable by the content owner/developer of such digital content. The architecture allows and facilitates such controlled rendering, especially in an office or organization environment or the like where documents are to be shared amongst a defined group of individuals or classes of individuals. Such architecture allows content to be published without first gaining approval from a server and allows the publishing individual to issue itself a use license to render the published content without contacting the server for approval.

It should be appreciated that changes could be made to the embodiments described above without departing from the inventive concepts thereof. For example, if a license or rights label is signed based on rights data therein, such rights data need not necessarily be encrypted. Likewise, in requesting and constructing an enrollment or sub-enrollment certificate 1310, the revocation authority list and other similar information need not necessarily be employed. 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

1. A method for acquiring an off-line publishing (OLP) certificate by a first computing device, the OLP certificate issued by a server enrolled in a Digital Rights Management (DRM) system, the method comprising: requesting, by the first computing device, an OLP certificate from the enrolled server having an enrollment certificate, wherein the enrollment certificate comprises a public key of the enrolled server (PU-DRM) and revocation information;receiving the OLP certificate from the enrolled server, wherein the OLP certificate comprises a public key (PU-OLP) and a private key (PR-OLP), and wherein the OLP certificate is signed with a private key of the enrolled server (PR-DRM);encrypting content according to a content key (CK), wherein the content comprises one or more of: audio, video, text, data, and multimedia;encrypting the content key with the public key of the enrolled server (PU-DRM);generating rights data defining rules for rendering the encrypted content;signing the rights data and the encrypted content key with the private key (PR-OLP);concatenating the signed rights data and the encrypted content key to the encrypted content;forwarding, by the first computing device without contacting the enrolled server, the encrypted content concatenated with the signed rights data and the encrypted content key to a second computing device; andissuing, by the first computing device without contacting the enrolled server, a use license for accessing the encrypted content by the first computing device, wherein the use license is signed with the private key (PR-OLP).
2. The method as defined in claim 1, further comprising decrypting the encrypted content key using a private key of a publishing user (PR-ENTITY) to obtain a decrypted content key.
3. The method as defined in claim 2, further comprising decrypting the encrypted content using the decrypted content key.
4. The method as defined in claim 1, wherein the revocation information comprises a listing of revoking entities able to revoke authority of the enrolled server to provide DRM services.
5. The method as defined in claim 1, wherein the private key (PR-OLP) of the OLP certificate is encrypted with the public key of a publishing user (PU-ENTITY).
6. The method as defined in claim 1, wherein the enrollment certificate comprises a time-range wherein the enrolled server is authorized to provide DRM services.
7. The method as defined in claim 1, wherein the use license is based on the signed rights data published by the first computing device.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation application and claims priority to U.S. patent application Ser. No. 12/053,090, filed Mar. 21, 2008, entitled “Issuing a Publisher Use License Off-Line in a Digital Rights Management (DRM) System,” which application is a continuation application and claims priority to U.S. patent application Ser. No. 10/373,621 (now U.S. Pat. No. 7,370,212), filed Feb. 25, 2003, entitled “Issuing a Publisher Use License Off-Line in a Digital Rights Management (DRM) System,” which applications are incorporated herein by reference in their entirety. The following U.S. patent applications disclose subject matter that is related to the subject matter of the present application, and are hereby incorporated herein by reference in their entirety: U.S. patent application Ser. No. 10/185,527 (now U.S. Pat. No. 7,353,402), filed Jun. 28, 2002 under and entitled “Obtaining a Signed Rights Label (SRL) for Digital Content and Obtaining a Digital License Corresponding to the Content Based on the SRL in a Digital Rights Management System”; U.S. patent application Ser. No. 10/185,278 (now U.S. Pat. No. 7,549,060), filed Jun. 28, 2002 under and entitled “Using a Rights Template to Obtain a Signed Rights Label (SRL) for Digital Content in a Digital Rights Management System”; U.S. patent application Ser. No. 10/185,511 (now U.S. Pat. No. 7,891,007), filed Jun. 28, 2002 under and entitled “Systems And Methods For Issuing Usage Licenses For Digital Content And Services”; U.S. patent application Ser. No. 10/364,627 (now U.S. Pat. No. 7,577,999), filed Feb. 11, 2003 under and entitled “Publishing Digital Content Within an Organization in Accordance with a Digital Rights Management (DRM) System; U.S. patent application Ser. No. 10/364,115 (now Abandoned), filed Feb. 11, 2003 under and entitled “Publishing Digital Content Within an Organization in Accordance with a Digital Rights Management (DRM) System; and U.S. Pat. No. 7,308,573, issued Dec. 11, 2007 and entitled “Enrolling/Sub-Enrolling a Digital Rights Management (DRM) Server Into a DRM Architecture”.

US Referenced Citations (1015)

Number	Name	Date	Kind
3718906	Lightner	Feb 1973	A
4183085	Roberts	Jan 1980	A
4202051	Davida et al.	May 1980	A
4323921	Guillou	Apr 1982	A
4405829	Rivest	Sep 1983	A
4528643	Freeny, Jr.	Jul 1985	A
4529870	Chaum	Jul 1985	A
4558176	Arnold	Dec 1985	A
4620150	Germer	Oct 1986	A
4658093	Hellman	Apr 1987	A
4683553	Mollier	Jul 1987	A
4747139	Taaffe	May 1988	A
4750034	Lem	Jun 1988	A
4799259	Ogrodski	Jan 1989	A
4817094	Lebizay	Mar 1989	A
4827508	Shear	May 1989	A
4855730	Venners	Aug 1989	A
4855922	Huddleston	Aug 1989	A
4857999	Welsh	Aug 1989	A
4910692	Outram	Mar 1990	A
4916738	Chandra et al.	Apr 1990	A
4926479	Goldwasser et al.	May 1990	A
4953209	Ryder, Sr. et al.	Aug 1990	A
4959774	Davis	Sep 1990	A
4967273	Greenberg	Oct 1990	A
4977594	Shear	Dec 1990	A
5001752	Fischer	Mar 1991	A
5008935	Roberts	Apr 1991	A
5012514	Renton	Apr 1991	A
5029206	Marino et al.	Jul 1991	A
5047928	Wiedemer	Sep 1991	A
5048086	Bianco et al.	Sep 1991	A
5050213	Shear	Sep 1991	A
5103392	Mori	Apr 1992	A
5103476	Waite et al.	Apr 1992	A
5109413	Comerford et al.	Apr 1992	A
5117457	Comerford et al.	May 1992	A
5124117	Tatebayashi et al.	Jun 1992	A
5142578	Matyas et al.	Aug 1992	A
5159633	Nakamura	Oct 1992	A
5163092	McNesby et al.	Nov 1992	A
5177790	Hazard	Jan 1993	A
5193573	Chronister	Mar 1993	A
5204897	Wyman	Apr 1993	A
5222134	Waite et al.	Jun 1993	A
5241602	Lee et al.	Aug 1993	A
5249184	Woest	Sep 1993	A
5257282	Adkisson et al.	Oct 1993	A
5260999	Wyman	Nov 1993	A
5261002	Perlman et al.	Nov 1993	A
5267316	Merino Gonzalez et al.	Nov 1993	A
5269019	Peterson	Dec 1993	A
5274368	Breeden	Dec 1993	A
5287537	Newmark et al.	Feb 1994	A
5301268	Takeda	Apr 1994	A
5303370	Brosh	Apr 1994	A
5319705	Halter et al.	Jun 1994	A
5327365	Fujisaki et al.	Jul 1994	A
5335346	Fabbio	Aug 1994	A
5355161	Bird	Oct 1994	A
5369262	Dvorkis	Nov 1994	A
5406630	Piosenka	Apr 1995	A
5410598	Shear	Apr 1995	A
5414861	Horning	May 1995	A
5437040	Campbell	Jul 1995	A
5438508	Wyman	Aug 1995	A
5440640	Anshel et al.	Aug 1995	A
5442704	Holtey	Aug 1995	A
5444780	Hartman, Jr.	Aug 1995	A
5444782	Adams et al.	Aug 1995	A
5448045	Clark	Sep 1995	A
5457699	Bode	Oct 1995	A
5459867	Adams	Oct 1995	A
5469506	Berson et al.	Nov 1995	A
5473692	Davis	Dec 1995	A
5479514	Klonowski	Dec 1995	A
5485577	Eyer et al.	Jan 1996	A
5490216	Richardson, III	Feb 1996	A
5500897	Hartman, Jr.	Mar 1996	A
5502766	Boebert et al.	Mar 1996	A
5509070	Schull	Apr 1996	A
5513319	Finch	Apr 1996	A
5522040	Hofsäss	May 1996	A
5530846	Strong	Jun 1996	A
5535276	Ganesan	Jul 1996	A
5552776	Wade	Sep 1996	A
5553139	Ross et al.	Sep 1996	A
5553143	Ross et al.	Sep 1996	A
5557765	Lipner et al.	Sep 1996	A
5563799	Brehmer	Oct 1996	A
5568552	Davis	Oct 1996	A
5570465	Tsakanikas	Oct 1996	A
5586291	Lasker	Dec 1996	A
5588060	Aziz	Dec 1996	A
5604755	Bertin et al.	Feb 1997	A
5629980	Stefik et al.	May 1997	A
5634012	Stefik et al.	May 1997	A
5636292	Rhoads	Jun 1997	A
5638443	Stefik et al.	Jun 1997	A
5638513	Ananda	Jun 1997	A
5666416	Micali	Sep 1997	A
5668877	Aziz	Sep 1997	A
5671412	Christiano	Sep 1997	A
5673316	Auerbach et al.	Sep 1997	A
5708709	Rose	Jan 1998	A
5710706	Märkl	Jan 1998	A
5710887	Chelliah et al.	Jan 1998	A
5715403	Stefik	Feb 1998	A
5717757	Micali	Feb 1998	A
5721788	Powell	Feb 1998	A
5724425	Chang et al.	Mar 1998	A
5726898	Jacobs	Mar 1998	A
5740246	Saito	Apr 1998	A
5745573	Lipner et al.	Apr 1998	A
5745879	Wyman	Apr 1998	A
5754657	Schipper et al.	May 1998	A
5754763	Bereiter	May 1998	A
5757908	Cooper et al.	May 1998	A
5758068	Brandt et al.	May 1998	A
5758069	Olsen	May 1998	A
5761669	Montague et al.	Jun 1998	A
5763832	Anselm	Jun 1998	A
5764275	Lappington	Jun 1998	A
5765152	Erickson	Jun 1998	A
5768382	Schneier	Jun 1998	A
5771354	Crawford	Jun 1998	A
5774870	Storey	Jun 1998	A
5787179	Ogawa et al.	Jul 1998	A
5790664	Coley et al.	Aug 1998	A
5793839	Farris	Aug 1998	A
5793868	Micali	Aug 1998	A
5796967	Filepp et al.	Aug 1998	A
5799088	Raike	Aug 1998	A
5799090	Angert	Aug 1998	A
5802592	Chess	Sep 1998	A
5809144	Sirbu et al.	Sep 1998	A
5809145	Byrne et al.	Sep 1998	A
5812857	Nelson et al.	Sep 1998	A
5825876	Peterson, Jr.	Oct 1998	A
5825877	Dan	Oct 1998	A
5825879	Davis	Oct 1998	A
5825883	Archibald	Oct 1998	A
5841865	Sudia	Nov 1998	A
5844986	Davis	Dec 1998	A
5845065	Conte	Dec 1998	A
5845281	Benson et al.	Dec 1998	A
5852665	Gressel et al.	Dec 1998	A
5864620	Pettitt et al.	Jan 1999	A
5872846	Ichikawa	Feb 1999	A
5875236	Jankowitz	Feb 1999	A
5883670	Sporer	Mar 1999	A
5883955	Ronning	Mar 1999	A
5883958	Ishiguro et al.	Mar 1999	A
5892900	Ginter et al.	Apr 1999	A
5892906	Chou	Apr 1999	A
5893086	Schmuck	Apr 1999	A
5905799	Ganesan	May 1999	A
5910987	Ginter et al.	Jun 1999	A
5915025	Saito et al.	Jun 1999	A
5917912	Ginter et al.	Jun 1999	A
5925127	Ahmad	Jul 1999	A
5926624	Katz et al.	Jul 1999	A
5933498	Schneck et al.	Aug 1999	A
5934422	Steed	Aug 1999	A
5935248	Kuroda	Aug 1999	A
5943248	Clapp	Aug 1999	A
5943422	Van Wie et al.	Aug 1999	A
5948061	Merriman	Sep 1999	A
5949877	Traw	Sep 1999	A
5949879	Benson et al.	Sep 1999	A
5951642	Onoe et al.	Sep 1999	A
5953420	Matyas, Jr. et al.	Sep 1999	A
5953502	Helbig, Sr.	Sep 1999	A
5956408	Arnold	Sep 1999	A
5958050	Barnes et al.	Sep 1999	A
5982891	Ginter et al.	Nov 1999	A
5982898	Hsu et al.	Nov 1999	A
5983238	Becker et al.	Nov 1999	A
5983350	Minear et al.	Nov 1999	A
5991399	Graunke et al.	Nov 1999	A
5991406	Lipner et al.	Nov 1999	A
5994710	Knee	Nov 1999	A
5995625	Sudia et al.	Nov 1999	A
5999629	Maher et al.	Dec 1999	A
5999921	Arsenault	Dec 1999	A
6002772	Saito	Dec 1999	A
6005945	Whitehouse	Dec 1999	A
6006332	Rabne et al.	Dec 1999	A
6009177	Sudia	Dec 1999	A
6021438	Duvvoori	Feb 2000	A
6023510	Epstein	Feb 2000	A
6023766	Yamamura	Feb 2000	A
6026293	Osborn	Feb 2000	A
6028596	Oka	Feb 2000	A
6047242	Benson	Apr 2000	A
6049789	Frison	Apr 2000	A
6049878	Caronni et al.	Apr 2000	A
6058188	Chandersekaran et al.	May 2000	A
6058476	Matsuzaki	May 2000	A
6061451	Muratani et al.	May 2000	A
6061794	Angelo	May 2000	A
6069647	Sullivan et al.	May 2000	A
6072874	Shin et al.	Jun 2000	A
6073124	Krishnan et al.	Jun 2000	A
6078667	Johnson	Jun 2000	A
6078909	Knutson	Jun 2000	A
6085976	Sehr	Jul 2000	A
6094486	Marchant	Jul 2000	A
6094487	Butler et al.	Jul 2000	A
6101606	Diersch et al.	Aug 2000	A
6105069	Franklin	Aug 2000	A
6112181	Shear et al.	Aug 2000	A
6119229	Martinez	Sep 2000	A
6122741	Patterson et al.	Sep 2000	A
6131162	Yoshiura et al.	Oct 2000	A
6138236	Mirov et al.	Oct 2000	A
6141754	Choy	Oct 2000	A
6147773	Taylor	Nov 2000	A
6148417	da Silva	Nov 2000	A
6151676	Cuccia et al.	Nov 2000	A
6157721	Shear et al.	Dec 2000	A
6158011	Chen et al.	Dec 2000	A
6158657	Hall, III et al.	Dec 2000	A
6163512	Jeun	Dec 2000	A
6167358	Othmer et al.	Dec 2000	A
6170060	Mott et al.	Jan 2001	B1
6175825	Fruechtel	Jan 2001	B1
6182219	Feldbau	Jan 2001	B1
6185678	Arbaugh	Feb 2001	B1
6188995	Garst et al.	Feb 2001	B1
6189146	Misra et al.	Feb 2001	B1
6192392	Ginter	Feb 2001	B1
6199068	Carpenter	Mar 2001	B1
6199169	Voth	Mar 2001	B1
6202151	Musgrave et al.	Mar 2001	B1
6212634	Geer et al.	Apr 2001	B1
6219652	Carter et al.	Apr 2001	B1
6219788	Flavin et al.	Apr 2001	B1
6223291	Puhl	Apr 2001	B1
6226618	Downs et al.	May 2001	B1
6226747	Larsson et al.	May 2001	B1
6230185	Salas et al.	May 2001	B1
6230272	Lockhart et al.	May 2001	B1
6233567	Cohen	May 2001	B1
6233600	Salas et al.	May 2001	B1
6233684	Stefik et al.	May 2001	B1
6233685	Smith	May 2001	B1
6236728	Marchant	May 2001	B1
6237098	Libicki	May 2001	B1
6240183	Marchant	May 2001	B1
6243439	Arai	Jun 2001	B1
6243470	Coppersmith	Jun 2001	B1
6243692	Floyd et al.	Jun 2001	B1
6253193	Ginter et al.	Jun 2001	B1
6253224	Brice, Jr.	Jun 2001	B1
6256774	O'Leary et al.	Jul 2001	B1
6260141	Park	Jul 2001	B1
6263313	Milsted et al.	Jul 2001	B1
6263431	Lovelace	Jul 2001	B1
6266420	Langford et al.	Jul 2001	B1
6272469	Koritzinsky et al.	Aug 2001	B1
6275586	Kelly	Aug 2001	B1
6279111	Jensenworth	Aug 2001	B1
6279156	Amberg et al.	Aug 2001	B1
6286051	Becker et al.	Sep 2001	B1
6289319	Lockwood	Sep 2001	B1
6289452	Arnold et al.	Sep 2001	B1
6295577	Anderson	Sep 2001	B1
6298446	Schreiber	Oct 2001	B1
6301361	Mischenko et al.	Oct 2001	B1
6301660	Benson	Oct 2001	B1
6303924	Adan	Oct 2001	B1
6304915	Nguyen et al.	Oct 2001	B1
6304973	Williams	Oct 2001	B1
6314408	Salas et al.	Nov 2001	B1
6314409	Schneck	Nov 2001	B2
6321314	Van Dyke	Nov 2001	B1
6321335	Chu	Nov 2001	B1
6324287	Angert	Nov 2001	B1
6324683	Fuh et al.	Nov 2001	B1
6327652	England	Dec 2001	B1
6330670	England et al.	Dec 2001	B1
6332025	Takahashi et al.	Dec 2001	B2
6334189	Granger	Dec 2001	B1
6335972	Chandersekaran et al.	Jan 2002	B1
6343280	Clark	Jan 2002	B2
6345256	Milsted et al.	Feb 2002	B1
6345294	O'Toole	Feb 2002	B1
6353888	Kakehi et al.	Mar 2002	B1
6360320	Ishiguro et al.	Mar 2002	B1
6363488	Ginter	Mar 2002	B1
6367017	Gray	Apr 2002	B1
6373047	Adan	Apr 2002	B1
6374354	Walmsley et al.	Apr 2002	B1
6374355	Patel	Apr 2002	B1
6374357	Mohammed et al.	Apr 2002	B1
6385596	Wiser et al.	May 2002	B1
6385727	Cassagnol	May 2002	B1
6389535	Thomlinson et al.	May 2002	B1
6389537	Davis	May 2002	B1
6389538	Gruse et al.	May 2002	B1
6389541	Patterson	May 2002	B1
6393125	Barbir	May 2002	B1
6393427	Vu	May 2002	B1
6397259	Lincke et al.	May 2002	B1
6398245	Gruse et al.	Jun 2002	B1
6404888	Barbir	Jun 2002	B1
6405923	Seysen	Jun 2002	B1
6408170	Schmidt	Jun 2002	B1
6409089	Eskicioglu	Jun 2002	B1
6411941	Mullor et al.	Jun 2002	B1
6418421	Hurtado et al.	Jul 2002	B1
6424714	Wasilewski	Jul 2002	B1
6424715	Saito	Jul 2002	B1
6425081	Iwamura	Jul 2002	B1
6438690	Patel et al.	Aug 2002	B1
6441813	Ishibashi	Aug 2002	B1
6442529	Krishan	Aug 2002	B1
6442690	Howard et al.	Aug 2002	B1
6446207	Vanstone et al.	Sep 2002	B1
6449719	Baker	Sep 2002	B1
6460140	Schoch	Oct 2002	B1
6463534	Geiger	Oct 2002	B1
6475180	Peterson et al.	Nov 2002	B2
6477649	Kambayashi	Nov 2002	B2
6490680	Scheidt	Dec 2002	B1
6496858	Frailong	Dec 2002	B1
6502079	Ball et al.	Dec 2002	B1
6505300	Chan et al.	Jan 2003	B2
6507909	Zurko et al.	Jan 2003	B1
6523119	Pavlin et al.	Feb 2003	B2
6527638	Walker et al.	Mar 2003	B1
6530023	Nissl	Mar 2003	B1
6532451	Schell et al.	Mar 2003	B1
6539364	Moribatake et al.	Mar 2003	B2
6549626	Al-Salqan	Apr 2003	B1
6550011	Sims, III	Apr 2003	B1
6557104	Vu et al.	Apr 2003	B2
6557105	Tardo et al.	Apr 2003	B1
6560581	Fox et al.	May 2003	B1
6560651	Katz et al.	May 2003	B2
6564995	Montgomery	May 2003	B1
6567793	Hicks	May 2003	B1
6571216	Garg et al.	May 2003	B1
6574609	Downs et al.	Jun 2003	B1
6574611	Matsuyama et al.	Jun 2003	B1
6574612	Baratti et al.	Jun 2003	B1
6581162	Angelo et al.	Jun 2003	B1
6581331	Kral	Jun 2003	B1
6585158	Norskog	Jul 2003	B2
6587684	Hsu et al.	Jul 2003	B1
6587837	Spagna et al.	Jul 2003	B1
6609201	Folmsbee	Aug 2003	B1
6615349	Hair	Sep 2003	B1
6615350	Schell et al.	Sep 2003	B1
6625729	Angelo	Sep 2003	B1
6631478	Wang	Oct 2003	B1
6640304	Ginter et al.	Oct 2003	B2
6646244	Aas	Nov 2003	B2
6654389	Brunheroto et al.	Nov 2003	B1
6664948	Crane	Dec 2003	B2
6665303	Saito et al.	Dec 2003	B1
6665409	Rao	Dec 2003	B1
6668246	Yeung et al.	Dec 2003	B1
6671737	Snowdon et al.	Dec 2003	B1
6671803	Pasieka	Dec 2003	B1
6671813	Ananda	Dec 2003	B2
6678828	Pham et al.	Jan 2004	B1
6681017	Matias et al.	Jan 2004	B1
6684198	Shimizu et al.	Jan 2004	B1
6684332	Douglas	Jan 2004	B1
6690556	Smola	Feb 2004	B2
6694000	Ung	Feb 2004	B2
6697945	Ishiguro et al.	Feb 2004	B2
6701433	Schell et al.	Mar 2004	B1
6704873	Underwood	Mar 2004	B1
6708176	Strunk	Mar 2004	B2
6711263	Nordenstam et al.	Mar 2004	B1
6714921	Stefik et al.	Mar 2004	B2
6715049	Hayakashi	Mar 2004	B1
6716652	Ortlieb	Apr 2004	B1
6728880	Sites	Apr 2004	B1
6738810	Kramer	May 2004	B1
6741851	Lee et al.	May 2004	B1
6763458	Watanabe	Jul 2004	B1
6765470	Shinzaki	Jul 2004	B2
6772340	Peinado et al.	Aug 2004	B1
6775655	Peinado et al.	Aug 2004	B1
6781956	Cheung	Aug 2004	B1
6791157	Casto	Sep 2004	B1
6792531	Heiden	Sep 2004	B2
6792537	Liu et al.	Sep 2004	B1
6799270	Bull et al.	Sep 2004	B1
6801998	Hanna et al.	Oct 2004	B1
6807542	Bantz et al.	Oct 2004	B2
6816596	Peinado et al.	Nov 2004	B1
6816809	Circenis	Nov 2004	B2
6816900	Vogel	Nov 2004	B1
6820063	England et al.	Nov 2004	B1
6826606	Freeman	Nov 2004	B2
6826690	Hind	Nov 2004	B1
6829708	Peinado et al.	Dec 2004	B1
6832319	Bell et al.	Dec 2004	B1
6834352	Shin	Dec 2004	B2
6839841	Medvinsky	Jan 2005	B1
6844871	Hinckley	Jan 2005	B1
6847942	Land	Jan 2005	B1
6850252	Hoffberg	Feb 2005	B1
6851051	Bolle	Feb 2005	B1
6856997	Lee et al.	Feb 2005	B2
6859790	Nonaka et al.	Feb 2005	B1
6868433	Philyaw	Mar 2005	B1
6871283	Zurko	Mar 2005	B1
6873975	Hatakeyama et al.	Mar 2005	B1
6889246	Kawamoto et al.	May 2005	B1
6895504	Zhang	May 2005	B1
6898286	Murray	May 2005	B2
6918034	Sengodan et al.	Jul 2005	B1
6920567	Doherty et al.	Jul 2005	B1
6922724	Freeman	Jul 2005	B1
6934840	Rich et al.	Aug 2005	B2
6934942	Chilimbi	Aug 2005	B1
6948073	England et al.	Sep 2005	B2
6954728	Kusumoto	Oct 2005	B1
6957186	Guheen	Oct 2005	B1
6959288	Medina et al.	Oct 2005	B1
6959290	Stefik et al.	Oct 2005	B2
6959291	Armstrong	Oct 2005	B1
6961426	Vesely	Nov 2005	B2
6961858	Fransdonk	Nov 2005	B2
6973444	Blinn et al.	Dec 2005	B1
6976162	Ellison	Dec 2005	B1
6976163	Hind	Dec 2005	B1
6978367	Hind et al.	Dec 2005	B1
6983049	Wee et al.	Jan 2006	B2
6983050	Yacobi	Jan 2006	B1
6986042	Griffin	Jan 2006	B2
6990174	Eskelinen	Jan 2006	B2
6993137	Fransdonk	Jan 2006	B2
6993648	Goodman	Jan 2006	B2
7000100	Lacombe	Feb 2006	B2
7000829	Harris	Feb 2006	B1
7006633	Reece	Feb 2006	B1
7010032	Kikuchi et al.	Mar 2006	B1
7010808	Leung et al.	Mar 2006	B1
7013384	Challener	Mar 2006	B2
7016498	Peinado et al.	Mar 2006	B2
7017188	Schmeidler et al.	Mar 2006	B1
7020704	Lipscomb et al.	Mar 2006	B1
7020781	Saw et al.	Mar 2006	B1
7024393	Peinado et al.	Apr 2006	B1
7028149	Grawrock	Apr 2006	B2
7028180	Aull	Apr 2006	B1
7036011	Grimes et al.	Apr 2006	B2
7043633	Fink	May 2006	B1
7047222	Bush	May 2006	B1
7047404	Doonan et al.	May 2006	B1
7051005	Peinado	May 2006	B1
7052530	Edlund	May 2006	B2
7054468	Yang	May 2006	B2
7055169	Delpuch	May 2006	B2
7058819	Okaue	Jun 2006	B2
7069442	Sutton, II	Jun 2006	B2
7069595	Cognigni	Jun 2006	B2
7073056	Kocher	Jul 2006	B2
7073063	Peinado	Jul 2006	B2
7076652	Ginter	Jul 2006	B2
7080039	Marsh	Jul 2006	B1
7080043	Chase, Jr. et al.	Jul 2006	B2
7089594	Lal et al.	Aug 2006	B2
7095852	Wack	Aug 2006	B2
7096469	Kubala	Aug 2006	B1
7097357	Johnson	Aug 2006	B2
7103574	Peinado et al.	Sep 2006	B1
7107462	Fransdonk	Sep 2006	B2
7113912	Stefik	Sep 2006	B2
7116969	Park	Oct 2006	B2
7117183	Blair	Oct 2006	B2
7120250	Candelore	Oct 2006	B2
7121460	Parsons	Oct 2006	B1
7123608	Scott	Oct 2006	B1
7124938	Marsh	Oct 2006	B1
7127513	Karger et al.	Oct 2006	B2
7127579	Zimmer	Oct 2006	B2
7130951	Christie	Oct 2006	B1
7133846	Ginter et al.	Nov 2006	B1
7136838	Peinado et al.	Nov 2006	B1
7136945	Gibbs et al.	Nov 2006	B2
7143066	Shear et al.	Nov 2006	B2
7143297	Buchheit et al.	Nov 2006	B2
7145919	Krishnarajah et al.	Dec 2006	B2
7146504	Parks et al.	Dec 2006	B2
7162645	Iguchi	Jan 2007	B2
7171539	Mansell	Jan 2007	B2
7171662	Misra et al.	Jan 2007	B1
7174320	Rothrock	Feb 2007	B2
7174452	Carr	Feb 2007	B2
7174457	England	Feb 2007	B1
7200760	Riebe	Apr 2007	B2
7203966	Abburi et al.	Apr 2007	B2
7207039	Komarla	Apr 2007	B2
7213005	Mourad et al.	May 2007	B2
7213266	Maher	May 2007	B1
7216363	Serkowski et al.	May 2007	B2
7216368	Ishiguro	May 2007	B2
7219842	Wang et al.	May 2007	B2
7222062	Goud	May 2007	B2
7224805	Hurst	May 2007	B2
7228437	Spagna et al.	Jun 2007	B2
7233948	Shamoon	Jun 2007	B1
7234144	Wilt	Jun 2007	B2
7236455	Proudler	Jun 2007	B1
7243366	Medvinsky et al.	Jul 2007	B2
7254836	Alkove	Aug 2007	B2
7260721	Tanaka	Aug 2007	B2
7266569	Cutter et al.	Sep 2007	B2
7266714	Davies et al.	Sep 2007	B2
7275159	Hull et al.	Sep 2007	B2
7278165	Molaro	Oct 2007	B2
7278168	Chaudhury et al.	Oct 2007	B1
7287280	Young	Oct 2007	B2
7296154	Evans	Nov 2007	B2
7296296	Dunbar	Nov 2007	B2
7299292	Morten et al.	Nov 2007	B2
7299358	Chateau	Nov 2007	B2
7308573	Kostal et al.	Dec 2007	B2
7310732	Matsuyama	Dec 2007	B2
7315941	Ramzan	Jan 2008	B2
7319579	Peinado et al.	Jan 2008	B2
7319759	Peinado et al.	Jan 2008	B1
7325139	Ishiguro et al.	Jan 2008	B2
7336791	Ishiguro	Feb 2008	B2
7343496	Hsiang	Mar 2008	B1
7353209	Peinado	Apr 2008	B1
7353402	Bourne et al.	Apr 2008	B2
7356709	Gunyakti	Apr 2008	B2
7359807	Frank	Apr 2008	B2
7360253	Frank	Apr 2008	B2
7370212	Bourne et al.	May 2008	B2
7376976	Fierstein	May 2008	B2
7382883	Cross	Jun 2008	B2
7383205	Peinado	Jun 2008	B1
7392429	Frank	Jun 2008	B2
7395245	Okamoto et al.	Jul 2008	B2
7395452	Nicholson et al.	Jul 2008	B2
7406446	Frank	Jul 2008	B2
7421413	Frank	Sep 2008	B2
7426752	Agrawal	Sep 2008	B2
7441121	Cutter et al.	Oct 2008	B2
7441246	Auerbach	Oct 2008	B2
7451202	Nakahara	Nov 2008	B2
7461249	Pearson	Dec 2008	B1
7464103	Siu	Dec 2008	B2
7475137	Holden et al.	Jan 2009	B2
7484103	Woo et al.	Jan 2009	B2
7490356	Lieblich	Feb 2009	B2
7493487	Phillips	Feb 2009	B2
7494277	Setala	Feb 2009	B2
7500267	McKune	Mar 2009	B2
7502945	Bourne et al.	Mar 2009	B2
7519816	Phillips	Apr 2009	B2
7526649	Wiseman	Apr 2009	B2
7529927	Peinado et al.	May 2009	B2
7539863	Phillips et al.	May 2009	B2
7540024	Phillips et al.	May 2009	B2
7549060	Bourne et al.	Jun 2009	B2
7552331	Evans	Jun 2009	B2
7558463	Jain	Jul 2009	B2
7562220	Frank	Jul 2009	B2
7565325	Lenard	Jul 2009	B2
7568096	Evans	Jul 2009	B2
7584502	Alkove	Sep 2009	B2
7590841	Sherwani	Sep 2009	B2
7596784	Abrams	Sep 2009	B2
7610631	Frank	Oct 2009	B2
7617401	Marsh	Nov 2009	B2
7644239	Ergan	Jan 2010	B2
7653943	Evans	Jan 2010	B2
7665143	Havens	Feb 2010	B2
7669056	Frank	Feb 2010	B2
7676846	Robert et al.	Mar 2010	B2
7680744	Blinn	Mar 2010	B2
7694153	Ahdout	Apr 2010	B2
7703141	Alkove	Apr 2010	B2
7739505	Reneris	Jun 2010	B2
7752674	Evans	Jul 2010	B2
7770205	Frank	Aug 2010	B2
7809646	Rose	Oct 2010	B2
7810163	Evans	Oct 2010	B2
7814532	Cromer	Oct 2010	B2
7856404	Evans et al.	Dec 2010	B2
7877607	Circenis	Jan 2011	B2
7891007	Waxman	Feb 2011	B2
7900140	Mohammed	Mar 2011	B2
7903117	Howell	Mar 2011	B2
7958029	Bobich	Jun 2011	B1
7979721	Westerinen	Jul 2011	B2
8060923	Cutter	Nov 2011	B2
8074287	Barde	Dec 2011	B2
20010005201	Digiorgio et al.	Jun 2001	A1
20010010076	Wray	Jul 2001	A1
20010011253	Coley et al.	Aug 2001	A1
20010021252	Carter	Sep 2001	A1
20010034711	Tashenberg	Oct 2001	A1
20010044782	Hughes	Nov 2001	A1
20010049667	Moribatake et al.	Dec 2001	A1
20010051996	Cooper et al.	Dec 2001	A1
20010052077	Fung et al.	Dec 2001	A1
20010053223	Ishibashi et al.	Dec 2001	A1
20010056413	Suzuki et al.	Dec 2001	A1
20010056539	Pavlin et al.	Dec 2001	A1
20020002597	Morrell, Jr.	Jan 2002	A1
20020002674	Grimes et al.	Jan 2002	A1
20020004773	Xu et al.	Jan 2002	A1
20020006204	England et al.	Jan 2002	A1
20020007310	Long	Jan 2002	A1
20020007454	Tarpenning et al.	Jan 2002	A1
20020007456	Peinado et al.	Jan 2002	A1
20020013772	Peinado	Jan 2002	A1
20020018566	Kawatsura et al.	Feb 2002	A1
20020019814	Ganesan	Feb 2002	A1
20020023212	Proudler	Feb 2002	A1
20020026574	Watanabe et al.	Feb 2002	A1
20020038231	Hasebe	Mar 2002	A1
20020044654	Maeda et al.	Apr 2002	A1
20020046098	Maggio	Apr 2002	A1
20020048369	Ginter et al.	Apr 2002	A1
20020049679	Russell et al.	Apr 2002	A1
20020055906	Katz	May 2002	A1
20020056042	van der Kaay	May 2002	A1
20020056747	Matsuyama et al.	May 2002	A1
20020063933	Maeda et al.	May 2002	A1
20020065781	Hillegass et al.	May 2002	A1
20020067767	Sugahara	Jun 2002	A1
20020073068	Guha	Jun 2002	A1
20020083319	Ishiguro et al.	Jun 2002	A1
20020091569	Kitaura	Jul 2002	A1
20020095603	Godwin	Jul 2002	A1
20020107701	Batty	Aug 2002	A1
20020107806	Higashi et al.	Aug 2002	A1
20020108050	Raley et al.	Aug 2002	A1
20020111916	Coronna	Aug 2002	A1
20020112171	Ginter et al.	Aug 2002	A1
20020118835	Uemura	Aug 2002	A1
20020123964	Kramer	Sep 2002	A1
20020123968	Okayama et al.	Sep 2002	A1
20020124212	Nitschke	Sep 2002	A1
20020129359	Lichner	Sep 2002	A1
20020138549	Urien	Sep 2002	A1
20020141451	Gates	Oct 2002	A1
20020144131	Spacey	Oct 2002	A1
20020147601	Fagan	Oct 2002	A1
20020147782	Dimitrova	Oct 2002	A1
20020147912	Shmueli	Oct 2002	A1
20020152393	Thoma et al.	Oct 2002	A1
20020156743	DeTreville	Oct 2002	A1
20020157002	Messerges et al.	Oct 2002	A1
20020166056	Johnson et al.	Nov 2002	A1
20020169954	Bandini et al.	Nov 2002	A1
20020169974	McKune	Nov 2002	A1
20020178071	Walker	Nov 2002	A1
20020184482	Lacombe	Dec 2002	A1
20020184508	Bialick	Dec 2002	A1
20020184515	Oho et al.	Dec 2002	A1
20020186843	Weinstein et al.	Dec 2002	A1
20020190876	Lai et al.	Dec 2002	A1
20020193101	McAlinden	Dec 2002	A1
20020194132	Pearson	Dec 2002	A1
20020194474	Natsuno et al.	Dec 2002	A1
20020198845	Lao et al.	Dec 2002	A1
20020198846	Lao	Dec 2002	A1
20030005135	Inoue	Jan 2003	A1
20030005335	Watanabe	Jan 2003	A1
20030014323	Scheer	Jan 2003	A1
20030014496	Spencer et al.	Jan 2003	A1
20030018491	Nakahara et al.	Jan 2003	A1
20030021416	Brown	Jan 2003	A1
20030023564	Padhye et al.	Jan 2003	A1
20030027549	Kiel	Feb 2003	A1
20030028454	Ooho et al.	Feb 2003	A1
20030028490	Miura et al.	Feb 2003	A1
20030035409	Wang	Feb 2003	A1
20030037246	Goodman	Feb 2003	A1
20030037261	Meffert et al.	Feb 2003	A1
20030040960	Eckmann	Feb 2003	A1
20030041008	Grey et al.	Feb 2003	A1
20030041257	Wee et al.	Feb 2003	A1
20030046026	Levy	Mar 2003	A1
20030046238	Nonaka et al.	Mar 2003	A1
20030048473	Rosen	Mar 2003	A1
20030053630	Elliott et al.	Mar 2003	A1
20030056107	Cammack	Mar 2003	A1
20030056118	Troyansky et al.	Mar 2003	A1
20030063750	Medvinsky	Apr 2003	A1
20030065918	Willey	Apr 2003	A1
20030069854	Hsu et al.	Apr 2003	A1
20030069981	Trovato	Apr 2003	A1
20030078853	Peinado et al.	Apr 2003	A1
20030079038	Robbin et al.	Apr 2003	A1
20030081592	Krishnarajah et al.	May 2003	A1
20030084104	Salem et al.	May 2003	A1
20030084278	Cromer	May 2003	A1
20030084285	Cromer	May 2003	A1
20030084306	Abburi et al.	May 2003	A1
20030084337	Simionescu	May 2003	A1
20030084352	Schwartz	May 2003	A1
20030088500	Shinohara	May 2003	A1
20030093694	Medvinsky	May 2003	A1
20030097596	Muratov	May 2003	A1
20030108164	Laurin et al.	Jun 2003	A1
20030110388	Pavlin	Jun 2003	A1
20030115457	Wildish et al.	Jun 2003	A1
20030115458	Song	Jun 2003	A1
20030120935	Teal	Jun 2003	A1
20030126519	Odorcic	Jul 2003	A1
20030131252	Barton	Jul 2003	A1
20030131353	Blom et al.	Jul 2003	A1
20030133576	Grumiaux	Jul 2003	A1
20030135380	Lehr	Jul 2003	A1
20030149670	Cronce	Aug 2003	A1
20030149671	Yamamoto	Aug 2003	A1
20030154393	Young	Aug 2003	A1
20030156572	Hui	Aug 2003	A1
20030156719	Cronce	Aug 2003	A1
20030161473	Fransdonk	Aug 2003	A1
20030163383	Engelhart	Aug 2003	A1
20030163712	LaMothe	Aug 2003	A1
20030167392	Fransdonk	Sep 2003	A1
20030172345	Engelsberg et al.	Sep 2003	A1
20030172376	Coffin, III et al.	Sep 2003	A1
20030185395	Lee	Oct 2003	A1
20030185399	Ishiguro	Oct 2003	A1
20030187801	Chase et al.	Oct 2003	A1
20030188117	Yoshino et al.	Oct 2003	A1
20030188165	Sutton, II	Oct 2003	A1
20030188179	Challener	Oct 2003	A1
20030194092	Parks et al.	Oct 2003	A1
20030194094	Lampson et al.	Oct 2003	A1
20030196102	McCarroll	Oct 2003	A1
20030196106	Erfani	Oct 2003	A1
20030198350	Foster et al.	Oct 2003	A1
20030200336	Pal	Oct 2003	A1
20030204738	Morgan	Oct 2003	A1
20030208338	Challener	Nov 2003	A1
20030208573	Harrison	Nov 2003	A1
20030229702	Hensbergen	Dec 2003	A1
20030233553	Parks et al.	Dec 2003	A1
20030236820	Tierney et al.	Dec 2003	A1
20030236978	Evans et al.	Dec 2003	A1
20040001088	Stancil	Jan 2004	A1
20040001594	Krishnaswamy et al.	Jan 2004	A1
20040003139	Cottrille et al.	Jan 2004	A1
20040003190	Childs	Jan 2004	A1
20040003268	Bourne et al.	Jan 2004	A1
20040003269	Waxman et al.	Jan 2004	A1
20040003270	Bourne et al.	Jan 2004	A1
20040003288	Wiseman	Jan 2004	A1
20040010440	Lenard	Jan 2004	A1
20040010602	Van Vleck et al.	Jan 2004	A1
20040010684	Douglas	Jan 2004	A1
20040019456	Circenis	Jan 2004	A1
20040023636	Gurel	Feb 2004	A1
20040030898	Tsuria et al.	Feb 2004	A1
20040030912	Merkle, Jr.	Feb 2004	A1
20040034816	Richard	Feb 2004	A1
20040039916	Aldis et al.	Feb 2004	A1
20040039924	Baldwin	Feb 2004	A1
20040039932	Elazar et al.	Feb 2004	A1
20040039960	Kassayan	Feb 2004	A1
20040042451	Takaku	Mar 2004	A1
20040044629	Rhodes	Mar 2004	A1
20040045027	Takamura et al.	Mar 2004	A1
20040054630	Ginter	Mar 2004	A1
20040054678	Okamoto et al.	Mar 2004	A1
20040054907	Chateau	Mar 2004	A1
20040054908	Circenis	Mar 2004	A1
20040054909	Serkowski	Mar 2004	A1
20040054912	Adent et al.	Mar 2004	A1
20040064351	Mikurak	Apr 2004	A1
20040064707	McCann	Apr 2004	A1
20040067746	Johnson	Apr 2004	A1
20040073670	Chack	Apr 2004	A1
20040080541	Saiga et al.	Apr 2004	A1
20040083289	Karger et al.	Apr 2004	A1
20040088541	Messerges et al.	May 2004	A1
20040088548	Smetters	May 2004	A1
20040093371	Burrows	May 2004	A1
20040093508	Foerstner	May 2004	A1
20040103305	Ginter	May 2004	A1
20040107125	Guheen	Jun 2004	A1
20040107356	Shamoon	Jun 2004	A1
20040107359	Kawano	Jun 2004	A1
20040107368	Colvin	Jun 2004	A1
20040111615	Nyang	Jun 2004	A1
20040123127	Teicher	Jun 2004	A1
20040125755	Roberts	Jul 2004	A1
20040125757	Mela et al.	Jul 2004	A1
20040125791	Hoffmann	Jul 2004	A1
20040127196	Dabbish et al.	Jul 2004	A1
20040128251	Adam	Jul 2004	A1
20040133794	Kocher et al.	Jul 2004	A1
20040139027	Molaro	Jul 2004	A1
20040139312	Medvinsky	Jul 2004	A1
20040143736	Cross et al.	Jul 2004	A1
20040143760	Alkove et al.	Jul 2004	A1
20040146015	Cross	Jul 2004	A1
20040158709	Narin et al.	Aug 2004	A1
20040158731	Narin et al.	Aug 2004	A1
20040158742	Srinivasan	Aug 2004	A1
20040168073	Bourne et al.	Aug 2004	A1
20040168077	Waxman et al.	Aug 2004	A1
20040184605	Soliman	Sep 2004	A1
20040193919	Dabbish	Sep 2004	A1
20040199769	Proudler	Oct 2004	A1
20040205028	Verosub et al.	Oct 2004	A1
20040205357	Kuo et al.	Oct 2004	A1
20040205510	Rising	Oct 2004	A1
20040210535	Erickson	Oct 2004	A1
20040220858	Maggio	Nov 2004	A1
20040225519	Martin	Nov 2004	A1
20040225894	Colvin	Nov 2004	A1
20040236717	Demartini et al.	Nov 2004	A1
20040243819	Bourne et al.	Dec 2004	A1
20040249759	Higashi et al.	Dec 2004	A1
20040255000	Simionescu	Dec 2004	A1
20040261093	Rebaud et al.	Dec 2004	A1
20040268120	Mirtal	Dec 2004	A1
20050002525	Alkove et al.	Jan 2005	A1
20050005114	Medvinsky	Jan 2005	A1
20050008240	Banerji et al.	Jan 2005	A1
20050010531	Kushalnagar et al.	Jan 2005	A1
20050010536	Cochran et al.	Jan 2005	A1
20050010766	Holden et al.	Jan 2005	A1
20050015343	Nagai	Jan 2005	A1
20050021944	Craft	Jan 2005	A1
20050021989	Johnson et al.	Jan 2005	A1
20050021992	Aida	Jan 2005	A1
20050028000	Bulusu	Feb 2005	A1
20050028151	Roth et al.	Feb 2005	A1
20050033747	Wittkotter	Feb 2005	A1
20050039013	Bajikar	Feb 2005	A1
20050044197	Lai	Feb 2005	A1
20050044397	Bjorkengren	Feb 2005	A1
20050050329	Wilding et al.	Mar 2005	A1
20050050344	Hill et al.	Mar 2005	A1
20050050355	Graunke	Mar 2005	A1
20050060388	Tatsumi	Mar 2005	A1
20050065880	Amato	Mar 2005	A1
20050069039	Crinon	Mar 2005	A1
20050080701	Tunney	Apr 2005	A1
20050081042	Venkatesan et al.	Apr 2005	A1
20050086174	Eng	Apr 2005	A1
20050091104	Abraham	Apr 2005	A1
20050091169	Peinado et al.	Apr 2005	A1
20050097204	Horowitz	May 2005	A1
20050102181	Scroggie	May 2005	A1
20050108547	Sakai	May 2005	A1
20050108564	Freeman	May 2005	A1
20050114896	Hug et al.	May 2005	A1
20050120125	Morten et al.	Jun 2005	A1
20050120251	Fukumori	Jun 2005	A1
20050125673	Cheng	Jun 2005	A1
20050129296	Setala	Jun 2005	A1
20050132150	Jewell	Jun 2005	A1
20050135613	Brandenburg et al.	Jun 2005	A1
20050138338	Sodani et al.	Jun 2005	A1
20050138357	Swenson et al.	Jun 2005	A1
20050138370	Goud	Jun 2005	A1
20050138388	Paganetti	Jun 2005	A1
20050138389	Catherman	Jun 2005	A1
20050138406	Cox	Jun 2005	A1
20050138423	Ranganathan	Jun 2005	A1
20050141717	Cromer	Jun 2005	A1
20050144099	Deb	Jun 2005	A1
20050149722	Wiseman	Jul 2005	A1
20050149729	Zimmer	Jul 2005	A1
20050163052	Savage et al.	Jul 2005	A1
20050166051	Buer	Jul 2005	A1
20050169444	Inon	Aug 2005	A1
20050169467	Risan et al.	Aug 2005	A1
20050172121	Risan	Aug 2005	A1
20050177875	Kamperman et al.	Aug 2005	A1
20050182921	Duncan	Aug 2005	A1
20050182931	Robert et al.	Aug 2005	A1
20050182940	Sutton, II	Aug 2005	A1
20050188843	Edlund	Sep 2005	A1
20050192099	Nguyen et al.	Sep 2005	A1
20050192907	Blinn et al.	Sep 2005	A1
20050198510	Robert et al.	Sep 2005	A1
20050203801	Morgenstern	Sep 2005	A1
20050204391	Hunleth et al.	Sep 2005	A1
20050210252	Freeman	Sep 2005	A1
20050213761	Walmsley	Sep 2005	A1
20050216413	Murakami	Sep 2005	A1
20050216577	Durham et al.	Sep 2005	A1
20050221766	Brizek et al.	Oct 2005	A1
20050223415	Oho et al.	Oct 2005	A1
20050226170	Relan et al.	Oct 2005	A1
20050235141	Ibrahim	Oct 2005	A1
20050240533	Cutter et al.	Oct 2005	A1
20050246521	Bade	Nov 2005	A1
20050246525	Bade	Nov 2005	A1
20050246552	Bade	Nov 2005	A1
20050254526	Wang et al.	Nov 2005	A1
20050257073	Bade	Nov 2005	A1
20050265548	Tsuchimura	Dec 2005	A1
20050265555	Pippuri	Dec 2005	A1
20050268115	Barde	Dec 2005	A1
20050268174	Kumagai	Dec 2005	A1
20050275866	Corlett	Dec 2005	A1
20050278519	Luebke	Dec 2005	A1
20050279371	Billard	Dec 2005	A1
20050279827	Mascavage	Dec 2005	A1
20050283601	Tahan	Dec 2005	A1
20050286476	Crosswy	Dec 2005	A1
20050289076	Lambert	Dec 2005	A1
20050289177	Hohmann, II	Dec 2005	A1
20050289343	Tahan	Dec 2005	A1
20060010076	Cutter	Jan 2006	A1
20060010326	Bade	Jan 2006	A1
20060014521	Chen et al.	Jan 2006	A1
20060015717	Liu	Jan 2006	A1
20060015718	Liu	Jan 2006	A1
20060015732	Liu	Jan 2006	A1
20060020554	Septon	Jan 2006	A1
20060020784	Jonker	Jan 2006	A1
20060020821	Waltermann	Jan 2006	A1
20060020860	Tardif	Jan 2006	A1
20060026418	Bade	Feb 2006	A1
20060026419	Arndt	Feb 2006	A1
20060026422	Bade	Feb 2006	A1
20060045267	Moore	Mar 2006	A1
20060047957	Helms et al.	Mar 2006	A1
20060053112	Chitkara	Mar 2006	A1
20060055506	Nicolas	Mar 2006	A1
20060072748	Buer	Apr 2006	A1
20060072762	Buer	Apr 2006	A1
20060074600	Sastry	Apr 2006	A1
20060075014	Tharappel	Apr 2006	A1
20060075223	Bade	Apr 2006	A1
20060085634	Jain et al.	Apr 2006	A1
20060085637	Pinkas	Apr 2006	A1
20060085844	Buer	Apr 2006	A1
20060089917	Strom	Apr 2006	A1
20060090084	Buer	Apr 2006	A1
20060100010	Gatto	May 2006	A1
20060104356	Crinon	May 2006	A1
20060106845	Frank et al.	May 2006	A1
20060106920	Steeb	May 2006	A1
20060107306	Thirumalai	May 2006	A1
20060107328	Frank	May 2006	A1
20060107335	Frank	May 2006	A1
20060112267	Zimmer	May 2006	A1
20060117177	Buer	Jun 2006	A1
20060129496	Chow	Jun 2006	A1
20060129824	Hoff	Jun 2006	A1
20060130130	Kablotsky	Jun 2006	A1
20060143431	Rothman	Jun 2006	A1
20060149966	Buskey	Jul 2006	A1
20060156416	Huotari	Jul 2006	A1
20060161635	Lamkin et al.	Jul 2006	A1
20060165005	Frank	Jul 2006	A1
20060167814	Peinado et al.	Jul 2006	A1
20060167815	Peinado et al.	Jul 2006	A1
20060167985	Albanese et al.	Jul 2006	A1
20060168451	Ishibashi et al.	Jul 2006	A1
20060168664	Frank	Jul 2006	A1
20060173787	Weber	Aug 2006	A1
20060174110	Debique et al.	Aug 2006	A1
20060184790	Oliveira et al.	Aug 2006	A1
20060193474	Fransdonk	Aug 2006	A1
20060206618	Zimmer	Sep 2006	A1
20060212363	Peinado et al.	Sep 2006	A1
20060212945	Donlin	Sep 2006	A1
20060213997	Frank	Sep 2006	A1
20060229990	Shimoji et al.	Oct 2006	A1
20060235798	Alkove et al.	Oct 2006	A1
20060235799	Evans et al.	Oct 2006	A1
20060235801	Strom et al.	Oct 2006	A1
20060242406	Barde	Oct 2006	A1
20060248594	Grigorovitch et al.	Nov 2006	A1
20060248596	Jain	Nov 2006	A1
20060265758	Khandelwal et al.	Nov 2006	A1
20060268099	Potrebic et al.	Nov 2006	A1
20060272026	Niwano et al.	Nov 2006	A1
20060282319	Maggio	Dec 2006	A1
20060282899	Raciborski	Dec 2006	A1
20070003064	Wiseman et al.	Jan 2007	A1
20070016594	Visharam et al.	Jan 2007	A1
20070016784	Vauclair	Jan 2007	A1
20070033102	Frank	Feb 2007	A1
20070033419	Kocher et al.	Feb 2007	A1
20070058807	Marsh	Mar 2007	A1
20070078777	Demartini et al.	Apr 2007	A1
20070112681	Niwano et al.	May 2007	A1
20070157322	Onno	Jul 2007	A1
20070171903	Zeng et al.	Jul 2007	A1
20070269044	Bruestle	Nov 2007	A1
20070274393	Toma et al.	Nov 2007	A1
20070280422	Setala	Dec 2007	A1
20070288391	Nakamura et al.	Dec 2007	A1
20080075168	Toma et al.	Mar 2008	A1
20080141339	Gomez et al.	Jun 2008	A1
20080187284	Ikeda et al.	Aug 2008	A1
20080298581	Murase et al.	Dec 2008	A1
20080301440	Plouffe et al.	Dec 2008	A1
20080301468	Murase et al.	Dec 2008	A1
20090070454	McKinnon, III et al.	Mar 2009	A1
20090132815	Ginter	May 2009	A1
20090158036	Barde	Jun 2009	A1
20100177891	Keidar	Jul 2010	A1
20100280954	Khandelwal	Nov 2010	A1
20110128290	Howell	Jun 2011	A1
20120036562	Cutter et al.	Feb 2012	A1
20120137127	Jain	May 2012	A1

Foreign Referenced Citations (223)

Number	Date	Country
9741703	Mar 1998	AU
2373542	Nov 2002	CA
1531673	Sep 2004	CN
0085480	Aug 1983	EP
0409397	Jan 1991	EP
0613073	Aug 1994	EP
0635790	Jan 1995	EP
0665486	Aug 1995	EP
0387599	Sep 1995	EP
0679978	Nov 1995	EP
0709760	May 1996	EP
0715245	Jun 1996	EP
0715246	Jun 1996	EP
0715247	Jun 1996	EP
0752663	Jan 1997	EP
0768774	Apr 1997	EP
778512	Jun 1997	EP
0798892	Oct 1997	EP
0843249	May 1998	EP
0843449	Jun 1998	EP
0849658	Jun 1998	EP
0874300	Oct 1998	EP
0887723	Dec 1998	EP
0907120	Apr 1999	EP
1061465	Dec 2000	EP
1085396	Mar 2001	EP
1120967	Aug 2001	EP
01041823	Oct 2002	EP
01287636	Mar 2003	EP
0679980	Jun 2003	EP
0735719	Jun 2003	EP
1 346 755	Sep 2003	EP
07255122	Sep 2003	EP
1363424	Nov 2003	EP
0137881	Jan 2004	EP
01376307	Jan 2004	EP
1387237	Feb 2004	EP
1429224	Jun 2004	EP
1223722	Aug 2004	EP
1460514	Sep 2004	EP
1376307	Nov 2004	EP
01477879	Nov 2004	EP
01494425	Jan 2005	EP
1233337	Aug 2005	EP
01292065	Dec 2008	EP
01378812	Mar 2010	EP
1594034	Apr 2010	EP
1259863	May 2013	EP
1166562	Jun 2013	EP
2359969	Sep 2001	GB
2378780	Feb 2003	GB
2381898	May 2003	GB
2060859	Mar 1990	JP
02291043	Nov 1990	JP
2291043	Nov 1990	JP
3241950	Oct 1991	JP
05-35461	Feb 1993	JP
5073580	Mar 1993	JP
06-035718	Feb 1994	JP
07-036559	Feb 1995	JP
07-141153	Jun 1995	JP
09-069044	Aug 1995	JP
08-006729	Jan 1996	JP
09-006800	Jan 1997	JP
01-526550	May 1997	JP
09-185504	Jul 1997	JP
09-251494	Sep 1997	JP
11-110294	Apr 1999	JP
11-187013	Jul 1999	JP
11-219329	Aug 1999	JP
2000-113066	Apr 2000	JP
2000-215165	Aug 2000	JP
00-293369	Oct 2000	JP
2000-293439	Oct 2000	JP
2000-347566	Dec 2000	JP
2000-516743	Dec 2000	JP
01-051742	Feb 2001	JP
03-510684	Mar 2001	JP
2001-067408	Mar 2001	JP
01-101033	Apr 2001	JP
03-510713	Apr 2001	JP
11-175605	Jun 2001	JP
2001-175605	Jun 2001	JP
01-184472	Jul 2001	JP
01-290780	Oct 2001	JP
01-312325	Nov 2001	JP
01-325387	Nov 2001	JP
01-331229	Nov 2001	JP
01-338233	Dec 2001	JP
2001-344437	Dec 2001	JP
2002-072876	Mar 2002	JP
2002-077149	Mar 2002	JP
02-108478	Apr 2002	JP
02-108870	Apr 2002	JP
02-164880	Jun 2002	JP
2002-169719	Jun 2002	JP
2002-169726	Jun 2002	JP
2002-183352	Jun 2002	JP
2002-207426	Jul 2002	JP
2002-215465	Aug 2002	JP
2002-297816	Oct 2002	JP
2002-324170	Nov 2002	JP
02-374327	Dec 2002	JP
2002-359616	Dec 2002	JP
2003-030150	Jan 2003	JP
03-507785	Feb 2003	JP
2003-101526	Apr 2003	JP
03-140761	May 2003	JP
03-140762	May 2003	JP
03-157335	May 2003	JP
3 421 950	Jun 2003	JP
2003-173381	Jun 2003	JP
03-208314	Jul 2003	JP
03-248522	Sep 2003	JP
03-296487	Oct 2003	JP
2003-309545	Oct 2003	JP
2003-323224	Nov 2003	JP
02-182562	Jan 2004	JP
04-038974	Feb 2004	JP
04-062561	Feb 2004	JP
2004-054937	Feb 2004	JP
2004-056794	Feb 2004	JP
2004062890	Feb 2004	JP
04-118327	Apr 2004	JP
2004-102789	Apr 2004	JP
2004-507124	Apr 2004	JP
04-164491	Jun 2004	JP
04-295846	Oct 2004	JP
04-304755	Oct 2004	JP
2004-534291	Nov 2004	JP
07-525774	Sep 2007	JP
08-054952	Feb 2011	JP
239865	Jan 2000	KR
20010000805	Jan 2001	KR
239 865	Oct 2001	KR
20020037453	May 2002	KR
20050008439	Jan 2005	KR
20050021782	Mar 2005	KR
286 668	Oct 1996	NZ
2147790	Apr 2000	RU
9301550	Jan 1993	WO
WO 9301550	Jan 1993	WO
9313013	May 1996	WO
WO 9623013	May 1996	WO
9624092	Aug 1996	WO
9627155	Sep 1996	WO
WO 9721162	Jun 1997	WO
9743761	Nov 1997	WO
WO 9802793	Jan 1998	WO
9809209	Mar 1998	WO
9810381	Mar 1998	WO
WO 9810381	Mar 1998	WO
WO 9811478	Mar 1998	WO
9821679	May 1998	WO
WO 9821683	May 1998	WO
9824037	Jun 1998	WO
WO 9833106	Jul 1998	WO
9837481	Aug 1998	WO
9858306	Aug 1998	WO
9842098	Sep 1998	WO
WO 9842098	Sep 1998	WO
WO 9847259	Oct 1998	WO
9858306	Dec 1998	WO
WO 9904328	Jan 1999	WO
9915970	Apr 1999	WO
WO 9915970	Apr 1999	WO
9953689	Oct 1999	WO
WO 9953689	Oct 1999	WO
0008909	Feb 2000	WO
0015221	Mar 2000	WO
0021239	Apr 2000	WO
0042492	Jul 2000	WO
WO 0054126	Sep 2000	WO
WO 0057637	Sep 2000	WO
0058811	Oct 2000	WO
0059150	Oct 2000	WO
WO 0057684	Oct 2000	WO
WO 0058810	Oct 2000	WO
WO 0058859	Oct 2000	WO
WO 0059152	Oct 2000	WO
0068763	Nov 2000	WO
0122268	Mar 2001	WO
0122651	Mar 2001	WO
0133867	May 2001	WO
WO 0135293	May 2001	WO
0144908	Jun 2001	WO
0146783	Jun 2001	WO
WO 0143342	Jun 2001	WO
WO 0145012	Jun 2001	WO
0152021	Jul 2001	WO
WO 0152018	Jul 2001	WO
WO 0152020	Jul 2001	WO
WO 0163512	Aug 2001	WO
WO 0177795	Oct 2001	WO
WO 0178303	Oct 2001	WO
WO 0193461	Dec 2001	WO
0201335	Jan 2002	WO
WO 0208969	Jan 2002	WO
0223314	Mar 2002	WO
0223315	Mar 2002	WO
WO 0219598	Mar 2002	WO
0237371	May 2002	WO
WO 02056155	Jul 2002	WO
02073378	Sep 2002	WO
02086684	Oct 2002	WO
WO 02080442	Oct 2002	WO
02097693	Dec 2002	WO
WO 02103495	Dec 2002	WO
WO 03009115	Jan 2003	WO
WO 03030434	Apr 2003	WO
WO 03073688	Sep 2003	WO
WO 03079269	Sep 2003	WO
03090101	Oct 2003	WO
2008090101	Oct 2003	WO
WO 03107585	Dec 2003	WO
WO 03107588	Dec 2003	WO
2004023717	Mar 2004	WO
2004030364	Apr 2004	WO
WO 2004092886	Oct 2004	WO
WO 2005109202	Nov 2005	WO
2005122047	Dec 2005	WO
2006065012	Jun 2006	WO
WO 2007032974	Mar 2007	WO

Non-Patent Literature Citations (978)

Entry
United States Advisory Action mailed Jan. 19, 2007, in U.S. Appl. No. 09/482,843 (4 pages).
United States Advisory Action mailed Feb. 15, 2005, in U.S. Appl. No. 09/482,840 (3 pages).
United States Advisory Action mailed Mar. 21, 2006, in U.S. Appl. No. 11/117,590 (3 pages).
United States Advisory Action mailed Apr. 27, 2005, in U.S. Appl. No. 09/482,932 (2 pages).
United States Advisory Action mailed May 16, 2007, in U.S. Appl. No. 11/117,590 (3 pages).
United States Advisory Action mailed Aug. 1, 2008, in U.S. Appl. No. 10/831,280 (2 pages).
United States Advisory Action mailed Sep. 23, 2011, in U.S. Appl. No. 10/971,346 (4 pages).
United States Advisory Action mailed Nov. 25, 2003, in U.S. Appl. No. 09/482,932 (3 pages).
United States Amendment filed Jan. 10, 2005, in U.S. Appl. No. 09/482,725 (11 pages).
United States Amendment filed Jan. 11, 2008, in U.S. Appl. No. 11/353,321 (13 pages).
United States Amendment filed Jan. 11, 2011, in U.S. Appl. No. 10/831,280 (18 pages).
United States Amendment filed Jan. 16, 2008, in U.S. Appl. No. 10/831,280 (16 pages).
United States Amendment filed Jan. 18, 2011, in U.S. Appl. No. 11/116,884 (12 pages).
United States Amendment filed Jan. 20, 2004, in U.S. Appl. No. 09/482,928 (20 pages).
United States Amendment filed Jan. 21, 2005, in U.S. Appl. No. 09/482,840 (13 pages).
United States Amendment filed Jan. 21, 2009, in U.S. Appl. No. 11/018,095 (9 pages).
United States Amendment filed Jan. 22, 2008, in U.S. Appl. No. 10/831,281 (15 pages).
United States Amendment filed Jan. 22, 2009, in U.S. Appl. No. 11/116,884 (10 pages).
United States Amendment filed Feb. 1, 2007, in U.S. Appl. No. 10/830,632 (9 pages).
United States Amendment filed Feb. 6, 2009, in U.S. Appl. No. 11/117,590 (10 pages).
United States Amendment filed Feb. 16, 2006, in U.S. Appl. No. 11/117,590 (20 pages).
United States Amendment filed Feb. 17, 2011, in U.S. Appl. No. 10/971,346 (31 pages).
United States Amendment filed Feb. 22, 2005, in U.S. Appl. No. 09/482,843 (14 pages).
United States Amendment filed Feb. 23, 2004, in U.S. Appl. No. 09/290,363 (34 pages).
United States Amendment filed Feb. 23, 2009, in U.S. Appl. No. 11/388,403 (14 pages).
United States Amendment filed Feb. 25, 2010, in U.S. Appl. No. 11/116,884 (13 pages).
United States Amendment filed Mar. 2, 2009, in U.S. Appl. No. 10/831,281 (26 pages).
United States Amendment filed Mar. 11, 2008, in U.S. Appl. No. 10/976,463 (13 pages).
United States Amendment filed Mar. 14, 2005, in U.S. Appl. No. 10/208,139 (9 pages).
United States Amendment filed Mar. 22, 2006, in U.S. Appl. No. 09/290,363 (31 pages).
United States Amendment filed Mar. 24, 2009, in U.S. Appl. No. 11/353,321 (20 pages).
United States Amendment filed Mar. 26, 2012, in U.S. Appl. No. 10/971,346 (18 pages).
United States Amendment filed Mar. 28, 2011, in U.S. Appl. No. 11/018,095 (10 pages).
United States Amendment filed Apr. 9, 2008, in U.S. Appl. No. 11/048,194 (7 pages).
United States Amendment filed Apr. 11, 2005, in U.S. Appl. No. 09/482,932 (19 pages).
United States Amendment filed Apr. 15, 2011, in U.S. Appl. No. 11/116,884 (13 pages).
United States Amendment filed Apr. 21, 2003, in U.S. Appl. No. 09/482,840 (15 pages).
United States Amendment filed Apr. 22, 2003, in U.S. Appl. No. 09/290,363 (46 pages).
United States Amendment filed Apr. 27, 2005, in U.S. Appl. No. 09/482,840 (20 pages).
United States Amendment filed Apr. 27, 2007, in U.S. Appl. No. 11/117,590 (13 pages).
United States Amendment filed Apr. 28, 2008, in U.S. Appl. No. 11/353,321 (14 pages).
United States Amendment filed May 4, 2009, in U.S. Appl. No. 10/831,280 (16 pages).
United States Amendment filed May 5, 2009, in U.S. Appl. No. 11/018,095 (10 pages).
United States Amendment filed May 12, 2005, in U.S. Appl. No. 09/482,932 (19 pages).
United States Amendment filed May 12, 2010, in U.S. Appl. No. 10/971,346 (12 pages).
United States Amendment filed May 15, 2003, in U.S. Appl. No. 09/482,932 (4 pages).
United States Amendment filed May 17, 2010, in U.S. Appl. No. 11/018,095 (10 pages).
United States Amendment filed May 21, 2003, in U.S. Appl. No. 09/482,843 (13 pages).
United States Amendment filed May 27, 2004, in U.S. Appl. No. 09/482,725 (40 pages).
United States Amendment filed Jun. 13, 2007, in U.S. Appl. No. 10/976,463 (17 pages).
United States Amendment filed Jun. 13, 2008, in U.S. Appl. No. 10/968,462 (11 pages).
United States Amendment filed Jun. 15, 2007, in U.S. Appl. No. 11/117,590 (12 pages).
United States Amendment filed Jun. 25, 2008, in U.S. Appl. No. 11/018,095 (10 pages).
United States Amendment filed Jun. 29, 2010, in U.S. Appl. No. 10/831,280 (18 pages).
United States Amendment filed Jul. 8, 2005, in U.S. Appl. No. 09/482,725 (48 pages).
United States Amendment filed Jul. 9, 2008, in U.S. Appl. No. 11/388,365 (18 pages).
United States Amendment filed Jul. 13, 2009, in U.S. Appl. No. 11/116,884 (13 pages).
United States Amendment filed Jul. 16, 2008, in U.S. Appl. No. 10/831,280 (16 pages).
United States Amendment filed Jul. 17, 2006, in U.S. Appl. No. 09/482,843 (17 pages).
United States Amendment filed Jul. 26, 2004, in U.S. Appl. No. 09/482,840 (9 pages).
United States Amendment filed Jul. 28, 2005, in U.S. Appl. No. 09/482,840 (22 pages).
United States Amendment filed Aug. 6, 2008, in U.S. Appl. No. 10/831,281 (20 pages).
United States Amendment filed Aug. 11, 2004, in U.S. Appl. No. 09/482,843 (10 pages).
United States Amendment filed Aug. 11, 2010, in U.S. Appl. No. 11/116,884 (13 pages).
United States Amendment filed Aug. 20, 2009, in U.S. Appl. No. 11/117,590 (2 pages).
United States Amendment filed Aug. 31, 2005, in U.S. Appl. No. 09/482,932 (21 pages).
United States Amendment filed Sep. 6, 2011, in U.S. Appl. No. 10/971,346 (48 pages).
United States Amendment filed Sep. 9, 2008, in U.S. Appl. No. 10/976,463 (14 pages).
United States Amendment filed Sep. 9, 2011, in U.S. Appl. No. 11/018,095 (11 pages).
United States Amendment filed Sep. 15, 2009, in U.S. Appl. No. 10/971,346 (12 pages).
United States Amendment filed Sep. 20, 2010, in U.S. Appl. No. 10/971,346 (39 pages).
United States Amendment filed Sep. 22, 2003, in U.S. Appl. No. 09/482,928 (20 pages).
United States Amendment filed Sep. 24, 2004, in U.S. Appl. No. 09/482,932 (12 pages).
United States Amendment filed Sep. 25, 2006, in U.S. Appl. No. 11/117,590 (14 pages).
United States Amendment filed Sep. 26, 2005, in U.S. Appl. No. 11/117,590 (17 pages).
United States Amendment filed Sep. 26, 2011, in U.S. Appl. No. 10/971,346 (10 pages).
United States Amendment filed Oct. 3, 2001, in U.S. Appl. No. 09/290,363 (26 pages).
United States Amendment filed Oct. 8, 2010, in U.S. Appl. No. 11/018,095 (7 pages).
United States Amendment filed Oct. 9, 2009, in U.S. Appl. No. 11/353,321 (22 pages).
United States Amendment filed Oct. 14, 2008, in U.S. Appl. No. 10/831,280 (16 pages).
United States Amendment filed Oct. 24, 2007, in U.S. Appl. No. 10/976,463 (13 pages).
United States Amendment filed Oct. 30, 2003, in U.S. Appl. No. 09/482,932 (25 pages).
United States Amendment filed Nov. 6, 2003, in U.S. Appl. No. 09/482,843 (16 pages).
United States Amendment filed Nov. 18, 2005, in U.S. Appl. No. 09/290,363 (31 pages).
United States Amendment filed Nov. 20, 2007, in U.S. Appl. No. 09/482,843 (9 pages).
United States Amendment filed Nov. 23, 2009, in U.S. Appl. No. 10/831,280 (18 pages).
United States Amendment filed Dec. 3, 2008, in U.S. Appl. No. 10/971,346 (12 pages).
United States Amendment filed Dec. 5, 2011, in U.S. Appl. No. 11/018,095 (9 pages).
United States Amendment filed Dec. 6, 2011, in U.S. Appl. No. 11/116,884 (11 pages).
United States Amendment filed Dec. 7, 2007, in U.S. Appl. No. 11/117,590 (16 pages).
United States Amendment filed Dec. 26, 2006, in U.S. Appl. No. 09/482,843 (13 pages).
United States Amendment filed Apr. 26, 2010, in U.S. Appl. No. 11/353,321 (22 pages).
United States Final Office Action mailed Jan. 11, 2005, in U.S. Appl. No. 09/482,932 (21 pages).
United States Final Office Action mailed Jan. 26, 2009, in U.S. Appl. No. 11/353,321 (11 pages).
United States Final Office Action mailed Jan. 26, 2010, in U.S. Appl. No. 11/353,321 (13 pages).
United States Final Office Action mailed Feb. 3, 2009, in U.S. Appl. No. 11/388,365 (13 pages).
United States Final Office Action mailed Feb. 28, 2007, in U.S. Appl. No. 11/117,590 (12 pages).
United States Final Office Action mailed Mar. 15, 2010, in U.S. Appl. No. 11/018,095 (8 pages).
United States Final Office Action mailed Mar. 18, 2009, in U.S. Appl. No. 10/971,346 (14 pages).
United States Final Office Action mailed Apr. 16, 2008, in U.S. Appl. No. 10/831,280 (21 pages).
United States Final Office Action mailed Apr. 22, 2011, in U.S. Appl. No. 10/971,346 (22 pages).
United States Final Office Action mailed May 24, 2005, in U.S. Appl. No. 10/208,139 (7 pages).
United States Final Office Action mailed Jun. 9, 2011, in U.S. Appl. No. 11/018,095 (10 pages).
United States Final Office Action mailed Jun. 10, 2009, in U.S. Appl. No. 11/388,403 (9 pages).
United States Final Office Action mailed Jun. 30, 2008, in U.S. Appl. No. 10/976,463 (20 pages).
United States Final Office Action mailed Jul. 8, 2008, in U.S. Appl. No. 11/048,194 (7 pages).
United States Final Office Action mailed Jul. 8, 2011, in U.S. Appl. No. 11/116,884 (15 pages).
United States Final Office Action mailed Jul. 22, 2010, in U.S. Appl. No. 10/971,346 (16 pages).
United States Final Office Action mailed Jul. 30, 2003, in U.S. Appl. No. 09/482,932 (22 pages).
United States Final Office Action mailed Aug. 7, 2008, in U.S. Appl. No. 11/117,590 (10 pages).
United States Final Office Action mailed Aug. 12, 2003, in U.S. Appl. No. 09/482,843 (26 pages).
United States Final Office Action mailed Aug. 20, 2009, in U.S. Appl. No. 10/831280 (26 pages).
United States Final Office Action mailed Aug. 24, 2007, in U.S. Appl. No. 10/976,463 (26 pages).
United States Final Office Action mailed Sep. 15, 2010, in U.S. Appl. No. 10/831,280 (19 pages).
United States Final Office Action mailed Oct. 21, 2008, in U.S. Appl. No. 11/018,095 (12 pages).
United States Final Office Action mailed Oct. 24, 2006, in U.S. Appl. No. 09/482,843 (15 pages).
United States Final Office Action mailed Oct. 28, 2004, in U.S. Appl. No. 09/482,840 (19 pages).
United States Final Office Action mailed Oct. 28, 2010, in U.S. Appl. No. 11/116,884 (14 pages).
United States Final Office Action mailed Nov. 7, 2005, in U.S. Appl. No. 09/290,363 (6 pages).
United States Final Office Action mailed Nov. 16, 2004, in U.S. Appl. No. 09/482,843 (4 pages).
United States Final Office Action mailed Nov. 25, 2011, in U.S. Appl. No. 10/971,346 (19 pages).
United States Final Office Action mailed Nov. 27, 2009, in U.S. Appl. No. 11/116,884 (17 pages).
United States Final Office Action mailed Dec. 2, 2008, in U.S. Appl. No. 10/831,281 (11 pages).
United States Final Office Action mailed Dec. 20, 2005, in U.S. Appl. No. 11/117,590 (13 pages).
United States Non-Final Office Action mailed Jun. 13, 2008, in U.S. Appl. No. 10/971,346 (9 pages).
United States Non-Final Office Action mailed Jan. 9, 2008, in U.S. Appl. No. 11/048,194 (7 pages).
United States Non-Final Office Action mailed Jan. 16, 2003, in U.S. Appl. No. 09/482,840 (17 pages).
United States Non-Final Office Action mailed Feb. 3, 2009, in U.S. Appl. No. 10/831,280 (25 pages).
United States Non-Final Office Action mailed Feb. 4, 2011, in U.S. Appl. No. 11/116,884 (13 pages).
United States Non-Final Office Action mailed Feb. 5, 2009, in U.S. Appl. No. 11/018,095 (13 pages).
United States Non-Final Office Action mailed Feb. 13, 2003, in U.S. Appl. No. 09/482,932 (22 pages).
United States Non-Final Office Action mailed Feb. 14, 2008, in U.S. Appl. No. 11/388,365 (14 pages).
United States Non-Final Office Action mailed Feb. 19, 2003, in U.S. Appl. No. 09/482,843 (16 pages).
United States Non-Final Office Action mailed Mar. 13, 2007, in U.S. Appl. No. 10/976,463 (11 pages).
United States Non-Final Office Action mailed Mar. 18, 2008, in U.S. Appl. No. 10/968,462 (10 pages).
United States Non-Final Office Action mailed Mar. 25, 2008, in U.S. Appl. No. 11/018,095 (14 pages).
United States Non-Final Office Action mailed Mar. 29, 2010, in U.S. Appl. No. 10/831,280 (16 pages).
United States Non-Final Office Action mailed Apr. 14, 2005, in U.S. Appl. No. 09/482,725 (9 pages).
United States Non-Final Office Action mailed Apr. 14, 2009, in U.S. Appl. No. 11/116,884 (12 pages).
United States Non-Final Office Action mailed Apr. 19, 2006, in U.S. Appl. No. 09/482,843 (23 pages).
United States Non-Final Office Action mailed May 6, 2008, in U.S. Appl. No. 10/831,281 (11 pages).
United States Non-Final Office Action mailed May 11, 2004, in U.S. Appl. No. 09/482,843 (19 pages).
United States Non-Final Office Action mailed May 12, 2010, in U.S. Appl. No. 11/116,884 (13 pages).
United States Non-Final Office Action mailed May 16, 2012, in U.S. Appl. No. 11/353,321 (15 pages).
United States Non-Final Office Action mailed May 18, 2004, in U.S. Appl. No. 09/482,840 (18 pages).
United States Non-Final Office Action mailed May 27, 2003, in U.S. Appl. No. 09/482,928 (11 pages).
United States Non-Final Office Action mailed May 29, 2012, in U.S. Appl. No. 13/274,217 (11 pages).
United States Non-Final Office Action mailed May 31, 2005, in U.S. Appl. No. 09/482,932 (20 pages).
United States Non-Final Office Action mailed Jun. 20, 2007, in U.S. Appl. No. 09/482,843 (6 pages).
United States Non-Final Office Action mailed Jun. 21, 2004, in U.S. Appl. No. 09/482,932 (23 pages).
United States Non-Final Office Action mailed Jun. 30, 2006, in U.S. Appl. No. 11/117,590 (13 pages).
United States Non-Final Office Action mailed Jul. 5, 2005, in U.S. Appl. No. 11/117,590 (12 pages).
United States Non-Final Office Action mailed Jul. 8, 2010, in U.S. Appl. No. 11/018,095 (9 pages).
United States Non-Final Office Action mailed Jul. 9, 2009, in U.S. Appl. No. 11/353,321 (12 pages).
United States Non-Final Office Action mailed Aug. 19, 2009, in U.S. Appl. No. 11/018,095 (10 pages).
United States Non-Final Office Action mailed Sep. 7, 2007, in U.S. Appl. No. 11/117,590 (13 pages).
United States Non-Final Office Action mailed Sep. 27, 2011, in U.S. Appl. No. 11/018,095 (5 pages).
United States Non-Final Office Action mailed Oct. 5, 2007, in U.S. Appl. No. 11/353,321 (9 pages).
United States Non-Final Office Action mailed Oct. 13, 2004, in U.S. Appl. No. 09/482,725 (9 pages).
United States Non-Final Office Action mailed Oct. 16, 2007, in U.S. Appl. No. 10/831,280 (19 pages).
United States Non-Final Office Action mailed Oct. 18, 2007, in U.S. Appl. No. 10/831,281 (12 pages).
United States Non-Final Office Action mailed Oct. 12, 2008, in U.S. Appl. No. 11/388,403 (8 pages).
United States Non-Final Office Action mailed Oct. 22, 2008, in U.S. Appl. No. 11/116,884 (10 pages).
United States Non-Final Office Action mailed Nov. 1, 2006, in U.S. Appl. No. 10/830,632 (21 pages).
United States Non-Final Office Action mailed Nov. 12, 2009, in U.S. Appl. No. 10/971,346 (14 pages).
United States Non-Final Office Action mailed Nov. 26, 2010, in U.S. Appl. No. 10/971,346 (14 pages).
United States Non-Final Office Action mailed Dec. 11, 2007, in U.S. Appl. No. 10/976,463 (22 pages).
United States Non-Final Office Action mailed Dec. 14, 2004, in U.S. Appl. No. 10/208,139 (6 pages).
United States Non-Final Office Action mailed Dec. 27, 2010, in U.S. Appl. No. 11/018,095 (8 pages).
United States Non-Final Office Action mailed Jan. 17, 2003, in U.S. Appl. No. 09/290,363 (23 pages).
United States Non-Final Office Action mailed Apr. 24, 2001, in U.S. Appl. No. 09/290,363 (28 pages).
United States Notice of Allowance mailed Feb. 14, 2002, in U.S. Appl. No. 09/290,363 (8 pages).
United States Notice of Allowance mailed Feb. 17, 2010, in U.S. Appl. No. 11/117,590 (15 pages).
United States Notice of Allowance mailed Mar. 7, 2012, in U.S. Appl. No. 11/116,884 (8 pages).
United States Notice of Allowance mailed Mar. 22, 2006, in U.S. Appl. No. 09/290,363 (8 pages).
United States Notice of Allowance mailed Mar. 23, 2009, in U.S. Appl. No. 10/831,281 (8 pages).
United States Notice of Allowance mailed Mar. 31, 2005, in U.S. Appl. No. 09/482,928 (9 pages).
United States Notice of Allowance mailed Apr. 2, 2008, in U.S. Appl. No. 09/482,843 (6 pages).
United States Notice of Allowance mailed Apr. 6, 2006, in U.S. Appl. No. 09/482,725 (7 pages).
United States Notice of Allowance mailed May 3, 2007, in U.S. Appl. No. 10/830,632 (13 pages).
United States Notice of Allowance mailed Jun. 11, 2009, in U.S. Appl. No. 11/117,590 (15 pages).
United States Notice of Allowance mailed Jun. 27, 2011, in U.S. Appl. No. 10/831,280 (7 pages).
United States Notice of Allowance mailed Jun. 27, 2012, in U.S. Appl. No. 11/018,095 (7 pages).
United States Notice of Allowance mailed Jun. 24, 2008, in U.S. Appl. No. 10/968,462 (10 pages).
United States Notice of Allowance mailed Sep. 26, 2008, in U.S. Appl. No. 10/976,463 (8 pages).
United States Notice of Allowance mailed Dec. 2, 2005, in U.S. Appl. No. 09/482,725 (6 pages).
United States Notice of Allowance mailed Dec. 6, 2005, in U.S. Appl. No. 09/482,932 (8 pages).
United States Notice of Allowance mailed Dec. 9, 2005, in U.S. Appl. No. 09/482,840 (11 pages).
United States Notice of Allowance mailed Dec. 14, 2011, in U.S. Appl. No. 11/116,884 (7 pages).
United States Notice of Allowance mailed Dec. 30, 2011, in U.S. Appl. No. 11/018,095 (10 pages).
United States Supplemental Amendment filed Jan. 21, 2005, in U.S. Appl. No. 09/482,725 (5 pages).
United States Supplemental Amendment filed Jan. 31, 2008, in U.S. Appl. No. 11/117,590 (18 pages).
United States Supplemental Amendment filed Jun. 16, 2003, in U.S. Appl. No. 09/482,725 (3 pages).
United States Supplemental Amendment filed Sep. 12, 2005, in U.S. Appl. No. 09/482,843 (5 pages).
United States Supplemental Amendment filed Nov. 16, 2006, in U.S. Appl. No. 11/117,590 (14 pages).
United States Supplemental Amendment filed Dec. 10, 2003, in U.S. Appl. No. 09/482,725 (51 pages).
Australian Examination Response filed Aug. 21, 2009, in Australian Application No. 200400461 (26 pgs).
Australian First Report on Patent Action mailed May 22, 2009, in Australian Application No. 200400461 (2 pgs).
Australian Notice of Acceptance mailed Nov. 12, 2009, in Australian Application No. 2004200471 (3 pgs).
Australian Notice of Acceptance mailed Sep. 4, 2009, in Australian Application No. 2004200461 (3 pgs).
Australian Office Action mailed Aug. 27, 2009, in Australian Application No. 2004200471 (2 pgs).
Chinese Noitce on First Office Action mailed Feb. 6, 2009, in Chinese Application No. 200410007610 (11 pgs).
Chinese Notice on First Office Action mailed Feb. 6, 2009, in Chinese Patent Application No. 200410005380.4 (9 pgs).
Chinese Notice on Grant of Patent Right for Invention mailed Jul. 24, 2009, in Chinese Patent Application No. 200410005380.4 (4 pgs).
Chinese Notice on the First Action mailed Nov. 23, 2011, in Chinese Application No. 200910139429.8 (7 pgs).
Chinese Response to First Office Action mailed Feb. 6, 2009, in Chinese Patent Application No. 200410005380.4, filed Jun. 5, 2009 (12 pgs).
Digital Media Solutions: Secure Streaming. OrnniWeb, http://www.omniweb.com/dms.html#stream (3 pgs).
European Communication mailed Feb. 15, 2005, in European Patent Application No. 03013569.3 (4 pgs).
European Communication mailed Feb. 15, 2006, in European Patent Application No. 03013569.3 (7 pgs).
European Communication mailed Jan. 17, 2011, in European Application No. 03013556 (4 pgs).
European Communication mailed Jun. 6, 2006, in European Application No. 04003033.0 (3 pgs).
European Communication mailed Jun. 6, 2007, in European Application No. 03013556 (4 pgs).
European Communication mailed Mar. 18, 2005, in European Application No. 04001954.9 (3 pgs).
European Decision to Refuse a European Patent Application mailed Mar. 4, 2006, in European Application No. 04001954.9 (31 pgs).
European Decision to Refuse European Patent Application mailed Apr. 25, 2007, in European Patent Application No. 03013569.3 (21 pgs).
European Letter in Response to the Summons dated Nov. 22, 2006 to Attend Oral Proceedings, mailed Feb. 22, 2007, in European Patent Application No. 03013569.3 (22 pgs)•.
European Partial Search Report filed Feb. 20, 2006, in European Application No. 03013556 (5 pgs).
European Reply to Communication filed May 24, 2011, in European Application No. 03013556 (16 pgs).
European Reply to Communication filed Oct. 16, 2007, in European Application No. 03013556 (25 pgs).
European Response to Communication dated Mar. 18, 2005, in European Application No. 04001954.9, filed May 24, 2005 (17 pgs).
European Response to Official Communication dated Feb. 15, 2006, filed Aug. 25, 2006 in European Patent Application No. 03013569.3 (18 pgs).
European Response to Official Communication dated Feb. 17, 2005, filed Jun. 27, 2005 in European Patent Application No. 03013569.3 (27 pgs).
European Response to Summons dated Sep. 23, 2010, in European Application No. 04001954.9. filed Dec. 14, 2010 (14 pgs).
European Response to Summons to Attend Oral Proceedings mailed Oct. 4, 2005, in European Application No. 04001954.9, filed Nov. 17, 2005 (5 pgs).
European Search Report dated Jul. 27, 2004 in European Application No. 04001954.9 (2 pgs).
European Search Report filed Aug. 2, 2004, in European Application No. 03013569.3 (4 pgs).
European Search Report filed Oct. 25, 2006, in European Application No. 03013556 (7 pgs).
European Search Report mailed Sep. 26, 2005, in European Application No. 04003033.0 (4 pgs).
European Summons to Attend Oral Proceedings mailed Oct. 4, 2005, in European Application No. 04001954.9 (30 pgs).
Evans, P. “DRM: Is the Road to Adoption Fraught with Potholes?” Seybold Reporting Analyzing Publishing Technologies, 2001, 1(14), 32.
Features of Windows Media DRM. www.microsoft.com/windows/windowsmedia/drm/features.aspx.
Fowler, T.B. “Technology's Changing Role in Intellectual Property Rights”, IT Professional(IEEE), 2002, 4(2), 39-44.
Gable, J. “The Digital Rights Conundrum”, Transform Magazine, 2001, 10(11), 27.
Griswold, G.N. “A Method for Protecting Copyright on Networks”, IMA Intellectual Property Project Proceedings, 1994, 1(1), 169-178.
Gunter, C.A., et al. “Models and Languages for Digital Rights”, Proceedings of the 34.sup.th Annual Hawaii International Conference on System Sciences, 2001, 1-5.
Hanai, Hiroyuki; “Latest Information and Establishment of a Server-Setting Up Free BSD-”, Unix User, vol. 11, No. 3, pp. 93-100, etc., Softbank Publishing Co., Ltd., Japan, Mar. 1, 2002. [Partial English Translation].
How Windows Rights Management Works (Illustration). posted Mar. 17, 2003, http://directionsmicrosft.com/sample/DOMIS/update/2003/04apr/0403rrmctte—illo.htm (5 pgs).
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.
India First Examination Report mailed Aug. 30, 2011, in India Application No. 167/MUM/2004 (3 pgs).
Japanese Amendment filed Mar. 5, 2009, in Japanese Patent Application No. 2003-183597 (9 pgs).
Japanese Final Rejection mailed on Sep. 21, 2010, in Japanese Patent Application No. 2004-035810 (4 pgs).
Japanese Notice of Allowance mailed May 13, 2011, in Japanese Patent Application No. 2003-183597 (6 pgs).
Japanese Notice of Allowance mailed Oct. 18, 2010, in Japanese Patent Application No. 2004-050478 (6 pgs).
Japanese Notice of Allowance mailed Oct. 30, 2009, in Japanese Patent Application No. 2003-183597 (6 pgs).
Japanese Notice of Rejection mailed Dec. 1, 2009, in Japanese Patent Application No. 2003-183596 (7 pgs).
Japanese Notice of Rejection mailed Dec. 10, 2010, in Japanese Patent Application No. 2003-183596 (8 pgs).
Japanese Notice of Rejection mailed on Jun. 1, 2010, in Japanese Patent Application No. 2004-035810 (5 pgs).
Japanese Notice of Rejection mailed on May 28, 2010, in Japanese Application No. 2004050478 (5 pgs).
Japanese Notice of Rejection mailed on Sep. 17, 2010, in Japanese Application No. 2004-050478 (3 pgs).
Japanese Official Notice of Rejection mailed on Dec. 5, 2008, in Japanese Patent Application No. 2003-183597 (143 pgs).
Japanese Response filed Apr. 22, 2011, in Japanese Patent Application No. 2003-183596 (30 pgs).
Japanese Response filed Mar. 1, 2010, in Japanese Patent Application No. 2003-183596 (18 pgs).
Kahn, R.E. “Deposit, Registration and Recordation in an Electronic Copyright Management System”, IMA Intellectual Property Project Proceedings, 1994, 1(1), 111-120.
Kington, “Manage digital rights with the OMA”, IBM, Jul. 27, 2004, http://www.-106.ibm.com/developer.works/wireless/library/wi-drm.html, 4 pgs.
Korean Amendment filed Jan. 31, 2011, in Korean Patent Application No. 10-2004-0009030 (20 pgs.).
License Management is Fundamental, DRM Acts as an Impregnable Defense, the Last Stronghold is a Dedicated-Viewer. Nikkei Internet Technology, Nikkei Business Publications, Inc., Dec. 2001 issue, pp. 34 to 39, Japan, Nov. 22, 2001.
Managing digital rights in online publishing. Information Management & Technology, 2001, 34(4), 168-169.
Oda, Hiroharu; “The Basics and Application of Security IC Cards -Passport to an e-business-”, 1st Ed., pp. 143-144, etc., C.media Co., Ltd., Apr. 27, 2000. [Partial English Translation].
Peinado, M. “Digital rights management in a multimedia environment”, SMPTE Journal, 2002, 111(3), 159-163.
Protecting Content with Digital Rights Management. www.intelligraphics.com/articles/WDMaudiodesign—article.html
Realnetworks Announces Helix Drm—The First Major Digital Rights Management Platform for Both Standards-Based and Internet Formats. http://www.realnetworks.como/company/press/releases/2003/helixdrm.html, 3 pgs.
Rights Management Comes to the Enterprise: Rights Management Beyond Digital Media, by Matt Rosoff, posted Mar. 17, 2003 http://directionsonmicrosoft.com/sample/DOMIS/update/2003/04apr/0403rmctte.htm.
Royan, B. Content creation and rights management; experiences of SCRAN(the Scottish Cultural Resources Access Network), Program, 2000, 34(2), 131-142.
Russian Official Action mailed Dec. 12, 2007, in Russian Patent Application No. 2004103872 (5 pgs).
Taiwan Notice of Allowance mailed Jul. 28, 2010, in Taiwanese Application No. 9310448 (4 pgs).
United States Advisory Action mailed Dec. 1, 2006, in U.S. Appl. No. 10/364,627.
United States Advisory Action mailed Dec. 3, 2008, in Appl. No. 10/185,511 (3 pgs).
United States Advisory Action mailed Dec. 5, 2006, in U.S. Appl. No. 10/185,527 (3 pgs).
United States Advisory Action mailed Feb. 12, 2009, in U.S. Appl. No. 11/108,038 (3 pgs).
United States Advisory Action mailed Jul. 9, 2007, in U.S. Appl. No. 10/373,621 (3 pgs).
United States Advisory Action mailed Jun. 26, 2009, in U.S. Appl. No. 11/107,709.
United States Advisory Action mailed Nov. 10, 2008, in U.S. Appl. No. 10/364,115 (3 pgs).
United States Advisory Action mailed Nov. 28, 2006, in U.S. Appl. No. 10/185,511 (3 pgs).
United States Advisory Action mailed Nov. 9, 2007, in U.S. Appl. No. 10/364,115 (3 pgs).
United States Advisory Office Action mailed Dec. 4, 2006, in U.S. Appl. No. 10/185,278.
United States Amendment After Notice of Allowance to Feb. 10, 2009 action, filed Mar. 16, 2009 in U.S. Appl. No. 10/185,278 (8 pgs).
United States Final Office Action mailed Apr. 16, 2008, in U.S. Appl. No. 11/179,206 (7 pgs).
United States Final Office Action mailed Apr. 18, 2007, in U.S. Appl. No. 10/373,621 (10 pgs).
United States Final Office Action mailed Aug. 20, 2007, in U.S. Appl. No. 10/364,115 (10 pgs).
United States Final Office Action mailed Aug. 21, 2007, in U.S. Appl. No. 10/185,511 (18 pgs).
United States Final Office Action mailed Aug. 22, 2008, in U.S. Appl. No. 10/185,511 (16 pgs).
United States Final Office Action mailed Aug. 24, 2007, in U.S. Appl. No. 10/185,278.
United States Final Office Action mailed Aug. 30, 2007, in U.S. Appl. No. 10/364,627.
United States Final Office Action mailed Feb. 12, 2009, in U.S. Appl. No. 11/107,014.
United States Final Office Action mailed Feb. 4, 2010, in U.S. Appl. No. 11/108,038.
United States Final Office Action mailed Jul. 12, 2011, in U.S. Appl. No. 12/053,090 (15 pgs).
United States Final Office Action mailed Mar. 16, 2010, in U.S. Appl. No. 11/107,709.
United States Final Office Action mailed Mar. 5, 2009, in U.S. Appl. No. 11/107,709.
United States Final Office Action mailed May 13, 2010, in U.S. Appl. No. 11/107,014.
United States Final Office Action mailed May 17, 2011, in U.S. Appl. No. 12/835,569 (25 pgs).
United States Final Office Action mailed Nov. 12, 2009, in U.S. Appl. No. 10/185,511 (26 pgs).
United States Final Office Action mailed Nov. 19, 2008, in U.S. Appl. No. 11/108,038.
United States Final Office Action mailed Nov. 19, 2009 in U.S. Appl. No. 11/134,719, 13 pgs.
United States Final Office Action mailed Nov. 19, 2009, in U.S. Appl. No. 11/134,719 (12 pgs).
United States Final Office Action mailed Nov. 24, 2009, in U.S. Appl. No. 10/364,115 (17 pgs).
United States Final Office Action mailed Sep. 1, 2006, in U.S. Appl. No. 10/364,627.
United States Final Office Action mailed Sep. 15, 2011, in U.S. Appl. No. 11/107,014.
United States Final Office Action mailed Sep. 19, 2006, in U.S. Appl. No. 10/185,278.
United States Final Office Action mailed Sep. 26, 2006, in U.S. Appl. No. 10/185,527 (16 pgs).
United States Final Office Action mailed Sep. 27, 2006, in U.S. Appl. No. 10/185,511 (15 pgs).
United States Final Office Action mailed Sep. 3, 2008, in U.S. Appl. No. 10/364,115 (13 pgs).
United States Non-Final Office Action mailed Apr. 14, 2008, in U.S. Appl. No. 10/793,997.
United States Non-Final Office Action mailed Aug. 18, 2006, in U.S. Appl. No. 10/373,458.
United States Non-Final Office Action mailed Aug. 18, 2008, in U.S. Appl. No. 11/107,709.
United States Non-Final Office Action mailed Aug. 7, 2008, in U.S. Appl. No. 11/108,038.
United States Non-Final Office Action mailed Aug. 9, 2007, in U.S. Appl. No. 11/179,206 (6 pgs).
United States Non-Final Office Action mailed Dec. 21, 2010, in U.S. Appl. No. 12/835,569 (19 pgs).
United States Non-Final Office Action mailed Feb. 10, 2009, in U.S. Appl. No. 10/364,115 (13 pgs).
United States Non-Final Office Action mailed Feb. 27, 2007, in U.S. Appl. No. 10/185,278.
United States Non-Final Office Action mailed Feb. 28, 2006, in U.S. Appl. No. 10/185,278.
United States Non-Final Office Action mailed Feb. 28, 2006, in U.S. Appl. No. 10/185,527 (18 pgs).
United States Non-Final Office Action mailed Jan. 10, 2008, in U.S. Appl. No. 10/185,278.
United States Non-Final Office Action mailed Jan. 14, 2009 in U.S. Appl. No. 11/134,719, 13 pgs.
United States Non-Final Office Action mailed Jan. 28, 2008, in U.S. Appl. No. 10/185,511 (15 pgs).
United States Non-Final Office Action mailed Jan. 31, 2007, in U.S. Appl. No. 10/373,458.
United States Non-Final Office Action mailed Jan. 8, 2008, in U.S. Appl. No. 10/364,627.
United States Non-Final Office Action mailed Jul. 17, 2008, in U.S. Appl. No. 10/185,278.
United States Non-Final Office Action mailed Jul. 27, 2009, in U.S. Appl. No. 11/108,038.
United States Non-Final Office Action mailed Jun. 6, 2006, in U.S. Appl. No. 10/373,621 (14 pgs).
United States Non-Final Office Action mailed Mar. 1, 2011, in U.S. Appl. No. 11/107,014.
United States Non-Final Office Action mailed Mar. 16, 2010, in U.S. Appl. No. 11/952,093 (5 pgs).
United States Non-Final Office Action mailed Mar. 30, 2009, in U.S. Appl. No. 10/185,511 (16 pgs).
United States Non-Final Office Action mailed Mar. 31, 2008, in U.S. Appl. No. 11/107,014.
United States Non-Final Office Action mailed Mar. 6, 2007, in U.S. Appl. No. 10/185,511 (17 pgs).
United States Non-Final Office Action mailed Mar. 7, 2008, in U.S. Appl. No. 10/364,115 (9 pgs).
United States Non-Final Office Action mailed Mar. 8, 2007, in U.S. Appl. No. 10/364,115 (9 pgs).
United States Non-Final Office Action mailed Mar. 9, 2006, in U.S. Appl. No. 10/185,511 (16 pgs).
United States Non-Final Office Action mailed May 11, 2010, in U.S. Appl. No. 10/185,511 (16 pgs).
United States Non-Final Office Action mailed May 15, 2007, in U.S. Appl. No. 10/364,627.
United States Non-Final Office Action mailed May 18, 2007, in U.S. Appl. No. 10/185,527 (15 pgs).
United States Non-Final Office Action mailed May 30, 2006, in U.S. Appl. No. 10/364,627.
United States Non-Final Office Action mailed Nov. 15, 2006, in U.S. Appl. No. 10/644,359.
United States Non-Final Office Action mailed Nov. 2, 2006, in U.S. Appl. No. 10/373,621 (9 pgs).
United States Non-Final Office Action mailed Oct. 1, 2007, in U.S. Appl. No. 10/793,997.
United States Non-Final Office Action mailed Oct. 31, 2008, in U.S. Appl. No. 11/179,206 (8 pgs).
United States Non-Final Office Action mailed Sep. 1, 2010, in U.S. Appl. No. 12/053,090 (14 pgs).
United States Non-Final Office Action mailed Sep. 18, 2008, in U.S. Appl. No. 10/364,627.
United States Non-Final Office Action mailed Sep. 23, 2009, in U.S. Appl. No. 11/107,709.
United States Non-Final Office Action mailed Sep. 24, 2006, in U.S. Appl. No. 10/364,115 (10 pgs).
United States Non-Final Office Action mailed Sep. 3, 2009, in U.S. Appl. No. 11/107,010.
United States Notice of Allowance mailed Dec. 26, 2007, in U.S. Appl. No. 10/373,621 (6 pgs).
United States Notice of Allowance mailed Feb. 10, 2009, in U.S. Appl. No. 10/185,278.
United States Notice of Allowance mailed Jul. 31, 2007, in U.S. Appl. No. 10/373,458.
United States Notice of Allowance mailed Jun. 1, 2007, in U.S. Appl. No. 10/644,359.
United States Notice of Allowance mailed May 11, 2009, in U.S. Appl. No. 10/364,627.
United States Notice of Allowance mailed May 14, 2009, in U.S. Appl. No. 11/179,206(6 pgs).
United States Notice of Allowance mailed Oct. 29, 2007, in U.S. Appl. No. 10/185,527 (13 pgs).
United States Notice of Allowance mailed Oct. 29, 2008, in U.S. Appl. No. 10/793,997.
United States Notice of Allowance mailed Sep. 24, 2010, in U.S. Appl. No. 10/185,511 (7 pgs).
United States Notice of Allowance mailed Septmeber 1, 2010, in U.S. Appl. No. 11/107,709.
United States Response to Apr. 1, 2011 action, filed Jun. 28, 2011 in U.S. Appl. No. 11/107,014 (11 pgs).
United States Response to Apr. 14, 2008 action, filed Jul. 15, 2008 in U.S. Appl. No. 10/793,997 (11 pgs).
United States Response to Apr. 16, 2008 office action, in U.S. Appl. No. 11/179,206, filed Oct. 15, 2008 (15 pgs).
United States Response to Apr. 18, 2007 office action, in U.S. Appl. No. 10/373,621, filed Jun. 18, 2007 (10 pgs).
United States Response to Apr. 18, 2007 office action, in U.S. Appl. No. 10/373,621, filed Sep. 17, 2007 (10 pgs).
United States Response to Aug. 18, 2006 action, filed Nov. 9, 2006 in U.S. Appl. No. 10/373,458 (19 pgs).
United States Response to Aug. 18, 2008 action, filed Nov. 18, 2008 in U.S. Appl. No. 11/107,709 (13 pgs).
United States Response to Aug. 20, 2007 office action, in U.S. Appl. No. No. 10/364,115, filed Oct. 22, 2007 (8 pgs).
United States Response to Aug. 21, 2007 action, filed Oct. 26, 2007 in U.S. Appl. No. 10/185,511 (15 pgs).
United States Response to Aug. 22, 2006 action, filed Nov. 19, 2008 in U.S. Appl. No. 10/185,511 (18 pgs).
United States Response to Aug. 24, 2007 action, filed Oct. 24, 2007 in U.S. Appl. No. 10/185,278 (8 pgs).
United States Response to Aug. 30, 2007 action, filed Oct. 16, 2007 in U.S. Appl. No. 10/364,627 (14 pgs).
United States Response to Aug. 7, 2008 office action, in U.S. Appl. No. 11/108,038, filed Nov. 6, 2008 (11 pgs).
United States Response to Aug. 9, 2007 office action, in U.S. Appl. No. 11/179,206, filed Janurary 9, 2008 (16 pgs).
United States Response to Dec. 21, 2010 office action, in U.S. Appl. No. 12/835,569, filed Mar. 21, 2011 (19 pgs).
United States Response to Feb. 10, 2009 office action, in U.S. Appl. No. 10/364,115, filed Jul. 7, 2009 (9 pgs).
United States Response to Feb. 12, 2009 action, filed Aug. 11, 2009 in U.S. Appl. No. 11/107,014 (11 pgs).
United States Response to Feb. 27, 2007 action, filed May 25, 2007 in U.S. Appl. No. 10/185,278 (9 pgs).
United States Response to Feb. 28, 2006 action, filed May 3, 2006 in U.S. Appl. No. 10/185,278 (20 pgs).
United States Response to Feb. 4, 2010 office action, in U.S. Appl. No. 11/108,038, filed May, 11 2010 (7 pgs).
United States Response to Jan. 10, 2008 action, filed Apr. 9, 2008 in U.S. Appl. No. 10/185,278 (11 pgs).
United States Response to Jan. 28, 2008 action, filed May 28, 2008 in U.S. Appl. No. 10/185,511 (16 pgs).
United States Response to Jan. 31, 2007 action, filed Apr. 30, 2007 in U.S. Appl. No. 10/373,458 (19 pgs).
United States Response to Jan. 8, 2008 action, filed May 8, 2008 in U.S. Appl. No. 10/364,627 (21 pgs).
United States Response to Jul. 12, 2011 office action, in U.S. Appl. No. 12/053,090, filed Nov. 14, 2011 (25 pgs).
United States Response to Jul. 17, 2008 action, filed Nov. 14, 2008 in U.S. Appl. No. 10/185,278 (14 pgs).
United States Response to Jul. 27, 2009 office action, in U.S. Appl. No. 11/108,038, filed Nov. 13, 2009 (8 pgs).
United States Response to Jun. 6, 2006 office action, in U.S. Appl. No. 10/373,621, filed Aug. 11, 2006 (16 pgs).
United States Response to Mar. 16, 2009 action, filed Jun. 7, 2010 in U.S. Appl. No. 11/107,709 (13 pgs).
United States Response to Mar. 30, 2009 action, filed Jun. 30, 2009 in U.S. Appl. No. 10/185,511 (18 pgs).
United States Response to Mar. 31, 2008 action, filed Sep. 29, 2008 in U.S. Appl. No. 11/107,014 (11 pgs).
United States Response to Mar. 5, 2009 action, filed Jun. 5, 2009 in U.S. Appl. No. 11/107,709 (13 pgs).
United States Response to Mar. 6, 2007 action, filed Jun. 5, 2007 in U.S. Appl. No. 10/185,511 (14 pgs).
United States Response to Mar. 7, 2008 office action, in U.S. Appl. No. 10/364,115, filed Jun. 9, 2008 (8 pgs).
United States Response to Mar. 8, 2007 office action, in U.S. Appl. No. 10/364,115, filed Jun. 8, 2007 (8 pgs).
United States Response to Mar. 9, 2006 action, filed Jun. 7, 2006 in U.S. Appl. No. 10/185,511 (20 pgs).
United States Response to May 11, 2010 action, filed Jul. 2, 2010 in U.S. Appl. No. 10/185,511 (22 pgs).
United States Response to May 13, 2010 action, filed Sep. 13, 2010 in U.S. Appl. No. 11/107,014 (11 pgs).
United States Response to May 15, 2007 action, filed Aug. 15, 2007 in U.S. Appl. No. 10/364,627 (14 pgs).
United States Response to May 17, 2011 office action, in U.S. Appl. No. 12/835,569, filed Sep. 19, 2011 (18 pgs).
United States Response to May 30, 2006 action, filed Aug. 11, 2006 in U.S. Appl. No. 10/364,627 (22 pgs).
United States Response to Nov. 12, 2009 action, filed Mar. 12, 2010 in U.S. Appl. No. 10/185,511 (19 pgs).
United States Response to Nov. 15, 2006 action, filed Feb. 15, 2007 in U.S. Appl. No. 10/644,359 (10 pgs).
United States Response to Nov. 19, 2008 office action, in U.S. Appl. No. 11/108,038, filed Jan. 23, 2009 (10 pgs).
United States Response to Nov. 19, 2008 office action, in U.S. Appl. No. 11/108,038, filed May, 12 2009 (6 pgs).
United States Response to Nov. 2, 2006 office action, in U.S. Appl. No. 10/373,621, filed Feb. 2, 2007 (9 pgs).
United States Response to Oct. 1, 2007 action, filed Dec. 28, 2007 in U.S. Appl. No. 10/793,997 (8 pgs).
United States Response to Oct. 31, 2008 office action, in U.S. Appl. No. 11/179,206, filed Mar. 31, 2009 (16 pgs).
United States Response to Office Action dated Feb. 28, 2006, filed May 10, 2006 in U.S. Appl. No. 10/185,527 (20 pgs).
United States Response to Office Action dated Jul. 14, 2009, filed Jul. 14, 2009 in U.S. Appl. No. 11/134,719, 11 pgs.
United States Response to Office Action dated May 18, 2007, filed Aug. 20, 2007 in U.S. Appl. No. 10/185,527 (13 pgs).
United States Response to Office Action dated Nov. 19. 2009, filed Jan. 19, 2010 in U.S. Appl. No. 11/134,719, 13 pgs.
United States Response to Office Action dated Sep. 26, 2006, filed Feb. 22, 2007 in U.S. Appl. No. 10/185,527 (24 pgs).
United States Response to Office Action dated Sep. 26, 2006, filed Nov. 14, 2006 in U.S. Appl. No. 10/185,527 (11 pgs).
United States Response to Sep. 1, 2006 action, filed Feb. 28, 2007 in U.S. Appl. No. 10/364,627 (17 pgs).
United States Response to Sep. 1, 2006 action, filed Oct. 27, 2006 in U.S. Appl. No. 10/364,627 (10 pgs).
United States Response to Sep. 1, 2010 office action, in U.S. Appl. No. 12/053,090, filed Dec. 1, 2010 (20 pgs).
United States Response to Sep. 18, 2008 action, filed Mar. 18, 2009 in U.S. Appl. No. 10/364,627 (21 pgs).
United States Response to Sep. 19, 2006 action, filed Jan. 19, 2007 in U.S. Appl. No. 10/185,278 (8 pgs).
United States Response to Sep. 19, 2006 action, filed Nov. 10, 2006 in U.S. Appl. No. 10/185,278 (16 pgs).
United States Response to Sep. 23, 2009 action, filed Dec. 21, 2009 in U.S. Appl. No. 11/107,709 (12 pgs).
United States Response to Sep. 27, 2006 action, filed Jan. 19, 2007 in U.S. Appl. No. 10/185,511 (16 pgs).
United States Response to Sep. 27, 2006 action, filed Nov. 8, 2006 in U.S. Appl. No. 10/185,511 (15 pgs).
United States Response to Sep. 27, 2006 office action, in U.S. Appl. No. 10/364,115, filed Dec. 27, 2006 (4 pgs).
United States Response to Sep. 3, 2008 office action, in U.S. Appl. No. 10/364,115, filed Nov. 3, 2008 (9 pgs).
United States Response to Sep. 3, 2009 action, filed Mar. 3, 2010 in U.S. Appl. No. 11/107,014 (10 pgs).
United States Supplemental Notice of Allowance mailed Oct. 16, 2007, in U.S. Appl. No. 10/373,458.
Valimaki, M. et al., “Digital rights management on open and semi-open networks”, WIAPP, 2001, 154-155.
Yu, H. “Digital multimedia at home and content rights management”, IEEE Proceedings 2002 IEEE 4.sup.th International Workshop on Networked Appliances, 2002, 49-56.
Australian Examiner's First Report mailed Jan. 22, 2010, in Australian Patent Application No. 2004288593. (2 pgs.).
Australian Examiner's First Report mailed May 26, 2009, in Application No. 2004200454 (4 pgs.).
Australian Examiner's First Report mailed Sep. 2, 2009, in Application No. 2004200468 (2 pgs.).
Australian Examiner's Second Report mailed Jun. 7, 2010, in Australian Patent Application No. 2005201572 (2 pgs.).
Australian Notice of Acceptance mailed Dec. 16, 2009, in Application No. 2004200468 (3 pgs.).
Australian Notice of Acceptance mailed May 7, 2010, in Australian Patent Application No. 2005201602 (3 pgs.).
Australian Notice of Acceptance mailed Oct. 14, 2010, in Australian Patent Application No. 2005201572 (3 pgs.).
Australian Response to Examiner's First Report mailed Jan. 14, 2010, in Australian Patent Application No. 2005201602, filed Apr. 14, 2010 (5 pgs.).
Australian Response to Examiner's First Report mailed Jan. 15, 2010, in Australian Patent Application No. 2005201572, filed May 11, 2010 (24 pgs.).
Australian Response to Examiner's First Report mailed May 26, 2009, in Application No. 2004200454, filed Sep. 8, 2009 (36 pgs.).
Australian Response to Examiner's First Report mailed Sep. 2, 2009, in Application No. 2004200468, filed Dec. 2, 2009 (40 pgs.).
Australian Response to Examiner's Second Report mailed Jun. 7, 2010, in Australian Patent Application No. 2005201572, filed Sep. 22, 2010 (19 pgs.).
Benjamin, R. et al., “Electronic markets and virtual value chains on the information superhighway,” Sloan Management Rev., Winter, 1995, 62-72. (10 pgs.).
Black box crypton defies the hackers, Electronic Weekly, 1985, 1257, p. 26 (from DialogClassic Web.TM. file 275, Accession No. 01116377). (1 pg.).
BreakerTech joins copyright management market. From http://www.findarticles.com, Computer International, 1999. (5 pgs.).
Cassidy, “A Web developers guide to content encapsulation technology,” Apr. 1997, 5 pages. (5 pgs.).
Chinese First Office Action mailed Jun. 27, 2008, in Chinese Application No. 200510004173.1 (17 pgs.).
Chinese First Office Action mailed Mar. 8, 2010, in Chinese Application No. 200680025291.3 (13 pgs.).
Chinese Notice on First Office Action mailed Apr. 17, 2009, in Chinese Patent Application No. 200410005381.9 (11 pgs.).
Chinese Notice on First Office Action mailed Apr. 6, 2007, in Chinese Patent Application No. 200410033028.1 (6 pgs.).
Chinese Notice on First Office Action mailed Jan. 16, 2009, in Chinese Patent Application No. 200480011309.5 (10 pgs.).
Chinese Notice on First Office Action mailed Nov. 30, 2007, in Chinese Patent Application No. 200510066707.3 (8 pgs.).
Adams, C. et al. “Internet X.509 Public Key Infrastructure Certificate Management Protocols”. Internet Engineering Task Force, Network Working Group, Mar. 1999, 1-72, XP-002284791. (62 pgs.).
Aladdin acquires the assets of Micro Macro Technologies. Business Wire, 1999 http://www.findarticles.com. (4 pgs.).
Aladdin Knowledge Systems Partners with Rights Exchange, Inc. To Develop a Comprehensive Solution for Electronic Software Distribution. Aug. 3, 1988, (5 pgs.).
Armati, D., “Tools and standards for protection, control and presentation of data,” Apr. 3, 1996. (17 pgs.).
Arsenault, A. et al. “InternetX.509 Public Key Infrastructure: Roadmap”. PKIX Working Group Internet Draft, Jul. 2002, 1-55, XP-002284790. (56 pgs.).
Australian Examiner's First Report mailed Jan. 14, 2010, in Australian Patent Application No. 2005201602. (1 pg.).
Australian Examiner's First Report mailed Jan. 15, 2010, in Australian Patent Application No. 2005201572. (2 pgs.).
Chinese Notice on Grant of Patent Right for Invention mailed Jan. 15, 2010, in Chinese Patent Application No. 200410033028.1 (4 pgs.).
Chinese Notice on Grant of Patent Right for Invention mailed Mar. 12, 2010, in Chinese Patent Application No. 200410005381.9 (4 pgs.).
Chinese Notice on Grant of Patent Right for Invention mailed Mar. 17, 2011, in Chinese Patent Application No. 200680025291.3 (4 pgs.).
Chinese Notice on Grant of Patent Right for Invention mailed Sep. 27, 2011, in Chinese Patent Application No. 200510004173.1 (4 pgs.).
Chinese Notice on Grant of Patent Right to Invention mailed Aug. 8, 2008, in Chinese Patent Application No. 200510066707.3 (4 pgs.).
Chinese Notice on Second Office Action mailed Aug. 28, 2009, in Chinese Patent Application No. 200410033028.1 (7 pgs.).
Chinese Notice on Second Office Action mailed Sep. 18, 2009, in Chinese Patent Application No. 200410005381.9 (9 pgs.).
Chinese Notice on Grant of Patent Right for Invention mailed Sep. 23, 2011, in Chinese Patent Application No. 200480011309.5 (4 pgs.).
Chinese Response to Second Office Action mailed Nov. 5, 2010, in Chinese Application No. 200680025291.3, filed Jan. 13, 2011 (7 pgs.).
Chinese Response to Telephone Conversation mailed Jan. 30, 2011, in Chinese Application No. 200680025291.3 (6 pgs.).
Chinese Response to First Office Action mailed Jun. 27, 2008, in Chinese Application No. 200510004173.1, filed Jan. 12, 2009 (19 pgs.).
Chinese Response to First Office Action mailed Mar. 8, 2010, in Chinese Application No. 200680025291.3, filed Jun. 3, 2010 (8 pgs.).
Chinese Response to Notice on First Office Action mailed Apr. 17, 2009, in Chinese Patent Application No. 200410005381.9, filed Jul. 30, 2009 (27 pgs.).
Chinese Response to Notice on First Office Action mailed Jan. 16, 2009, in Chinese Patent Application No. 200480011309.5, filed Jun. 24, 2010 (12 pgs.) [no. Translation].
Chinese Response to Notice on First Office Action mailed Nov. 30, 2007, in Chinese Patent Application No. 200510066707.3, filed Apr. 15, 2008 (52 pgs.).
Chinese Response to Second Office Action mailed Feb. 12, 2010, in Chinese Application No. 200510004173.1, filed Apr. 15, 2010 (17 pgs.).
Chinese Second Office Action mailed Feb. 12, 2010, in Chinese Application No. 200510004173.1 (16 pgs.).
Chinese Second Office Action mailed Nov. 5, 2010, in Chinese Application No. 200680025291.3 (9 pgs.).
Cox, B., “Superdistribution,” Idees Fortes, Sep. 1994. (2 pgs.).
Cox, B., “What if There Is a Silver Bullet,” J. Object Oriented Program., Jun. 1992. pp. 8-9 and 76.
Curet, et al., “RTP Payload Format for MPEG-4 FlexMultiplexed Streams”, Internet Engineering Task Force, Internet Draft, XP-001075015, Nov. 8, 2001, (12 pgs.).
European Communication mailed Apr. 14, 2010, in Application No. 04779484 (4 pgs.).
European Communication dated Dec. 17, 2004, in European Application No. 04003418.3 (7 pgs.).
European Communication dated Dec. 4, 2006, in European Application No. 03013557.8 (5 pgs.).
European Communication dated Feb. 15, 2006, in European Application No. 03013557.8 (6 pgs.).
European Communication dated Feb. 17, 2005, in European Application No. 03013557.8 (4 pgs.).
European Communication dated Mar. 6, 2006, in European Application No. 04003418.3 (5 pgs.).
European Communication dated Sep. 19, 2005, in European Application No. 04003418.3 (12 pgs.).
European Communication mailed Aug. 25, 2006, in Application No. 04001953 (4 pgs.).
European Communication mailed Mar. 2, 2007, in Application No. 05102768 (7 pgs.).
European Communication mailed Nov. 19, 2007, in Application No. 05102765 (7 pgs.).
European Communication mailed Oct. 14, 2008, in Application No. 00913629 (5 pgs.).
European Communication mailed Oct. 15, 2008, in Application No. 00915912 (7 pgs.).
European Decision dated Nov. 16, 2009, in European Application No. 03013557.8 (20 pgs.).
European Decision to Grant dated Feb. 19, 2009, in Application No. 04001953 (2 pgs.).
European Decision to Grant dated Sep. 13, 2007, in European Application No. 04003418.3 (2 pgs.).
European Decision to Grant mailed Mar. 11, 2010, in Application No. 05102768 (2 pgs.).
European Reply filed Feb. 25, 2009, in Application No. 00915912 (27 pgs.).
European Reply to Communication mailed Aug. 25, 2006, in Application No. 04001953, filed Mar. 5, 2007 (33 pgs.).
European Reply to Communication mailed Nov. 19, 2007, in Application No. 05102765, filed May 26, 2008 (20 pgs.).
European Reply to Communication mailed Oct. 14, 2008, in Application No. 00913629, filed Feb. 24, 2009 (38 pgs.).
European Response to Additional Telephone Interview, in Application No. 05102768, filed Nov. 18, 2008 (7 pgs.).
European Response to Communication mailed Apr. 14, 2010, in Application No. 04779484, filed Aug. 2, 2010 (15 pgs.).
European Response to Communication dated Dec. 17, 2004, in European Application No. 04003418.3, filed May 20, 2005 (12 pgs.).
European Response to Communication dated Dec. 4, 2006, in European Application No. 03013557.8, filed Jun. 14, 2007 (15 pgs.).
European Response to Communication dated Feb. 15, 2006, in European Application No. 03013557.8, filed Aug. 25, 2006 (16 pgs.).
European Response to Communication dated Feb. 17, 2005, in European Application No. 03013557.8, filed Jun. 27, 2005 (23 pgs.).
European Response to Communication dated Mar. 6, 2006, in European Application No. 04003418.3, filed Sep. 7, 2006 (12 pgs.).
European Response to Communication dated Sep. 19, 2005, in European Application No. 04003418.3, filed Jan. 30, 2006 (13 pgs.).
European Response to Communication mailed Mar. 2, 2007, in Application No. 05102768, filed Nov. 12, 2007 (26 pgs.).
European Response to Result of Consultation of Nov. 10, 2008, in Application No. 05102768 (22 pgs.).
European Response to Summons dated May 13, 2009, in European Application No. 03013557.8, filed Sep. 25, 2009 (18 pgs.).
European Response to Telephone Interview, in Application No. 05102768, filed Nov. 14, 2008 (21 pgs.).
European Response to the Invitation dated Nov. 28, 2008, in Application No. 05102768, filed Jan. 29, 2009 (7 pgs.).
European Response to the Summons to Attend Oral Proceedings mailed Jul. 17, 2008, in Application No. 05102768, filed Oct. 15, 2008 (17 pgs.).
European Search Report and Written Opinion in PCT/US2006/031185, date of mailing Jan. 16, 2007. (Pg. 12).
European Search Report dated Aug. 2, 2004, in European Application No. 03013557.8 (4 pgs.).
European Search Report dated Jul. 20, 2004, in European Application No. 04003418.3 (5 pgs.).
European Search Report filed Aug. 2, 2005, in Application No. 04001953 (4 pgs.).
European Search Report mailed Aug. 25, 2006, in Application No. 05102768 (3 pgs.).
European Search Report mailed Mar. 23, 2010, in Application No. 05101183 (4 pgs.).
European Search Report mailed Nov. 2, 2006, in Application No, 04779484 (3 pgs.).
European Search Report mailed Nov. 8, 2007, in Application No. 06774628 (3 pgs.).
European Search Report mailed Oct. 13, 2006, in Application No. 05102765 (3 pgs.).
European Search Report mailed Sep. 26, 2002, in Application No. 00915912 (3 pgs.).
European Summons to Attend Oral Proceedings dated May 13, 2009, in European Application No. 03013557.8 (7 pgs.).
European Summons to Attend Oral Proceedings mailed Jul. 17, 2008, in Application No. 05102768 (8 pgs.).
European Supplemental Search report filed Feb. 8, 2010, in Application No, 04779484 (3 pgs.).
Free On-Line Dictionary of Computing Concatenate. Dec. 22, 1995.
Gold, S. “Finland—Data fellows secures ICSA certification”, Newsbytes, 1998, (from DialogClassic Web(TM), File 9, Accession No. 01451058. (2 pgs.).
Handley, et al., “SDP: Session Description Protocol,” The Internet Society, 1998. (pp. 1-42).
Hauser, R.C., “Does licensing require new access control techniques?” Aug. 1993. (9 pgs.).
Hong, S. et al., “On the construction of a powerful distributed authentication server without additional key management”, Computer Communications, 2000, 23. (pp. 638-1644).
Housley, R. et al. “RFC 3280: Internet X.509 Public Key infrastructure Certificate and CRL Profile (w/o Annezes)” RFC 3280, Apr. 2002, XP002279343.
Hudgins-Bonafield, C. “Selling Knowledge on the Net,” Network Computing, Jun. 1, 1995. (pp. 102-109).
IBM spearheading intellectual property protection technology for information on the Internet. May 1996. (3 pgs.).
India First Examination Report mailed Jul. 27, 2011, in India Application No. 136/MUM/2004 (4 pgs.).
Indonesia Notice of the Results of Substantive Examination mailed Dec. 19, 2007, in Indonesia Patent Application No. P-00 2004 00074 (4 pgs.).
International Preliminary Examination Report on Patentability as issued in International Application No. PCT/US2000/04946 completed Oct. 23, 2002 (2 pgs.).
International Preliminary Examination Report on Patentability as issued in International Application No. PCT/US2000/04947 completed Aug. 27, 2002 (2 pgs.).
International Preliminary Examination Report on Patentability as issued in International Application No. PCT/US2000/04948 completed Oct. 23, 2002 (2 pgs.).
International Preliminary Examination Report on Patentability as issued in International Application No. PCT/US2000/04949 Oct. 23, 2002 (2 pgs.).
International Preliminary Examination Report on Patentability as issued in International Application No. PCT/US2000/04972 Sep. 4, 2002 (2 pgs.).
International Preliminary Examination Report on Patentability as issued in International Application No. PCT/US2000/04983 Oct. 31, 2002 (2 pgs.).
International Preliminary Examination Report on Patentability as issued in International Application No. PCT/US2000/05091 Apr. 12, 2002 (2 pgs.).
International Preliminary Examination Report on Patentability as issued in International Application No. PCT/US2004/024439 Nov. 1, 2006 (7 pgs.).
International Preliminary Examination Report on Patentability as issued in International Application No. PCT/US2006/026913 Jan. 16, 2008 (4 pgs.).
International Search Report as mailed Jul. 22, 2002 in International Application No. PCT/US2000/04949 (5 pgs.).
International Search Report as mailed Jul. 24, 2002 in International Application No. PCT/US2000/04946 (5 pgs.).
International Search Report as mailed Jul. 24, 2002 in International Application No. PCT/US2000/04948 (5 pgs.).
International Search Report as mailed Jul. 26, 2002 in International Application No. PCT/US2000/05091 (5 pgs.).
International Search Report as mailed Jul. 30, 2002 in International Application No. PCT/US2000/04983 (5 pgs.).
International Search Report as mailed Sep. 18, 2007 in International Application No. PCT/US2006/026913 (3 pgs.).
International Search Report as mailed Sep. 6, 2006 in International Application No. PCT/US2004/024439 (3 pgs.).
Jakobsson, M. et al., “Proprietary Certificates”, Topics in Cryptology, 2002. (pp. 164-181).
Kaplan, M.A., “IBM Cryptolopes.sub.—, Super-Distribution and Digital Rights Management,” Dec. 1996. (7 pgs.).
Kent, S.T., “Protecting externally supplied software in small computers,” Sep. 1980. (pp. 142 and 250-252).
Klemets, “RTP Payload Format for Video Codec 1 (VC-1),” Microsoft, Feb. 2006. (pp. 136).
Kohl, U. et al., “Safeguarding Digital Library Contents and Users; Protecting Documents Rather Than Channels,” D-Lib Magazine, Sep. 1997. (9 pgs.).
Kumik, P. “Digital Rights Management”, Computers and Law, 2000, 11(4). pp. 14-15).
Licenslt: kinder, gentler copyright? Copyright management system links content, authorship information. Seybold Report on Desktop Publishing, 1996, 10(11). (2 pgs.).
Linn, R.J., “Copyright and Information Services in the Context of the National Research and Education Network,” IMA Intell. Property Project Proceedings, Jan. 1994, 1(1). (pp. 1 and 10-20).
Managing Digital Rights in Online Publishing, “How two publishing houses maintin control of copyright” Information Management & Technology, 2001, 34(4). (pp. 168-169).
Maurer, Ueli, “Modeling a Public-Key Infrastructure,” XP002212747, Sep. 1999. (4 pgs.).
McNab, L., “Super-distribution works better in practical applications,” Mar. 2, 1998. (2 pgs.).
Menezes et al. Handbook of Applied Cryptography 1997 CRC Press. (pp. 31-32).
Moeller, M., “IBM takes charge of E-commerce; Plans client, server apps based on Set,” Apr. 1996. (4 pgs.).
Moeller, M., “NetTrust lets Cyberspace Merchants Take Account,” PC Week, Nov. 20, 1995, 12(48). (1 pg.).
Myers, et al. “Certificate Management Messages over CMS. Internet Engineering Task Force”, Network Working Group, Apr. 2000, (pp. 1-47), XP-002284794.
Myers, M. et al., “Internet X.509 Certificate Request Message Format”, Internet X.509, Mar. 1999, http://www.rfc.net/rfc2511.html,( 24 pgs.).
Nafaa, A. 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.
Olson, M., et al., “Concurrent access licensing,” UNIX Review, 1988, 6(9), (pp. 67-72 (from Dialog Accession No. 01254918).
Optimising license checkouts from a floating license server, ARM the Architecture for the Digital World, http://www.arm.com/support/faqdev/1391.html.
PCT/US2005/019935.
Pemberton, J., “An ONLINE Interview with Jeff Crigler at IBM InfoMarket,” Jul. 1996. (6 pgs.).
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).
Ramanujapuram, A. et al., “Digital Content & Intellectual Property Rights: A specification language and tools for rights management,” Dec. 1998, 20-23 and 26.
Rights Management in the Digital Age: Trading in Bits, Not Atoms. Spring, 1997, 4. (3 pgs.).
Rosoff, “Rights Management Comes to the Enterprise: Rights Management Beyond Digital Media”, posted Mar. 17, 2003, http://directionsonmicrosft.com/sample/DOMIS/update/2003/04apr/0403rmdte.htm, (5 pgs.)
Rouvroy, G. et al. “Reconfigurable hardware solutions for the digital rights management of digital cinema”, Oct. 2004, DRM '04: Proceedings of the 4th ACM workshop on Digital rights management, ACM. (pp. 40-53).
RTP Payload Format for MPEG-4 Streams. Internet Engineering Task Force, Internet Draft, XP-001033580, Jul. 2001. (41 pgs.).
Schneier, B., “Applied Cryptography Passage”, Applied Crytography, Protocols, Algorithms and Source Code in C, 1996, 2.sup.nd edition. (pp. 585-587), XP 000863833.
Schneier, B., “Applied Cryptography”, Applied Crytography, Protocols, Algorithms and Source Code in C, 1996, pp. 183-187 & 574-577), XP-002954321.
Schulzrinne, et al., “RTP: A Transport Protocol for Real-Time Applications,” The Internet Society, 2003. (pp. 1-104).
Schulzrinne, H. “RTP Profile for Audio and Video Conferences with Minimal Control”. RFC 1890, available at [[http://faqs.org/rfcs/rfc1890.html]], accessed Jan. 7, 2004, (14 pgs.).
Sibert, O. et al., “Securing the Content, Not the Wire, for Information Commerce,” Jul. 1995, (pp. 1-11).
Sibert, O. et al., “The DigiBox: A Self-protecting Container for Information Commerce,” First USENIX Workshop on Electronic Commerce, Jul. 11-12, 1995. (pp. 171-183).
Solution for piracy, Which Computer, 1983, p. 29 (from DialogClassic Web.TM. file 275, Accession No. 01014280).
Sony develops copyright protection solutions for digital music content. PR Newswire, 1999, http://www.findarticles.com.
Stefik, M., “Shifting the Possible: How Trusted Systems and Digital Property Rights Challenge Us to Rethink Digital Publishing,” Technical Perspective, 1997. (pp. 137-159).
Stefik, M., “Trusted Systems,” Mar. 1997. (8 pgs.).
Technological Solutions Rise to Complement Law's Small Stick Guarding Electronic Works. Information Law Alert, Jun. 16, 1995. (pp. 3-4 and 7).
The Directory Public-Key Attribute Certificate Frameworks. International Telecommunication Union, ITU-T Telecommunication Standardization Sector of ITU. Mar. 2000, XP-002284793.
Thompson, C.W., et al., “Digital licensing,” IEEE Internet Computing, 2005, 9(4).
Torrubia, A. et al., “Cryptography regulations for E-commerce and digital rights management”, Computers & Security, 2001, 20(8). (pp. 724-738).
Weber, R., “Digital Right Management Technologies,” Oct. 1995. (35 pgs.).
White, S.R. et al., “Abyss: A trusted architecture for software protection,” IEEE Symposium on Security and Privacy, Apr. 27-29, 1987. (pp. 38-51).
White, S.R. et al., “Abyss: An Architecture for Software Protection,” IEEE Trans. on Software Engineering, Jun. 1990, 16(6). (pp. 619-629).
Windows Media, “A Technical Overview of Windows Media DRM 10 for Devices,” Microsoft Corp. Sep. 2004.
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.
Written Opinion of the International Searching Authority as completed Apr. 29, 2006 in International Application No. PCT/US2004/024439 (6 pgs.).
Written Opinion of the International Searching Authority as completed Jul. 26, 2007 in International Application No. PCT/US2006/026913 (3 pgs.).
Zwollo, K. “Digital document delivery and digital rights management”, Information Services & Use, 2001, 9-11.
Ahuja, Gautama. “The Key to Keys,” DataQuest (India), Aug. 31, 1997 (from DialogClassic WebTM, file 619, Acc. No. 05010091) (6 pages).
Amdur, D. “Metering Online Copyright,” Jan. 16, 1996 (2 pages).
Amdur, D. (ed), “Intertrust Challenges IBM Digital Content Metering,” Report of Electronic Commerce, Jul. 23, 1996, 3(15), pp. 1-2 and 16-18 (5 pages).
Backman, D. “Smartcards: The Intelligent Way to Security,” Network Computing, 1998, 9(9) (4 pages).
Bankard Set to Into Virtual Shopping in Philippines, Newsbytes News Network, Apr. 16, 1997, (from DialogClassic WebTM file 9, acc. No. 01235815) (2 pages).
Boxing Up Bytes, 1993 (2 pages).
Chin, T.L., “Reaching Out to Physicians,” Health Data Management, Sep. 1998, 6(9) (5 pages).
Clark, T. “Software Secures Digital Content on Web,” Interactive Week, 1995 (1 page).
Craig, W. et al. “Digital Licensing,” IEEE Internet Computing, Jul./Aug. 2005, 9(4) (4 pages).
Discussion from microsoft.public.access.security, “? How to Prevent copying DB Application to Other Machines,” response from Dec. 22, 1998 (2 pages).
Hidgins-Bonafield, C. “Selling Knowledge on the Net,” Network Computing, 1995, pp. 102-109 (6 pages).
Kaliski, “Privacy Enhancement for Internet email-Part IV: Key Certification and Related Services,” RFC 1424, 1993 (9 pages).
Kopeikin, R. “Secure Trading on the NET,” Telecommunications International Edition, 1996, 30(10), pp. 89-90, 92 and 94 (4 pages).
Misra, R.B. et al., “Tamper Detection Using Neuro-Fuzzy Logic,” Ninth International Conference on Metering and Tariffs for Energy Supply, Conference Publication 462, May 25-28, 1999, pp. 101-108 (10 pages).
MS to Upgrade Browser Security, Cnet News.com, Mar. 20, 1997 (2 pages).
Network-based Authentication: The Key to Security, Network Computing, 1991 (3 pages).
Next Step is Encryption: Data Security may be Bundled with Next's Operating System, Electronic Engineering Times, 1992, Dialog Classic WebTM, file 16, acc No. 02103190 (2 pages).
Postal Service Announce Plan to Postmarks on Electronic Mail, San Jose Mercury News, Apr. 19, 1995, DialogClassic Web file 9, acc No. 00618375 (2 pages).
S-A Unveil Security System, Multichannel News, 1996, 18(3), 45 + file 9, acc No. 00864754 (3 pages).
Smith, M.G. et al. “A New Set of Rules for Information Commerce,” Electronic Commerce, 1995, pp. 34-35 (2 pages).
Stallings, W. Network and Internetwork Security Principles and Practice, 1995 (3 pages).
Stevens, M.G. “How Secure is Your Computer System?,” Practical Accountant, 1998, 31(1), pp. 24-32 (9 pages).
Suppliers Cashing in on the Internet, Communications Week International, Nov. 14, 1994, 134, 36 Dialog Classic Web file 9, acc No. 00564878 (3 pages).
Tarter, J. “The Superdistribution Model,” Soft Trends, 1996, 3(6), pp. 1-6 (6 pages).
The New Network: Planning and Protecting Intranet Electronic Commerce, Information Week, 1996, 608, Dialog Classic WebTM file 13, acc No. 00528101 (7 pages).
United States Amendment filed Jul. 30, 2012, in U.S. Appl. No. 13/274,217 (15 pages).
United States Amendment filed Aug. 16, 2012, in U.S. Appl. No. 11/353,321 (24 pages).
United States Notice of Allowance mailed Nov. 6, 2012, in U.S. Appl. No. 11/018,095 (8 pages).
USPTO Office Action, mailed Mar. 26, 2002, cited in U.S. Appl. No. 09/449,106 (14 pages).
USPTO Office Action, mailed Oct. 22, 2002, U.S. Appl. No. 09/449,106 (10 pages).
Japanese Notice of Rejection mailed Feb. 9, 2010, in Application No. 2004-050480 (12 pages).
Japanese Notice of Allowance mailed May 25, 2010, in Application No. 2004-050480 (6 pages).
Malaysia Substantive Examination mailed Apr. 23, 2008, in Application No. PI20040481 (2 pages).
Malaysia Notice of Allowance mailed Sep. 30, 2011, in Application No. PI20040481 (2 pages).
Malaysia Substantive Examination mailed Oct. 2, 2009, in Application No. PI20051703 (2 pages).
Malaysia Notice of Allowance mailed May 14, 2010, in Application No. PI20051703 (2 pages).
Polish Notice mailed Jan. 23, 2009, in Application No. P365549 (4 pages).
Polish Notice mailed Sep. 9, 2009, in Application No. P365549 (3 pages).
Philippines Office Action mailed Oct. 26, 2007, in Application No. 1-2004-000078 (1 page).
Russian Office Action mailed Jan. 25, 2008, in Application No. 2004105509 (8 pages).
Russian Decision on Grant mailed Jul. 25, 2008, in Application No. 2004105509 (13 pages).
Russian Office Action mailed Mar. 5, 2008, in Application No. 2004103871 (9 pages).
Russian Decision on Grant mailed Jun. 27, 2008, in Application No. 2004103871 (20 pages).
Russian Office Action mailed Apr. 22, 2009, in Application No. 2005112059 (3 pages).
Russian Decision to Grant mailed Jul. 16, 2009, in Application No. 2005112059 (20 pages).
Russian Decision to Grant mailed Mar. 16, 2009, in Application No. 2005112105 (18 pages).
Russian Decision to Grant mailed Aug. 13, 2008, in Application No. 2005120670 (6 pages).
Russian Decision to Grant mailed Oct. 6, 2010, in Application No. 2008101456 (22 pages).
Japanese Notice of Rejection mailed on Feb. 12, 2010, in Application No. 2004-035808 (7 pages).
Japanese Notice of Rejection mailed Jul. 23, 2010, in Application No. 2004-035808 (4 pages).
Japanese Notice of Allowance mailed Nov. 2, 2010, in Application No. 2004-035808 (6 pages).
Japanese Notice of Rejection mailed Dec. 3, 2010, in Application No. 2005-006781 (9 pages).
Japanese Final Rejection mailed Apr. 22, 2011, in Application No. 2005-006781 (7 pages).
Japanese Written Appeal filed Aug. 22, 2011, in Application No. 2005-006781 (23 pages).
Japanese Notice of Allowance mailed Oct. 7, 2011, in Application No. 2005-006781 (6 pages).
Japanese Notice of Rejection mailed Dec. 10, 2010, in Application No. 2005-124814 (11 pages).
Japanese Notice of Allowance mailed Apr. 26, 2011, in Application No. 2005-124814 (6 pages).
Japanese Notice of Rejection mailed May 20, 2011, in Application No. 2008-521533 (4 pages).
Japanese Notice of Allowance mailed Oct. 14, 2011, in Application No. 2008-521533 (6 pages).
Canadian Application 2456400, Office Action mailed Jan. 17, 2013 (2 pages).
Canadian Application 2456400, Office Action mailed Sep. 5, 2012 (2 pages).
Canadian Application 2456592, Office Action mailed Aug. 29, 2012 (5 pages).
Canadian Application 2457291, Office Action mailed Oct. 30, 2012 (6 pages).
Canadian Application 2457938, Office Action mailed Apr. 24, 2012 (3 pages).
Canadian Application 2504677, Office Action mailed Aug. 31, 2012 (2 pages).
Canadian Application 2505295, Office Action mailed May 29, 2012 (4 pages).
Chinese Notice on the Second Action mailed Aug. 3, 2012, in Chinese Application No. 200910139429.8 (11 pgs).
Chinese Notice on the Third Action mailed Feb. 21, 2013, in Chinese Application No. 200910139429.8 (8 pgs).
European Application 02014340.0, Search Report mailed Aug. 11, 2005 (3 pages).
India Application 135/MUM/2004, First Examination Report mailed Apr. 25, 2012 (2 pages).
Japanese Application 2002-186967, Decision to Grant a Patent mailed on Oct. 31, 2008 (6 pages).
Japanese Application 2002-186967, Official Notice of Rejection mailed Feb. 29, 2008 (12 pages).
Japanese Application 2002-186968, Notice of Allowance mailed Oct. 9, 2009 (6 pages).
Japanese Application 2002-186968, Notice of Rejection mailed Jun. 12, 2009 (7 pages).
Japanese Application 2002-186968, Official Notice of Rejection mailed Dec. 9, 2008 (33 pages).
Japanese Application 2004-035810, Decision to Decline the Amendment mailed Apr. 17, 2012 (14 pages).
Japanese Application 2004-035810, Interrogation mailed Sep. 2, 2011 (6 pages).
Japanese Application 2004-035810, Notice of Rejection mailed Apr. 17, 2012 (33 pages).
Japanese Application 2004-035810, Written Appeal mailed Jan. 21, 2011 (9 pages).
PCT Application PCT/US00/22972, Publication and International Search Report mailed Nov. 27, 2000 (128 pages).
PCT Application PCT/US00/23105, Publication and International Search Report mailed Dec. 21, 2000 (134 pages).
PCT Application PCT/US00/23106, Publication and International Search Report mailed Feb. 19, 2001 (130 pages).
PCT Application PCT/US00/23107, Publication and International Search Report mailed Nov. 22, 2000 (133 pages).
PCT Application PCT/US00/23108, Publication and International Search Report mailed Dec. 14, 2000 (131 pages).
SDMI Portable Device Specification Part 1 Version 1.0, Secure Digital Music Initiate, 1999 (35 pages).
U.S. Appl. No. 11/107,014, Amendment and Response filed Feb. 21, 2013 (15 pages).
U.S. Appl. No. 11/107,014, Amendment and Response filed Aug. 14, 2012 (13 pages).
U.S. Appl. No. 11/107,014, Amendment and Response filed Dec. 15, 2011 (11 pages).
U.S. Appl. No. 11/107,014, Final Rejection mailed Nov. 21, 2012 (10 pages).
U.S. Appl. No. 11/107,014, Non-Final Rejection mailed Mar. 14, 2012 (10 pages).
U.S. Appl. No. 09/525,509, Advisory Action mailed Aug. 10, 2005 (2 pages).
U.S. Appl. No. 09/525,509, Amendment After Notice of Allowance filed Jun. 12, 2007 (3 pages).
U.S. Appl. No. 09/525,509, Amendment and Response filed Jan. 7, 2005 (10 pages).
U.S. Appl. No. 09/525,509, Amendment and Response filed Feb. 27, 2006 (18 pages).
U.S. Appl. No. 09/525,509, Amendment and Response filed Jul. 22, 2005 (22 pages).
U.S. Appl. No. 09/525,509, Final Rejection mailed May 20, 2005 (24 pages).
U.S. Appl. No. 09/525,509, Non-Final Rejection mailed Oct. 6, 2004 (24 pages).
U.S. Appl. No. 09/525,509, Non-Final Rejection mailed Nov. 18, 2005 (22 pages).
U.S. Appl. No. 09/525,509, Notice of Allowance mailed Apr. 4, 2007 (7 pages).
U.S. Appl. No. 09/525,510, Advisory Action mailed Feb. 20, 2004 (2 pages).
U.S. Appl. No. 09/525,510, Advisory Action mailed Dec. 8, 2006 (2 pages).
U.S. Appl. No. 09/525,510, Amendment After Final filed May 2, 2003 (11 pages).
U.S. Appl. No. 09/525,510, Amendment After Notice of Allowance filed Jun. 12, 2007 (3 pages).
U.S. Appl. No. 09/525,510, Amendment and Response Sep. 22, 2003 (7 pages).
U.S. Appl. No. 09/525,510, Amendment and Response filed Jan. 10, 2005 (9 pages).
U.S. Appl. No. 09/525,510, Amendment and Response filed Jan. 26, 2004 (7 pages).
U.S. Appl. No. 09/525,510, Amendment and Response filed Apr. 25, 2006 (8 pages).
U.S. Appl. No. 09/525,510, Amendment and Response filed Jul. 8, 2005 (16 pages).
U.S. Appl. No. 09/525,510, Amendment and Response filed Nov. 4, 2002 (7 pages).
U.S. Appl. No. 09/525,510, Amendment and Response filed Nov. 13, 2006 (13 pages).
U.S. Appl. No. 09/525,510, Amendment and Response filed Dec. 16, 2005 (17 pages).
U.S. Appl. No. 09/525,510, Appeal Brief filed Jul. 12, 2004 (38 pages).
U.S. Appl. No. 09/525,510, Final Rejection filed Jan. 29, 2003 (12 pages).
U.S. Appl. No. 09/525,510, Final Rejection mailed Jul. 7, 2006 (13 pages).
U.S. Appl. No. 09/525,510, Final Rejection mailed Nov. 13, 2003 (12 pages).
U.S. Appl. No. 09/525,510, Non-Final Rejection mailed Jan. 23, 2006 (12 pages).
U.S. Appl. No. 09/525,510, Non-Final Rejection mailed 04/26/05 (11 pp.).
U.S. Appl. No. 09/525,510, Non-Final Rejection mailed Jun. 5, 2003 (11 pages).
U.S. Appl. No. 09/525,510, Non-Final Rejection mailed Sep. 3, 2002 (12 pages).
U.S. Appl. No. 09/525,510, Non-Final Rejection mailed Sep. 16, 2005 (12 pages).
U.S. Appl. No. 09/525,510, Non-Final Rejection mailed Oct. 12, 2004 (11 pages).
U.S. Appl. No. 09/525,510, Notice of Allowance mailed Apr. 3, 2007 (8 pages).
U.S. Appl. No. 09/525,510, Advisory Action mailed Nov. 2, 2005 (6 pages).
U.S. Appl. No. 09/892,298, Amendment After Final filed Oct. 11, 2005 (14 pages).
U.S. Appl. No. 09/892,298, Amendment and Response filed May 27, 2005 (17 pages).
U.S. Appl. No. 09/892,298, Final Rejection mailed Aug. 11, 2005 (16 pages).
U.S. Appl. No. 09/892,298, Non-Final Rejection mailed Mar. 16, 2005 (17 pages).
U.S. Appl. No. 09/892,298, Pre-Brief Appeal Conference Decision mailed Mar. 10, 2006 (2 pages).
U.S. Appl. No. 09/892,298, Pre-Brief Conference Request mailed Nov. 16, 2005 (6 pages).
U.S. Appl. No. 09/892,329, Advisory Action mailed Oct. 12, 2005 (3 pages).
U.S. Appl. No. 09/892,329, Amendment and Response filed Feb. 2, 2005 (13 pages).
U.S. Appl. No. 09/892,329, Amendment and Response filed Apr. 17, 2006 (23 pages).
U.S. Appl. No. 09/892,329, Amendment and Response filed Jul. 13, 2005 (20 pages).
U.S. Appl. No. 09/892,329, Amendment and Response filed Oct. 3, 2005 (24 pages).
U.S. Appl. No. 09/892,329, Amendment and Response filed Nov. 7, 2006 (19 pages).
U.S. Appl. No. 09/892,329, Final Rejection mailed Jul. 7, 2006 (14 pages).
U.S. Appl. No. 09/892,329, Final Rejection mailed Aug. 10, 2005 (13 pages).
U.S. Appl. No. 09/892,329, Non-Final Rejection mailed Jan. 18, 2006 (12 pages).
U.S. Appl. No. 09/892,329, Non-Final Rejection mailed Apr. 20, 2005 (12 pages).
U.S. Appl. No. 09/892,329, Non-Final Rejection mailed Nov. 2, 2004 (28 pages).
U.S. Appl. No. 09/892,329, Notice of Allowance mailed Jan. 16, 2007 (7 pages).
U.S. Appl. No. 09/892,371, Advisory Action mailed Nov. 3, 2005 (3 pages).
U.S. Appl. No. 09/892,371, Amendment and Response filed May 20, 2005 (20 pages).
U.S. Appl. No. 09/892,371, Amendment and Response filed Oct. 11, 2005 (25 pages).
U.S. Appl. No. 09/892,371, Final Rejection mailed Aug. 23, 2005 (15 pages).
U.S. Appl. No. 09/892,371, Non-Final Rejection mailed Mar. 8, 2005 (14 pages).
U.S. Appl. No. 09/892,371, Notice of Allowance mailed Feb. 10, 2006 (11 pages).
U.S. Appl. No. 10/980,743, Amendment and Response filed Jul. 8, 2008 (15 pages).
U.S. Appl. No. 10/980,743, Non-Final Rejection mailed Apr. 11, 2008 (14 pages).
U.S. Appl. No. 10/980,743, Notice of Allowance mailed Mar. 10, 2009 (7 pages).
U.S. Appl. No. 10/980,743, Notice of Allowance mailed Oct. 24, 2008 (7 pages).
U.S. Appl. No. 10/981,846, Amendment and Response filed Apr. 28, 2008 (10 pages).
U.S. Appl. No. 10/981,846, Non-Final Rejection mailed Jan. 28, 2008 (7 pages).
U.S. Appl. No. 10/981,846, Notice of Allowance mailed Jun. 2, 2008 (6 pages).
U.S. Appl. No. 10/982,105, Notice of Allowance mailed Dec. 2, 2005 (7 pages).
U.S. Appl. No. 10/982,578, Amendment and Response filed Feb. 24, 2010 (15 pages).
U.S. Appl. No. 10/982,578, Amendment and Response filed Feb. 25, 2009 (13 pages).
U.S. Appl. No. 10/982,578, Amendment and Response filed Jul. 14, 2010 (11 pages).
U.S. Appl. No. 10/982,578, Amendment and Response filed Jul. 23, 2009 (14 pages).
U.S. Appl. No. 10/982,578, Amendment and Response filed Sep. 11, 2008 (14 pages).
U.S. Appl. No. 10/982,578, Amendment and Response filed Dec. 17, 2010 (3 pages).
U.S. Appl. No. 10/982,578, Final Rejection mailed Nov. 24, 2009 (24 pages).
U.S. Appl. No. 10/982,578, Final Rejection mailed Nov. 2508 (17 pages).
U.S. Appl. No. 10/982,578, Non-Final Rejection mailed Apr. 14, 2010 (13 pages).
U.S. Appl. No. 10/982,578, Non-Final Rejection mailed Apr. 23, 2009 (13 pages).
U.S. Appl. No. 10/982,578, Non-Final Rejection mailed May 13, 2008 (16 pages).
U.S. Appl. No. 10/982,578, Notice of Allowance mailed Apr. 18, 2011 (9 pages).
U.S. Appl. No. 10/982,578, Notice of Allowance mailed Oct. 14, 2010 (7 pages).
U.S. Appl. No. 10/983,040, Advisory Action mailed Mar. 11, 2009 (3 pages).
U.S. Appl. No. 10/983,040, Amendment After Final filed Feb. 24, 2009 (12 pages).
U.S. Appl. No. 10/983,040, Amendment and Response filed Jan. 30, 2008 (10 pages).
U.S. Appl. No. 10/983,040, Amendment and Response filed Aug. 18, 2008 (10 pages).
U.S. Appl. No. 10/983,040, Amendment and Response filed Nov. 23, 2009 (10 pages).
U.S. Appl. No. 10/983,040, Final Rejection mailed Nov. 25, 2008 (11 pages).
U.S. Appl. No. 10/983,040, Non-Final Rejection mailed Apr. 17, 2008 (14 pages).
U.S. Appl. No. 10/983,040, Non-Final Rejection mailed May 28, 2009 (13 pages).
U.S. Appl. No. 10/983,040, Non-Final Rejection mailed Oct. 30, 2007 (10 pages).
U.S. Appl. No. 10/983,040, Notice of Allowance mailed Mar. 11, 2010 (6 pages).
U.S. Appl. No. 10/983,040, Notice of Allowance mailed Mar. 30, 2010 (6 pages).
U.S. Appl. No. 11/094,097, Advisory Action mailed Mar. 31, 2008 (3 pages).
U.S. Appl. No. 11/094,097, Amendment and Response filed Mar. 7, 2008 (13 pages).
U.S. Appl. No. 11/094,097, Amendment and Response filed Apr. 21, 2009 (9 pages).
U.S. Appl. No. 11/094,097, Amendment and Response filed Sep. 28, 2007 (13 pages).
U.S. Appl. No. 11/094,097, Amendment and Response filed Oct. 28, 2008 (11 pages).
U.S. Appl. No. 11/094,097, Final Rejection mailed Dec. 13, 2007 (17 pages).
U.S. Appl. No. 11/094,097, Non-Final Rejection mailed Jun. 28, 2007 (17 pages).
U.S. Appl. No. 11/094,097, Non-Final Rejection mailed Jul. 28, 2008 (20 pages).
U.S. Appl. No. 11/094,097, Notice of Allowance mailed Jul. 13, 2009 (12 pages).
U.S. Appl. No. 11/094,097, Supplemental Response filed Dec. 11, 2008 (14 pages).
U.S. Appl. No. 11/107,513, Amendment After Final filed Jun. 23, 2009 (7 pages).
U.S. Appl. No. 11/107,513, Amendment After Notice of Allowance filed Aug. 13, 2009 (6 pages).
U.S. Appl. No. 11/107,513, Amendment and Response filed Dec. 17, 2008 (12 pages).
U.S. Appl. No. 11/107,513, Final Rejection mailed Mar. 23, 2009 (8 pages).
U.S. Appl. No. 11/107,513, Non-Final Rejection mailed Sep. 19, 2008 (8 pages).
U.S. Appl. No. 11/107,513, Notice of Allowance mailed Jul. 9, 2009 (7 pages).
U.S. Appl. No. 11/108,038, Amendment and Response filed Apr. 9, 2012 (11 pages).
U.S. Appl. No. 11/108,038, Amendment and Response filed Sep. 4, 2012 (14 pages).
U.S. Appl. No. 11/108,038, Final Rejection mailed Jun. 4, 2012 (11 pages).
U.S. Appl. No. 11/108,038, Non-Final Rejection mailed Dec. 7, 2011 (9 pages).
U.S. Appl. No. 11/116,884, Notice of Allowance mailed Mar. 6, 2013 (8 pages).
U.S. Appl. No. 11/116,884, Notice of Allowance mailed Dec. 20, 2012 (8 pages).
U.S. Appl. No. 11/132,677, Advisory Action mailed Jan. 9, 2009 (3 pages).
U.S. Appl. No. 11/132,677, Amendment After Final filed Dec. 29, 2008 (17 pages).
U.S. Appl. No. 11/132,677, Amendment and Response filed Mar. 2, 2009 (14 pages).
U.S. Appl. No. 11/132,677, Amendment and Response filed Aug. 8, 2008 (17 pages).
U.S. Appl. No. 11/132,677, Final Rejection mailed Oct. 1, 2008 (10 pages).
U.S. Appl. No. 11/132,677, Non-Final Rejection mailed Apr. 8, 2008 (9 pages).
U.S. Appl. No. 11/132,677, Notice of Allowance mailed May 7, 2009 (6 pages).
U.S. Appl. No. 11/132,677, Notice of Allowance mailed Sep. 23, 2009 (6 pages).
U.S. Appl. No. 11/134,719, Amendment and Response filed Apr. 18, 2012 (8 pages).
U.S. Appl. No. 11/134,719, Final Rejection mailed May 3, 2012 (12 pages).
U.S. Appl. No. 11/134,719, Non-Final Rejection mailed Jan. 19, 2012 (10 pages).
U.S. Appl. No. 11/353,321, Amendment and Response filed Apr. 30, 2013 (22 pages).
U.S. Appl. No. 11/353,321, Final Rejection mailed Jan. 31, 2013 (13 pages).
U.S. Appl. No. 11/432,276, Amendment and Response filed Jan. 30, 2008 (7 pages).
U.S. Appl. No. 11/432,276, Amendment and Response filed Sep. 14, 2007 (11 pages).
U.S. Appl. No. 11/432,276, Non-Final Rejection mailed Jun. 14, 2007 (14 pages).
U.S. Appl. No. 11/432,276, Non-Final Rejection mailed Oct. 30, 2007 (8 pages).
U.S. Appl. No. 11/432,276, Notice of Allowance mailed Mar. 28, 2008 (4 pages).
U.S. Appl. No. 11/754,856, Amendment After Final filed Jun. 23, 2011 (8 pages).
U.S. Appl. No. 11/754,856, Amendment and Response filed Jan. 10, 2011 (10 pages).
U.S. Appl. No. 11/754,856, Amendment and Response filed Jun. 18, 2010 (10 pages).
U.S. Appl. No. 11/754,856, Amendment and Response filed Dec. 29, 2009 (9 pages).
U.S. Appl. No. 11/754,856, Final Rejection mailed Mar. 10, 2010 (14 pages).
U.S. Appl. No. 11/754,856, Final Rejection mailed Apr. 8, 2011 (5 pages).
U.S. Appl. No. 11/754,856, Non-Final Rejection mailed Sep. 29, 2009 (13 pages).
U.S. Appl. No. 11/754,856, Non-Final Rejection mailed Oct. 14, 2010 (14 pages).
U.S. Appl. No. 11/754,856, Notice of Allowance mailed Jul. 14, 2011 (7 pages).
U.S. Appl. No. 11/866,041, Advisory Action mailed Dec. 2, 2011 (3 pages).
U.S. Appl. No. 11/866,041, Amendment and Response filed Feb. 8, 2011 (9 pages).
U.S. Appl. No. 11/866,041, Amendment and Response filed Oct. 27, 2011 (9 pages).
U.S. Appl. No. 11/866,041, Final Rejection mailed Aug. 24, 2011 (12 pages).
U.S. Appl. No. 11/866,041, Non-Final Rejection mailed Oct. 12, 2010 (17 pages).
U.S. Appl. No. 12/014,081, Amendment and Response filed Jun. 23, 2010 (15 pages).
U.S. Appl. No. 12/014,081, Amendment and Response filed Nov. 18, 2010 (17 pages).
U.S. Appl. No. 12/014,081, Final Rejection mailed Aug. 20, 2010 (23 pages).
U.S. Appl. No. 12/014,081, Non-Final Rejection mailed Mar. 23, 2010 (20 pages).
U.S. Appl. No. 12/014,081, Non-Final Rejection mailed Oct. 11, 2012 (5 pages).
U.S. Appl. No. 12/053,090, Amendment and Response mailed Nov. 14, 2011 (25 pages).
U.S. Appl. No. 12/135,944, Amendment and Response filed Dec. 1, 2009 (2 pages).
U.S. Appl. No. 12/135,944, Non-Final Rejection mailed Sep. 1, 2009 (4 pages).
U.S. Appl. No. 12/135,944, Notice of Allowance mailed Dec. 24, 2009 (6 pages).
U.S. Appl. No. 13/274,217, Notice of Allowance mailed Jan. 8, 2013 (10 pages).
U.S. Appl. No. 13/367,198, Non-Final Rejection mailed Feb. 25, 2013 (13 pages).
U.S. Appl. No. 60/260543, filed Jan. 2001, Thomas et al.
A Unveil security system, Multichannel News, 1995, 18(3) p. 45 (from DialogClassic Web™, file 9, acc. No. 00864754).
Achieving Peak Performance: Insights from a Global Survey on Credit Risk and Collections Practices, GCI Group Pamphlet, (2002, 2004), 12 pages.
Anderson, R et al., “Tamper Resistance—A Cautionary Note, ” Proc. Of the 2nd USENIX Workshop on Electronic Commerce, Oakland, California, Nov. 1996, 1-11.
Arbaugh, “A Secure and Reliable Bootstrap Architecture”, IEEE Symposium on Security and Privacy, May 1997, pp. 65-71.
AU Examiners First Report, Application No. 2006220489, Jan. 25, 2010 (2 pages).
AU Examiners First Report, Application No. 2006220489, Sep. 15, 2009 (2 pages).
Bajikar, S., “Trusted Platform Module (TPM) based Security on Notebook PCs—White Paper”, Mobile Platforms Group Intel Corporation; XP002259678; http://www.intel.com/design/mobile/platform/downloads/Trusted Platform Module White Paper.pdf, (Jun. 20, 2002).
Bankard set to into virtual shopping in Philippines, Newsbytes News Network, 1997 (from DialogClassic Web™, file 9, acc. No. 01235815.
Bird, R., et al., “The KryptoKnight family of light-weight protocols for authentification and key distribution, ”IEEE, 1995, 31-41.
Black box crypton defies the hackers, Electronics Weekly, 1985, n1257 p. 26 (from DialogClassic Weekly, 1985, n1257 (from DialogClassic Web™, File 275, Acc. No. 011163377).
Blissmer, “Next Step is Encryption: Data Security May be Bundled with Next's Operating System”, Electronic Engineering Times, Feb. 3, 1992.
Boyl, J.P., et al. The Esprit Project Café High Security digital payment systems, ESORICs, LNCS 875, 1994, 217-230.
Breaker Tech Joins Copyright Management Market, Computergram International, Aug. 5, 1999, 2 pages.
Canadian Application 2457291, Office Action mailed Aug. 27, 2013, 2 pages.
Canadian Application 2457938, Notice of Allowance mailed Jul. 23, 2013, 2 pages.
Cante, T.M., et al., “Challenges to combining general-purpose and multimedia processors,” IEEE, Dec. 1997,33-37.
Chabaud, D., “Programmation des cartes VGA, ” Micro-Systems, 1990, 173-178 (no English abstract available).
Chinese Application 200910139429.8, Decision on Rejection mailed Jul. 31, 2013, 6 pages.
Choudhury et al. “Copyright Protection for Electronic Publishing over Computer Networks”, IEEE Network Magazine, Jun. 1994, 1-18.
Clark, P. et al., “Bits: A Smartcard Protected Operating System,” Comm Of the ACM, Nov. 1994, 37(11)m 66-70 and 94.
Clarke, Roger et al. “Technological Protections for Digital Copyright objects,” [Online] Jul. 2000, Retrieved from the Internet: http://www.anu.edu.au/people/Roger.Clarke/II/TPDCO.html [retrieved on Jul. 28, 2005].
Comino, N et al., “A Novel Data Distribution Technique for Host-Client Type Parallel Applications”, IEEE Transactions on Parallel and Distributed Systems, 2002, 13(2), 97-110.
Content Protection System Architecture A Comprehensive Framework for Content Protection, Content Protection Architecture: XP02259679; http://4centity.com/data/tech/cpsa/cpsa081.pdf, (Feb. 17, 2000).
Cylink: Public-Key Security Technology Granted to the Public; Cylink Announces the Reowned Diffie-Hellman Public-Key Technology Has Entered the Public Domain:, Business Wire, Sep. 16, 1997.
CyoLicence, Version 1.3.0, Released Mar. 5, 2005, cyotec.com, Printed Sep. 7, 2005.
Davida, George I., et al., “UNIX GUARDIANS: Active User Intervention in Data Protection”, Aerospace Computer Security Applications Conference, Fourth Dec. 12-16, (1988), 6 pages.
DMOD WorkSpace OEM Unique Features, www.dmod.com/oem/features, Retrieved from the Internet on Jan. 12, 2005, 3 pages.
EP Communication for Application No. 05823253.9-2212/1815322 PCT/US2005040942, Reference FBI18697, Aug. 13, 2010.
EP Communication for application No. 05851550.3-1243/ 1825391 PCT/US2005040967, Reference FBI18698, Jul. 5, 2012.
EP Communication for Application No. 05854752.2-1245/ 1829274 PCT/US2005046091, Reference FBI18701, Dec. 21, 2011.
Equifax Business Solutions—Manage Your Customers, Retrieved from the Internet from http://www.equifax.com/sitePages/biz/small Biz/?sitePage=manageCustomers on Oct. 14, 2005, 3 pages.
Eren, H. et al., Fringe-Effect Capacitive Proximity Sensors for Tamper Proof Enclosures, Proceedings of 2005 Sensors for Industry Conference (Feb. 2005), pp. 22-25.
European Application 12002880.8, Communication mailed Feb. 18, 2013 (4 pages).
European Application 12002880.8, Search Report mailed Jul. 10, 2012 (5 pages).
Europe Application 03013556.0, Summons to Attend Oral Proceedings mailed Sep. 3, 2013, 8 pages.
European Application 02011478.1, Communication mailed Jan. 18, 2011 (4 pages).
European Application 02011478.1, Search Report mailed Apr. 16, 2010 (7 pages).
European Application 02014340.0, Communication mailed Jul. 9, 2009 (4 pages).
European Application 02014340.0, Communication mailed Dec. 19, 2006 (6 pages).
European Application 02014340.0, Communication mailed Dec. 21, 2007 (5 pages).
European Application 02014340.0, Means of Redress mailed Nov. 9, 2011 (15 pages).
European Application 02014340.0, Results of Consultation mailed Nov. 7, 2011 (8 pages).
European Application 02014340.0, Summons to Attend Oral Proceedings mailed Jun. 21, 2011 (9 pages).
European Application 12002881.6, Communication mailed Feb. 18, 2013 (4 pages).
European Application 12002881.6, Search Report mailed Jul. 10, 2012 (5 pages).
European Extended Search Report mailed Oct. 8, 2013, in Application No. 06774628 (7 pgs).
Examiner's First Report on Application mailed Jun. 4, 2010, AU Application No. 2005222507, 2 pages.
Finland—Data fellows secures ICSA Certification, Newbytes, 1988 (from DialogClass Web™), File 9, Acc. No. 01451058, 2 pages.
Finnie et al., “Suppliers cashing in on the internet”, Communications Week International, 1994, N134, p. 36 (from DialogClassic Web, file 9, acc. No. 00564878), Nov. 14, 1994, 2 pages.
First Special Feature, Security Oriented Web Application Development, Part 3, Method for Realizing Secure Session Management, N+1 Network Guide (vol. 4, No. 1, Serial No. 32) Softbank Publishing Inc., (Jan. 2004), pp. 47-59.
Flonix: USB Desktop OS Solutions Provider, http://www.flonix.com, Retrieved from the Internet Jun. 1, 2005, (Copyright 2004), 2 pages.
Forward Solutions Unveils Industry's Most Advanced Portable Personal Computing system on USB Flash Memory Device:, Proquest, PR Newswire, http://proquest.umi.com/pqdweb?index=20&did=408811931&SrchMode=1&sid=6&Fmt=3. Retrieved from the Internet Feb. 15, 2008, (Sep. 22, 2003), 3 pages.
Gao, Jerry et al., “Online Advertising—Taxonomy and Engineering Perspectives”, http://www.engr.sjsu.edu/gaojerry/report/OnlineAdvertising%20.pdf, (2002), 33 pages.
Gilmont, T. et al., “An Architecture of Security Management Unit for Safe Hosting of Multiple Agents, ” IS&T/SPIE Conf. on Security and Watermarking of Multimedia Contents, San Jose, California, Jan. 1999, SPIE vol. 3657, 472-483.
Goering, Richard “Web Venture Offers Metered Access to EDA Packages—Startup Winds Clocks by the Hour Tools (E*CAD Will Launch Web Site That Provides Pay-Per-Use and Pay-Per-Hour Access to Range of Chip Design Software)”, Electronic Engineering Times (Nov. 6, 2000), 3 pages.
Hartung F. et al. “Digital Rights Management and Watermarking of Multimedia Content for M-Commerce Applications,” IEEE Communications Magazine, IEEE Service Center. Piscatawy, N.J., vol. 38, No. 11, Nov. 2000, pp. 78-84.
Housley, R. et al., “Metering: a Pre-Pay Technique”, Proceedings of the SPIE—The International Society for Optical Engineering, 1997, 3022, 527-531.
India Application 228/DEL/2004, First Examination Report mailed May 29, 2013, 2 pages.
India Application 892/DEL/2005, First Examination Report mailed Sep. 13, 2013, 2 pages.
Internet Dynamics: Internet Dynamics First to Ship Integrated Security Solution for Enterprise Intranets and Extranets; Conclave Accelerates Enterprise Deployment of Secure, High-Value Intranets and Extranets, Business Wire, Sep. 15, 1997.
Is Your Computer Secure?, Which Computer?—The Business Computer Magazine, Nov. 1983, 3 pages.
Ishii, S., et al., “2,048-bit public-key encryption processor, ” NTT Human Interface Labs., 998, 259-267 (Abstract on p. 261).
JP Final Rejection for Application No. 2000-608539, Dec. 24, 2009.
JP Notice of Rejection for Application No. 2005-301957, Jun. 8, 2012.
Kim, S. et al., “A Secure and Efficient Metering Scheme for Internet Advertising”, Journal of KISS: Computer Systems and Theory, 2002, 29(3-4) 153-160.
KR Preliminary Rejection for Application No. 10-2007-7012294, Reference 310476.07, Jul. 4, 2012.
Kwok, Sai H., “Digital Rights Management for the Online Music Business”, ACM SIGecom Exchanges, vol. 3, No. 3, (Aug. 2002), pp. 17-24.
Lampson, Butler et al., “Authentication in Distributed Systems: Theory and Practice”, ACM Transactions on Computer Systems, v10, 265 (1992), 18 pages.
Linn, “Privacy Enhancement for Internet Email—Part I: Message Encryption and Authentication Procedures”, RFC 1421, pp. 1-37, (Feb. 1993).
Looi, “A Note on Supplying a Trusted Clock via a Secure Device”, Computers & Security, Sep. 7, 1994.
Lotspiech, “Broadcast Encryption's Bright Future”, IEEE Computer, Aug. 2002.
Magic Desktop Automation Suite for the Small and Mid-Sized Business, printed from www.remedy.com/soultions/magic—it—suite.htm on Sep. 7, 2005 (Copyright 2005), 4 pages.
Malamud, “Network-Based Authentification: The Key to Security, ” Network Computing, Jun. 1991, 98-100.
Memon, “Protecting Digital Media Content”, Communications of the ACM Jul. 1998.
Migo by Power House Technologies Group, http://www.4migo.com, Retrieved from the Internet Jun. 1, 2005, (Copyright 2003), 3 pages.
Monitor Spearheads Call Logging Entry, Electronics Weekly, Mar. 6, 1985, 1 page.
Morales, Tatiana “Understanding Your Credit Score”, http://www.cbsnews.com/stories/2003/04/29/earlyshow/contributors/raymartin/main55152.shtml retrieved from the Internet on Apr. 23, 2009, (Apr. 30, 2003), 3 pages.
Mufti, Dr. Muid et al., “Design and Implementation of a Secure Mobile IP Protocol”, Networking and Communication, INCC 204, International Conference on Jun. 11-13, 2004, (2004), 5 pages.
MX Office Action for Application No. MX/a2007005660, Jul. 7, 2009.
Nakajima, S. “Do You Really Know It? Basics of Windows2000/XP Network, 4th Installment, What is Logon Like?”, Nikkei Business Publications, Inc., (Jan. 2004), pp. 116-121.
Next step is Encryption: data security many be bundled with next's operating system, Electronic Times, 1992, p. 18 (from DialogClassic Web™, file 16, acc. No. 02103190).
Notice of Acceptance mailed Oct. 14, 2010, AU Application No. 2005222507, 3 pages.
Ogata, “Provably Secure Metering Scheme”, ASIACRYPT 2000, Dec. 3, 2000.
Olson, M. et al., Concurrent access licensing, pp. 67-72, UNIX Review, vol. 6 No. 9 Sep. 1988 (from Dialog acc. No. 01254918.
Optimizing license checkouts from a floating license server, Arm the Architecture for the Digital World, from http://www.arm.com/support/faqdev/1391.html.
PCT International Search Report and Written Opinion for Application No. PCT/US05/40965, reference 311052 02, Apr. 25, 2007.
Postal service announce plan to put postmarks on electronic mail, San Jose Mercury Mews. 1995, (from DialogClassic Web, file 9, acc. No. 00618375.
Schneck, P.B., “Persistent Access Control to Prevent Piracy of Digital Information, ”, Proc. Of the IEEE, Jul. 1999, 87(7), 1239-1250.
Schubert, “Radios Controlled Standard Clock Uses Digital Correlation”, Elektronik, 1997. (English language abstract provided).
Shen, “A New Digital Watermarking Technique for Video”, ACM, Visual '02, Nov. 13, 2002.
Shi, Changgui et al., “A Fast MPEG Video Encryption Algorithm”, 1998, Bristol, UK; pp. 81-88.
Slusallek, “Vision-An Architecture for Global Illumination Calculation”, IEEE Transactions on Visualization and Computer Graphics, vol. 1, No. 1, Mar. 1995, pp. 77-96.
Sony Develops Copyright Protection Solutions for Digital Music Content, PR Newswire, Feb. 25, 1999, 4 pages.
Steinebach, “Digital Watermaking Basics—Applications—Limits”, NFD Information—Wissenschaft and Praxis, Jul. 2002.
Takura, “A Secure and Trusted Time Stamping Authority”, IWS 1999, IEEE, Feb. 18, 1999.
TCG Specification Architecture Overview, Revision 1.2, (Apr. 28, 2004), 55 pages.
Technological Solutions Rise to Complement Law's Small Stick Guarding Electronic Works, Information Law Alert, Jun. 16, 1995-, 3-4 and 7.
The New Network: Planning and Protecting Intranet Electronic Commerce, Information week, Dec. 2, 1996, 2 pages.
Thompson, C. et al., Digital Licensing, IEEE Internet Computing, Jul./Aug. 2005 (vol. 9 No. 4).
Tyler, L. Chin “Reaching out physicians, ” Health Data Management, 1998, 6(9), pp. 36,38,40 (from DialogClassic Web™, file 13, acc. No. 00588764).
U.S. Appl. No. 09/449,106, Amendment and Response filed Jan. 29, 2003, 11 pages.
U.S. Appl. No. 09/449,106, Amendment and Response filed Jul. 23, 2002, 14 pages.
U.S. Appl. No. 09/449,106, Non-Final Office Action mailed Mar. 26, 2002, 14 pages.
U.S. Appl. No. 09/449,106, Non-Final Office Action mailed Oct. 22, 2002, 10 pages.
U.S. Appl. No. 09/449,106, Notice of Allowance mailed Jan. 3, 2004, 13 pages.
U.S. Appl. No. 09/526,290, Amendment and Response filed Jan. 29, 2003, 12 pages.
U.S. Appl. No. 09/526,290, Non-Final Office Action mailed Oct. 22, 2002, 10 pages.
U.S. Appl. No. 09/526,290, Notice of Allowance mailed Jan. 30, 2004, 11 pages.
U.S. Appl. No. 09/526,291, Amendment and Response filed Apr. 15, 2004, 24 pages.
U.S. Appl. No. 09/526,291, Non-Final Office Action mailed Nov. 25, 2003, 17 pages.
U.S. Appl. No. 09/526,291, Notice of Allowance mailed Jul. 13, 2004, 4 pages.
U.S. Appl. No. 09/526,292, Amendment and Response filed Jan. 26, 2004, 12 pages.
U.S. Appl. No. 09/526,292, Non-Final Office Action mailed Nov. 17, 2003, 10 pages.
U.S. Appl. No. 09/526,292, Notice of Allowance mailed Jun. 9, 2004, 5 pages.
U.S. Appl. No. 09/645,887, Final Office Action mailed Aug. 10, 2005, 11 pages.
U.S. Appl. No. 09/645,887, Non- Final Office Action filed Feb. 9, 2005, 10 pages.
U.S. Appl. No. 09/645,887, Non-Final Office Action mailed Mar. 25, 2004, 11 pages.
U.S. Appl. No. 09/645,887, Notice of Allowance mailed Nov. 30, 2005, 7 pages.
U.S. Appl. No. 10/971,346, Final Rejection mailed Jul. 16, 2013, 17 pages.
U.S. Appl. No. 11/107,014, Non-Final Rejection mailed Sep. 5, 2013, 12 pages.
U.S. Appl. No. 11/353,321, Amendment and Response filed Aug. 20, 2013, 21 pages.
U.S. Appl. No. 11/353,321, Non-Final Rejection mailed May 21, 2013, 15 pages.
U.S. Appl. No. 11/866,041, Non-Final Rejection mailed Jun. 14, 2013, 9 pages.
U.S. Appl. No. 12/053,090, Notice of Allowance mailed Sep. 23, 2013, 14 pages.
U.S. Appl. No. 12/832,831, Notice of Allowance mailed Oct. 3, 2013, 14 pages.
U.S. Appl. No. 13/367,198, Amendment and Response filed Jul. 9, 2013, 12 pages.
Using Windows Media Rights Manager to Protect and Distribute Digital Rights Media, Windows Media Technologies (Online): XP002307161; http://msdn.microsoft/msdnmag/issues/01/12/DRM/print.asp, (Dec. 1, 2001).
Utagawa, Mari et al., “Creation of Card Application by IC Card OS ‘MULTOS’ Which Can Rewrite Application”, Interface, vol. 29, No. 3. ISSN: 0387-9569, CQ Publishing Co. Ltd., (Mar. 1, 2003), pp. 46-55.
Vernon, P., “Improved identification schemes based on error-correcting codes, ” AAECC, 1997, 57-69.
WDM Audio Design Considerations, Copyright 2004, intelligraphics.com, Intelligraphics Device Drivers, Printed Apr. 15, 2005.
WebServUSB Quick Start, ItWorks, http://www.webservusb.com, Retrieved from the Internet Jun. 1, 2005 (Copyright 2004), 16 pages.
Yue, Wei T., et al., “The Reward Based Online Shopping Community”, Routledge, vol. 10, No. 4, (Oct. 1, 2000), 2 pages.
Zemao, Chen et al., “A Malicious Code Immune Model Based on Program Encryption”, IEEE—Wireless Communication, Networking and Mobile Computing, WICOM '08, 4th International Conference on Oct. 12-14, 2008 (2008), 5 pages.
Zhao, Hua “A New Watermarking Scheme for CAD Engineering Drawings”, 9th Intl. Conf. Computer-Aided Industrial Design and Conceptual Design: CAID/CD 2008; Nov. 22-25, 2008.
Canadian Application 2505295, Office Action mailed Nov. 19, 2013, 4 pages.
India Application 914/DEL/2005, First Examination Report mailed Nov. 26, 2013, 2 pages.
U.S. Appl. No. 10/971,346, Final Office Action mailed Nov. 7, 2013, 22 pages.
U.S. Appl. No. 11/107,014, Amendment and Response filed Dec. 5, 2013, 13 pages.
U.S. Appl. No. 11/353,321, Final Office Action mailed Dec. 5, 2013, 15 pages.
U.S. Appl. No. 11/107,014, Notice of Allowance mailed Dec. 23, 2013, 6 pages.
U.S. Appl. No. 12/053,090, Notice of Allowance mailed Nov. 18, 2013, 9 pages.
U.S. Appl. No. 13/367,198, Final Office Action mailed Oct. 25, 2013, 15 pages.

Related Publications (1)

	Number	Date	Country
	20100281253 A1	Nov 2010	US

Continuations (2)

	Number	Date	Country
Parent	12053090	Mar 2008	US
Child	12832831		US
Parent	10373621	Feb 2003	US
Child	12053090		US

Issuing a publisher use license off-line in a digital rights management (DRM) system

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

International Classifications

Term Extension

Abstract