US 6,138,119 AGrant

Techniques for Defining, Using and Manipulating Rights Management Data Structures

Issue Date:2000-10-24

•64 Claims

•14 Drawing Sheets

Abstract

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.

Metadata

Assignee

InterTrust Technologies Corp.

Inventors

Edwin J. Hall
Victor H. Shear
Luke S. Tomasello
David M. Van Wie
Robert P. Weber
Kim Worsencroft
Xuejun Xu

Application Information

Application Number:US 3007782

Filing Date:1999-04-27

Priority Date:1997-02-25

Art Unit:277

Classifications

IPC:

G06F 1730

Field of Search:

7079;4;102

Patent Drawings (14 sheets)

Description

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.TM." container developed by InterTrust Technologies Corp. of Sunnyvale Calif. The Ginter et al. patent specification referenced above describes many characteristics of this DigiBox.TM. 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.TM. 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.TM. 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 FIGS. 1A and 1B, a newspaper publisher can distribute a newspaper 102 within a container 100A. A publisher of fashion magazines 106 can distribute the fashion magazines within another container 100C. Similarly, for example, a wholesale banking environment may use yet a further container, an electronic trading system may use a still further container, and so on.

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:

Integrity Constraints: 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.

Application Generation: 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.

Runtime interpretation: It is possible to interpret a descriptive data structure at run time, providing materially increased efficiencies and timeliness.

Runtime adaptability: 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.

BRIEF DESCRIPTION OF THE DRAWINGS

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:

FIGS. 1A and 1B show example content containers;

FIGS. 2A and 2B show example content containers associated with example descriptive data structures;

FIG. 3 shows an example descriptive data structures creation and usage process;

FIG. 4 shows another example creation and usage process;

FIG. 5 shows an example system architecture using descriptive data structures;

FIG. 5A shows an example process performed by the FIG. 5 system;

FIG. 6 shows an hierarchical descriptive data structure organization;

FIG. 6A shows an example of how descriptive data structures can be used with atomic transaction data;

FIG. 7 shows an example descriptive data structure format;

FIG. 8 shows an example descriptive data structure creation graphical interface;

FIG. 9 shows an example process for tracking descriptive data structure rights management related data;

FIG. 10A shows an example use of descriptive data structures to provide interoperability between environments; and

FIG. 10B provides more detail about how the FIG. 10A example descriptive data structure may be organized.

DETAILED DESCRIPTION OF PRESENTLY PREFERRED EXAMPLE

Embodiments

FIGS. 2A and 2B show the example containers 100a, 100c of FIGS. 1A, 1B associated with machine readable descriptive data structures 200 and 200'. Referring to FIG. 2A, a descriptive data structure 200 is associated with content container 100a. This descriptive data structure 200 may be used to define the content (and certain other characteristics) of container 100a. In the example shown, descriptive data structure 200 defines a number of sections of newspaper style content 102 such as, for example, the headline (descriptor 202a), the issue date (descriptor 202b), the lead story (descriptor 202c), breaking news (descriptor 202d), image(s) (descriptor 202e), advertisement (descriptor 202f), and section (descriptor 202g).

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 FIG. 2A example descriptive data structure headline definition 202a does not specify a particular headline (e.g., "Yankees Win the Pennant!"), but instead defines the location (for example, the logical or other offset address) within the container data structure 100a (as well as certain other characteristics) in which such headline information may reside. Because descriptive data structure 200 is generic to a class or family of newspaper style content publications, it can be reused. For example, each daily issue of a newspaper might be created using and/or associated with the same descriptive data structure 200. By abstractly defining the data format and other characteristics of newspaper style content 102, the descriptive data structure 200 allows easy creation, usage and manipulation of newspaper style content 102.

Referring to FIG. 2B, a different descriptive data structure 200' may be used to define another class of content publications 106 such as fashion magazines. The descriptive data structure 200' for this content class reflects a different format (and possibly other characteristics) as compared to the descriptive data structure 200 shown in FIG. 2A. For example, since fashion magazines typically do not include headlines or breaking news, the example descriptive data structure 200' may not define such formatting. Instead, descriptive data structure 200' for defining a class of fashion magazine content may define issue date (descriptor 204a), a magazine title (descriptor 204b), the name of a photographer (descriptor 204c) and associated artwork designation (descriptor 204d).

The FIG. 2A and 2B examples show descriptive data structures 200, 200' being delivered within content object containers 100a, 100c along with associated content 102, 106. However, other forms of association may be used. For example, descriptive data structure 200 can be independently delivered in its own separate container along with associated rules controlling its access and/or use. Alternatively, descriptive data structures 200 could be stored in a library and delivered on an as needed basis in secure or insecure form depending on particular requirements.

In addition, although FIGS. 2A and 2B are printed publication content examples, the use of descriptive data structures 200 is not so limited. To the contrary, descriptive data structures 200 can be used to define the format and/or other characteristics associated with a wide variety of different types of digital information including for example:

images

sound

video

computer programs

methods

executables

interpretables

currency objects

currency containers for currency objects

rules

any computer input

any computer output

other descriptive data structures

any other information.

Example Process For Creating and Using Descriptive Data Structures

FIG. 3 shows an example process for creating and using descriptive data structures 200. In this example, a layout tool 300 is used to create descriptive data structure 200. This layout tool 300 may be, for example, a software-controlled process interacting with a human being via a graphical user interface. The resulting descriptive data structure 200 (which may be stored on a mass storage device or other memory) can then be used to facilitate any number of other processes to create or interpret stored data. For example, the descriptive data structure may be used in a creation process 302. The creation process 302 may read the descriptive data structure and, in response, create an output file 400 with a predefined format such as, for example, a container 100 corresponding to a format described by the descriptive data structure 200. A viewing process 304 may use the descriptive data structure 200 to locate important items in the output file 400 for display. A browsing process 306 may use the descriptive data structure 200 to locate items within the stored output file 400 such as, for example, key words or other searchable text. Descriptive data structure 200 may supply integrity constraints or rules that protect the integrity of corresponding content during use of and/or access to the content.

FIG. 4 shows a more detailed example descriptive data structure creation and usage process. In this example, the layout tool 300 may accept user input 310 provided via a graphical user interface 312. The output of the layout tool 300 may be a descriptive data structure 200 in the form of, for example, a text file. A secure packaging process 302a may accept container specific data as an input, and it may also accept the descriptive data structure 200 as a read only input. The packager 302a could be based on a graphical user interface and/or it could be automated. The packager 302a packages the container specific data 314 into a secure container 100. It may also package descriptive data structure 200 into the same container 100 if desired. A viewer 304 may view data 314 with the assistance of the descriptive data structure 200 and in accordance with rules 316 packaged within the container applying to the data 314 and/or the descriptive data structure 200.

Example Architecture For Using Descriptive Data Structures

FIG. 5 shows an example secure system architecture suitable for use with descriptive data structure 200. In this example, an electronic appliance 500 of the type described in the above-referenced Ginter et al. patent specification may be provided within a tamper resistant barrier 502. Electronic appliance 500 may include an application program interface (API) 504. One or more applications 506 may communicate with electronic appliance 500 via API 504. In some examples, the application 506 may execute on the secure electronic appliance 500. Each application 506 may include a descriptive data structure interpreter 508. In use, electronic appliance 500 may access secure container 100 and--in accordance with rules 316--access the descriptive data structure 200 and content 102 it contains and provide it to application 506. The interpreter 508 within application 506 may, in turn, read and use the descriptive data structure 200. In addition, application 506 may be polymorphic in the sense that it can take on personality or behavior as defined at least in part by descriptive data structure 200.

