Techniques for defining, using and manipulating rights management data structures
A descriptive data structure provides an abstract representation of a rights management data structure such as a secure container. The abstract representation may describe, for example, the layout of the rights management data structure. It can also provide metadata describing or defining other characteristics of rights management data structure use and/or processing. For example, the descriptive data structure can provide integrity constraints that provide a way to state rules about associated information. The abstract representation can be used to create rights management data structures that are interoperable and compatible with one another. This arrangement preserves flexibility and ease of use without compromising security.
This application is a continuation of application Ser. No. 09/819,063, filed Sep. 28, 2000, which is a continuation of application Ser. No. 09/300,778, filed Apr. 27, 1999, now U.S. Pat. No. 6,138,119, which is a continuation of application Ser. No. 08/805,804, filed Feb. 25, 1997, now U.S. Pat. No. 5,920,861, all of which are incorporated herein by reference. This application is related to commonly assigned application Ser. No. 08/388,107 of Ginter et al. entitled “SYSTEMS AND METHODS FOR SECURE TRANSACTION MANAGEMENT AND ELECTRONIC RIGHTS PROTECTION,” filed Feb. 13, 1995, now abandoned; and application Ser. No. 08/699,712 of GINTER et al. entitled “TRUSTED INFRASTRUCTURE SUPPORT SYSTEMS, METHODS AND TECHNIQUES FOR SECURE ELECTRONIC COMMERCE ELECTRONIC TRANSACTIONS AND RIGHTS MANAGEMENT” filed Aug. 12, 1996, now abandoned, both of which are incorporated herein by reference into this application.FIELD OF THE INVENTION
This invention relates to techniques for defining, creating, and manipulating rights management data structures. More specifically, this invention provides systems and processes for defining and/or describing at least some data characteristics within a secure electronic rights management container. The present invention also provides techniques for providing rights management data structure integrity, flexibility, interoperability, user and system transparency, and compatibility.BACKGROUND AND SUMMARY OF THE INVENTION(S)
People are increasingly using secure digital containers to safely and securely store and transport digital content. One secure digital container model is the “DigiBox™” container developed by InterTrust Technologies Corp. of Sunnyvale Calif. The Ginter et al. patent specification referenced above describes many characteristics of this DigiBox™ container model—a powerful, flexible, general construct that enables protected, efficient and interoperable electronic description and regulation of electronic commerce relationships of all kinds, including the secure transport, storage and rights management interface with objects and digital information within such containers.
Briefly, DigiBox containers are tamper-resistant digital containers that can be used to package any kind of digital information such as, for example, text, graphics, executable software, audio and/or video. The rights management environment in which DigiBox™ containers are used allows commerce participants to associate rules with the digital information (content). The rights management environment also allows rules (herein including rules and parameter data controls) to be securely associated with other rights management information, such as for example, rules, audit records created during use of the digital information, and administrative information associated with keeping the environment working properly, including ensuring rights and any agreements among parties. The DigiBox™ electronic container can be used to store, transport and provide a rights management interface to digital information, related rules and other rights management information, as well as to other objects and/or data within a distributed, rights management environment. This arrangement can be used to provide an electronically enforced chain of handling and control wherein rights management persists as a container moves from one entity to another. This capability helps support a digital rights management architecture that allows content rightsholders (including any parties who have system authorized interests related to such content, such as content republishers or even governmental authorities) to securely control and manage content, events, transactions, rules and usage consequences, including any required payment and/or usage reporting. This secure control and management continues persistently, protecting rights as content is delivered to, used by, and passed among creators, distributors, repurposers, consumers, payment disagregators, and other value chain participants.
For example, a creator of content can package one or more pieces of digital information with a set of rules in a DigiBox secure container—such rules may be variably located in one or more containers and/or client control nodes—and send the container to a distributor. The distributor can add to and/or modify the rules in the container within the parameters allowed by the creator. The distributor can then distribute the container by any rule allowed (or not prohibited) means—for example, by communicating it over an electronic network such as the Internet. A consumer can download the container, and use the content according to the rules within the container. The container is opened and the rules enforced on the local computer or other InterTrust-aware appliance by software InterTrust calls an InterTrust Commerce Node. The consumer can forward the container (or a copy of it) to other consumers, who can (if the rules allow) use the content according to the same, differing, or other included rules—which rules apply being determined by user available rights, such as the users specific identification, including any class membership(s) (e.g., an automobile club or employment by a certain university). In accordance with such rules, usage and/or payment information can be collected by the node and sent to one or more clearinghouses for payment settlement and to convey usage information to those with rights to receive it.
The node and container model described above and in the Ginter et al. patent specification (along with similar other DigiBox/VDE (Virtual Distribution Environment) models) has nearly limitless flexibility. It can be applied to many different contexts and specific implementations. For example, looking at
The InterTrust DigiBox container model allows and facilitates these and other different container uses. It facilitates detailed container customization for different uses, classes of use and/or users in order to meet different needs and business models. This customization ability is very important, particularly when used in conjunction with a general purpose, distributed rights management environment such as described in Ginter, et al. Such an environment calls for a practical optimization of customizability, including customizability and transparency for container models. This customization flexibility has a number of advantages, such as allowing optimization (e.g., maximum efficiency, minimum overhead) of the detailed container design for each particular application or circumstance so as to allow many different container designs for many different purposes (e.g., business models) to exist at the same time and be used by the rights control client (node) on a user electronic appliance such as a computer or entertainment device.
While supporting a high degree of flexibility has great advantages, it can produce difficulties for the average user. For example, think of the process of creating a painting. A master painter creates a painting from a blank canvas. Because the canvas was blank at the beginning, the painter was completely unconstrained. The painting could have been a landscape, a portrait, a seascape, or any other image—limited only by the painter's imagination. This flexibility allows a master painter to create a masterpiece such as the “Mona Lisa.” However, great skill is required to create a pleasing image starting from a blank canvas. As a result, an inexperienced painter cannot be expected to create a good painting if he or she begins with a blank canvas.
Consider now an amateur painter just starting out. That person does not have the skill to transform a blank canvas to a pleasing image. Instead of spending years trying to acquire that skill, the amateur can go out and buy a “paint by numbers” painting kit. Instead of using a blank canvas, the amateur painter begins with a preprinted canvas that defines the image to be painted. By following instructions (“all areas labeled “12” should be painted with dark red,” “all areas labeled with “26” should be painted with light blue”), the amateur can—with relatively little skill—paint a picture that is relatively pleasing to the eye. To do this, the amateur must rigidly adhere to the preprinted instructions on the canvas. Any deviations could cause the final image to come out badly.
Ease of use problems in the computer field can be analogized to the “paint by numbers” situation. If it is important for untrained and/or inexperienced users to use particular software, the system designers can predefine certain constructs and design them into the system. This technique allows inexperienced users to make use of potentially very complicated designs without having to fully understand them—but this normally strictly defines, that is severely limits, the functionality and flexibility available by use of the program. As a result, creative solutions to problems are constrained in order to provide practical value. In addition, even the experienced user can find great advantage in using previously implemented designs. Because a user can program a complex program, for example, does not mean it is appropriate or efficient to create a program for a specific purpose, even if the previously implemented program is not ideal. If the creation of a new program “costs” more to create, that is takes too much time or financial resources, the experienced user will normally use a previously implemented program, if available. Therefore, the greatest total amount of value to be realized, related to customization, is to be able to customize with great ease and efficiency so that the cost of customization will not exceed the benefits.
Uniformity, flexibility, compatibility and interoperability are other considerations that come into play in the computer field, particularly in regards to systems supporting customization. In the painting situation, the human eye can appreciate uniqueness—and the “one of a kind” nature of a masterpiece such as the Mona Lisa is a big part of what makes a painting so valuable. In contrast, it is often desirable to make uniform at least the overall layout and format of things in the computer field. It is much more efficient for a computer to know beforehand how to treat and use objects. If the computer doesn't know beforehand how to read or handle an input object, for example, then the computer and the object are said to be “incompatible”, i.e., they cannot work together. Computers are said to be “interoperable” if they can work together. Incompatibility and interoperability problems can prevent one computer from talking to another computer, and can prevent you from using computer data created by someone else.
For example, in the non-computer world, a Frenchman who knows only a little English as a second language, might find it far more meaningful and efficient to describe a complex problem in his native tongue, French. But if he is speaking to a second person, an Englishman, and the Englishman does not understand French, the two are not interoperable in French, and the Frenchman must resort to the far less efficient option of speaking in English to the Englishman. Of course, this is far better than if he was trying to speak to a German who understood neither English nor French. Then the two would be not be “interoperable” in regards to discussing the problem. Similarly, because rights management containers may potentially be exchanged and used for a large number of different purposes by a large number of different users, groups, and organizations, it is very important to provide compatibility and interoperability if these different parties, each participating in one or more different rights management models, are to interoperate efficiently. For example, if a rights management container is used to distribute a newsletter and is optimized for this purpose, each reader of the newsletter must have a computer system or software that “knows” how to read the container and the newsletter it contains. Since commerce, such as distributing newsletters, needs to be as efficient and cost-effective as is feasible, it is important to optimize, that is customize, rights management containers to optimally reflect the requirements of their models and not to have unnecessary features for each respective application or class of application, since unnecessary features will require unnecessary computing overhead and/or storage space.
Different newsletter publishers may use different container formats customized to their own particular newsletters and/or content types and/or formats. A newsletter reader interested in many different newsletters may need to be able to read a large number of different formats. It normally will not efficient (or, due to security issues, may not be appropriate) simply to analyze the different containers upon delivery and “try to figure out” or otherwise discern the particular format in use.
Published standards may help achieve a level of interoperability and standards for given types of applications, but it generally takes a long time for any particular standard to achieve industry-wide acceptance and standards will need to vary widely between categories of applications. Moreover, data structure and other standards are often designed to the lowest common denominator—that is, they will carry fields and requirements not needed by some, and miss others features optimal in certain cases. There will always be applications that cannot be optimized for efficiency and/or operation if forced to use a specific standard.
Trade-offs between flexibility, ease of use and incompatibility and interoperability can be further complicated when security considerations come into play. To be effective in many electronic commerce applications, electronic container designs should be tamper-resistant and secure. One must assume that any tools widely used to create and/or use containers will fall into the hands of those trying to break or crack open the containers or otherwise use digital information without authorization. Therefore, the container creation and usage tools must themselves be secure in the sense that they must protect certain details about the container design. This additional security requirement can make it even more difficult to make containers easy to use and to provide interoperability.
The above-referenced Ginter et al. patent specification describes, by way of non-exhaustive example, “templates” that can act as a set (or collection of sets) of control instructions and/or data for object control software. See, for example, the “Object Creation and Initial Control Structures,” “Templates and Classes,” and “object definition file,” “information” method and “content” methods discussions in the Ginter et al. specification. The described templates are, in at least some examples, capable of creating (and/or modifying) objects in a process that interacts with user instructions and provided content to create an object. Ginter et al. discloses that templates may be represented, for example, as text files defining specific structures and/or component assemblies, and that such templates—with their structures and/or component assemblies—may serve as object authoring and/or object control applications. Ginter et al. says that templates can help to focus the flexible and configurable capabilities inherent within the context of specific industries and/or businesses and/or applications by providing a framework of operation and/or structure to allow existing industries and/or applications and/or businesses to manipulate familiar concepts related to content types, distribution approaches, pricing mechanisms, user interactions with content and/or related administrative activities, budgets, and the like. This is useful in the pursuit of optimized business models and value chains providing the right balance between efficiency, transparency, productivity, etc.
The present invention extends this technology by providing, among other features, a machine readable descriptive data structure for use in association with a rights management related (or other) data structure such as a secure container. In one example, the machine readable descriptive data structure may comprise a shorthand abstract representation of the format of the data within a rights management related data structure. This abstract data representation can be used to describe a single rights management data structure, or it may be generic to a family of data structures all following the format and/or other characteristics the abstract representation defines. The abstract representation may be used to create rights management data structures, allow others (including “other” rights management nodes automatically) to read and understand such data structures, and to manipulate some or all of the data structures.
The descriptive data structure can be used as a “template” to help create, and describe to other nodes, rights management data structures including being used to help understand and manipulate such rights management data structures.
In one particularly advantageous arrangement, the machine readable descriptive data structure may be associated with one or a family of corresponding rights management data structures—and may thus be independent of any specific particular rights management data structure usage. For example, a copy of the descriptive data structure may be kept with such data structures. Alternatively, some or all of the descriptive data structure may be obtained from somewhere else (e.g., a clearinghouse or repository) and independently delivered on as-needed basis.
In accordance with one example, the machine readable descriptive data structure provides a description that reflects and/or defines corresponding structure(s) within the rights management data structure. For example, the descriptive data structure may provide a recursive, hierarchical list that reflects and/or defines a corresponding recursive, hierarchical structure within the rights management data structure. In other examples, the description(s) provided by the descriptive data structure may correspond to complex, multidimensional data structures having 2, 3 or n dimensions. The descriptive data structure may directly and/or indirectly specify where, in an associated rights management data structure, corresponding defined data types may be found. The descriptive data structure may further provide metadata that describes one or more attributes of the corresponding rights management data and/or the processes used to create and/or use it. In one example, the entire descriptive data structure might be viewed as comprising such metadata.
The machine readable descriptive data structure may or may not be, in part or in whole, protected, depending on the particular application. Some machine readable descriptive data structures may be encrypted in whole or in part, while others might be maintained in “clear” form so that they are easily accessible. Some machine readable description data structures, whether encrypted or not, may be in part or wholly protected for integrity using a cryptographic hash algorithm in combination with a secrecy algorithm to form a cryptographic seal, and/or through use of other protection techniques (including hardware, e.g., secure semiconductor and/or hardware packaging protection means). The machine readable descriptive data structures may themselves be packaged within rights management data structures, and rules (e.g., permissions records) controlling their access and use may be associated with them
In accordance with one aspect of how to advantageously use descriptive data structures in accordance with a preferred embodiment of this invention, a machine readable descriptive data structure may be created by a provider to describe the layout of the provider's particular rights management data structure(s) such as secure containers. These descriptive data structure (“DDS”) templates may be used to create containers. A choice among two or more possible DDSs may be based upon one or more classes and/or one or more classes may be based on parameter data. The DDS may be loaded and used as the layout rules for secure containers being created. The provider can keep the DDS private, or publish it so that other providers may create compatible, interoperable containers based on the same DDS.
Descriptive data structures can also be used by a container viewer, browser, reader, or any other end user application designed to work with containers. Truly generic viewers or other applications can be written that can process a container in any format at least in part by making use of descriptive data structures. Thus, a descriptive data structure can be used to at least temporarily convert and/or customize a generic viewer (or other application) into a specialized viewer (or other application) optimized around one or more classes of containers. Additionally, specialized readers may be provided to efficiently process descriptive data structures to locate key media elements (e.g., cover page, table of contents, advertiser's index, glossary, articles, unprotected preview, price, and/or rights information regarding viewing, printing, saving electronically, redistributing, related budgets and/or other parameter information, etc.).
Such specialized readers can then seamlessly, transparently, and automatically process to present the user with an easy-to-use interface (for example, an icon display for each of the key media elements) optimized for the specific application, container, and/or user. Different and/or differently presented, such elements may be displayed or otherwise employed based, for example, on the identity of the user and/or user node, including, for example, taking into account one or more class attributes which can influence such automated processing.
Two or more DDSs may be associated with a container and/or container contents, as well as, for example, one or more user and/or node classes. A choice among two or more possible DDSs for a given container and/or class of containers and/or container contents may therefore be based upon one or more classes and/or one or more classes based on parameter data. Overall, this ability to easily characterize, and/or reuse stored, optimized, custom container models and subsequent transparency of translation from such customized containers (e.g. specific DDSs) to general purpose rights management use is particularly useful. For example, where such customized DDSs can be used as a basis for the creation of customized, optimized display of container content and/or control information to substantially improve the ease of use, efficiency, transparency, and optimization of a distributed, generalized rights management environment. In such an environment, for example, user nodes can interact with different DDSs to automatically adjust to the requirements of the commercial or other rights models associated with such DDSs.
Some providers may spend considerable time designing sophisticated container descriptive data structures that describe the layout of their associated containers. With this type of investment in structure and format, the descriptive data structure will often have significant value in their reuse for the same or similar applications. Entities can use descriptive data structures in-house to ensure consistent and highly efficient creation of containers. Third party providers (i.e., a provider other than the one responsible for descriptive data structure creation) can use these descriptive data structures when they wish to create containers compatible with other entities. One example is where the publisher of a widely circulated newspaper develops a descriptive data structure for reading its newspaper. Other, smaller newspapers may want to leverage any viewers or other tools put in place for use with the widely circulated newspaper by adopting the same container format. Descriptive data structures can be copyrighted and/or otherwise protectable by both law and by the rights management system itself. For example, they may also be protected by their own containers and associated controls to ensure that descriptive data structure creators, and/or distributors and/or other users of such DDSs, receive their fair, rights system managed, return on their descriptive data structure creation and/or use related efforts.
In addition to the foregoing, the following is a list of features and advantages provided in accordance with aspects of this invention:
- The descriptive data structure allows the provider to protect the integrity of his or her content, by enabling the specification of integrity constraints. Integrity constraints provide a way to state integrity related rules about the content.
- The descriptive data structure can be used to generate one or more portions of software programs that manipulate rights management structures. For example, a descriptive data structure could serve as ‘instructions’ that drive an automated packaging application for digital content and/or an automated reader of digital content such as display priorities and organization (e.g., order and/or layout).
Dynamic User Interfaces for Creation Applications:
- Applications can read a descriptive data structure to generate an interface optimized for data creation, editing, and/or composition for a specific model, including models involving, for example, composing complex content from textual, audio, video, and interactive (e.g., querying) elements. The data may take the form of a container, database and/or any other digital information organization as any simple or compound and complex file format. Applications can also read a descriptive data structure to learn how to best display an interface for collection and/or creation of content.
Dynamic User Interfaces for Display Applications:
- Applications can read a descriptive data structure to and generate an interface appropriate for data display. This data may be a container, database or any other compound complex file format. Applications can also read a descriptive data structure to learn how to best display an interface for the presentation of content. Applications can further read a descriptive data structure to learn how to manage display functions related to interacting—for content creation and/or packaging and/or user display purposes including optimizing any of such interactions—with other one or more other applications, smart agents, computing environments, identity (including any class identities) of user and/or user nodes, etc. For example, a user interface might be differently optimized for interacting with: a member of the U.S. Air Force versus a faculty member in social sciences at a university; or a member of a Kiwanis Club versus a member of a Protestant church club, a citizen of the United States versus a citizen of Saudia Arabia, including an appropriate display of expected class membership symbols and related, appropriate organization or suppression of displayed information.
Ability to Automatically Identify and Locate Data Fields:
- Full text search, agents, web spiders, and the like, benefit and are able to interact with information contained within one or more areas of a DDS when areas within a data file are known to contain potentially interesting information and such information is presented in a predefined format.
Ability to Extract Needed or Desired Data without First-Hand Knowledge of Data Format:
- Full text search, agents, web spiders, and the like, benefit and are able to interact with information contained within one or more areas of a DDS when large data files of arbitrary complexity and of unknown origin can be processed without special knowledge.
Efficient, Machine/Human Readable Data Abstract:
- The descriptive data structures can be optimally small, convenient, and cost-effective to process, transmit, and/or store.
Reusable, Salable—Independent of Actual Data:
- Descriptive data structures may be arbitrarily complex and therefore potentially time consuming to construct and requiring certain expertise. This gives the descriptive data structure resale value.
On-the-Fly Definition and Redefinition of Content Layout:
- Working with a layout tool allows quick iterations (including editing and modifications) of a design (layout) which can be more convenient and cost-effective than creating such a layout, which also may be quite difficult or beyond the expertise of many users.
Descriptive Data Structure Attributes Allow for Meta-Characteristics not Found in Actual Data:
- Because the same descriptive data structure is processed by both the creation and post-creation processes, meta-information can be placed into the descriptive data structure that would otherwise be unavailable in the packaged content. One example of this whether display of certain fields is “Required” or “Hidden”.
Enables Design Automation Via Descriptive Data Structure “Wizards”:
- Descriptive data structures themselves enable further automation in the way of “wizards”. There can, for example, be descriptive data structures that help to define other descriptive data structures. Descriptive data structures defining other descriptive data structures might represent the incomplete descriptive data structure for a book or magazine, for example. The “wizard” can comprise a series of dialog boxes displayed to the user to fill in the missing information to make it a completed descriptive data structure.
Applications Outside of a Particular Rights Management Architecture:
- For example, polymorphous applications may use descriptive data structures to determine certain data visualizations attributes and/or requirements, such as what look and feel should be displayed to the user. For example, if a descriptive data structure contains a word processing document reference, the polymorphous application might create an interface appropriate for display and editing of a document. If the descriptive data structure contains references to many executable programs, the polymorphous application might ask the user where the files should be saved.
Enables Umbrella Applications to Process Descriptive Data Structures and Delegate Unknown File Types and Processes:
- Umbrella (or polymorphous) applications can, for example, act substantially as an operation for a particular data file. This umbrella application may extract and process those things in the data file that it cares about, while ignoring or delegating (to, for example, user and/or value chain partner (e.g., distributor) to control display of such items) those things it does not understand.
- It is possible to interpret a descriptive data structure at run time, providing materially increased efficiencies and timeliness.
- Systems can adapt to dynamic data arriving in real time through use of descriptive data structures.
Automatic Conversion Capability:
- Descriptive data structures be used for converting automatically from one format to another.
Simplified System Design:
- The use of descriptive data structures may greatly reduce the need for a secondary “wrapper” application programming interface (API) or other arrangement to securely “contain” the container creation process. Such a “wrapper” API to control and otherwise restrict the container creation process might otherwise be needed to ensure that all created containers are compatible—thereby limiting flexibility and the ability to customize.
Object Oriented Template Programming Environment:
- The use of display related, interaction related, and rights related concept objects which may be selected through high-level user interface choices and prioritizations and specification of related parameter data, this enabling very easy creation of certain categories of templates—such as construction and display hint information.
- The use of a template language and interpreter involving supporting programming through use of language elements and interpretation of such language by nodes described in Ginter, et al., where such language includes elements descriptive of display, rights, and program interaction elements, priorities and parameter data.
These and other features and advantages of presently preferred example embodiments in accordance with the invention may be better and more completely understood by referring to the following detailed description along with the drawings, of which:
The descriptive data structure definitions 202 in this example do not contain or specify the particular contents of corresponding portions of the newspaper 102, but instead define more abstractly, a generic format that a newspaper style publication could use. For example, the
In addition, although
- computer programs
- currency objects
- currency containers for currency objects
- any computer input
- any computer output
- other descriptive data structures
- any other information.
Example Architecture for Using Descriptive Data Structures
As another example, interpreter 508 may provide application 506 with an element identification (e.g., a hexadecimal value or other identifier) that corresponds to the headline information within the newspaper style content (block 558). Application 506 may then ask electronic appliance 500 to provide it with the Headline (or other) content information 102 within container 100 by providing appropriate content information to electronic appliance 500 via API 504 (block 560). For example, application 506 may pass the electronic appliance 500 the element ID that interpreter 508 provided to the application. Even though application 506 may have no direct knowledge of what is inside container 100 (and may only be able to access the container 100 through a secure VDE node provided by appliance 500), interpreter 508 (by looking at descriptive data structure 200) can tell application 506 enough information so that the application knows how to request the information it wants from the electronic appliance 500.
The electronic appliance may then access information 102 within container 100, and deliver (in accordance with the rules 316 within the container) the requested information to the application 506 (block 562). The application 506 may then use the information electronic appliance 500 provides to it, based at least in part on what interpreter 508 has told it about the content information (block 564). For example, the descriptive data structure 200 may provide characteristics about the way application 506 should handle the information 102. Descriptive data structure 200 can, for example, tell application 506 to always display a certain field (e.g., the author or copyright field) and to never display other information (e.g., information that should be hidden from most users). DDS 200 can also provide complete presentation or “visualization” information so that an information provider can, for example, control the look and feel of the information when it is displayed or otherwise rendered. Descriptive data structure 200 may provide encodings of other characteristics in the form of metadata that can also be used by application 506 during a process of creating, using or manipulating container 100. The DDS 200 can be used to generate a software program to manipulate rights management structures. For example, a DDS 200 could serve as the ‘instructions’ that drive an automated packaging application for digital content or an automated reader of digital content.Example Description(s) Provided by Descriptive Data Structure
Example Descriptive Data Structure Formatting
- an object name field 262,
- one or more metadata fields 264 (which may be part of and/or referenced by the descriptive data structure); and
- location information 266 (which may be used to help identify the corresponding information within the container data structure 100).
The object name field 262 may include a constant that may corresponds to or describes a type of information. For example, object name field 262 may act as a “handle” to the content or data; it may be an indirect reference to the content or data; and/or it may be used to look up the content or data The following are examples of object names:
The DDS 200 may include or reference any type of data or metadata. In one example, the DDS 200 uses the object name field 262 to points or refers to metadata. This metadata can define certain characteristics associated with the object name. For example, such metadata may impose integrity or other constraints during the creation and/or usage process (e.g., “when you create an object, you must provide this information”, or “when you display the object, you must display this information”). The metadata 264 may also further describe or otherwise qualify the associated object name.
In one preferred example, the DDS 200 uses object name 262 to refer to metadata stored elsewhere—such as in a container 100. This referencing technique provides several advantages. For example, one situation where it may be useful to store the metadata in a secure container 100 separately from DDS 200 is in situations where it is desirable to make the DDS readily accessible to an outside application but to protect the associated metadata. For example, consider the case of handling web spider queries. A web spider may query the DDS 200 for a particular object name 262. If the object name is found, then the web spider may request the corresponding metadata. The web spider may have ready access to the metadata, but may only be able to access the associated metadata from the container 100 under appropriate conditions as controlled by a corresponding secure electronic appliance 500 based on associated rules 316. As another example, storing metadata separately from the DDS 200 may allow the same DDS to be used with different metadata in different contexts. Suppose for example that a DDS 200 contains an Object Name, for example KEYWORDS. When DDS 200 is associated with container 100A, then the DDS Object Name KEYWORDS refers to container 100A's KEYWORDS metadata. Conversely, if later this same DDS 200 is associated (e.g., packaged with) a different container 100C, then the DDS Object Name KEYWORDS refers to container 100B's KEYWORDS data.
Although it is preferred to use object name 262 to refer to metadata stored elsewhere, there may be other instances where there is a need or desire to explicitly include metadata within the DDS 200. For purposes of illustration,
The DDS 200 thus allows value chain participants to protect the integrity of content, by enabling the specification of integrity constraints. DDS 200 integrity constraints provide a way to state rules about the content. For example, DDS 200 can specify that an article of a newspaper cannot be viewed without its headline being viewed. The corresponding integrity constraint can indicate the rule ‘if there is an article, there must also be a headline”. Another example is a photograph that is part of a magazine and the credit that goes with it. The integrity constraint rule provided by DDS 200 might be ‘do not present this photograph without its associated credit’.
DDS integrity constraints give value chain participants a tool for protecting the use of the DDS 200, ensuring that content represented by a particular. DDS contains all the essential components—that it is representative of the DDS. This gives providers a way to set up conventions and enforce standards of use. There are many possible integrity constraints. The following are a few examples:
- Required: a is required as part of the content
- Optional: a is an optional component of the content
- Required relationship: if a is present, then b must be present, or if a is present b, c and d must be present. Conversely, if b is not present, then a is not allowed to be present. Relationships in this category are 1:m where m>0.
- Optional relationship: If a is present b may or may not be present. If b is present, then a is guaranteed to be present. Relationships in this category are 1:n, where n>=0.
- Repetition: a must occur n times where n>1. This could be specified with ranges of values, etc.
- Other rules and/or requirements.
- Metadata 264
- “construction type” metadata (upon object construction, the information is required; upon object construction, the object creation tool is to always or never prompt for the information);
- display metadata (e.g., always display the associated information (e.g., for copyright notices, author names and the like) or always or never make the information visible; and/or
- layout “hints” and field definitions (e.g., text, text block, integer, file, image or other data type).
The above metadata descriptions are non-limiting examples. Other metadata characteristics and attributes may be used.
Value chain participant 602 can use DDS 200 to author content 102. Participant 602 can package content 102 with associated controls 316A in a container 100A. Participant 600 may, if he desires, include DDS 200 and associated controls 316a, 316b with content 102 in the same container—or depend on the provider 600 and/or rights and permissions clearinghouse 604 to independently deliver the DDS and its controls to end users 606 in another container 100c for example.
End users 606(1), . . . , 606(n) use DDS 200 (in accordance with controls 316) in conjunction with content 102 (for example, to read, browse or otherwise access the container content). Controls 316, 316A may require user appliances to provide usage data 610 to a usage clearinghouse 612. The usage clearinghouse 612 can provide usage data 610A related to access and/or usage of DDS 200 to DDS provider 600, and may independently provide usage data 610B related to access and/or usage of content 102 to value chain participant 602.Descriptive Data Structures can be Used to Achieve a Degree of Interoperability Between Rights Management Environments
Descriptive data structures 200 provided in accordance with the present invention can provide a degree of interoperability between source and target rights management environments, and/or to provide a bridge to achieve at least some degree of interoperatibility between a rights management environment and the outside world.
Different rights management environments may have substantially incompatible mechanisms for defining rights pertaining to an object. Descriptive data structures 200 can provide at least a partial bridge to achieve a degree of compatibility and interoperability. For example, a provider that defines an object within a source rights management environment may create a descriptive data structure for use by processes within one or more target rights management environments. For example, an object creator or other provider can specify, within a descriptive data structure 200, certain rules, integrity constraints and/or other characteristics that can or should be applied to the object after it has been imported into a target rights management environment. The target rights management environment can choose to selectively enforce such rules, constraints and/or other characteristics depending on the degree to which it can trust the source environment. For example, objects imported from an EDI system employing X.12 security may be more trustworthy than objects presented from environments with lesser (or no) security.
In another example, a provider that creates an object outside of any rights management environment can create a descriptive data structure 200 for use if and when the object is imported into one or more rights management environments. The target rights management environment(s) can use such descriptive data structure(s) to help efficiently understand and handle the object. Further, a descriptive data structure created within a rights management environment can be exported to one or more applications outside of the rights management environment and used to assist the application(s) in interpreting exported content or other information.
Target data block 801 may provide information used to provide interoperability with a particular target environment 850. A single DDS 200 can, in one example, provide interoperability with N different target environments 850 by including N target data blocks 801(1), . . . 801(N) each corresponding to a different target environment 850(1), . . . 850(N).
In this example, each target data block 801 includes rule (control) information. Different target data blocks 801 can provide different rule information for different target environments 850. The rule information may, for example, relate to operations (events) and/or consequences of application program functions 856 within the associated target environment 850 such as specifying:
- permitted and/or required operations;
- nature and/or extent of operations permitted and/or required operations; and/or
- consequences of performing permitted and/or required operations.
The target data block 801 may also include additional information if desired that gives directions to a DDS parser 852 and/or a translator 854 within a corresponding target environment 850.
The optional creator seals 812B, 819 (and source seals) may be cryptographic seals that help to ensure that the DDS 200 and target records 801, respectively, have not be altered since they were created, and also the identity of the DDS 200's creator and/or source. The optional source messages 812C and 821 may be information that helps to ensure that a target environment knows which source environment created DDS 200.
Referring again to
If source messages 812C, 821 are used, they should preferably represent information provided by the source environment that may help a target environment identify the source environment, and further may also help to ensure that the DDS 200 was actually created by the source environment (and therefore may, for example, be trusted to the extent that the source environment is trusted). For example, a source environment may have a protected processing environment (PPE) of the form described in the above referenced Ginter, et al. patent application. Certain of such PPEs may have cryptographic keys (e.g., a private key of a public key/private key pair) available that may be used to encrypt a cryptographic hash taken of the DDS header 805 or target block header 807, as appropriate. In such an example, a target environment would need to acquire a corresponding cryptographic key (e.g., a public key of a public key/private key pair) using trusted techniques (e.g., delivery in a certificate signed by a trusted certifying authority) in order to evaluate such a source message. In another example, DDS creation tool 800 may have been equipped with cryptographic keys when it was manufactured, and may use these cryptographic keys instead of keys from a PPE, although generally this technique would be more susceptible to tampering by an experienced computer hacker and might therefore be somewhat less trusted by target environments.
In addition, or alternatively (for example, if cryptographic techniques are not appropriate or desired), the source message may contain a unique identifier that corresponds to the source environment.
The DDS creation tool 800 (see
Target environment parser 852 (and/or translator 854) may, for example, be part of an application program, part of an operating system, or part of a utility program used by, or in conjunction with, an application program and/or an operating system. The target environment parser 852 receives the DDS 200 and parses it to locate the target data block 801(k) corresponding to the target environment 850 (k). Parser 852 may then determine, from the corresponding target data block 801, the rules the target data block contains. Parser 852 preferably understands enough about the structure of DDS 200 to find (e.g., using the header information shown in
The target environment parser 852 may obtain applicable target rules from target data block 801 and provide these rules to application program functions 856. Application program functions 856 may define any operation pertaining to object 830 such as for example:
- any other operation.
The target rules provided by parser 852 may be used, for example, to permit, require and/or prevent certain operations; to define the extent to which certain operations can be performed (e.g., limit number of copies, define extent of cut, the rules that should be applied to cut information in subsequent use, etc.); and/or to define the consequences of performing a particular operation (e.g., charge the user for printing or otherwise using and/or accessing all or part of object 830, maintain records of the time and/or number of such operations performed, etc.).
Parser 852 may also, or alternatively, provide some or all of the rules it obtains from target data block 801 to other arrangements for applying the rules such as, for example, the “other rights management functions” block 858. Block 858 may provide any kind of rights management functions. Translator 854 may be used if needed to allow the application program functions 856 and/or the “other rights management” block 858 to understand the rules. As one example, translator 854 may be used to further elaborate, parameterize and/or secure the rule information obtained from target data block 801 so they are more or fully compatible with the “other rights management functions” block 858.
A useful data structure definitional method and arrangement has been described in connection with its most practical and presently preferred example embodiments. The present invention is not to be limited to those embodiments, but on the contrary, is intended to encompass variations and equivalents as defined within the spirit and scope of the claims.
29. A method of accessing content information, the method performed by a first electronic appliance, the method comprising:
- receiving, at a first communications interface of the first electronic appliance, a secure electronic container, the secure electronic container comprising: content information; hierarchal data comprising a plurality of first attributes, the plurality of first attributes defining first level organizational elements of the secure electronic container; and one or more rules governing use of the content information;
- receiving, from a user of the first electronic appliance, a request to use the content information;
- accessing, based at least in part on the plurality of first attributes, the one or more rules governing use of the content information;
- determining that the request to access the content information is allowed by the one or more rules; and
- allowing access to the content information based on the determination.
30. The method of claim 29, wherein each of the plurality of first attributes of the hierarchal data comprise one or more second attributes, the one or more second attributes defining second level organizational elements of the secure electronic container.
31. The method of claim 29, wherein the hierarchal data comprises access information defining one or more access conditions of the content information.
32. The method of claim 31, wherein allowing access to the content information is further based on a determination that the one or more access conditions of the content information are satisfied.
33. The method of claim 31, wherein the access conditions are included, at least in part, in the plurality of first attributes.
34. The method of claim 31, wherein each of the plurality of first attributes of the hierarchal data comprise one or more second attributes, the one or more second attributes defining second level organizational elements of the secure electronic container, and wherein the access conditions are included, at least in part, in the plurality of second attributes.
35. The method of claim 30, wherein at least one of the first or second attributes comprises information specifying fields relating to at least one atomic transaction.
36. The method of claim 29, wherein the one or more rules require that payment information be transmitted to a second electronic appliance associated with a clearinghouse prior to accessing the content information.
37. The method of claim 36, wherein the method further comprises transmitting, by the communications interface, payment information to the second electronic appliance, and the determining step further comprises determining that the payment information was transmitted to the second electronic appliance.
38. The method of claim 29, wherein the method further comprises transmitting, to a second electronic appliance associated with a clearinghouse, usage data relating to use of the content information.
39. The method of claim 29, wherein the hierarchal data is encrypted.
40. The method of claim 29, wherein hierarchal data is cryptographically sealed.
41. A non-transitory computer-readable storage medium storing instructions that, when executed by a processor included in a first electronic appliance, cause the first electronic appliance to:
- receive, at a first communications interface of the first electronic appliance, a secure electronic container, the secure electronic container comprising: content information; hierarchal data comprising a plurality of first attributes, the plurality of first attributes defining first level organizational elements of the secure electronic container; and one or more rules governing use of the content information;
- receive, from a user of the first electronic appliance, a request to use the content information;
- access, based at least in part on the plurality of first attributes, the one or more rules governing use of the content information;
- determine that the request to access the content information is allowed by the one or more rules; and
- allow access to the content information based on the determination.
42. The non-transitory computer-readable storage medium of claim 41, wherein each of the plurality of first attributes of the hierarchal data comprise one or more second attributes, the one or more second attributes defining second level organizational elements of the secure electronic container.
43. The non-transitory computer-readable storage medium of claim 41, wherein the hierarchal data comprises access information defining one or more access conditions of the content information.
44. The non-transitory computer-readable storage medium of claim 43, further comprising instructions that, when executed by the processor, cause the first electronic appliance to allow access to the content information based at least in part on a determination that the one or more access conditions of the content information are satisfied.
45. The non-transitory computer-readable storage medium of claim 43, wherein the access conditions are included, at least in part, in the plurality of first attributes.
46. The non-transitory computer-readable storage medium of claim 43, wherein each of the plurality of first attributes of the hierarchal data comprise one or more second attributes, the one or more second attributes defining second level organizational elements of the secure electronic container, and wherein the access conditions are included, at least in part, in the plurality of second attributes.
47. The non-transitory computer-readable storage medium of claim 42, wherein at least one of the first or second attributes comprises information specifying fields relating to at least one atomic transaction.
48. The non-transitory computer-readable storage medium of claim 41, wherein the one or more rules require that payment information be transmitted to a second electronic appliance associated with a clearinghouse prior to accessing the content information.
49. The non-transitory computer-readable storage medium of claim 48, further comprising instructions that, when executed by the processor, cause the first electronic appliance to transmit, by the communications interface, payment information to the second electronic appliance, and determine that the payment information was transmitted to the second electronic appliance.
50. The non-transitory computer-readable storage medium of claim 41, further comprising instructions that, when executed by the processor, cause the first electronic appliance to transmit to a second electronic appliance associated with a clearinghouse, usage data relating to use of the content information.
51. The non-transitory computer-readable storage medium of claim 41, wherein the hierarchal data is encrypted.
52. The non-transitory computer-readable storage medium of claim 41, wherein hierarchal data is cryptographically sealed.
Filed: Mar 26, 2012
Publication Date: Feb 28, 2013
Inventors: Edwin J. Hall (San Jose, CA), Victor H. Shear (Bethesda, MD), Luke S. Tomasello (San Jose, CA), David M. Van Wie (Sunnyvale, CA), Robert P. Weber (Menlo Park, CA), Kim Worsencroft (Los Gatos, CA), Xuejun Xu (Fremont, CA)
Application Number: 13/430,572
International Classification: G06F 21/24 (20060101);