FIG. 5A shows an example detailed process performed by the FIG. 5 example secure system architecture. In this example, application 506 asks appliance 500 to retrieve the descriptive data structure 200 from container 100 (block 550). Electronic appliance 500 reads the descriptive data structure 200 and, subject to the conditions specified by associated rules 316, provides the descriptive data structure 200 to the application 506 (block 552). Application 506 then asks its interpreter 508 to interpret the descriptive data structure 200 (block 554). The interpreter 508 tells the application 506 what the descriptive data structure 200 says (block 556). The application 506 extracts or obtains the descriptive data structure information it needs or wants from interpreter 508 (block 558). For example, suppose the application 506 wants to display the "headline" information within newspaper style content shown in FIG. 2A. Application 506 may ask interpreter 508 to provide it with information that will help it to locate, read, format and/or display this "headline" information.

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

FIG. 6 shows one example of how a descriptive data structure 200 may describe and define an arbitrarily complex, information structure such as, for example, an hierarchical container 100. In this particular example, container 100 includes properties 600(1), 600(2). Property 600(1) may include n attributes 602(1), 602(2). . . 602(n). Property 600(2) may include any number of attributes 604(1), 604(2), and it may also include an additional property 606. Property 606 may, in turn, include its own attributes 608(1), 608(2). . . . Associated descriptive data structure 200 may be organized as a tree structure list 250 providing a recursive structure to reflect the recursive structure of the contents of container 100. For example, list 250 may include "branches" in the form of "property" descriptors 252(1), 252(2) corresponding to properties 600(1), 600(2). Each property descriptor 252 may, in turn, include a list 254 of attributes and may include additional property descriptors 256 in the same recursive, hierarchical arrangement as is reflective of the example content container structure. DDS 200 may be used to describe arbitrarily complex, hierarchical or non-hierarchical data structures of any dimension (1 to n).

FIG. 6A shows that descriptive data structure 200 can be used in conjunction with any kind of information such as, for example, events or methods defining an "atomic transaction" such as a real estate transaction. In this FIG. 6A example, a container 100 includes one or more descriptive data structures 200 and associated control set(s) 316 relating to a sequence of "events" 700 that define a real estate transaction. The DDS 200 may, for example, include a number of different entries 200A-200N pertaining to each different "event" within the transaction (e.g., "offer", "acceptance", "purchase/sales", "inspection", "mortgage", etc.). These entries 200A-N may, for example, define where in container 100 the event can be found. The entries 200A-200N may also include metadata that provides additional characteristics corresponding to the event (for example, how certain information related to the event should be displayed).

Example Descriptive Data Structure Formatting

FIG. 7 shows an example of how descriptive data structure 200 may be formatted. As mentioned above, descriptive data structure 200 may comprise a list such as a linked list. Each list entry 260(1), 260(2),. . . may include a number of data fields including, for example:

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:

General Purpose Object Names

NUMBER

STRING

DATE

TITLE

DESCRIPTION

AUTHOR

PROVIDER

MIME.sub.-- TYPE

VERSION

URL

NEWGROUP

FILE.sub.-- NAME

KEYWORDS

CREATION.sub.-- DATE

MODIFICATION.sub.-- DATE

LAST.sub.-- ACCESS.sub.-- DATE

NATIVE.sub.-- PLATFORM

SIZE

CONTENT

PREVIEW

THUMBNAIL

TEXT

ARTWORK

ILLUSTRATION

UNKNOWN

TEMPLATE

BILLING.sub.-- NAME

CONTAINER

Book-style Object Names

DEADLINE DATE

TITLE PAGE

PROLOGUE

INTRODUCTION

ABSTRACT

TABLE.sub.-- OF.sub.-- CONTENTS

CHAPTER

CHAPTER.sub.-- NUMBER

INDEX

Electronic Mail-style Object Names

FROM

SUBJECT

MESSAGE.sub.-- BODY

ENCLOSURE

Newspaper-style Object Names

ISSUE DATE

ARTICLE

COLUMN

COVER.sub.-- STORY

LEAD.sub.-- STORY

BREAKING.sub.-- NEWS

SECTION

EDITORIAL

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 10OB'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, FIG. 7 shows an example DDS 200 that includes metadata field 264 and also refers to metadata within a container 100 using the object name 262. Either or both techniques may be used.

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

Example Graphical Interface For Creating Descriptive Data Structures

FIG. 8 shows an example descriptive data structure creation graphical user interface 312. In this example, the graphical user interface 312 may prompt the user for the object name. In addition, the graphical user interface 312 may provide options for specifying the associated metadata 264. The options shown in FIG. 8 may, for example, include:)

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

Example Process Using Descriptive Data Structures

FIG. 9 shows one example arrangement for using the infrastructure described in co-pending related U.S. patent application Ser. No. 08/699,712 (referenced above) for descriptive data structures 200. The arrangement shown in FIG. 9 may be useful in a number of different contexts. For example, a provider 600 of descriptive data structures 200 may want to know which descriptive data structures 200 are the best liked by his customers so he or she can improve the quality of his products. Or, a provider 600 may charge customers for using descriptive data structures 200 on a per use or other basis. In still another example, some descriptive data structures 200 or classes of DDS 200 may be restricted to use only by authorized users or classes of authorized users.

FIG. 9 shows a DDS provider 600 who delivers a DDS 200 and an associated control set 316 to a value chain participant 602. Controls 316 may provide rules and associated consequences for controlling or otherwise affecting the use or other aspects of what value chain participant 602 can do with DDS 200. The controls 316 and DDS 200 may be packaged within a container 100. Value chain participant 602 may get the container 100 containing DDS 200 directly from DDS provider 600; alternatively, the provider can provide it a rights and permissions clearinghouse 604 and participant 602 and get it from the clearinghouse (or elsewhere) (see container 100B).

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 61 OB 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.

FIG. 10A shows an example of how descriptive data structures 200 may be used to provide interoperability. In the FIG. 10A example, a DDS creation tool 800 creates a DDS 200 that includes one or more target data blocks 801. In one example, the DDS creation tool 800 may be based on, and/or incorporate some or all of the capabilities of layout tool 300 and provide interoperability capabilities in addition to features associated with layout tool 300. In another example, DDS creation tool 800 may not incorporate any of the capabilities of layout tool 300, and may create DDS 200 solely for interoperability purposes. DDS creation tool 800 may, for example, be an application program with a graphical user interface, a background process that only displays a user interface when being configured by a user, a portion of an operating system, a portion of a computer's firmware, a server process that may act independently or as part or all of a "gateway" between one system and another (e.g., a public network and a private network, two or more private networks, a local area network and a wide area network, etc.), or any other desirable implementation or integration.

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.

FIG. 10B shows one detailed example of how target information may be organized within DDS 200. In this example, DDS creation tool 800 creates a DDS header 805 that references one or more target record headers 807. DDS header 805 may, for example, include a "number of targets" field 809 indicating the number of target data blocks 801 within the DDS 200, a "offset to first target data portion" field 811 that provides the location of the first target data block 801(1) within the DDS 200, a source message field 812A that identifies the source environment, and an optional creator seal 812B that may be used to verify the integrity and authenticity of the DDS 200. Source message field 812A (which can be optional) may include a source ID that may be used to help verify the source environment of DDS 200, and an optional source seal (that may or may not be present in the source message). Each target data block 801 within DDS 200 may begin with a target record header 807 including a "target ID" field 813, a "length" field 815, a "offset to next target data portion" field 817, an optional creator seal 819, and an optional source message 821. The "target ID" field 813 may specify a unique identification number or value corresponding to the associated target data block 801 and/or identifying the intended target environment(s), the "length" field 815 may specify the length of the target data block 801, and the "offset" field 817 may specify the location (relative or absolute) of the next target data block 801 within the DDS 200 (and may take on a null value for the last target data block).

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 FIG. 10A, DDS creation tool 800 may, upon creating the DDS 200, cryptographically seal it and each target data block 801 for integrity using appropriate cryptographic processes, for example by first running a cryptographic hash function (e.g., SHA, MD5, etc.) on the data and then encrypting the resulting hash value using a private key of the DDS creator associated with an asymmetric cryptosystem (e.g., RSA, E1 Gamal, etc.). If sealing is used, the DDS creator preferably should ensure that the public key associated with the encrypting private key is certified (e.g., encrypted with a private key of a certifying authority) and available for use by target environments to validate the seal (e.g., by including a certificate in DDS 200, publishing the certificate on a public network, etc.)

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 FIG. 10A) may then package the resulting DDS 200 into a secure container 100 along with an associated object 830. In another example, DDS creation tool 800 may embed DDS 200 within, or otherwise associate the DDS with, an object 830' that provides a method for releasing the DDS to the target environment parser 852. The DDS 200 and its associated object 830 may then be delivered to one or more target environments 850 for processing.

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 FIG. 10B) the appropriate target data block 801 corresponding to it, and also to understand the rules within the target data block. The target environment parser 852 doesn't need to understand any additional rules 316 that may be packaged within container 100 or otherwise delivered with object 830, but it may use any such additional rules if desired (e.g., when it finds no target data block 801 within DDS 200 for the particular target environment 850 (for example, if it is capable of understanding some other target data block 801 whose rules are based on a published specification and/or standard)).

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:

cut

copy

paste

save

change

delete

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 as defined within the spirit and

Claims

Certificate of Correction present

The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.

We claim:

1. A method including: generating a descriptive data structure in a first data processing device characterized by a first security aspect; specifying information in the descriptive data structure, including information relating to the first security aspect, a first rule, and a second rule; associating a third rule with the descriptive data structure, the third rule at least in part controlling use of at least a portion of the descriptive data structure; transmitting the descriptive data structure to a second data processing device; at the second environment, retrieving from the descriptive data structure the information relating to the first security aspect, the retrieval being governed at least in part by the third rule; and determining whether to use the first rule or the second rule based on the information.

2. The method of claim 1, wherein determining includes determining the level of security present at the first data processing device based on the information related to the first security aspect.

3. The method of claim 2, wherein determining includes determining to use the first rule or the second rule, but not both.

4. The method of claim 1, wherein specifying information in the descriptive data structure includes populating a first target block and a second target block.

5. A descriptive data structure embodied on a computer-readable medium or other logic device, including the following elements: identification information at least in part identifying a first rights management data structure; organization information at least in part describing the organization of at least some governed information contained within or referenced by the first rights management data structure; rule information relating to a first rule used to at least in part govern use of at least a portion of the governed information contained within the first rights management data structure; and a second rule used to at least in part govern use of at least a portion of the descriptive data structure.

6. The descriptive data structure of claim 5, in which the first rights management data structure is a secure container.

7. The descriptive data structure of claim 6, in which the secure container includes: the governed information; and the first rule.

8. The descriptive data structure of claim 6, in which the secure container includes the descriptive data structure.

9. The descriptive data structure of claim 5, in which: the first rule is stored outside the descriptive data structure; and the rule information includes information regarding the location at which the first rule is stored.

10. The descriptive data structure of claim 5, in which: the first rule is a display rule at least in part governing the display of at least a portion of the governed information.

11. The descriptive data structure of claim 5, in which: the governed information includes source information at least in part identifying an author, creator, publisher and/or owner of at least a portion of the governed information; and the first rule requires display of the source information under circumstances specified by the rule.

12. The descriptive data structure of claim 5, in which: the first rule constitutes a creation rule at least in part governing the creation of a specific example of the first rights management data structure.

13. The descriptive data structure of claim 12, in which: the creation rule at least in part specifies information which must be included with the specific example of the first rights management data structure.

14. The descriptive data structure of claim 5, in which: the descriptive data structure is stored in a second rights management data structure.

15. The descriptive data structure of claim 5, further including: information relating to the organization of at least some information contained in a second rights management data structure which differs in at least one respect from the first rights management data structure.

16. The descriptive data structure of claim 5, which: the organization information includes information relating to the location of at least some of the governed information.

17. The descriptive data structure of claim 5, further including: a first target data block including information relating to a first target environment in which the descriptive data structure may be used.

18. The descriptive data structure of claim 17, further including: a second target data block including information relating to a second target environment in which the descriptive data structure may be used.

19. The descriptive data structure of claim 5, further including: a source message field containing information at least in part identifying at least one source for the descriptive data structure.

20. The descriptive data structure of claim 19, in which: the source identification information includes environment information relating to at least one aspect of an environment in which the descriptive data structure was at least in part created.

21. The descriptive data structure of claim 20, in which: the environment information includes information relating to security present at the environment.

22. The descriptive data structure of claim 5 further including a source seal.

23. The descriptive data structure of claim 22, in which: the source seal includes a hash of at least a portion of the descriptive data structure.

24. The descriptive data structure of claim 22, in which: the source seal is encrypted based on a private key.

25. The descriptive data structure of claim 24, further including: key location information related to a location from which a public key corresponding to the private key may be obtained.

26. The descriptive data structure of claim 25, in which: the key location information is contained within a certificate.

27. The descriptive data structure of claim 26, in which: the certificate is contained in the descriptive data structure.

28. A distributed data processing arrangement including: a first data processing apparatus including: a central processing unit; and a first memory storing (1) a descriptive data structure, the descriptive data structure including information regarding a first organization of elements within a secure container, and (2) a first rule at least in part governing use of at least a portion of the descriptive data structure; and a second data processing apparatus including: a central processing unit; and a second memory storing a first secure container including: data elements organized at least in part in accordance with the information contained in the descriptive data structure; and a rule set made up of at least a second rule, the rule set used to at least in part govern at least one aspect of access to or use of the data elements; the second rule requiring that information regarding at least one use of at least one of the data elements be at least temporarily recorded.

29. The distributed data processing arrangement of claim 28, in which: the descriptive data structure is contained in a second secure container, which also includes the second rule.

30. The distributed data processing arrangement of claim 29, further including metadata relating to the contents of the first secure container.

31. The distributed data processing arrangement of claim 30, in which: the metadata is stored in the second secure container.

32. The distributed data processing arrangement of claim 30, in which: the metadata is stored in a third secure container.

33. The distributed data processing arrangement of claim 31, further including: a third data processing apparatus, including: a central processing unit; a third memory including: the third secure container and a rule used to at least in part govern at least one aspect of access to or use of the metadata; and communications means by which the third data processing apparatus may communicate the third secure container, or a copy of the third secure container, to the second data processing apparatus.

34. The distributed data processing arrangement of claim 28, further including: a computer program designed to use at least a portion of the descriptive data structure in an operation on the first secure container or the contents of the first secure container.

35. The distributed data processing arrangement of claim 34, in which: the computer program includes means for using a rule from the rule set to govern at least one aspect of the computer program's use of the descriptive data structure.

36. The distributed data processing arrangement of claim 34, which the computer program is designed to use the information regarding the organization of elements within the first secure container to identify or locate at least one of the elements.

37. The distributed data processing arrangement of claim 34 in which: the computer program includes a browser which uses the information regarding the organization of elements within the first secure container to control, at least in part, the display of at least some information from the first secure container.

38. The distributed data processing arrangement of claim 34, in which: the computer program is integrated into an operating system.

39. The distributed data processing arrangement of claim 38, in which: the operating system is compatible with at least one version of Microsoft Windows.

40. The distributed data processing arrangement of claim 28, in which: the rule set includes a rule at least in part controlling at least one aspect of an auditing process.

41. The distributed data processing arrangement of claim 28, in which: the rule set includes a rule at least in part controlling at least one aspect of a budgeting process.

42. The distributed data processing arrangement of claim 28, in which the second data processing apparatus includes a secure electronic appliance.

43. A method of using a descriptive data structure, at a first data processing arrangement located at a first site, including: receiving a first secure container including governed information; receiving a first rule set including at least one rule, the first rule set governing at least one aspect of access to or use of the governed information and containing a first rule at least in part governing at least one aspect of an auditing process involving the governed information; receiving a second secure container including a descriptive data structure, the descriptive data structure including information at least in part describing or representing at least one aspect of the organization of the first secure container governed information; receiving a second rule set including at least one rule, the second rule set governing at least one aspect of access to or use of the descriptive data structure; using the second rule set to gain access to at least a portion of the descriptive data structure; and using the accessed descriptive data structure portion to make a use of the first secure container governed information.

44. The method of claim 43, in which using the descriptive data structure portion includes: identifying a first portion of the first secure container governed information using information from the descriptive data structure.

45. The method of claim 44, in which: the first portion of the first secure container governed information identifies or describes a second portion of the first secure container governed information.

46. The method of claim 45, in which identifying a first portion is followed by displaying information from the first portion of the first secure container governed information.

47. The method of claim 46, in which displaying information from the first portion of the first secure container governed information includes: displaying a title of a work contained in the second portion of the first secure container governed information.

48. The method of claim 46, in which displaying information from the first portion of the first secure container governed information includes: displaying a summary of the second portion of the first secure container governed information.

49. The method of claim 43, in which the first data processing arrangement includes a descriptive data structure interpreter; and using the accessed descriptive data portion is carried out at least in part through use of the descriptive data structure interpreter.

50. The method of claim 49, in which the descriptive data structure interpreter is integrated with a browser and using the accessed descriptive data structure portion further includes the steps, performed by the browser, of: using the descriptive data structure to identify and locate a portion of the first secure container governed information, and causing the display of the located portion.

51. A method of creating a first secure container, including: accessing a first control, which at least in part governs use of a descriptive data structure; in compliance with the first rule, accessing the descriptive data structure, which includes or addresses: organization information at least in part describing a required or desired organization of a content section of the first secure container, and metadata information at least in part specifying at least one step required or desired in creation of the first secure container; organizing information contained in the first secure container using the descriptive data structure; and using the metadata information to at least in part generate or identify a second control designed to govern at least one aspect of access to or use of at least a portion of the information contained in the first secure container.

52. The method of claim 51, in which the descriptive data structure is contained in a second secure container with which the first control is associated and accessing the descriptive data structure includes: opening the second secure container in compliance with the first control.

53. The method of claim 51, further including: using the metadata information to at least in part identify or generate a third control to govern an aspect of access to or use of at least a portion of the information contained in the first secure container.

54. The method of claims further including: associating the third control with the first secure container.

55. The method of claim 51, further including: receiving the descriptive data structure at a first site from a second site prior to accessing the descriptive data structure; and creating the first secure container at the first site.

56. The method of claim 55, further including: receiving the metadata at the first site prior to using the metadata, the metadata being received separately from the descriptive data structure.

57. The method of claim 56, further including: requesting the metadata by the first site based on information contained in the descriptive data structure.

58. The method of claim 56, wherein receiving the metadata includes: receiving the metadata at the first site in a second secure container having associated a third control; and wherein using the metadata in the creation of the first secure container occurs after the first site has complied with a requirement imposed by the third control.

59. The method of claim 51, further including: storing owner or creator information in the first secure container in compliance with the descriptive data structure.

60. The method of claim 59, further including: storing copyright ownership information in the first secure container in compliance with the descriptive data structure.

61. The method of claim 60, further including: storing an advertisement in the first secure container in compliance with the descriptive data structure.

62. The method of claim 61, in which: the creation of the first secure container includes placing the owner or creator information, the copyright ownership information, and the advertisement in locations specified at least in part by the descriptive data structure.

63. The method of claim 51, in which: the descriptive data structure includes information specifying fields relating to at least one atomic transaction.

64. The method of claim 63, in which: the atomic transaction information fields include fields for offer and acceptance information.

Patent Citations (331)

Patent	Date	Inventor
US3573747	1971-04-01	Adams et al.
US3609697	1971-09-01	Blevins
US3796830	1974-03-01	Smith
US3798359	1974-03-01	Feistel
US3798360	1974-03-01	Feistel
US3798605	1974-03-01	Feistel
US3806882	1974-04-01	Clarke
US3829833	1974-08-01	Freeny
US3906448	1975-09-01	Henriques
US3911397	1975-10-01	Freeny
US3924065	1975-12-01	Freeny
US3931504	1976-01-01	Jacoby
US3946220	1976-03-01	Brobeck et al.
US3956615	1976-05-01	Anderson et al.
US3958081	1976-05-01	Ehrsam et al.
US3970992	1976-07-01	Boothroyd et al.
US4048619	1977-09-01	Forman et al.
US4071911	1978-01-01	Mazur
US4112421	1978-09-01	Freeny
US4120030	1978-10-01	Johnstone
US4163280	1979-07-01	Mori et al.
US4168396	1979-09-01	Best
US4196310	1980-04-01	Forman et al.
US4200913	1980-04-01	Kuhar et al.
US4209787	1980-06-01	Freeny
US4217588	1980-08-01	Freeny
US4220991	1980-09-01	Hamano et al.
US4232193	1980-11-01	Gerard
US4232317	1980-11-01	Freeny
US4236217	1980-11-01	Kennedy
US4253157	1981-02-01	Kirschner et al.
US4262329	1981-04-01	Bright et al.
US4265371	1981-05-01	Desai et al.
US4270182	1981-05-01	Asija
US4278837	1981-07-01	Best
US4305131	1981-12-01	Best
US4306289	1981-12-01	Lumley
US4309569	1982-01-01	Merkle
US4319079	1982-03-01	Best
US4323921	1982-04-01	Guillou
US4328544	1982-05-01	Baldwin et al.
US4337483	1982-06-01	Guillou
US4361877	1982-11-01	Dyer et al.
US4375579	1983-03-01	Davida et al.
US4433207	1984-02-01	Best
US4434464	1984-02-01	Suzuki et al.
US4442486	1984-04-01	Mayer
US4446519	1984-05-01	Thomas
US4454594	1984-06-01	Heffron et al.
US4458315	1984-07-01	Uchenick
US4462076	1984-07-01	Smith
US4462078	1984-07-01	Ross
US4465901	1984-08-01	Best
US4471163	1984-09-01	Donald et al.
US4484217	1984-11-01	Block et al.
US4494156	1985-01-01	Kadison et al.
US4513174	1985-04-01	Herman
US4528588	1985-07-01	Lofberg
US4528643	1985-07-01	Freeny
US4553252	1985-11-01	Egendorf
US4558176	1985-12-01	Arnold et al.
US4558413	1985-12-01	Schmidt et al.
US4562306	1985-12-01	Chou et al.
US4562495	1985-12-01	Bond et al.
US4577289	1986-03-01	Comerford et al.
US4584641	1986-04-01	Guglielmino
US4588991	1986-05-01	Atalla
US4589064	1986-05-01	Chiba et al.
US4593353	1986-06-01	Pickholtz
US4593376	1986-06-01	Volk
US4595950	1986-06-01	Lofberg
US4597058	1986-06-01	Izumi et al.
US4634807	1987-01-01	Chorley et al.
US4644493	1987-02-01	Chandra et al.
US4646234	1987-02-01	Tolman et al.
US4652990	1987-03-01	Pailen et al.
US4658093	1987-04-01	Hellman
US4670857	1987-06-01	Rackman
US4672572	1987-06-01	Alsberg
US4677434	1987-06-01	Fascenda
US4680731	1987-07-01	Izumi et al.
US4683553	1987-07-01	Mollier
US4685056	1987-08-01	Barnsdale et al.
US4688169	1987-08-01	Joshi
US4691350	1987-09-01	Kleijne et al.
US4696034	1987-09-01	Wiedemer
US4701846	1987-10-01	Ikeda et al.
US4712238	1987-12-01	Gilhousen et al.
US4713753	1987-12-01	Boebert et al.
US4740890	1988-04-01	William
US4747139	1988-05-01	Taaffe
US4757533	1988-07-01	Allen et al.
US4757534	1988-07-01	Matyas et al.
US4768087	1988-08-01	Taub et al.
US4791565	1988-12-01	Dunham et al.
US4796181	1989-01-01	Wiedemer
US4799156	1989-01-01	Shavit
US4807288	1989-02-01	Ugon et al.
US4817140	1989-03-01	Chandra et al.
US4823264	1989-04-01	Deming
US4827508	1989-05-01	Shear
US4858121	1989-08-01	Barber et al.
US4864494	1989-09-01	Kobus
US4868877	1989-09-01	Fischer
US4903296	1990-02-01	Chandra et al.
US4924378	1990-05-01	Hershey et al.
US4930073	1990-05-01	Cina
US4949187	1990-08-01	Cohen
US4977594	1990-12-01	Shear
US4999806	1991-03-01	Chernow et al.
US5001752	1991-03-01	Fischer
US5005122	1991-04-01	Griffin et al.
US5005200	1991-04-01	Fischer
US5010571	1991-04-01	Katznelson
US5023907	1991-06-01	Johnson et al.
US5047928	1991-09-01	Wiedemer
US5048085	1991-09-01	Abraham et al.
US5050213	1991-09-01	Shear
US5091966	1992-02-01	Bloomberg et al.
US5103392	1992-04-01	Mori
US5103476	1992-04-01	Waite et al.
US5111390	1992-05-01	Ketcham
US5119493	1992-06-01	Janis et al.
US5128525	1992-07-01	Stearns et al.
US5136643	1992-08-01	Fischer
US5136646	1992-08-01	Haber et al.
US5136647	1992-08-01	Haber et al.
US5136716	1992-08-01	Harvey et al.
US5146575	1992-09-01	Nolan
US5148481	1992-09-01	Abraham et al.
US5155680	1992-10-01	Wiedemer
US5168147	1992-12-01	Bloomberg
US5185717	1993-02-01	Mori
US5201046	1993-04-01	Goldberg et al.
US5201047	1993-04-01	Maki et al
US5208748	1993-05-01	Flores et al.
US5214702	1993-05-01	Fischer
US5216603	1993-06-01	Flores et al.
US5221833	1993-06-01	Hecht
US5222134	1993-06-01	Waite et al.
US5224160	1993-06-01	Paulini et al.
US5224163	1993-06-01	Gasser et al.
US5235642	1993-08-01	Wobber et al.
US5245165	1993-09-01	Zhang
US5247575	1993-09-01	Sprague et al.
US5260999	1993-11-01	Wyman
US5263158	1993-11-01	Janis
US5265164	1993-11-01	Matyas et al.
US5276735	1994-01-01	Boebert et al.
US5280479	1994-01-01	Mary
US5285494	1994-02-01	Sprecher et al.
US5301231	1994-04-01	Abraham et al.
US5311591	1994-05-01	Fischer
US5319705	1994-06-01	Halter et al.
US5319785	1994-06-01	Halter et al.
US5337360	1994-08-01	Fischer
US5341429	1994-08-01	Stringer et al.
US5343527	1994-08-01	Moore et al.
US5347579	1994-09-01	Blandford
US5351293	1994-09-01	Michener et al.
US5355474	1994-10-01	Thuraisngham et al.
US5373561	1994-12-01	Haber et al.
US5390247	1995-02-01	Fischer
US5390330	1995-02-01	Talati
US5392220	1995-02-01	van den Hamer et al
US5392390	1995-02-01	Corzier
US5394469	1995-02-01	Nagel et al.
US5410598	1995-04-01	Shear
US5412717	1995-05-01	Fischer
US5421006	1995-05-01	Jablon
US5422953	1995-06-01	Fischer
US5428606	1995-06-01	Moskowitz
US5438508	1995-08-01	Wyman
US5442645	1995-08-01	Ugon
US5444779	1995-08-01	Daniele
US5449895	1995-09-01	Hecht et al.
US5449896	1995-09-01	Hecht et al.
US5450493	1995-09-01	Maher
US5453601	1995-09-01	Rosen
US5453605	1995-09-01	Hecht et al.
US5455407	1995-10-01	Rosen
US5455861	1995-10-01	Faucher et al.
US5455953	1995-10-01	Russell
US5457746	1995-10-01	Dolphin
US5463565	1995-10-01	Cookson et al.
US5473687	1995-12-01	Lipscomb et al.
US5473692	1995-12-01	Davis
US5479509	1995-12-01	Ugon
US5485622	1996-01-01	Yamaki
US5491800	1996-02-01	Goldsmith et al.
US5497479	1996-03-01	Hornbuckle
US5497491	1996-03-01	Mitchell et al.
US5499298	1996-03-01	Narasimhalu et al.
US5504757	1996-04-01	Cook et al.
US5504818	1996-04-01	Okano
US5504837	1996-04-01	Griffeth et al.
US5508913	1996-04-01	Yamamoto et al.
US5509070	1996-04-01	Schull
US5513261	1996-04-01	Maher
US5517518	1996-05-01	Rosen
US5530235	1996-06-01	Stefik et al.
US5530752	1996-06-01	Rubin
US5533123	1996-07-01	Force et al.
US5534975	1996-07-01	Stefik et al.
US5537526	1996-07-01	Anderson et al.
US5539735	1996-07-01	Moskowitz
US5539828	1996-07-01	Davis
US5550971	1996-08-01	Brunner et al.
US5553282	1996-09-01	Parrish et al.
US5557518	1996-09-01	Rosen
US5563946	1996-10-01	Cooper et al.
US5568552	1996-10-01	Davis
US5572673	1996-11-01	Shurts
US5592549	1997-01-01	Nagel et al.
US5606609	1997-02-01	Houser et al.
US5613004	1997-03-01	Cooperman et al.
US5621797	1997-04-01	Rosen
US5629980	1997-05-01	Stefik et al.
US5633932	1997-05-01	Davis et al.
US5634012	1997-05-01	Stefik et al.
US5636292	1997-06-01	Rhoads
US5638443	1997-06-01	Stefik
US5638504	1997-06-01	Scott et al.
US5640546	1997-06-01	Gopinath et al.
US5655077	1997-08-01	Jones et al.
US5687236	1997-11-01	Moskowitz et al.
US5689587	1997-11-01	Bender et al.
US5692180	1997-11-01	Lee
US5710834	1998-01-01	Rhoads
US5724425	1998-03-01	Chang et al.
US5740549	1998-04-01	Reilly et al.
US5745604	1998-04-01	Rhoads
US5748763	1998-05-01	Rhoads
US5748783	1998-05-01	Rhoads
US5748960	1998-05-01	Fischer
US5754849	1998-05-01	Dyer et al.
US5757914	1998-05-01	McManis
US5758152	1998-05-01	LeTourneau
US5765152	1998-06-01	Erickson
US5768426	1998-06-01	Rhoads
US5920861	1999-07-01	Hall et al.
US5943422	1999-08-01	Van Wie et al.
US5982956	1999-11-01	Lahmi
US5987471	1999-11-01	Bodine et al.
US6006332	1999-12-01	Rabne et al.
US6026166	2000-02-01	LeBourgeois
US6061726	1999-11-01	Cook et al.
BEX62-241061	1984-12-01
BEX900479	1984-12-01
EPX84441A1	1983-07-01
EPX128672A1	1984-12-01
EPX135422A1	1985-03-01
EPX180460A1	1986-05-01
EPX370146A1	1988-11-01
EPX399822A2	1990-11-01
EPX421409A2	1991-04-01
EPX456386A2	1991-11-01
EPX469864A2A3	1992-02-01
EPX565314A2	1993-10-01
EPX593305A2	1994-04-01
EPX651554A1	1995-05-01
EPX668695A2A3	1995-08-01
EPX696798A1	1996-02-01
EPX695985A1	1996-02-01
EPX714204A2	1996-05-01
EPX715243A1	1996-06-01
EPX715244A1	1996-06-01
EPX715245A1	1996-06-01
EPX715246A1	1996-06-01
EPX715247A1	1996-06-01
EPX725376A2	1996-08-01
EPX763936A2	1996-09-01
EPX749081A1	1996-12-01
EPX778513A2	1997-06-01
EPX795873A2	1997-09-01
EPX800312A1	1997-10-01
DEX3803982	1990-01-01
JPX57-726	1982-05-01
JPX62-225059	1987-08-01
JPX62-241061	1987-10-01
JPX64-68835	1989-03-01
JPX1-068835	1989-03-01
JPX2-242352	1990-09-01
JPX2-247763	1990-10-01
JPX2-294855	1990-12-01
JPX4-369068	1992-12-01
JPX5-181734	1993-07-01
JPX5-257783	1993-10-01
JPX5-268415	1993-10-01
JPX6-175794	1994-06-01
JPX6-215010	1994-08-01
JPX7-056794	1995-03-01
JPX7-084852	1995-03-01
JPX7-141138	1995-06-01
JPX7-200317	1995-08-01
JPX7-200492	1995-08-01
JPX7-244639	1995-09-01
JPX8-137795	1996-05-01
JPX8-152990	1996-06-01
JPX8-185292	1996-07-01
JPX8-185298	1996-07-01
GBX2136175	1984-09-01
GBX2264796	1993-09-01
GBX2294348	1996-04-01
GBX2295947	1996-06-01
WOXWO85/02310	1985-05-01
WOXWO85/03584	1985-08-01
WOXWO90/02382	1990-03-01
WOXWO92/06438	1992-04-01
WOXWO92/22870	1992-12-01
WOXWO93/01550	1993-01-01
WOXWO94/01821	1994-01-01
WOXWO94/03859	1994-02-01
WOXWO94/06103	1994-03-01
WOXWO94/16395	1994-07-01
WOXWO94/18620	1994-08-01
WOXWO94/22266	1994-09-01
WOXWO94/27406	1994-11-01
WOXWO95/14289	1995-05-01
WOXWO96/00963	1996-01-01
WOXWO96/06503	1996-02-01
WOXWO96/05698	1996-02-01
WOXWO96/03835	1996-02-01
WOXWO96/13013	1996-05-01
WOXWO96/21192	1996-07-01
WOXWO96/24092	1996-08-01
WOXWO97/03423	1997-01-01
WOXWO97/07656	1997-03-01
WOXWO97/25816	1997-07-01
WOXWO97/32251	1997-09-01
WOXWO97/48203	1997-12-01

Non-Patent Literature (142)

David Arneke and Donna Cunningham, Document from the Internet: AT& T encryption system protects information services, (News Release), Jan. 9, 1995, 1 page.
Claude Baggett, Cable's Emerging Role in the Information Superhighway, Cable Labs, (undated), 13 slides.
Theodore Sedgwick Barassi, Document from Internet: The Cybernotary: Public Key Registration and Certification and Authentication of International Legal Transactions, (undated), 4 pages.
Hugh Barnes, memo to Henry LaMuth, subject: George Gilder articles, May 31, 1994, 2 pages.
Comments in the Matter of Public Hearing and Request for Comments on the International Aspects of the National Information Infrastructure, Before the Department of Commerce, Aug. 12, 1994, pp. 1-15 (comments of Dan Bart).
Michael Baum, "Worldwide Electronic Commerce: Law, Policy and Controls Conference," Nov. 11, 1993, 18 pages.
Robert M. Best, Preventing Software Piracy With Crypto-Microprocessors, Digest of Papers, VLSI: New Architectural Horizons, Feb. 1980, pp. 466-469.
Richard L. Bisbey, II and Gerald J. Popek, Encapsulation: An Approach to Operating System Security, (USC/Information Science Institute, Marina Del Rey, CA), Oct. 1973, pp. 666-675.
Rolf Blom, Robert Forchheimer, et al., Encryption Methods in Data Networks, Ericsson Technics, No. 2, Stockholm, Sweden, 1978.
Rick E. Bruner, Document from the Internet: PowerAgent, NetBot help advertisers reach Internet shoppers, Aug. 1997, 3 pages.
Denise Caruso, Technology, Digital Commerce: 2 plans for watermarks, which can bind proof of authorship to electronic works, N.Y. Times, Aug. 7, 1995, p. D5.
A.K. Choudhury, N. F. Maxemchuck, et al., Copyright Protection for Electronic Publishing Over Computer Networks, (AT&T Bell Laboratories, Murray Hill, N. J.) Jun. 1994, 17 pages.
Tim Clark, Ad service gives cash back, Document from the Internet: <www.news.com./News/Item/0,4,13050,00.html> (visited Aug. 4, 1997), 2 pages.
Donna Cunningham, David Arneke, et al., Document from the Internet: AT&T, VLSI Technology join to improve info highway security, ( News Release) Jan. 31, 1995, 3 pages.
Lorcan Dempsey and Stuart Weibel, The Warwick Metadata Workshop: A Framework for the Deployment of Resource Description, D-Lib Magazine, Jul. 15, 1996.
Dorothy E. Denning and Peter J. Denning, Data Security, 11 Computing Surveys No. 3, Sep. 1979, pp. 227-249.
Whitfield Diffie and Martin E. Hellman, New Directions in Cryptography, IEEE Transactions on Information Theory, vol. 22, No. 6, Nov. 1976, pp. 644-651.
Whitfield Diffie and Martin E. Hellman, Privacy and Authentication: An Introduction to Cryptography, Proceedings of the IEEE, vol. 67, No. 3, Mar. 1979, pp. 397-427.
Stephen R. Dusse and Burton S. Kaliski, A Cryptographic Library for the Motorola 56000, Advances in Cryptology-Proceedings of Eurocrypt 90, (I.M. Damgard, ed., Springer-Verlag) 1991, pp. 230-244.
Esther Dyson, Intellectual Value, WIRED Magazine, Jul. 1995, pp. 136-141 and 182-183.
Science, space and technology, Hearing before Subcomm. on Technology, Environment and Aviation, May 26, 1994 (testimony of D. Linda Garcia).
James Gleick, Dead as a Dollar, The New York Times Magazine, Jun. 16, 1996, Sect. 6, pp. 26-30, 35, 42, 50, 54.
Fred Greguras, Document from Internet: Softic Symposium '95, Copyright Clearances and Moral Rights, Dec. 11, 1995, 3 pages.
Louis C. Guillou, Smart Cards and Conditional Access, Advances in Cryptography--Proceedings of EuroCrypt 84 (T. Beth et al, Ed., Springer-Verlag, 1985) pp. 480-490.
Harry H. Harman, Modern Factor Analysis, Third Edition Revised, University of Chicago Press, Chicago and London, 1976.
Amir Herzberg and Shlomit S. Pinter, Public Protection of Software, ACM Transactions on Computer Systems, vol. 5, No. 4, Nov. 1987, pp. 371-393.
Jud Hofmann, Interfacing the NII to User Homes, (Consumer Electronic Bus. Committee) NIST, Jul. 1994, 12 slides.
Jud Hofmann, Interfacing the NII to User Homes, Electronic Industries Association, (Consumer Electronic Bus Committee) (undated), 14 slides.
Stannie Holt, Document from the Internet: Start-up promises user confidentiality in Web marketing service, InfoWorld Electric News (updated Aug. 13, 1997).
Jay J. Jiang and David W. Conrath, A Concept-based Approach to Retrieval from an Electronic Industrial Directory, International Journal of Electronic Commerce, vol. 1, No. 1 (Fall 1996) pp. 51-72.
Debra Jones, Document from the Internet: Top Tech Stories, PowerAgent Introduces First Internet `Informediary` to Empower and Protect Consumers, (updated Aug. 13, 1997) 3 pages.
Kevin Kelly, E-Money, Whole Earth Review, Summer 1993, pp. 40-59.
Stephen Thomas Kent, Protecting Externally Supplied Software in Small Computers, (MIT/LCS/TR-255) Sep. 1980 254 pages.
David M. Kristol, Steven H. Low and Nicholas F. Maxemchuk, Anonymous Internet Mercantile Protocol, (AT&T Bell Laboratories, Murray Hill, NJ) Draft: Mar. 17, 1994.
Carl Lagoze, The Warwick Framework, A Container Architecture for Diverse Sets of Metadata, D-Lib Magazine, Jul./Aug. 1996.
Mike Lanza, e-mail, George Gilder's Fifth Article--Digital Darkhorse--Newspapers, Feb. 21, 1994.
Steven Levy, E-Money, That's What I want, WIRED, Dec. 1994, 10 pages.
Steven H. Low and Nicholas F. Maxemchuk, Anonymous Credit Cards, AT&T Bell Laboratories, Proceedings of the 2.sup.nd ACM Conference on Computer and Communication Security, Fairfax, VA, Nov. 2-4, 1994, 10 pages.
Steven H. Low, Nicholas F. Maxemchuk, and Sanjoy Paul, Anonymous Credit Cards and its Collusion Analysis (AT&T Bell Laboratories, Murray Hill, N.J.) Oct. 10, 1994, 18 pages.
S. H. Low, N.F. Maxemchuck, et al., Document Marking and Identification using both Line and word Shifting (AT&T Bell Laboratories, Murray Hill, N.J.) Jul. 29, 1994, 22 pages.
Malcolm Maclachlan, Document from the Internet: PowerAgent Debuts Spam-Free Marketing, TechWire, Aug. 13 1997, 3 pages.
N.F. Maxemchuk, Electronic Document Distribution, (AT&T Bell Laboratories, Murray Hill, N.J.) (undated).
Eric Milbrandt, Document from the Internet: Steganography Info and Archive, 1996, 2 pages.
Ryoichi Mori and Masaji Kawahara, Superdistribution: The Concept and the Architecture, The Transactions of the EIEICE, V, E73, No. 7, Tokyo, Japan, Jul. 1990.
Walter S. Mossberg, Personal Technology, Threats to Privacy On-Line Become More Worrisome, The Wall Street Journal, Oct. 24, 1996.
Nicholas Negroponte, Some Thoughts on Likely and Expected Communications Scenarios: A Rebuttal, Telecommunications, Jan. 1993, pp. 41-42.
Nicholas Negroponte, Electronic Word of Mouth, WIRED, Oct. 1996, p. 218.
Peter G. Neumann, Robert S. Boyer, et al., A Provably Secure Operating System: The System, Its Applications, and Proofs, Computer Science Laboratory Report CSL-116, Second Edition, SRI International, Jun. 1980.
Joseph N. Pelton (Dr.), Why Nicholas Negroponte is Wrong About the Future of Telecommunication, Telecommunications, Jan. 1993, pp. 35-40.
Gordon Rankine (Dr.), Thomas--A Complete Single-chip RSA Device, Advances in Cryptography, Proceedings of CRYPTO 86, (A.M. Odiyzko Ed., Springer-Verlag) 1987, pp. 480-487.
Arthur K. Reilly, Input to the `International Telecommunications Hearings,` Panel 1: Component Technologies of the NII/GII, Standards Committee T1-Telecommunications (undated).
Paul Resnick and Hal R. Varion, Recommender Systems, Communications of the ACM, vol. 40, No. 3, Mar. 1997 pp. 56-89.
Lance Rose, Cyberspace and the Legal Matrix: Laws or Confusion?, 1991.
Steve Rosenthal, Interactive Network: Viewers Get Involved, New Media, Dec. 1992, pp. 30-31.
Steve Rosenthal, Interactive TV: The Gold Rush is on, New Media, Dec. 1992, pp. 27-29.
Steve Rosenthal, Mega Channels, New Media, Sep. 1993, pp. 36-46.
Edward Rothstein, Technology, Connections, Making the Internet come to you through `push` technology, N. Y. Times, Jan. 20, 1997, p. D5.
Ken Rutkowski, Document from Internet: PowerAgent Introduces First Internet `Informediary` to Empower and Protect Consumers, Tech Talk News Story, Aug. 4, 1997, 1 page.
Ira Sager (Edited by), Bits & Bytes, Business Week, Sep. 23, 1996, p. 142E.
Schlosstein, Steven, America: The G7's Comeback Kid, International Economy, Jun./Jul. 1993, 5 pages.
Ingrid Scnaumueller-Bichl and Ernst Piller, A Method of Software Protection Based on the Use of Smart Cards and Cryptographic Techniques, (undated), 9 pages.
Jurgen Schurmann, Pattern Classification, A Unified View of Statistical and Neural Approaches, John Wiley & Sons, Inc., 1996.
Victor Shear, Solutions for CD-ROM Pricing and Data Security Problems, CD ROM Yearbook 1988-1989 (Microsoft Press 1988 or 1989) pp. 530-533.
Karl Siuda, Security Services in Telecommunications Networks, Seminar: Mapping New Applications Onto New Technologies, edited by B. Plattner and P Gunzburger; Zurich, Mar. 8-10, 1988, pp. 45-52, XP000215989.
Sean Smith and J.D. Tygar, Signed Vector Timestamps: A Secure Protocol for Partial Order Time, CMU-93-116, School of Computer Science Carnegie Mellon University, Pittsburgh, Pennsylvania, Oct. 1991; version of Feb. 1993, 15 pages.
Mark Stefik, Letting Loose the Light: Igniting Commerce in Electronic Publication, (Xerox PARC, Palo Alto, CA) 1994-1995, 35 pages.
Mark Stefik, Letting Loose the Light: Igniting Commerce In Electronic Publication, Internet Dreams: Archetypes, Myths, and Metaphors. Massachusetts Institute of Technology, 1996, pp. 219-253.
Mark Stefik, Chapter 7, Classification, Introduction to Knowledge Systems (Morgan Kaufmann Publishers, Inc., 1995) pp. 543-607.
Tom Stephenson, The Info Infrastructure Initiative: Data Super Highways and You, Advanced Imaging, May 1993, pp. 73-74.
Bruce Sterling, Literary freeware: Not for Commercial Use, remarks at Computers, Freedom and Private Conference IV, Chicago, IL, Mar. 26, 1994.
Bruno Struif, The Use of Chipcards for Electronic Signatures and Encryption, Proceedings for the 1989 Conference on VSLI and Computer Peripherals, IEEE Computer Society Press, 1989, pp. (4)155-(4)158.
J.D. Tygar and Bennet Yee, Cryptography: It's Not Just For Electronic Mail Anymore, CMU-CS-93-107, School of Computer Science Carnegie Mellon University, Pittsburgh, PA, Mar. 1, 1993, 21 pages.
J.D. Tygar and Bennet Yee, Dyad: A System for Using Physically Secure Coprocessors, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (undated), 41 pages.
J.D. Tygar and Bennet Yee, Dyad: A System for Using Physically Secure Coprocessors, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 1991, 36 pages.
T. Valovic, The Role of Computer Networking in the Emerging Virtual Marketplace, Telecommunications, (undated), pp. 40-44.
Joan Voight, Beyond the Banner, Wired, Dec. 1996, pp. 196, 200, 204.
Steven Vonder Haar, Document from the Internet: Power/Agent Launches Commercial Service, Interactive Week, Aug. 4, 1997, 1 page.
Robert Weber, Metering Technologies for Digital Intellectual Property, A Report to the International Federation of Reproduction Rights Organisations (Boston, MA), Oct. 1994, pp. 1-29.
Robert Weber, Document from the Internet: Digital Rights Management Technologies, Oct. 1995, 21 pages.
Robert Weber, Digital Rights Management Technologies, A Report to the International Federation of Reproduction Rights Organisations, Northeast Consulting Resources, Inc., Oct. 1995, 49 pages.
Adele Weder, Life on the Infohighway, INSITE, (undated), pp. 23-25.
Steve H. Weingart, Physical Security for the Abyss System, (IBM Thomas J. Watson Research Center, Yorktown Heights, NY), 1987, pp. 52-58.
Daniel J Weitzner, A Statement on EFF's Open Platform Campaign as of Nov., 1993, 3 pages.
Steve R. White, Abyss: A Trusted Architecture for Software Protection, (IBM Thomas J. Watson Research Center, Yorktown Heights, NY), 1987, pp. 38-50.
Bennet Yee, Using Secure Coprocessors, CMU-CS-94-149, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1994, 94 pages.
Frank Yellin, Document from the Internet: Low Level Security in Java, Sun Microsystems, 1996, 8 pages.
Symposium: Applications Requirements for Innovative Video Programming: How to Foster (or Crippple) Program Development Opportunities for Interactive Video Programs Delivered on Optical Media: A Challenge for the Introduction of DVD (Digital Video Disc) (Oct. 19-20, 1995, Sheraton Universal Hotel, Universal City CA).
Argent Information, Q&A Sheet, Document from the Internet: < http://www.digital-watermark.com/>, Copyright 1995, The Dice Company, (last modified Jun. 16, 1996), 7 pages.
New Products, Systems and Services, AT&T Technology, vol. 9, No. 4, (undated), pp. 16-19.
Cable Television and America's Telecommunications Infrastructure, (National Cable Television Association, Washington, D.C.), Apr. 1993, 19 pages.
CD ROM: Introducing . . . The Workflow CD-ROM Sampler (Creative Networks, MCIMail: Creative Networks, Inc.), (undated).
Codercard, Basic Coder Subsystem (Interstate Electronics Corp., Anaheim, CA), (undated) 4 pages.
Collection of documents including: Protecting Electronically Published Properties, Increasing Publishing Profits, (Electronic Publishing Resources Inc.,) Jan. 1993, 25 pages.
Communications of the ACM, vol. 39, No. 6, Jun. 1996, 130 pages.
Communications of the ACM, "Intelligent Agents," vol. 37, No. 7, Jul. 1994, 170 pages.
Computer Systems Policy Project (CSSP), Perspectives on the National Information Infrastructure: Ensuring Interoperability, Feb. 1994, 5 slides.
DiscStore (Electronic Publishing Resources, Chevy Chase, MD), 1991.
DSP56000/DSP56001 Digital Signal Processor User's Manual, (Motorola), 1990, p. 2-2.
A Supplement to Midrange Systems, Premenos Corp. White Paper: The Future of Electronic Commerce, Document from Internet: <[email protected]>, Aug. 1995, 4 pages.
CGI Common Gateway Interface, Document from the Internet: <[email protected]>, 1996, 1 page.
HotJava.TM.: The Security Story, Document from the Internet: (undated) 4 pages.
About the Digital Notary Service, Document from the Internet: < [email protected]>, (Surety Technologies), 1994-5, 6 pages.
Templar Overview: Premenos, Document from the Internet: < [email protected]> (undated), 4 pages.
Templar Software and Services, Secure, Reliable, Standards-Based EDI Over the Internet: Document from the Internet: <[email protected].> (Premenos) (undated), 1 page.
JAVASOFT, Frequently Asked Questions--Applet Security, Document from Internet: < [email protected]>, Jun. 7, 1996, 8 pages.
News from The Document Company Xerox, Xerox Announces Software Kit for Creating `Working Documents` with Dataglyphs Document from Internet: Nov. 6, 1995, 13 pages.
Premenos Announces Templar 2.0--Next Generation Software for Secure Internet EDI, Document from Internet: <[email protected]>, Jan. 17, 1996, 1 page.
WEPIN Store, Stenography (Hidden Writing), Document from Internet: (Common Law), 1995, 1 page.
Sag's durch die Blume, Document from Internet: < [email protected].> (German), (undated), 5 pages.
A Publication of the Electronic Frontier Foundation, EFFector Online vol. 6 No. 6., Dec. 6, 1993, 8 pages.
EIA and TIA White Paper on National Information Infrastructure, The Electronic Industries Association and the Telecommunications Industry Association, Washington, D.C., (undated).
Electronic Currency Requirements, XIWT (Cross Industry Working Group), (undated).
Electronic Publishing Resources Inc. Protecting Electronically Published Properties Increasing Publishing Profits (Electronic Publishing Resources, Chevy Chase, MD) 1991, 19 pages.
What is Firefly?, Document from the Internet: < www.ffly.com>, (Firefly Network, Inc.) Firefly revision: 41.4, (Copyright 1995, 1996), 1 page.
First CII Honeywell Bull International Symposium on Computer Security and Confidentially, Conference Text, Jan. 26-28, 1981, pp. 1-21.
Framework for National Information Infrastructure Services, Draft, U.S. Department of Commerce, Jul. 1994.
Framework for National Information Infrastructure Services, NIST, Jul. 1994, 12 Slides.
Intellectual Property and the National Information Infrastructure, a Preliminary Draft of the Report of the Working Group on Intellectual Property Rights, Green paper, Jul. 1994, 141 pages.
Multimedia Mixed Object Envelopes Supporting a Graduated Fee Scheme Via Encryption, IBM Technical Disclosure Bulletin, vol. 37, No. 3, Mar. 1, 1994, pp. 413-417, XP000441522.
Transformer Rules Stategy for Software Distribution Mechanism-Support Products, IBM Technical Disclosure Bulletin, vol. 37, No. 48, Apr. 1994, pp. 523-525, XP000451335.
IISP Break Out Session Report for Group No. 3, Standards Development and Tracking System, (undated).
Information infrastructure Standards Panel: NII "The Information Superhighway", NationsBank--HGDeal--ASC X9, (undated), 15 pages.
Invoice? What's an Invoice?, Business Week, Jun. 10, 1996, pp. 110-112.
Micro Card (Micro Card Technologies, Inc., Dallas, TX), (undated), 4 pages.
Background on the Administration's Telecommunications Policy Reform Initiative, News Release, The White House, Office of the President, Jan. 11, 1994, 7 pages.
NII, Architecture Requirements, XIWT, (undated).
Symposium: Open System Environment Architectural Framework for National Information Infrastructure Services and Standards, in Support of National Class Distributed Systems, Distributed System Engineering Program Sponsor Group, Draft 1.0, Aug. 5, 1994, 34 pages.
Proper Use of Consumer Information on the Internet, Document from the Internet, White Paper, (PowerAgent Inc., Menlo Park, CA) Jun. 1997, 9 pages.
What the Experts are Reporting on PowerAgent, Document from the Internet, PowerAgent Press Releases, Aug. 13, 1997, 6 pages.
What the Experts are Reporting on PowerAgent, Document from the Internet, PowerAgent Press Releases, Aug. 4, 1997, 5 pages.
Portland Software's Ziplock, Internet Information, Copyright Portland Software 1996-1997, 12 pages.
Press Release, National Semiconductor and EPR Partner for Information Metering/Data Security Cards (Mar. 4, 1994).
R01 (Personal Library Software, 1987 or 1988).
R01--Solving Critical Electronics Publishing Problems (Personal Library Software, 1987 or 1988).
Serving the Community: A Public Interest Vision of the National Information Infrastructure, Computer Professionals for Social Responsibility, Executive Summary (undated).
Special Report, The Internet: Fulfilling the Promise; Lynch, Clifford, The Internet Bringing Order From Chaos; Resnick, Paul, Search the Internet, Hearst, Marti A., Filtering Information on the Internet; Stefik, Mark, Interfaces for Searching the Web; Scientific American, Mar. 1997, pp. 49-56, 62-67, 68-72, 78-81.
The 1:1 Future of the Electronic Marketplace: Return to a Hunting and Gathering Society, (undated), 2 pages.
The Benefits of RDI for Database Protection and usage Based Billing (Personal Library Software, 1987 or 1988).
The New Alexandria No. 1, Alexandria Institute, Jul.-Aug. 1986, pp. 1-12.
Is Advertising Really Dead?, Wired 1.02, Part 2, 1994.
How Can I Put an Access Counter on My Home Page?, World Wide Web FAQ, 1996, 1 page.
XIWT Cross Industry Working Team, Jul. 1994, 5 pages.

Abstract

Description