US 12,711,251 B2Grant

System and methods for using cipher objects to protect data

Issue Date:2026-08-18

•18 Claims

•15 Drawing Sheets

Abstract

Systems, methods, and devices configured to build and utilize an intelligent cipher transfer object are provided. The. intelligent cipher transfer object includes a set of participants protected by cloaking patterns. A portable dynamic rule set, which includes executable code for managing access to the protected set of participants, is included within the intelligent cipher transfer object. For a given user, the intelligent cipher transfer object may provide access to some of the participants while preventing access to other participants, based on the portable dynamic rule set therein.

Metadata

Assignee

Sertainty Corporation

Inventors

Gregory Scott Smith
Melani Leigh Smith Weed
Daniel Michael Fischer
Elke M. Ridenour

Application Information

Application Number:US 18/623,627

Filing Date:2024-04-01

Priority Date:2011-12-09

Art Unit:2407

Classifications

IPC:

G06F21/60H04L9/40H04W4/18

Field of Search:

G06F 21/604G06F 21/606G06F 2221/2107G06F 2221/2141G06F 21/1015G06F 21/1012H04L 63/104H04L 63/20H04L 63/0428H04L 63/08H04L 63/108H04W 4/185

Patent Drawings (15 sheets)

Description

[0001] This application is a continuation of U.S. application Ser. No. 17/377,595, filed on Jul. 16, 2021, which is continuation-in-part of U.S. application Ser. No. 16/657,412, filed on Oct. 18, 2019, now 11,093,623, which is a continuation of U.S. application Ser. No. 15/704,735, filed on Sep. 14, 2017, now U.S. Pat. No. 10,482,266, which is a continuation of U.S. application Ser. No. 14/689,668, filed on Apr. 17, 2015, now U.S. Pat. No. 9,792,451, which claims priority to U.S. Provisional Application No. 61/980,617, filed Apr. 17, 2014, and is a continuation-in-part application of U.S. application Ser. No. 13/710,366, filed Dec. 10, 2012, which claims priority to U.S. Provisional Application No. 61/569,162, filed Dec. 9, 2011, and is entitled to those filing dates for priority in whole or in part. This application also claims priority to and the benefit of U.S. Provisional Application No. 63/052,851. The specifications, figures and complete disclosures of the aforementioned applications are incorporated herein by specific reference for all purposes.

Field of the Invention

[0002] This invention relates to a system and related methods for protecting and controlling data using self-encryption, self-governance, self-protection and delegation, including, but not limited to, the use of an intelligent cipher transfer object having flexible access protocols.

Background of the Invention

[0003] Current techniques for protecting the secure transfer of data have certain drawbacks. When information is outside of a trusted environment, like a secure network, it is typically protected by encryption in large part, because application-level security measures no longer have control of the information. Current techniques use encryption keys which must be present within an application, or revealed or exchanged among users or via an application, for encrypted data to be useful, thereby potentially compromising protection and confidentiality. For example, encryption keys can be stolen in a discovery or APT assault, or can be compromised via social engineering or other means. Further, once an encryption key (or password) is shared and the data unlocked, control of the data is lost. Even when data is within a trusted environment, such as behind a firewall or the like, it is vulnerable to attack or misuse, as files are available to anyone with access to their storage location. Protecting information traditionally requires teams of people with expertise in networks, consumer devices (especially in a bring-your-own-device environment), telecommunication, servers and applications, and integrating and coordinating the expertise and efforts on an enterprise scale to achieve a level of security which nevertheless can be compromised by exploiting flaws and gaps inherent in complex integrations.

[0004] Conventional data encryption uses algorithms that run in a predetermined sequence to encrypt and then, typically, run in the reverse sequence to decrypt the data. There may also be a process of moving pieces of data in a static pattern to cloak it, and then reversing the process to reveal the complete, unencrypted file. With this method, an attacker who has access to the encryption algorithm used to encrypt data can break the encryption by reversing the encryption process.

[0005] Another traditional technique for protecting data is the use of dynamic controls. Dynamic controls are application dependent, such as password protected PDF files generated and used by document viewing and editing software produced by Adobe®, or the like. Traditional dynamic controls are dependent on the application or reside within an application. Rules are executed by the application. While also dependent on a key (password) exchange as described above, another drawback to this method is that application-dependent rules may be overridden (as in the example of a protected PDF opened with Adobe® Acrobat®) or, a developer could write an application that ignores the rules imposed by the authoring application.

[0006] Accordingly, what is needed is a data assurance solution that is self-protecting and self-governing, that is less dependent on keys and passwords for authentication, on predictable reversible encryption sequences for protection, or on external applications for execution while remaining functional and efficient both within and outside the secure environment, both for data at rest and in transit.

Summary of the Invention

[0007] This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This summary is not intended to identify key features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.

[0008] In various embodiments, aspects of the invention provide methods and supporting systems for authenticating users of self-protecting data objects (“SPDOs”) through the use of a pseudo user object, (referred to herein as a “Delegate”) to resolve user authentication in a dynamic user environment in which a static built-in framework used in many SPDOs is no longer viable. The technique uses a combination of static user list, a dynamic user list supported through a Delegate service, a gateway to access existing enterprise LDAP/AD services, and a local cached user credential that can also include a time-to-live and domain recognition for additional security. This combination provides a complete and flexible solution to user authentication of SPDOs, and can securely provide user authentication in variety of scenarios.

[0009] Therefore, in a first aspect, the invention provides

Brief Description of the Drawings

[0010] The foregoing aspects and many of the attendant advantages of embodiments of the present disclosure will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings.

[0011] FIG. 1 shows a schematic diagram that illustrates an exemplary embodiment of data governance according to various aspects of the present invention.

[0012] FIG. 2 shows a flowchart that illustrates an exemplary embodiment of a method of constructing an ICTO according to various aspects of the, present invention.

[0013] FIG. 3 shows a flowchart that illustrates an exemplary embodiment of a method of accessing data protected by an ICTO according to various aspects of the present invention.

[0014] FIG. 4 shows a schematic diagram, that illustrates an exemplary use case for an embodiment of the present invention.

[0015] FIG. 5 shows a schematic diagram that illustrates aspects of an exemplary workflow for an embodiment of the present invention.

[0016] FIG. 6 shows a block diagram that illustrates an exemplary′ hardware architecture of a computing device suitable for use with embodiments of the present invention.

[0017] FIG. 7 shows a schematic diagram that illustrates an exemplary embodiment of data governance according to another exemplary embodiment of the present invention.

[0018] FIG. 8 shows a flow chart that illustrates a exemplary embodiment of creating an ICTO according to another exemplary embodiment of the present invention.

[0019] FIG. 9 shows a flow chart that illustrates a exemplary embodiment of accessing an ICTO according to another exemplary embodiment of the present invention,

[0020] FIG. 10 shows a view of a portable identity appliance system in accordance with another exemplary embodiment of the present invention.

[0021] FIG. 11 shows a diagram of a portable identity appliance used to produce a protected object.

[0022] FIG. 12 shows a diagram of a portable identity appliance used to facilitate secure messaging of protected data.

[0023] FIG. 13 shows a diagram of a portable identity appliance used to guard access to websites, portals, networks, or other resources.

[0024] FIG. 14 shows a diagram of a delegate access management system and an authentication operational flow, according to some embodiments.

Detailed Description of Exemplary Embodiments

[0025] In several exemplary embodiments, the present invention comprises a self-contained, self-protecting, self-controlling intelligent cipher transfer object (ICTO), which may be stored on a computer-readable medium. The ICTO comprises a set of participants including a portable dynamic rule set (PDRS). Computer-implemented methods of creating, accessing, and using such an ICTO, and a computing device configured to execute the executable portions of such an ICTO, also are provided.

[0026] In various embodiments, the present invention addresses critical faults with previous data protection systems and methods. The present invention fills a gap in existing protection schemes because existing schemes address perimeter defenses, user access (both users and their devices) and anomaly detection, but are not attached to the data itself. If prior-art encryption is utilized, the burden of key code management may reduce productivity or flaws may create yet other vulnerabilities by exposing keys that likewise need to be protected.

[0027] Embodiments of the present disclosure provide a self-contained, self-protecting, self-governing, data-centric solution, meaning that the controls for data management, protection, and administration are grafted into, and become part of, each data set and directly oversee the data set's access and use. Though, in some embodiments of the present disclosure, some data can be removed from protection for analysis or use by an authorized agent, the, method of removal from protection is not predictable, because it is not a reversal of the protection mechanism or mechanisms. The present invention comprises an unpredictable and irreversible system and associated methods to retain dynamic, portable, independent, persistent, intelligent governance of data over the life of the data's existence. This system is capable of protecting data while the data is stored or in transit, and in the hands of trusted data users or untrusted data users.

[0028] In some embodiments of the present disclosure, the data protection scheme is embedded within, grafted to, and maintained within the data-set and thus form a self-protecting data object, or SPDO. The data protection scheme may also create an audit trail of attempts to access the data. Known or authorized users of the data are noted in an embedded log, while unknown parties or other unauthorized attempts to access the data are likewise noted in the embedded log and can be transmitted and displayed to the data owner in real time. If an unauthorized party attempts to access the data, the self-protecting data can defend itself, take offensive action against the intrusion, alert the data owner to the unauthorized attempt, and/or take any other appropriate action.

[0029] The data owner utilizes the protection scheme as a simple and lightweight management tool that continuously validates the relationship of the parties to the data. From an attacker's point of view, the system is unpredictable because every authorized party has its established identity incorporated into the protection scheme. A unique protection scheme may be provided for each combination of owner, user, and dataset; this means that the method by which data is revealed to Authorized Party A would not be the way data is revealed to Authorized Party B.

[0030] Further, the unique protection scheme that may be provided for a combination of owner, user, data set and rule set will likewise be unique to itself when the same combination is protected subsequent times. That is, each time a combination of owner, user, data set and rule set is protected as described herein, whether it is the same combination or a different combination, the ICTO will be a uniquely protected ICTO.

[0031] In some embodiments, different techniques may be used to protect the data and to access the protected data. For example, an irreversible protection scheme may be used to combine multiple pieces of data into a single digital mixture, such that a selective retrieval scheme may be used to selectively retrieve pieces of data from the single digital mixture without obtaining access to other protected data in the digital mixture. In such an embodiment, when the data is properly accessed, it is selectively revealed, based upon the owner's wishes for the authorized recipient. The path to reveal information is not a function of retracing the original steps, and the original protection scheme used to combine the multiple pieces of data may not be reversible other than with respect to individually requested pieces of data. In other words, even though pieces of data stored by the protection scheme may be accessed, the totality of the digital mixture is not accessible in such a way that allows the totality of the original contents to be reconstituted. Embodiments of the, present disclosure are configured to positively identify any user or entity identity such that is included as a participant as legitimate or not, and the data owner controls which portions or pieces of data to which the identified legitimate users can gain access. Unauthorized parties, whether inside or external to the intended recipient or the intended recipient's network, can never access the data in its unprotected form. Embodiments of the present disclosure unequivocally confirm the identity of a trusted party before providing access to ensure data security. Reversing or reverse engineering the protection scheme cannot yield the original results.

[0032] In several embodiments of the present invention, rules are executed by an executable portion of the digital mixture, ensuring the absolute wishes of the data owner are enforced without relying on a third party or an outside entity or application or operating system. The protection scheme is not dependent on an application or an operating system to protect/unprotect the data: the data is self-protecting and self-controlling. The protection scheme is independent of operating system, environment, and application (i.e., external or centralized or server key management, password management and identity management applications).

[0033] Methods in the protocol are implemented in executable code stored in the data mixture, and are executed in response to detecting a request by the user to access the data through a structured API. Furthermore, the data can be of any type (e.g., text, audio, video, or combination thereof), and in any kind of container, database or environment: (e.g., buffer, directory, file, or combinations thereof). Any attempt to access the data, other than through the API or other means described herein will be foiled by the applied cloaking patterns, which will be undeterminable by any component outside of or other than the components implementing the API. When attempting to access the data through the API or other means described herein, the protection scheme ensures that legitimate users are only able to access data as permitted by the data owner.

[0034] Other methods initiated through the API, or other ICTO-aware application, device or operating system, initially validate the ICTO. Subsequently, the outer cloaking technology locates the executable code, cipher engine, or mixer stored in the digital mixture. A request for access is received by the executable code via the API or other ICTO-aware application, device or operating system on behalf of the agent. The executable code is energized, or “awakened,” at which point the portable dynamic rule set takes and maintains control until the self-governed data object is closed or becomes inactive. Any attempt to access the self-protecting, self-controlling digital mixture without energizing the executable code will be unsuccessful.

[0035] FIG. 1 is a schematic diagram that illustrates an exemplary embodiment of self-governing data according to various aspects of the present invention. A dynamic participant controller 110, or “mixer,” identifies a set of digital ingredients (“participants”) 101, including descriptions of authorized agents, device locations, rules for using the data, and/or other ingredients as discussed further below. By mixing these ingredients, the mixer 110 forms a cloaked entity, the intelligent cipher transfer object, or ICTO 115. The ICTO 115 may also be called a “digital mixture.” As discussed herein, one of ordinary skill in the art will recognize that the terms “ICTO” and “digital mixture” and “self-governing data” may be, used interchangeably. To an unauthorized entity or third party viewing the ICTO 115 directly, the ICTO 115 may simply appear to be a set of data. The ICTO 115 appears to the outside as a homogenous mixture without resembling or exposing the original ingredients. However, when accessed via an application implementing the API (such as the mixer 110, an ICTO-aware client application (not illustrated), and/or the like), executable portions of the ICTO 115 are accessible to provide access to the data governed by the ICTO 115.

[0036] In some embodiments, the executable portions of the ICTO 115 may be stored at a determinable location within the ICTO 115 to allow an application implementing the API to easily find the executable portions. In some embodiments, additional protection may be applied to the ICTO 115 by storing one or more executable portions of the ICTO 115 at variable locations within the ICTO 115. While these variable locations make the executable portions of the ICTO 115 exceedingly difficult for an unauthorized user to find, an ICTO-aware application implementing the API for accessing the ICTO 115 may be able to compute the variable locations for a given ICTO 115 based on a feature of the ICTO 115. For example, the secure application may read an attribute of the ICTO 115 such as a file size, a creation time, and/or the like, and may perform a calculation that determines the location using the attribute as a seed. By keeping the details of the calculation secret, the location of the executable portions of the ICTO 115 can likewise be kept secret.

[0037] The set of participants 101 may include object descriptions 102, mixture metadata 104, owner data 106, cloaking patterns 107, an identity module 109, and an intelligence module 111. in some embodiments, a combination of the identity module 109 and the intelligence module 111 may be considered together as a portable dynamic rule set 108. The object descriptions 102 may include owner-supplied and owner-defined earmarks, data identifiers, and/or properties. Owner data 106 may include data that is to be protected within the ICTO 115, such as a document, a file, a buffer, a directory, a pointer to remotely stored data, database, and/or the like. In some embodiments, owner data 106 may be optional, if the ICTO 115 is merely used, for example, for a signature verification method that is not associated with underlying signed data. In some embodiments, multiple pieces of owner data 106 may be included within a single ICTO 115. In some embodiments, owner data 106 from multiple owners may be included within a single ICTO 115.

[0038] The cloaking patterns 107 specify various combinations of data protection and access techniques supported by the mixer 110. The data protection and access techniques included in cloaking patterns 107 may include techniques such as industry standard verified encryption, compression, randomization, normalization, and/or other techniques. Techniques suitable for use as cloaking patterns 107 are not limited to currently known techniques, but could include any privately or publicly available encoding and/or decoding technique, known now or developed in the future. Use of a cloaking pattern 107 to protect and/or access data may involve applying the combination of data protection and/or access techniques specified in the cloaking pattern 107 to the data.

[0039] The mixture metadata 104 provides organizational information for the digital mixture 115, such as virtual file system data containing directories, key codes, user files, signatures, and/or the like.

[0040] The identity module 109 may include dynamic identity attributes that uniquely identify protected agents in a transaction. In some embodiments, the. identity module 109 may include data that represents a configuration of a computing device that may be given certain rights with respect to a protected object. The identity module 109 may contain specific information about hardware or software configurations installed on the computing device usable to identify the computing device. The identity module 109 may contain data including, but not limited to, CPU information including model numbers, number of cores, speed, and/or the like; a chassis serial number; manufacturer data; a volatile memory size; a non-volatile memory size; one or more storage device serial numbers and/or model numbers; installed software titles and/or version numbers, and/or the like.

[0041] In some, embodiments, a transaction is an atomic action using the ICTO 115 in which one or more agents securely exchange data within a given context and with a specified intent. Authorized agents may include human and non-human entities, such as a human user, a unique mechanical object, a unique electronic object, a unique software or program object, and/or the like. Dynamic identity attributes contained in the ICTO 115 may be modified by the intelligence module 111 within or during the course of an interaction with the ICTO 115, and may include, application-specified identifiers, account identifiers, biometric signatures, device and/or location signatures, temporal data, cryptographic keys, and/or the like. In some embodiments, a location signature may include data from a geolocation technology, such as GPS, GSM network locating, IP address locating, dead reckoning, and/or the like. The location signature may include a longitude, latitude, an altitude, an approximate street address, and/or the, like. Additional location data such as street, city, state, country, postal code, and/or the like may also be present. In some embodiments, the temporal data may include, a timestamp and/or the like, which may allow rules or other intelligent code to enforce timers, expirations, dynamic keys, and/or the, like. The temporal data may include a simple date/time value, or may include a complex schedule comprising timestamp ranges and/or other scheduling guidelines.

[0042] In some embodiments, each ICTO 115 includes at least one digital signature key. The digital signature key may be validated using an external digital certificate available to the mixer 110. During access of the ICTO 115, the mixer 110 validates the digital signature key using the, external digital certificate and verifies that the digital signature key is valid for an agent currently accessing the ICTO 115. In some embodiments, multiple agents may sign off on the ICTO 115. In such an embodiment, the ICTO 115 may include a chain of signature keys, wherein each signature key may be associated with a separate external digital certificate for validation. For example, an ICTO 115 may be used by an owner to create a protected file for a transfer to multiple, agents wherein each agent may access different sections of the file but not the entire file, either simultaneously or sequentially. Both the, owner and the agents may have to provide valid digital sig-natures to allow the transaction to proceed.

[0043] The intelligence module 111 may include dynamic rule sets capable of recording and communicating access data and other relevant history; along with intelligent code, that provides configurable functionality for performing actions to protect the ICTO 115. Rules may be provided at object creation time. However, in some embodiments, a rule may have a capability to modify itself or other rules for a previously created ICTO 115. In some embodiments, a rule may have a capability to create additional rules. For example, a rule may determine, from identity data, that additional protection is desirable for a given ICTO 115. The rule may then create additional encryption and/or decryption rales to be applied. The rales are protected and contained within the ICTO 115. In some embodiments, the rales may only be executable by an executable portion of the intelligence module 111, and/or may be written in a proprietary language and stored in com-piled or binary form. Based on the rules and requirements of the identity module 109, the intelligence module 111 acts on its rales and requirements. Application-specified identifiers may vary from access to access, and may vary depending on a type of agent. For example, for a human user, application-specified identifiers may include account keys, transaction information, context keys, associated intents, and/or the like. For an electronic object, a digital asset, or any other potential agent, application-specified identifiers may also include an IP address, a URL, a file specification, and/or the like.

[0044] In some embodiments, the embedded portable dynamic rule set or sets have read/write access to the embedded participants 101, even while the participants 101 are protected by the ICTO 115. In other words, a rule may read and write data to the mixture metadata 104 and the owner data 106 of the ICTO 115. This may be useful for recording access information such as date, time, place, and the like, and/or to destroy the data if an attack is detected. Some examples of decisions made or actions taken by intelligent code within rales may include, but are not limited to: evaluating object content and context for validity; challenging an agent for proof of identity; interacting with client code; contacting a server for validation; causing the ICTO 115 to self-destruct; maintaining a history of object access and sending the history information to a server; allowing on-line and/or off-line object access; creating new rules based on dynamic server updates; encrypting and decrypting data; mangling and unmangling data; and/or the like.

[0045] The use of portable dynamic rules may have various benefits. For example, pre encryption and pre-decryption rales may provide dynamic salt and encryption keys based on participant-specified criteria. Such dynamic keys may be based on temporal data, environment data, or any other algorithm specified in a pre-encryption rule. As another example, rules may access encrypted identity artifacts within the ICTO 115 in order to validate the agent without exposing unprotected data to unauthorized users. As yet another example, because the, rules are portable and are therefore included within the ICTO 115, rules may be written in such a way as to allow the ICTO 115 to be fully protected from unauthorized access even when off-line or out-of-network. As a further example, rules may add nested protection, if the ICTO 115 protects a document that is meant to be, read by a single agent within one. hour of creation, a rule may implement the timer and issue a self-destruct mechanism.

[0046] As stated above, the embedded mixer 110 uses an embedded portable dynamic rule set 108 to form a mixture of the object descriptions 102, the mixture metadata 104, the owner data 106, the cloaking patterns 107, the identity module 109, and the intelligence module 111 that comprises a self-protecting, self-governing ICTO 115. In some embodiments, various components of the ICTO 115 may be marked by encoded checksums to detect tampering. For example, the entire ICTO 115, the rules, the owner data, and/or the user data may each be validated by an embedded checksum. The checksum may be a hash value generated based on the contents of the checksum target. In some embodiments, the algorithm used to generate the checksum is sensitive enough to reliably detect a change of a single bit value of even a large data-set. Some suitable algorithms include MD5 and SHA, though any other suitable algorithm may be used. Each checksum may be appended, prepended, or otherwise combined with the checksum target for storage, or may be. stored in a separate location.

[0047] FIG. 7 is a schematic diagram that illustrates another exemplary embodiment of self-contained, self-controlling, self-governing data protection according to additional embodiments of the present invention. An API or other ICTO-aware application, device, or operating system initiates a request to the dynamic participant controller or executable mixer 702, thereby energizing it, to protect a set of digital participants 701. Digital participants include, but are not limited to, authorized agents, devices, locations, rules for using the data, and/or other digital ingredients as discussed further below, gathered for inclusion in the self-protecting, self-governing data object (i.e., digital mixture, or ICTO) 710. The dynamic participant controller 702, when energized, creates an interim cipher object 703 utilizing a temporary or “starter” rule set while said object is being constructed. The interim cipher object 703 is cloaked using one or more outer cloaking patterns 704 selected, created or produced by algorithms generated by the mixer 702.

[0048] The set of digital participants 701 may include, but are not limited to, outer cloaking patterns 704, mixture metadata 705, owner data 706, inner cloaking patterns 707, an identity module 708, and an intelligence module 709. In some embodiments, a combination of the inner cloaking patterns 707, the identity module 708 and the intelligence module 709 can be considered together as the portable dynamic rule set (PDRS) 711. Owner data 706 that is to be protected within the ICTO 710 and governed by the PDRS 711, may include a number of data types, including, but not limited to, an image, a video, a message, an email, a document, a file, a buffer, a directory, a pointer to remotely stored data, a portal, and the like. In several embodiments, owner data 706 may be optional and thus not included, such as when the ICTO 710 is merely used, for example, as an irrefutable and certain signature verification method. In some embodiments, multiple pieces of owner data may be mixed into a single ICTO 710. in other embodiments, owner data from multiple owners may be included in a single ICTO 710. In further embodiments, multiple ICTOs could be mixed into a single ICTO.

[0049] The inner cloaking patterns 707 specify various combinations of data protection and access techniques determined by the owner's rules set forth in the portable dynamic rule set 711 and supported by the dynamic participant controller or mixer 702. The data protection and access techniques included in the inner cloaking patterns 707 may include, but are not limited to, techniques such as industry standard encryption, proprietary encryption, compression, randomization, normalization, and the, like. Techniques suitable for use as inner cloaking patterns 707 are not limited to currently known techniques, but could include any privately or publicly available encoding and/or decoding techniques, known now or developed in the future. Use of an inner cloaking pattern 707 to protect and/or access data may involve applying the combination of data protection and/or access techniques specified in the portable dynamic rule set 711 to the data and other participants.

[0050] The outer cloaking patterns 704 specify various combinations of data protection and access techniques selected through one or more algorithms calculated, used, or created by the dynamic participant controller 702 utilizing the interim rule set to create the interim cipher object 703. The data protection and access techniques included in the outer cloaking patterns 704 may include, but are not limited to, techniques such as industry standard verified encryption, compression, randomization, normalization, and the like. Techniques suitable for use as outer cloaking patterns 704 are not limited to currently known techniques, but could include any privately or publicly available encoding and/or decoding technique, known now or developed in the, future. Use of an outer cloaking pattern 704 to protect and/or access data may involve applying the combination of data protection calculated by the dynamic participant controller 702 and specified by the interim rule set. The mixture metadata 705 provides organizational information for the digital mixture 710, such as, but not limited to, virtual file system data containing directories, user files, and the like.

[0051] The identity module 708 may include dynamic identity attributes that uniquely identify legitimate agents in a transaction. Dynamic identity attributes can be learned information that are added to the identity module within the PDRS such as, but not limited to, location, device, and access behavior. Learned information is collected and can be utilized in a future access request session, thereby adding additional intelligence and decision points. Additionally, dynamic identity attributes can also be volatile (i.e., unpredictable) details. They may be presented during the authentication process, alone or in conjunction with personal identity attributes, in the determination of legitimate identification of an agent requesting access to an ICTO.

[0052] In some embodiments, the identity module 708 may include data that represents a configuration of a computing device that may be given certain rights with respect to a protected object. The identity module 708 may contain specific information about hardware or software configurations installed on the computing device usable to identify the computing device. The identity module 708 may contain data including, but not limited to, CPU information including model numbers, number of cores, speed, and/or the like; a chassis serial number; manufacturer data; a volatile memory size; a nonvolatile memory size; one or more storage device serial numbers and/or model numbers; installed software titles and/or version numbers, and/or the like.

[0053] In several embodiments, a transaction is an atomic action using the ICTO 710 in which one or more legitimate and authorized agents securely exchange data or information within a given context and with a specified intent. Legitimate, authorized agents may include human and non-human entities, such as a human user, a unique mechanical object, a unique electronic object, a unique software or program object, or the like. Dynamic identity attributes contained in the ICTO 710 may be modified by the intelligence module 709 within or during the course of an interaction with the ICTO 710, and may include, but are not limited to, application-specified identifiers, account identifiers, biometric signatures, device and/or location signatures, temporal data, cryptographic keys or data, and the like. In some, embodiments, a location signature may include data from a geolocation technology, such as GPS, GSM network locating, IP address locating, dead reckoning, and the like. The location signature may include a longitude, latitude, an altitude, an approximate street address, and the like. Additional location data such as street, city, state, country, postal code, and the like may also be present. In some embodiments, the temporal data may include a timestamp or similar information, which may allow rules or other intelligent code to enforce timers, expirations, dynamic keys, and the like. The temporal data may include a simple date/time value, or may include a complex schedule comprising timestamp ranges and/or other scheduling guidelines.

[0054] In some embodiments, each ICTO 710 may include one or more digital signature requirements, human or non-human. During authentication by the ICTO 710, the portable dynamic rule set 711 determines the digital signature to be valid for a legitimate, agent requesting access to information governed by the PDRS 711. In some embodiments, multiple legitimate agents may verify the authority of other legitimate agents. In such an embodiment, the PDRS 711 may enforce a chain of digital signature requirements, wherein each digital signature, may be associated with a separate legitimate agent. For example, an ICTO 710 may be used by an owner to create a self-governing file for approvals, signature and transfer to multiple legitimate agents wherein each legitimate agent may access different sections of the file but not the entire file, either simultaneously or sequentially. Both the owner and the legitimate agents may have to provide valid digital signatures to allow the transaction to proceed.

[0055] The intelligence module 709 may include dynamic rule sets capable of recording and communicating access data and other relevant events; along with intelligent code that provides configurable functionality for performing actions to govern the ICTO 710. Rules may be provided at object creation time. However, in some embodiments, a rule may modify itself or other rules of a given ICTO 710 instance. In some embodiments, a rale may create additional rules. For example, a rule may determine, during authentication of a legitimate agent, that additional protection is desirable for a given ICTO 710. The rule may then create additional access, defensive, cloaking and the like requirements. In some embodiments, the rules may only be executable by the dynamic participant controller 702, or may be stored in a binary form as a participant of the ICTO, or a combination thereof. Based on the rules and requirements of the identity module 708, the intelligence module 709 acts on its rales and requirements as supplied by the owner agent. Portable dynamic rule set 711 identifiers may vary from access to access, and may vary depending on a type of agent. For example, for a human user, portable dynamic rule set 711 specified identifiers may include account keys, transaction information, context keys, associated intents, and the like. For an electronic object, a digital asset, or any other potential agent, portable dynamic rules set 711 identifiers may also include an IP address, a URL, a file specification, and the like.

[0056] In some embodiments, rules have read/write access to the digital participants 701, even while the digital participants 701 are protected by the ICTO 710. In other words, a rule may read and write data to the mixture metadata 705 and to the owner data 706 of the ICTO 710. This may be useful for recording access information such as date, time, place, and the like, and, in some cases, to destroy the data if an attack is detected. Some examples of decisions made or actions taken by the intelligence module 709 may include, but are not limited to: evaluating object content and context for validity; challenging an agent for proof of identity; interacting with client code; contacting a server for verification of trust; causing the ICTO 710 to self-destruct; maintaining a history of object access and sending the history information to a server, by email, SMS, FTP or stored with the ICTO 710; allowing on-line and/or off-line object access; creating new rules based on dynamic server updates; cloaking and de-cloaking data; and mangling and unmangling data.

[0057] The use of said portable dynamic rule sets 711 has various benefits and purposes. In one exemplary embodiment, access rules may utilize internally created, internally managed, unique keys based on owner-specified criteria. Said unique keys may be based on temporal data, environment data, or any other algorithm specified by an owner's rule set. As another example, said rules may access protected identity artifacts within the ICTO 710 in order to authenticate and validate the agent without exposing the protected data to the world. As yet another example, because said rules are self-contained, portable, platform independent and are therefore, included within the ICTO 710, rules may be written in such a way as to allow the ICTO 710 to be fully protected from unauthorized access even when offline.

[0058] As a further example, rules may add nested protection. If the ICTO 710 protects one or more ICTOs 710 within the current or outer ICTO 710, the outer ICTO 710 may be able to communicate with one or more of the ICTOs 710 managed as part of the owner data 706 of each. Where the outer ICTO 710, or vice-versa, can cause the execution of rules managed within any of the ICTOs 710 included in the owner data 706 of the outer ICTO 710 or create new rules as a result of rules contained in one or more of the included ICTOs 710. Another example, the rules self-contained within the PDRS 711 of an ICTO 710 are self-governing. If the ICTO 710 protects a document that is meant to be accessed by a single legitimate agent within one hour of creation for a maximum of one hour after access, a rule may implement the timer and issue a self-destruct mechanism after expiry.

[0059] As previously described, the dynamic participant controller 702, or mixer, utilizing a portable dynamic rule set 711 creates a mixture of the outer cloaking patterns 704, mixture metadata 705, the owner data 706, the inner cloaking patterns 707, the identity module 708 and the intelligence module 709 that makes up the ICTO 710. In some embodiments, various components of the ICTO 710 may be combined for encoded checksums to detect tampering. For example, the entire ICTO 710, the rules, the owner data, and/or the participant data may each be validated by a checksum 712. The checksum 712 may be a hash value generated based on the contents of the checksum 712 targets. In some embodiments, the algorithm used to generate the checksum is sensitive enough to reliably detect a change of a single bit value of even a large document. Some suitable algorithms include MD5 and SHA, though any other suitable algorithm may be used. Each checksum 712 may be appended, prepended, or otherwise combined with the. checksum target for storage, or may be. stored in a separate location.

[0060] FIG. 2 is a flowchart that illustrates an exemplary embodiment of a method 200 of constructing an ICTO 115 according to various aspects of the present invention. While the illustrated method 200 describes creation of a relatively simple ICTO 115, one of ordinary skill in the art will understand that similar techniques may be used to create much more complex ICTOs 115. In some embodiments, the mixer 110 is configured to perform the method 200. In some embodiments, the method 200 is performed by a computing device, as described below, that is configured to provide the functionality of the mixer 110. One of ordinary skill in the art will recognize that the construction and utilization of the ICTO 115 is neither dependent on the type of said computing device nor on any operating system associated with said computing device, but may instead by constructed and utilized via any suitable means.

[0061] From a start block, the method 200 proceeds to block 202, where a set of common digital ingredients or participants is obtained. The common participants are participants 101 which may be used in more than one ICTO 115, or may at least have similar corresponding components in more than one ICTO 115, and are specified and/or generated by the mixer 110 for inclusion in the ICTO 115. For example, the. object descriptions 102, the mixture metadata 104, the cloaking patterns 107, the identity module 109, and the intelligence, module 111 may all be common participants. Next, at block 204, a dynamic participant controller (“mixer”) 110 is initialized. In some embodiments, initializing the mixer 110 may include verifying that the mixer 110 is being executed by an expected or otherwise trusted application. At block 206, the mixer 110 receives one or more pieces of owner data 106 to be protected. As discussed above, in some embodiments the owner data 106 may be optional, and the access protection features of the ICTO 115 may be used to verify user identities and/or obtain signatures from users.

[0062] The method 200 proceeds to block 208, where the mixer 110 causes a portable dynamic rule set 108 to be executed. At block 210, an intelligence module 111 of the portable dynamic rule set 108 determines one or more identity-based cloaking patterns to be used to protect participants 101, and at block 212, the mixer 110 applies the one or more cloaking patterns to the participants 101, creating a set of cloaked participants.

[0063] The portable dynamic rule set 108 determines a cloaking pattern to be applied to each participant 101 based on the desires of the owner of the data to be protected. Different cloaking patterns may be applied to each participant 101. Further, each participant 101 may be protected using separate cloaking patterns for access by different agents. In other words, a participant 101 such as owner data 106 may be protected by a first cloaking pattern for access by a first agent, and protected by a second cloaking pattern for access by a second agent. The selection of cloaking patterns may be based on an attribute of the participant 101 to be protected, an attribute of the agent to be given access to the data, a location, an intent, and/or any other suitable piece of information. Selection of a cloaking pattern may include selecting from a preexisting cloaking pattern, and/or may include creating a new cloaking pattern from a combination of protection techniques supported by the mixer 110. Records of the applied cloaking patterns may be stored in the mixture metadata 104.

[0064] Cloaking patterns describe transformations applied to a participant 101 to protect the participant 101 within the ICTO 115, and how those transformations may be reversed to access the participant 101. The transformations may include, but are not limited to, data compression, data normalization, and encryption/decryption. A given cloaking pattern may include one or more of these techniques, or other techniques not listed here. Data compression may reduce the overall size of the ICTO 115, which may in turn improve transport times and bandwidth usage. Data compression may be performed by any suitable lossless compression algorithm including, but not limited to, DEFLATE, LZW, LZR, LZX, JBIG, DjVu, and/or the like. Data normalization is performed by any suitable process that places the data in a form that may efficiently be processed. In some embodiments, the data may be passed through a Base64 encoding algorithm, to convert the data, whether binary or text format, into a normalized alphanumeric string. This is an example only, and should not be seen as limiting. In other embodiments, other algorithms may be used to normalize the data.

[0065] In some embodiments, a cloaking pattern may cause the identity module 109 and the intelligence module 111 to apply separate encryption techniques to different components of the participants 101. For example, a first encryption rule, when executed, may identify and encrypt a first portion of the encrypted digital mixture 115 while leaving a second portion of the encrypted digital mixture 115 unchanged. A second encryption rule, when executed, may then identify and encrypt the second portion of the encrypted digital mixture 115 using a different encryption algorithm, a different encryption key, and/or the like.

[0066] In some embodiments, the cloaking patterns and/or the portable dynamic rule set 108 may establish two or more nested layers of encryption. For example, execution of a first encryption rule may encrypt a first portion of the encrypted digital mixture 115. Execution of a second encryption rule may then cause the encrypted first portion of the encrypted digital mixture 115 to be encrypted again, along with the first encryption rale and a corresponding first decryption rule. Hence, to later access the first portion of the encrypted digital mixture 115, a second decryption rule corresponding to the second encryption rule is executed to decrypt the doubly encrypted first portion of the encrypted digital mixture 115 and to obtain the first decryption rule. The first decryption rule is then executed to decrypt the first portion of the encrypted digital mixture 115 to generate a plaintext version of the first portion of the digital mixture 115.

[0067] Once the cloaking patterns have been applied to the participants 101 to create the set of cloaked participants, the method 200 proceeds to block 214, where the mixer 110 creates a digital mixture (ICTO) 115 and adds the set of cloaked participants to the digital mixture 115. In some embodiments, additional protection may be applied to the digital mixture 115 as a whole, such as shuffling of the data, additional encryption or digital signatures, and/or the like. The method 200 then proceeds to an end block and terminates.

[0068] One of ordinary skill in the art will understand that certain steps have been omitted from FIG. 2 for case of discussion. However, other steps not explicitly illustrated in FIG. 2 may also be included in the method 200 without departing from the scope of the present disclosure. For example, if any errors are detected while applying the cloaking patterns or executing rules, the method 200 may stop, and may not produce a completed ICTO 115. As another example, in some embodiments, the owner data 106 may include one or more ICTOs as a way of providing nested protection. In some embodiments, rules within a nested ICTO may be provided with access to participant data 101 within the outer ICTO 115. In some embodiments, a rule within a first ICTO may cause a second ICTO to be created, and cause the first ICTO to be added to the second ICTO such that the first ICTO is nested inside of the second ICTO. Likewise, in some embodiments, a rule within a first ICTO may cause a second ICTO to be created, and cause the second ICTO to be added to the first ICTO such that the second ICTO is nested inside of the first ICTO.

[0069] FIG. 8 is a process flow that illustrates an alternative exemplary embodiment of a method 800 of constructing an ICTO 710 according to various aspects of the present invention. The method 800 shown describes the creation of a simple ICTO 710: however, utilizing similar techniques one may construct a complex ICTO. In some embodiments an ICTO-aware application, device or operating system is configured to initiate and facilitate the method 800. The construction and utilization of an ICTO 710, simple or complex, is not dependent on a specific operating system or device.

[0070] From Start 801, the method 800 begins with initialization 802 of the Dynamic Participant Controller 702 or mixer. In some embodiments, initialization of the mixer 802 may include validation that the object is an authentic ICTO and/or that the request to initialize is from an ICTO-aware application, device, operating system or other ICTO-aware process. Proceeding to block 803, a set of digital participants 701 is provided to the mixer 702 for inclusion in the ICTO 710. The digital participants 701 may be used in more than one ICTO 710, or may at least have similar or common components in more than one ICTO 710. For example, the outer cloaking patterns 704, the mixture metadata 705, additional cloaking patterns 707, the identity module 708, and the intelligence module 709 may all be considered common digital participants 701. Proceeding to block 804, the mixer 702 utilizing one or more algorithms selects one or more outer cloaking patterns 704 to be applied to the set of digital participants 701 utilizing an interim rule set to create the initial cloaking patterns for the ICTO 710, creating the initial interim cipher object 703. Proceeding to block 805, one or more owner data elements are added to the digital participants set for inclusion in the ICTO 710. In some embodiments, owner data 706 may be optional, and the access protection functionality of the ICTO 710 may be utilized to verify legitimate agent identities and/or for legitimate agent signatures.

[0071] The method 800 proceeds to block 806, where the owner's rules are obtained from the PDRS 711 and utilized by the mixer 702 to replace the interim rale set initially used in the creation of the ICTO 710. Proceeding to block 807, utilizing one or more algorithms the mixer 702 selects one or more inner cloaking patterns 707 to be applied to some or all of the digital participant set 701, inclusive of the owner data 706. The, algorithms utilize time as a unique number and owner rules to further randomize the inner cloaking patterns 707. The algorithms used are added to the identity module 708, managed internally by the PDRS 711 and not shared externally. Finally in block 808 the mixer 702 completes the construction of the ICTO 710 creating a set of cloaked digital participants 720. While similar or common digital participants 701 may be utilized as provided in 803, in combination, the method will create a unique digital mixture 808 for each ICTO 710 constructed.

[0072] The mixer 702 using one or more algorithms determines which inner cloaking patterns 707 are to be applied to each digital participant 701 while also randomly applying time as a unique number and other internal factors generated by the intelligence module 709. The algorithms utilized by the mixer 702 to select the inner cloaking patterns 707 are then added to the identity module 708, managed internally and not shared/exchanged/exposed externally of the ICTO 710. Each participant 701 may be protected utilizing one or more inner cloaking patterns 707 that may be uniquely different from one or more inner cloaking patterns 707 protecting other participants 701 in the digital mixture 710. For example, a participant such as the owner data 706 may be protected with one or more cloaking patterns and internal rales that are uniquely different than the one or more inner cloaking patterns 707 and internal rules utilized to protect the identity module 708. Further, utilization of one or more inner cloaking patterns 707 and the random use of time as a unique number and internal rules in turn creates unique cloaking patterns that are added to the identity module 708 for each participant 701. The internal rules embedded in the, intelligence module 708 may include but are not limited to such things as location, time, authorization requirements, and the like.

[0073] The inner cloaking patterns 707 describe transformations applied to a participant 701 to protect the participant 701 within the ICTO 710, and how some of those transformations may be reversed to access parts or all of the participant 701. The transformations may include, but are not limited to, data compression, data normalization, and encryption. A given inner cloaking pattern 707 may include one or more of these techniques, and/or other techniques. Data compression may reduce the overall size of the ICTO 710, which may in turn improve transport times and bandwidth usage. Data compression may be performed by any suitable lossless compression algorithm including, but not limited to, DEFLATE, LZW, LZR, LZX, JBIG, DjVu, and/or the like. Data normalization is performed by any suitable process that places the data in a form that may efficiently be processed. In some embodiments, the data may be passed through a Base64 encoding algorithm to convert the data, whether binary or text format, into a normalized alphanumeric string. This is an example only, and should not be seen as limiting. In other embodiments, other algorithms may be used to normalize the data.

[0074] Inner cloaking patterns 707 may also include one or more encryption techniques. The cloaking patterns may specify methods of deriving encryption keys, may specify particular encryption algorithms, such as, but not limited to, NIST or FIPS, other proprietary encryption algorithms, or key lengths, or may specify other configurable options such as time seeds, Xor encoding, or other industry standard encoding and decoding techniques for generating elements of the cloaking scheme, or combinations thereof. In some embodiments, encryption techniques may perform operations or calculations other than encryption, such as deriving a hash value for the referenced content or the like. In some embodiments, the inner cloaking pattern 707 may store (or may contain rules that require storage of) a record of an encryption key or decryption key used, either in the inner cloaking pattern 707 itself or elsewhere within the ICTO 710, managed internally and not shared externally. When the inner cloaking pattern 707 is used to access the protected information, the cloaking/de-cloaking algorithm(s) and keys are maintained internally and provided to the dynamic participant controller 702 within the ICTO 710 to provide access to the, information, but are not available to the requesting agent or any other agent or application, device, operating system external to the ICTO 710. In other words, the cloaking/de-cloaking algorithms and keys are not stored or exposed outside of the ICTO 710, are not made available to any agents, and so there is no need for external key management functions, thus no vulnerabilities there from and their secrecy is maintained.

[0075] In some embodiments, the rules set forth in the intelligence module 709 may cause the mixer 702 to apply separate inner cloaking patterns 707 to separate components of the participants 701. For example, a first rule, when executed, may identify and apply a cloaking pattern to a first portion of the protected digital mixture 710 while leaving a second portion of the protected digital mixture 710 unchanged. A second rule, when executed, may then identify and apply a cloaking pattern to the second portion of the protected digital mixture 710 using a different cloaking pattern with a different pattern, or the like.

[0076] In some embodiments, the intelligence module 709 of the portable dynamic rule set 711 may require two or more nested layers of cloaking of some or all of the participants 701. For example, execution of a first rule by the mixer 702 may cloak a first portion of the protected digital mixture 710. Execution of a second rule by the mixer 702 may then cause the cloaked first portion of the protected digital mixture 710 to be cloaked again using a different inner cloaking pattern 707, along with the first rule and a corresponding first cloaking rule. Hence, to later access the first portion of the protected digital mixture 710 a second de-cloaking rule corresponding to the second rule is executed to de-cloak the nested cloaked first portion of the protected digital mixture 710 and to obtain the first de-cloaking rule. The first de-cloaking rule is then executed to de-cloak the first portion of the protected digital mixture 710 to generate a plaintext version of the first portion of the digital mixture 710.

[0077] Once the inner cloaking patterns 707 have been applied to the participants 701 to create the set of cloaked participants 720, the method 800 proceeds to block 808, where the mixer 702 completes the construction of a digital mixture (i.e., ICTO) 710. In some embodiments, additional protection may be applied to the digital mixture 710 as a whole, such as shuffling of the data, additional cloaking and/or the like. The method 800 then proceeds to an end block and terminates.

[0078] Other steps not explicitly illustrated in FIG. 8 may also be included in the method 800 without departing from the scope of the present disclosure. For example, if any anomalies are detected while applying the cloaking patterns or executing rules, the method 800 may stop, and may not produce a completed ICTO 710. As another example, in some embodiments, the owner data 706 may include one or more ICTOs as a way of providing nested protection. In some embodiments, rules within a nested ICTO may be provided with access to participant data 701 within the outer ICTO 710. In some embodiments, a rule within a first ICTO may cause a second or multiple ICTO(s) to be created, and cause the first ICTO to be added to the second ICTO such that the first ICTO is nested inside of the second ICTO. Likewise, in some embodiments, a rule within a first ICTO may cause a second ICTO to be created, and cause the second ICTO to be added to the first ICTO such that the second ICTO is nested inside of the first ICTO.

[0079] FIG. 3 is a flowchart that illustrates an exemplary embodiment of a method 300 of accessing data protected by an ICTO 115 according to various aspects of the present disclosure. After the ICTO 115 is activated, the ICTO 115 begins verification and validation of its current environment, access attempts, authorized agents, and other conditions as specified in the rule set included in the portable dynamic rule set 108. This verification and validation may be performed once upon startup, continuously during an active period, periodically during an active period, or at any other suitable interval or in response to any suitable, change in state. When rules and agent identity have been positively confirmed, the ICTO 115 permits access to authorized portions of itself while maintaining the homogenous essence of the mixture and protection of the rest of the data.

[0080] As with the method 200 described above, in some embodiments the mixer 110 is configured to perform the method 300. In some embodiments, the method 300 is performed by a computing device if one or more processors of the computing device execute computer executable instructions that cause the computing device to do so. As understood by one of ordinary skill in the art, the construction and utilization of the ICTO 115 is neither dependent on the type of said computing devices nor on any operating systems associated with said computing devices. The data protection protocol is embedded in the data set. An activated ICTO 115 can communicate with the data owner (information such as access attempts, alerts to unauthorized locations or unauthorized agents, notification of self-destruct or self-recreation) over the life of the data. Further, because the rules in the. ICTO 115 may update themselves and other portions of the ICTO 115, the ICTO 115 may learn from its environment, and may change its future behavior based on that learning. The protection protocol can be. customized and is unique to each owner, data set, and user combination, as specified in cloaking patterns.

[0081] From a start block, the method 300 proceeds to block 302, where a portable dynamic rule set 108 within a digital mixture 115 is activated in response to a request by an agent to access the digital mixture 115. In several embodiments, a super-identity is embedded in the ICTO 115 and includes criteria to verify an identity of an agent attempting to access the ICTO 115, dynamic rules to provide an intelligent awareness that validates the agent and determines the data's current state, and algorithms for data cloaking as specified in cloaking patterns. Verification criteria such as challenge/response pairs, digital signatures, biometric information, and/or the like may be used to verify the identity of the agent. At block 304, the portable dynamic rule set 108 is executed to verify that the agent is allowed the requested access to the digital mixture 115 in a relevant context. The identity module 109 and the intelligence module 111, when activated, assess the current access attempt by the verified agent and establish a level of trust. In some embodiments, this assessment is an on-going process, in that there is a continuous verification and validation of each participant 101: the data owner, the agent (data user) and the data itself. In some embodiments, pre access rules from the portable dynamic rule set 108 may be executed by the mixer 110 to decrypt at least some portion of the ICTO 115 for internal use by the mixer 110 without allowing access to the decrypted data to agents other than the mixer 110. Pre-access rules have access to the participants 101, including the ability to test identity artifacts and evaluate owner and agent data. If the trust level goes down, the proto col reassesses the participants 101. In some embodiments, if the agent attempting to access the ICTO 115 is unable to reestablish their legitimacy, defensive or offensive actions may be invoked. If the agent is able to satisfy the new set of challenges, access will be allowed to proceed or continue.

[0082] In some embodiments, the pre-access rules are merely allowed read access to identity or authentication data, but in some embodiments, the pre-access rules may also have write access, which may be used, for example, to record access attempt attributes when opening (or attempting to open) the ICTO 115.

[0083] The method 300 proceeds to block 306, where the portable dynamic rule set 108 determines a cloaking pattern used to protect the requested data. The portable dynamic rale set 108 consults the mixture metadata 104 to determine which cloaking pattern 107 was applied based on the identity of the agent, the data request, the context in which the data is being requested, and/or the like. Once the used cloaking pattern 107 is determined, the method 300 proceeds to block 308, where the cloaking pattern 107 is used to provide the requested access to the, agent. Similar to how the cloaking pattern 107 indicated a set of techniques used to protect the requested data, the cloaking pattern 107 also indicates a set of techniques used to reconstruct the requested data from the protected version stored in the ICTO 115. The method 300 then proceeds to an end block and terminates.

[0084] FIG. 9 is a process flow that illustrates an alternative embodiment of a method 900 of accessing data protected by an ICTO 710. After the ICTO 710 is activated, the PDRS 711 begins verification and validation of the, ICTO's 710 current environment, access attempts, legitimate agents, and other conditions as specified in the PDRS 711.

[0085] This verification and validation process is inherently efficient, ensures the integrity of the data and may be performed once upon startup, continuously during an active period, periodically during an active period, or at any other suitable interval or in response to any suitable change in status or state. When rules and legitimate agent identity have been positively confirmed, the PDRS 711 permits access to authorized portions of ICTO 710 while maintaining the homogenous essence of the mixture and protection of the rest of the participants. In some, embodiments, an ICTO-aware application, device or operating system is configured to initiate and facilitate the method 900.

[0086] From a start block 901, the. method 900 proceeds to block 902, where the dynamic participant controller 702 within the protected digital mixture or ICTO 710 is energized by an ICTO-aware application, device, or operating system in response to a request by an agent to access the digital mixture or ICTO 710. In some embodiments, the owner/agent identity and/or one or more agent identities are included in the identity module 708 embedded in the ICTO 710 and includes criteria to verify the identity, authenticity and legitimacy of an agent attempting to access the ICTO 710, dynamic rules to provide an intelligent awareness that validates the legitimacy of the agent and determines the data's current state, and algorithms for data cloaking as specified in cloaking patterns. Verification criteria such as challenge/response pairs, external authorizations, biometric information, and/or the like may be used to authenticate, validate and/or verify the. identity of the agent. At block 903, utilizing the portable dynamic rule set 711, the requesting agents are verified in an efficient, full, complete and relevant context and granted access to the digital mixture 710.

[0087] The method 900 proceeds to block 904, where the portable dynamic rule set 711 provides the dynamic participant controller 702 one or more cloaking patterns used to protect the requested data based on the identity of the agent, the data request, the context in which the data is being requested, and the like. Proceeding to block 905, the DPC or mixer 702 on instruction from the portable dynamic rule set 711 de-cloaks some or all of the protected data within the ICTO 710 based on the data owner's rules for the legitimate agent, the data request, the context in which the data is being requested, and/or the like managed by the portable dynamic rule set 711.

[0088] Other steps not explicitly illustrated in FIG. 9 may also be included in the method 900 without departing from the scope of the present disclosure. For example, if any anomalies are detected while applying the de-cloaking patterns or executing rules, the method 900 may stop, and may not allow access to the protected ICTO 710. Another example, the method 900 may determine legitimacy of a requesting agent to ICTO 710 which may cause external authorizations to be required prior to completion of authorization of the legitimate agent. Additionally, alerts may be sent as a result of legitimate and authorized access to the ICTO 710. As another example, in some embodiments, the method 900 may determine that unauthorized access is being attempted which may cause the PDRS 711 within the ICTO 710 to send alerts, record access attempts and/or the like. In another example, in some embodiments, the method 900 may determine an unauthorized access attempt is underway, and enable access to false data in the ICTO 710, recording activity, sending alerts and/or the like. Alerts include, but are not limited to, failed access attempt, unrecognized access address (which can include device and location specifics), schedule violations, unauthorized movement of an ICTO, and the like.

[0089] Accordingly, the present invention results in an ICTO that is self-contained, self-controlling, and self-governing. All access rights, rules of engagement, compliance rules, audit requirements, and similar rules and restrictions as determined by the data owner are contained in the PDRS, and embedded in the ICTO, and thus controlled on behalf of the data owner by the PDRS (whether online or offline, control is maintained from within the ICTO), and executed by the PDRS. The PDRS is the means for self-governance and control upon creation and throughout the life of the ICTO. It travels with the ICTO, complies at all times with the rules established by the data owner, and can be adaptive (i.e., dynamic), based on, but not limited to, the environment (such as place, time, and device), so to self manage and make decision based on learned information. The PDRS does not require any outside sources (e.g., IAM or SIEM systems) or specific operating environments to maintain control and governance. The PDRS controls the complete management of the ICTO from within the ICTO. The PDRS is permanently embedded in the ICTO and travels with the ICTO, thereby creating a self-contained, self-controlled, self-governing entity.

[0090] FIG. 4 is a schematic diagram that illustrates an exemplary use case for an embodiment of the present disclosure. One of ordinary skill in the art will recognize that this use case is exemplary only and is described to show certain features of the disclosure, but that this use case does not utilize or describe every feature of the technology disclosed herein. In FIG. 4, a first user 418, using a first computing device 416, uses an embodiment of the present disclosure to protect a first piece of data (data one 404) and a second piece of data (data, two 406). An ICTO 408 is created that includes a protected version of data one 410 and a protected version of data two 412. In creating the ICTO 408, the first user 418 specifies that a second user 422 may access data one 404, but does not specify that the second user 422 may access data two 406. Hence, the ICTO 408 includes a rule in its portable dynamic rule set 108 that allows user two 422, once verified, to access data one 404.

[0091] The first computing device 416 transmits the ICTO 408 to a second computing device 420 used by the second user 422 via a network, such as a LAN, a wireless network, the internet, and/or the like. The second user 422 causes the ICTO 408 to be activated, and submits a request 424 to access to data, one 404. The ICTO 408 verifies the identity of the second user 422, which may include processing a challenge/response pair stored in the ICTO 408 and/or consulting a trusted sendee 409 (such as a certificate server, a RADIUS or other authentication server, and/or the like) to verify that the second user 422 is who he purports to be. Once the identity of the second user 422 is verified, the ICTO 408 consults the cloaking pattern used to create protected data one 410, and uses the cloaking pattern to give the second user 422 access to data one 404. The second user 422 may also submit a request 426 to access data two 406. However, because the ICTO 408 has not been instructed to provide access to data two 406 for the second user 422, the ICTO 408 does not allow the second user 422 to access data two 406.

[0092] In an alternate process flow, a first computing device 416 transmits an ICTO 408 to a second computing device 420 used by the second user 422 via a network, such as a LAN, a wireless network, the internet, and/or the like. The second user 422 utilizing an ICTO aware application, device or operating system awakens the ICTO 408 which receives a request to access protected data one in the ICTO 408. The ICTO 408 verifies the identity of the second user 422, which may include processing of multiple pairs of challenge/response stored in the ICTO 408 and/or external authorization or the like to verify that the second user 422 is valid and authorized. Additionally a trusted service 409 may be used for further validation of time, physical location and the like based on the rules of access set forth by owner 418. Once the identity of the second user 422 is verified (i.e., established as authentic and legitimate), the ICTO 408 determines the one or more cloaking patterns used to create protected data one 410, and de-cloaks the protected data one 410 revealing data one 404 to the second user 422. The second user 422 may also request to access protected data two 412. However, because the second user 422 is not authorized to access protected data two in the ICTO 408, the second user 422, is not granted access to the protected data two 412.

[0093] Though a trusted service 409 that provides authentication services is described, other types of trusted services may be used. For example, if a rule is included the ICTO 408 that only allows access during a given time period, a trusted sendee 409 that provides a trusted date-time value may be used. As another example, a trusted service 409 may seek input from other users while the ICTO 408 is determining whether to grant access to an agent. As illustrated, a trusted service 409 may notify the first user 418 of the access attempt via email, SMS, or any other suitable technique, and may wait to allow the attempted access until a corresponding approval is received from the first user 418.

[0094] This use case illustrates several advantages of the present disclosure. Once the ICTO 408 is created, protected data one 410 and protected data two 412 cannot be accessed without invoking the processing of the ICTO 408 to request access. Accordingly, the data is protected when the ICTO 408 is stored on the first computing device 416, when the ICTO 408 is in transit on the network 402, and when the ICTO 408 is stored on the second computing device 416. Also, even though the ICTO 408 provides access to the second user 422 to data one 404, data two 406 is nevertheless protected from access.

[0095] While this simple use case illustrates several features of the present disclosure, much more complex use cases are also possible. For example, FIG. 5 is a schematic diagram that illustrates aspects of an exemplary workflow for an embodiment of the present disclosure. A first user (“User A”) may have a set of documents (“Documents X, y, and Z”) to be approved and signed, maintaining confidentiality throughout the transaction, by a second user (“User B”), a third user (“User C”), and a fourth user (“User D”). Document X needs to be signed by User B. Document Y needs to be signed by User B and User C, but only after Document X has been signed. Document Z needs to be signed by User D, but only after Documents X and Y have been signed. Further, Document X and Document Y must be signed during working hours (e.g., between 9 AM and PM) to ensure compliance with local corporate, policy, while Document Z (the working draft of Doc Y) must be signed immediately upon approved signatures of Doc X and Y, the audit logged, and then Doc Z destroyed, with the audit also logged.

[0096] Embodiments of the present disclosure will support such a workflow. User A creates an ICTO that includes Documents X, Y, and Z. User A creates an access rule for Document X that allows User B to review and sign Document X. User A creates an access rule for Document Y that allows User B and User C to review and sign Document Y once the signature on Document X is obtained. User A may create an access rule for Document X that allows User C to review Document X to check for a signature, or the access rule for Document X may detect the signature applied to Document X, and may dynamically update the access rule for Document Y that allows it to be signed once the signature is detected. User A creates an access rule for Document Z that checks for signatures on Documents X and Y, and upon detecting such signatures, User D is allowed to sign Document Z. Each of these rules also enforces the associated time requirements, and does not allow access if the time requirements are not satisfied. User A may also create a rule that reports any access to any of the. documents back to User A, so that User A may monitor the process. Each of the rales may specify how each user is to be identified, the related privileges, devices from which the users are allowed to access the documents, and locations from which the users are allowed to access the documents.

[0097] Once, for example, User B receives the ICTO, User B invokes an application configured to activate the executable code within the ICTO. The executable code determines the identity of User B, either by consulting a trusted identity service, by checking the response to a challenge included in a rule, or by any other method. Once the identity, time, location, and other requirements are satisfied, User B is allowed to access Document X, but not any of the other documents. After User B signs Document X, the ICTO is transferred to the next user, and enforces the protections on the documents as the ICTO passes through the rest of the workflow.

[0098] Alternatively, for example, User B receives the ICTO, User B invokes an ICTO aware application, which activates the PDRS within the ICTO. The executable code determines the identity of User B by utilizing the identity credentials stored within the ICTO which presents multiple challenge/response pairs and/or external authorizations codes. Once the identity, time, location, and other requirements are satisfied, User B is allowed to access Document X, but not any of the other documents. After User B signs Document X, the ICTO is transferred to the next user, and enforces the protections on the documents as the ICTO passes through the rest of the workflow.

[0099] In another exemplary embodiment, protection protocol is instituted in a portable identity appliance (PIA). The PIA defines a portable and discrete digital identity using an instinctive and autonomic authentication method. The PIA ultimately implements an incorporated ICTO protocol, thus becoming an intelligent object itself. In several embodiments, the PIA is an ICTO that does not include owner data (e.g., files, images, and the like). The PIA comprises an ICTO that utilizes the PDRS along with additional publicly available information (similar to the information available on a business card or in a public directory) about the owner, but without necessarily containing owner data, the PIA thus is a self-protecting, self-controlling, self-governing ICTO with the purpose of representing, irrefutably, the, owner identity.

[0100] As seen in FIGS. 10-13, once the protected PIA is created, it can combine with data to produce a SPDO, facilitate the transmission of secure message between one or more parties (e.g., validating and maintaining sender and receiver legitimacy and data integrity), and provide a secure, trustworthy identity that can be used to assure or guard websites, portals, networks, or other resources.

[0101] The PIA thus present numerous advantages over existing signature techniques. Existing signature techniques are typically based on certificates that are purchased from a certificate authority. Certificates are presumed trust-worthy based on who holds the cert and who issues the cert. However, certificates can be stolen, can be spoofed, and are not based on a uniquely defined identity.

[0102] Thus, a ICTO may be used for irrefutable verification of identity where a “signature” is required. Signature ICTOs can be utilized as external identity verification in conjunction with an ICTO containing legal documents requiring absolute verification of identity. The Signature ICTO(s) can become part (embedded) of the “final” legal documents contained within the original ICTO. Further, Signature. ICTOs can be included within the ICTO (i.e., nested) as additional protected data elements in addition to the owner documents requiring signature, thus pre-defining and providing pre-verification of the required signers traveling with the documents. Signature ICTOs also can be used as irrefutable verification of identity in documents that are not included in an ICTO but rather in an ICTO aware application. For example, they can be used to provide acceptance of Terms and Conditions electronically, or acknowledgement of privacy notices.

[0103] Signature ICTOs in the context of document signing can be thought of as a digital version of the owner that has been “legally verified and notarized,” but also is irrefutable. Each Signature ICTO, just like an ICTO with owner data, is unique and therefore cannot be “spoofed” by a person or entity trying to pretend to be the actual owner of the Signature ICTO. Additionally, a Signature ICTO does not have to represent a human; it can represent a machine, whereby a digital process flow requires signatures (verifications) along the way in order to confirm the validity of the authorization to proceed; and this signature must be documented. Signature ICTOs can be used anywhere a standard digital signature is required today, but are not limited to just how digital signatures are used today. As discussed above, in several embodiments there must be ICTO-awareness as a pre-requisite for use.

[0104] FIG. 14 illustrates an architecture of a Delegate access management system and an authentication operational flow, according to some embodiments. In certain embodiments the invention provides additional capabilities to allow for a flexible user access and management protocol to be included in the SPDO creation and usage processes. In such cases, a centralized web service operates as a user access authentication service that is external from the SPDO. Use of such service avoids unbundling the SPDO and re-bundling the SPDO to add authorized users to or delete users from the package, as well as implementing any changes to the required credentials, permissions and other attributes associated with any particular user.

[0105] By associating each SPDO with one or more Delegates, the SPDO and its associated user credentials can be managed securely and dynamically without compromising security. In addition, such techniques facilitated a compartmentalized access management, in which multiple entities (e.g., departments in an enterprise) can independently manage their own SPDO user access lists for each document protected using the SPDO protocol. This technique also provides a mechanism for continuous access while accessing documents and other objects protected using this approach while offline.

[0106] More specifically, a dynamic user access protocol uses Delegates, which are defined as pseudo user objects that include as an attribute the address of a web service that resolves user access permissions for the SPDO. A SPDO designer can thus build a SPDO to include one or more Delegate objects. When this SPDO is accessed by a user, the SPDO reader uses the Delegate object to access an external service that can resolve the name of its constituent users and access their credentials and meta data. The advantage of this dynamic technique is that the user list can be changed at any time without impacting or having to rebuild the SPDO.

[0107] In some embodiments, a data designer may build both a static user access list and Delegate object(s) in a data protection system, thus implementing a “hybrid” approach. For example, Delegates may be used to manage a dynamic user access list, whereas a static user access list may include department heads, document owners, or other users whose access credentials will not change.

[0108] The Delegate access management system may be not limited to the systems and methods in the present disclosed embodiments, but it may be applied to any type of data object framework.

[0109] As described above, the advantages of using a Delegate access management system may include providing a flexible mechanism and a broad domain for using the data protection systems, allowing a data protection system to include secure management of a dynamic user access list, without compromising security of the system, and allowing a data protection system to include a compartmentalized access management, in which multiple entities (e.g., departments in an enterprise) may independently manage their own user access lists for each secure document, resulting in a mechanism for continuous access when the systems do not have access to a network (that is, off-grid).

[0110] In the present embodiments, a data protection system disclosed may include zero, one, or a plurality of built-in Delegates. For example, if a user needs to share a document with both the Engineering department and Accounting department with different management structures, the user may protect the document by building an engineering Delegate object 1422, and an accounting Delegate object 1424 in a data protection system. The Delegates 1422, 1424 may point to different authentication services (e.g., one for each department). Each service may authenticate users to access the data protection system independently so that the accounting department may manage its own users, and the engineering department may manages its own users through the corresponding services.

[0111] To create the dynamic Delegate object, a data designer may create, or use an existing delegate service 1420 within a web services framework. The Delegate service 1420 may include one or more Delegates (1422, 1424). Each Delegate (1422, 1424) may include an initial dynamic list of authorized users (e.g., a dynamic user access list 1430) to access a data object (e.g., a SPDO 1480). In some embodiments, the initial list of authorized users is empty, while in other embodiments, the initial list of authorized users includes at least one user. A data designer may then use the address of the Delegate service 1420 to construct a Delegate object 1470. The construction of the Delegate object 1470 may include delegating pseudo user objects, and/or building an initial static list of authorized users (that is, a built-in static user access list 1460) into the SPDO.

[0112] When attempting to access the data withing the SPDO, a user may provide login credentials (e.g., their user ID) and request access to data within the SPDO. A SPDO reader may then access the SPDO 1480 and search the provided login credentials (e.g., user IDs) in the built-in static data access list 1460.

[0113] If the SPDO reader finds the user in the built-in static user access list, it may execute a corresponding set of challenge prompt and responses included in the user's meta data and verify the provided login credentials. If the challenges are successful and the credentials are verified, the SPDO reader provides access to the user. Otherwise, it may deny the access.

[0114] If the SPDO reader does not find the user in the built-in static user access list 1460, or if there are no built-in static user access list 1460, the SPDO reader may send a request 1412 from the SPDO 1480 to the Delegate web service 1420 to search for the user within the first available Delegate (e.g., a dynamic user access list 1430 including authorized user IDs to access the given SPDO 1480).

[0115] If the user is found in the first available Delegate, then the Delegate web service 1420 may return a response 1414 (e.g., user ID and its meta data) to the SPDO, and the SPDO reader may also use the access mechanism built into the given Delegate object to find the address of the Delegate service. Otherwise, the Delegate web service 1420 may return with a response indicating failure in authentication, and the SPDO may then search for the user ID in a second available Delegate object within the SPDO.

[0116] In some embodiments, the delegate web service 1420 may use an existing enterprise lightweight directory access protocol (LDAP) or active directory (AD) service for the given Delegate (e.g., for additional security) by applying a built-in Delegate callback mechanism. Upon successful authentication by the enterprise LDAP or AD service, the system may return a result 1414 (e.g., user ID and its meta data) to the requesting Delegate in the SPDO.

[0117] If the user is not found in the second available Delegate, the system may continue searching in the next available Delegate until all built-in Delegates within the data object are searched. If the user is not found in the static user access list or any of the Delegates, the SPDO reader may deny the access to the SPDO.

[0118] In some embodiments, access to the SPDO and the associated the data protection system may be on-grid (i.e., access to a network) or off-grid (i.e., no access to a network). If the data protection system is on-grid when a user tries to access to the SPDO, the SPDO may send a request from a requesting Delegate to the Delegate web service 1420 to access the remote Delegate service and resolve the authentication of the user, as described above. If the data protection system is off-grid when a user tries to access to the SPDO, the SPDO may proceed to access a cached copy 1450 of the access credentials saved locally with the SPDO during previous online access.

[0119] For creating a cached copy of the user access credentials, a data designer may turn on a caching option of the Delegate so that the data protection system caches the latest user access credentials and uses the cached credentials when the computer is offline. In some embodiments, a data designer may turn off the caching option to only allow access when connected to a secure network. In some embodiments, the cached copy may be ignored when networked access to the Delegate service is operational, even if a cached copy of the credentials exists or is turned on locally.

[0120] If a data designer provides an appropriate permission for caching the access credentials, the SPDO reader may cache the credentials locally 1450 for a given user if the user's authentication is successful. The access credential cache may, in some cases, reside in the same directory as the UXP data object and may also include additional built-in data protection capabilities, such as the ability to self-destruct after a user-specified or system defined time-to-live expires. The access credential cache may also disable itself if, for example, it is accessed from outside the domain (e.g., a system or location) in which it was authorized to operate. In some embodiments, a separate cache may be stored for each user, and the most recent user access credentials may be protected within the SPDO.

[0121] FIG. 6 is a block diagram that illustrates an exemplary hardware architecture of a computing device 500 suitable for use, with embodiments of the present disclosure. Those of ordinary skill in the art and others will recognize that the computing device 500 may be any one of any number of currently available or yet to be developed devices including, but not limited to, desktop computers, server computers, lap top computers, embedded computing devices, application specific integrated circuits (ASICs), smartphones, tablet computers, and/or the like. In its most basic configuration, the computing device 500 includes at least one processor 502 and a system memory 504 connected by a communication bus 506. Depending on the exact configuration and type of device, the system memory 504 may be volatile or nonvolatile memory, such as read only memory (“ROM”), random access memory (“RAM”), EEPROM, flash memory, or similar memory technology. Those of ordinary skill in the art and others will recognize that system memory 504 typically stores data and/or program modules that are immediately accessible to and/or currently being operated on by the processor 502. In this regard, the processor 502 serves as a computational center of the computing device 500 by sup porting the execution of instructions.

[0122] As further illustrated in FIG. 6, the computing device 500 may include a network interface 510 comprising one or more components for communicating with other devices over the network. Embodiments of the present dis closure may access basic sendees that utilize the network interface 510 to perform communications using common network protocols. In the exemplary embodiment depicted in FIG. 6, the computing device 500 also includes a storage medium 508. However, services may be accessed using a computing device that does not include means for persisting data to a local storage medium. Therefore, the storage medium 508 depicted in FIG. 6 is represented with a dashed line to indicate that the storage medium 508 is optional. In any event, the storage medium 508 may be volatile or nonvolatile, removable or nonremovable, implemented using any technology capable of storing information such as, but not limited to, a hard drive, solid state drive, CD ROM, DVD, or other disk storage, magnetic cassettes, magnetic tape, magnetic disk storage, and the like.

[0123] As used herein, the term “computer readable media” includes volatile and nonvolatile and removable and nonremovable media implemented in any method or technology capable of storing information, such as computer readable instructions, data structures, program modules, or other data. In this regard, the system memory 504 and storage medium 508 depicted in FIG. 6 are merely examples of computer readable media.

[0124] Suitable implementations of computing devices that include a processor 502, system memory′ 504, communication bus 506, storage medium 508, and network interface 510 are known and commercially available. For ease of illustration and because it is not important for an understanding of the claimed subject matter, FIG. 6 does not show some of the typical components of many computing devices. In this regard, the computing device 500 may include input devices, such as a keyboard, mouse, microphone, touch input device, and/or the like. Similarly, the computing device 500 may also include output devices such as a display, speakers, printer, and/or the like. Since all these devices are well known in the art, they are not described further herein.

Claims

What is claimed is:

1. A computer-implemented method for creating digitally secured data, the method comprising:

constructing a self-protected data object comprising at least one delegate object and an access list built into the self-protected data object, wherein the at least one delegate object comprises an externally addressable network address and wherein the delegate object communicates with a remote delegate service at the externally addressable network address, wherein the self-protected data object is protected using a protection scheme independent of an operating system, application, or environment;

initializing the remote delegate service with one or more user authentication credentials specific to the access list built into the self-protected data object such that access to the self-protected data object is limited to users associated with the user authentication credentials stored at the remote delegate service; and

updating the one or more user authentication credentials specific to the self-protected data object, wherein updating the one or more user authentication credentials specific to the self-protected data object comprises adding new user credentials to the one or more user authentication credentials specific to the self-protected data object such that additional users are provided with authenticated access to the data object.

2. The method of claim 1 wherein updating the one or more user authentication credentials specific to the self-protected data object comprises removing user credentials from the one or more user authentication credentials specific to the self-protected data object such that users associated with the removed user credentials are no long authenticated to access to the data object.

3. The method of claim 1 wherein the one or more user authentication credentials specific to the self-protected data object comprise at least one static user credential.

4. The method of claim 3 wherein the at least one static user credential is incorporated into the self-protected data object, thereby allowing users associated with the at least one static user credential to access the data object without requiring authentication the remote delegate service.

5. The method of claim 1 wherein the self-protected data object comprises a plurality of delegate objects, each comprising a different externally addressable network address such that the remote delegate service applies a different access policy to the self-protected data object for each of the plurality of delegate objects.

6. The method of claim 5 wherein at least a subset of the plurality of data objects are instantiated until a successful authentication is encountered.

7. The method of claim 1 further comprising incorporating a copy of the one or more user authentication credentials specific to the self-protected data object into the self-protected data object such that the one or more user authentication credentials are available as a cached copy absent access to the remote delegate service.

8. The method of claim 7 wherein the cached copy of the authentication credentials are disabled upon expiration of a time to live period.

9. The method of claim 7 wherein the cached copy of the authentication credentials are disabled an attempt to access the data object from an unauthorized domain.

10. A system for creating digitally secured data, the method comprising:

one or more processors; and

a memory coupled with the one or more processors wherein the one or more processors executes computer-executable instructions stored in the memory, that when executed:

constructs a self-protected data object comprising at least one delegate object and an access list built into the self-protected data object, wherein the at least one delegate object comprises an externally addressable network address and wherein the delegate object communicates with a remote delegate service at the externally addressable network address wherein the self-protected data object is protected using a protection scheme independent of an operating system, application, or environment;

initializes the remote delegate service with one or more user authentication credentials specific to the access list built into the self-protected data object such that access to the self-protected data object is limited to users associated with the user authentication credentials stored at the remote delegate service; and

updates the one or more user authentication credentials specific to the self-protected data object, wherein updating the one or more user authentication credentials specific to the self-protected data object comprises adding new user credentials to the one or more user authentication credentials specific to the self-protected data object such that additional users are provided with authenticated access to the data object.

11. The system of claim 10 wherein updating the one or more user authentication credentials specific to the self-protected data object comprises removing user credentials from the one or more user authentication credentials specific to the self-protected data object such that users associated with the removed user credentials are no long authenticated to access to the data object.

12. The system of claim 10 wherein the one or more user authentication credentials specific to the self-protected data object comprise at least one static user credential.

13. The system of claim 12 wherein the at least one static user credential is incorporated into the self-protected data object, thereby allowing users associated with the at least one static user credential to access the data object without requiring authentication the remote delegate service.

14. The system of claim 10 wherein the self-protected data object comprises a plurality of delegate objects, each comprising a different externally addressable network address such that the remote delegate service applies a different access policy to the self-protected data object for each of the plurality of delegate objects.

15. The system of claim 14 wherein at least a subset of the plurality of data objects are instantiated until a successful authentication is encountered.

16. The system of claim 10 wherein execution of the instructions further incorporates a copy of the one or more user authentication credentials specific to the self-protected data object into the self-protected data object such that the one or more user authentication credentials are available as a cached copy absent access to the remote delegate service.

17. The system of claim 16 wherein the cached copy of the authentication credentials are disabled upon expiration of a time to live period.

18. The system of claim 16 wherein the cached copy of the authentication credentials are disabled an attempt to access the data object from an unauthorized domain.

Patent Citations (404)

Patent	Date	Inventor	Cited By
US5276444(A)	1994-01-01	McNair	Applicant
US5382983(A)	1995-01-01	Kwoh et al.	Applicant
US5475819(A)	1995-12-01	Miller et al.	Applicant
US5557518(A)	1996-09-01	Rosen	Applicant
US5610980(A)	1997-03-01	Johnson et al.	Applicant
US5671279(A)	1997-09-01	Elgamal	Applicant
US5677955(A)	1997-10-01	Doggett et al.	Applicant
US5680452(A)	1997-10-01	Shanton	Applicant
US5715314(A)	1998-02-01	Payne et al.	Applicant
US5724424(A)	1998-03-01	Gifford	Applicant
US5729594(A)	1998-03-01	Klingman	Applicant
US5732400(A)	1998-03-01	Mandler et al.	Applicant
US5737414(A)	1998-04-01	Walker et al.	Applicant
US5765144(A)	1998-06-01	Larche et al.	Applicant
US5768382(A)	1998-06-01	Schneier et al.	Applicant
US5779549(A)	1998-07-01	Walker et al.	Applicant
US5790677(A)	1998-08-01	Fox et al.	Applicant
US5794207(A)	1998-08-01	Walker et al.	Applicant
US5797127(A)	1998-08-01	Walker et al.	Applicant
US5798508(A)	1998-08-01	Walker et al.	Applicant
US5799285(A)	1998-08-01	Klingman	Applicant
US5818933(A)	1998-10-01	Kambe et al.	Applicant
US5822737(A)	1998-10-01	Ogram	Applicant
US5855008(A)	1998-12-01	Goldhaber et al.	Applicant
US5864610(A)	1999-01-01	Ronen	Applicant
US5870473(A)	1999-02-01	Boesch et al.	Applicant
US5878403(A)	1999-03-01	DeFrancesco et al.	Applicant
US5883810(A)	1999-03-01	Franklin et al.	Applicant
US5883955(A)	1999-03-01	Ronning	Applicant
US5890137(A)	1999-03-01	Koreeda	Applicant
US5892900(A)	1999-04-01	Ginter et al.	Applicant
US5899980(A)	1999-05-01	Wilf et al.	Applicant
US5901228(A)	1999-05-01	Crawford	Applicant
US5903721(A)	1999-05-01	Sixtus	Applicant
US5903882(A)	1999-05-01	Asay et al.	Applicant
US5905736(A)	1999-05-01	Ronen et al.	Applicant
US5909492(A)	1999-06-01	Payne et al.	Applicant
US5909671(A)	1999-06-01	Byford et al.	Applicant
US5914472(A)	1999-06-01	Foladare et al.	Applicant
US5930776(A)	1999-07-01	Dykstra et al.	Applicant
US5933625(A)	1999-08-01	Sugiyama	Applicant
US5950172(A)	1999-09-01	Klingman	Applicant
US5963625(A)	1999-10-01	Kawecki et al.	Applicant
US5978775(A)	1999-11-01	Chen	Applicant
US5991738(A)	1999-11-01	Ogram	Applicant
US5996076(A)	1999-11-01	Rowney et al.	Applicant
US6000832(A)	1999-12-01	Franklin et al.	Applicant
US6002767(A)	1999-12-01	Kramer	Applicant
US6003765(A)	1999-12-01	Okamoto	Applicant
US6023499(A)	2000-02-01	Mansey et al.	Applicant
US6047268(A)	2000-04-01	Bartoli et al.	Applicant
US6058250(A)	2000-05-01	Harwood et al.	Applicant
US6058258(A)	2000-05-01	Cullum et al.	Applicant
US6064987(A)	2000-05-01	Walker et al.	Applicant
US6076078(A)	2000-06-01	Camp et al.	Applicant
US6088686(A)	2000-07-01	Walker et al.	Applicant
US6092147(A)	2000-07-01	Levy et al.	Applicant
US6098053(A)	2000-08-01	Slater	Applicant
US6112983(A)	2000-09-01	D'Anniballe et al.	Applicant
US6113495(A)	2000-09-01	Walker et al.	Applicant
US6119105(A)	2000-09-01	Williams	Applicant
US6138107(A)	2000-10-01	Elgamal	Applicant
US6158657(A)	2000-12-01	Hall, III et al.	Applicant
US6161133(A)	2000-12-01	Kikinis	Applicant
US6173269(B1)	2001-01-01	Solokl et al.	Applicant
US6178240(B1)	2001-01-01	Walker et al.	Applicant
US6209091(B1)	2001-03-01	Sudia et al.	Applicant
US6233341(B1)	2001-05-01	Riggins	Applicant
US6236981(B1)	2001-05-01	Hill	Applicant
US6247047(B1)	2001-06-01	Wolff	Applicant
US6249865(B1)	2001-06-01	Walker et al.	Applicant
US6259789(B1)	2001-07-01	Paone	Applicant
US6263447(B1)	2001-07-01	French et al.	Applicant
US6282658(B2)	2001-08-01	French et al.	Applicant
US6317729(B1)	2001-11-01	Camp et al.	Applicant
US6321339(B1)	2001-11-01	French et al.	Applicant
US6324524(B1)	2001-11-01	Lent et al.	Applicant
US6327578(B1)	2001-12-01	Linehan	Applicant
US6332134(B1)	2001-12-01	Foster	Applicant
US6341349(B1)	2002-01-01	Takaragi et al.	Applicant
US6373950(B1)	2002-04-01	Rowney	Applicant
US6418169(B1)	2002-07-01	Datari	Applicant
US6438691(B1)	2002-08-01	Mao	Applicant
US6442607(B1)	2002-08-01	Korn et al.	Applicant
US6446052(B1)	2002-09-01	Juels	Applicant
US6460076(B1)	2002-10-01	Srinivasan	Applicant
US6466917(B1)	2002-10-01	Goyal et al.	Applicant
US6484182(B1)	2002-11-01	Dunphy et al.	Applicant
US6490567(B1)	2002-12-01	Gregory	Applicant
US6493685(B1)	2002-12-01	Ensel et al.	Applicant
US6570870(B1)	2003-05-01	Berstis	Applicant
US6581060(B1)	2003-06-01	Choy	Applicant
US6584309(B1)	2003-06-01	Whigham	Applicant
US6594692(B1)	2003-07-01	Reisman	Applicant
US6622169(B2)	2003-09-01	Kikinis	Applicant
US6629150(B1)	2003-09-01	Huded	Applicant
US6650633(B1)	2003-11-01	Albers et al.	Applicant
US6675153(B1)	2004-01-01	Cook et al.	Applicant
US6721716(B1)	2004-04-01	Gross	Applicant
US6763464(B2)	2004-07-01	Wang et al.	Applicant
US6769009(B1)	2004-07-01	Reisman	Applicant
US6771317(B2)	2004-08-01	Ellis et al.	Applicant
US6792537(B1)	2004-09-01	Liu et al.	Applicant
US6823318(B1)	2004-11-01	Creswell et al.	Applicant
US6889205(B1)	2005-05-01	Lamm	Applicant
US6957334(B1)	2005-10-01	Goldstein et al.	Applicant
US6959382(B1)	2005-10-01	Kinnis et al.	Applicant
US6961858(B2)	2005-11-01	Fransdonk	Applicant
US6973622(B1)	2005-12-01	Rappaport et al.	Applicant
US6978366(B1)	2005-12-01	Ignatchenko et al.	Applicant
US6993572(B2)	2006-01-01	Ross, Jr. et al.	Applicant
US7020635(B2)	2006-03-01	Hamilton et al.	Applicant
US7024395(B1)	2006-04-01	McCown et al.	Applicant
US7035824(B2)	2006-04-01	Nel	Applicant
US7039688(B2)	2006-05-01	Matsuda et al.	Applicant
US7039806(B1)	2006-05-01	Friedman et al.	Applicant
US7051067(B1)	2006-05-01	Liu et al.	Applicant
US7051072(B2)	2006-05-01	Stewart et al.	Applicant
US7072856(B1)	2006-07-01	Nachom	Applicant
US7076458(B2)	2006-07-01	Lawlor et al.	Applicant
US7080049(B2)	2006-07-01	Truitt et al.	Applicant
US7080051(B1)	2006-07-01	Crawford	Applicant
US7090128(B2)	2006-08-01	Farley et al.	Applicant
US7103910(B1)	2006-09-01	Liu et al.	Applicant
US7107462(B2)	2006-09-01	Fransdonk	Applicant
US7110978(B1)	2006-09-01	Chin	Applicant
US7134131(B1)	2006-11-01	Hendricks et al.	Applicant
US7143147(B1)	2006-11-01	Hickman et al.	Applicant
US7143148(B1)	2006-11-01	Hickman et al.	Applicant
US7143186(B2)	2006-11-01	Stewart et al.	Applicant
US7150045(B2)	2006-12-01	Koelle et al.	Applicant
US7206748(B1)	2007-04-01	Gruse et al.	Applicant
US7248675(B2)	2007-07-01	Mirashrafi et al.	Applicant
US7249097(B2)	2007-07-01	Hutchison et al.	Applicant
US7266499(B2)	2007-09-01	Surace et al.	Applicant
US7340045(B2)	2008-03-01	Felger	Applicant
US7356503(B1)	2008-04-01	Johnson et al.	Applicant
US7380120(B1)	2008-05-01	Garcia	Applicant
US7386477(B2)	2008-06-01	Fano	Applicant
US7451103(B1)	2008-11-01	Boyle et al.	Applicant
US7483858(B2)	2009-01-01	Foran et al.	Applicant
US7545931(B2)	2009-06-01	Dillaway	Examiner
US7546637(B1)	2009-06-01	Agbabian et al.	Applicant
US7587502(B2)	2009-09-01	Crawford et al.	Applicant
US7606760(B2)	2009-10-01	Hutchison et al.	Applicant
US7620565(B2)	2009-11-01	Abelow	Applicant
US7672892(B2)	2010-03-01	Odom et al.	Applicant
US7681046(B1)	2010-03-01	Morgan et al.	Applicant
US7703140(B2)	2010-04-01	Nath et al.	Applicant
US7711586(B2)	2010-05-01	Aggarwal et al.	Applicant
US7765151(B1)	2010-07-01	Williams et al.	Applicant
US7818399(B1)	2010-10-01	Ross, Jr. et al.	Applicant
US7908226(B2)	2011-03-01	Hutchison et al.	Applicant
US7917130(B1)	2011-03-01	Christensen et al.	Applicant
US7921288(B1)	2011-04-01	Hildebrand	Applicant
US8001039(B2)	2011-08-01	Crosthwaite et al.	Applicant
US8078527(B2)	2011-12-01	Cerise et al.	Applicant
US8127345(B2)	2012-02-01	Gregg et al.	Applicant
US8130768(B1)	2012-03-01	Ahrens et al.	Applicant
US8738531(B1)	2014-05-01	Kalyadin	Examiner
US8984640(B1)	2015-03-01	Emigh et al.	Applicant
US9058504(B1)	2015-06-01	Swanson	Examiner
US9313187(B1)	2016-04-01	Huntwork et al.	Applicant
US9330275(B1)	2016-05-01	Endresen	Examiner
US9338092(B1)	2016-05-01	Allen	Examiner
US9602538(B1)	2017-03-01	Chou	Applicant
US9635000(B1)	2017-04-01	Muftic	Applicant
US9690968(B2)	2017-06-01	Wadley	Applicant
US9792451(B2)	2017-10-01	Smith	Examiner
US9792593(B2)	2017-10-01	Hayhow et al.	Applicant
US10069914(B1)	2018-09-01	Smith	Applicant
US10078754(B1)	2018-09-01	Brandwine	Examiner
US10482266(B2)	2019-11-01	Smith	Examiner
US10581737(B1)	2020-03-01	Allen	Examiner
US10616255(B1)	2020-04-01	Strauss et al.	Applicant
US11093623(B2)	2021-08-01	Smith	Examiner
US12072989(B2)	2024-08-01	Smith	Examiner
US2001/0000535(A1)	2001-04-01	Lapsley et al.	Applicant
US2001/0001877(A1)	2001-05-01	French et al.	Applicant
US2001/0007098(A1)	2001-07-01	Hinrichs et al.	Applicant
US2001/0018739(A1)	2001-08-01	Anderson et al.	Applicant
US2001/0037310(A1)	2001-11-01	Saeki	Applicant
US2001/0039533(A1)	2001-11-01	Pare et al.	Applicant
US2001/0039535(A1)	2001-11-01	Tsiounis et al.	Applicant
US2001/0042051(A1)	2001-11-01	Barrett et al.	Applicant
US2001/0042124(A1)	2001-11-01	Barron	Examiner
US2002/0007343(A1)	2002-01-01	Oyama et al.	Applicant
US2002/0013765(A1)	2002-01-01	Shwartz	Applicant
US2002/0023051(A1)	2002-02-01	Kunzle et al.	Applicant
US2002/0032873(A1)	2002-03-01	Lordemann et al.	Applicant
US2002/0035533(A1)	2002-03-01	Mache et al.	Applicant
US2002/0046188(A1)	2002-04-01	Burges et al.	Applicant
US2002/0059430(A1)	2002-05-01	Orbke et al.	Applicant
US2002/0062249(A1)	2002-05-01	Iannacci	Applicant
US2002/0064283(A1)	2002-05-01	Parenty	Applicant
US2002/0071556(A1)	2002-06-01	Moskowitz et al.	Applicant
US2002/0071564(A1)	2002-06-01	Kurn et al.	Applicant
US2002/0078344(A1)	2002-06-01	Sandhu et al.	Applicant
US2002/0111919(A1)	2002-08-01	Weller et al.	Applicant
US2002/0116341(A1)	2002-08-01	Hogan et al.	Applicant
US2002/0128969(A1)	2002-09-01	Parmelee et al.	Applicant
US2002/0138722(A1)	2002-09-01	Douceur et al.	Applicant
US2002/0141593(A1)	2002-10-01	Kurn et al.	Applicant
US2002/0144120(A1)	2002-10-01	Ramanathan	Applicant
US2002/0144262(A1)	2002-10-01	Plotnick et al.	Applicant
US2002/0147838(A1)	2002-10-01	Pisarsky	Examiner
US2002/0161719(A1)	2002-10-01	Manning et al.	Applicant
US2002/0194209(A1)	2002-12-01	Bolosky et al.	Applicant
US2002/0194484(A1)	2002-12-01	Bolosky et al.	Applicant
US2003/0014362(A1)	2003-01-01	Yim	Applicant
US2003/0033259(A1)	2003-02-01	Walker et al.	Applicant
US2003/0046223(A1)	2003-03-01	Crawford et al.	Applicant
US2003/0046237(A1)	2003-03-01	Uberti	Applicant
US2003/0051172(A1)	2003-03-01	Lordemann et al.	Applicant
US2003/0101341(A1)	2003-05-01	Kettler et al.	Applicant
US2003/0105859(A1)	2003-06-01	Garnett et al.	Applicant
US2003/0120928(A1)	2003-06-01	Cato et al.	Applicant
US2003/0163423(A1)	2003-08-01	Holst-Roness	Applicant
US2003/0171992(A1)	2003-09-01	Blagg et al.	Applicant
US2003/0204718(A1)	2003-10-01	Connelly et al.	Applicant
US2003/0236999(A1)	2003-12-01	Brustoloni	Applicant
US2003/0237005(A1)	2003-12-01	Bar-Or et al.	Applicant
US2004/0002878(A1)	2004-01-01	Maria Hinton	Applicant
US2004/0003259(A1)	2004-01-01	Chang	Applicant
US2004/0028227(A1)	2004-02-01	Yu	Applicant
US2004/0078394(A1)	2004-04-01	Powell et al.	Applicant
US2004/0083184(A1)	2004-04-01	Tsuei et al.	Applicant
US2004/0121723(A1)	2004-06-01	Poltorak	Applicant
US2004/0123112(A1)	2004-06-01	Himmel et al.	Applicant
US2004/0141616(A1)	2004-07-01	Himmel et al.	Applicant
US2004/0176070(A1)	2004-09-01	Lai	Examiner
US2004/0192306(A1)	2004-09-01	Elkarat et al.	Applicant
US2004/0199456(A1)	2004-10-01	Flint et al.	Applicant
US2004/0199782(A1)	2004-10-01	Arnold	Applicant
US2004/0252836(A1)	2004-12-01	Yoshida et al.	Applicant
US2004/0267665(A1)	2004-12-01	Nam et al.	Applicant
US2005/0039034(A1)	2005-02-01	Doyle et al.	Applicant
US2005/0060539(A1)	2005-03-01	Anspach	Applicant
US2005/0094640(A1)	2005-05-01	Howe	Applicant
US2005/0160281(A1)	2005-07-01	Thibadeau	Applicant
US2005/0177518(A1)	2005-08-01	Brown	Applicant
US2005/0192896(A1)	2005-09-01	Hutchison et al.	Applicant
US2005/0216421(A1)	2005-09-01	Barry et al.	Applicant
US2005/0257069(A1)	2005-11-01	Tanaka et al.	Applicant
US2006/0041748(A1)	2006-02-01	Lockhart et al.	Applicant
US2006/0089912(A1)	2006-04-01	Spagna et al.	Applicant
US2006/0149913(A1)	2006-07-01	Rothman et al.	Applicant
US2006/0168663(A1)	2006-07-01	Viljoen et al.	Applicant
US2006/0224742(A1)	2006-10-01	Shahbazi	Examiner
US2006/0230282(A1)	2006-10-01	Hausler	Applicant
US2006/0237528(A1)	2006-10-01	Bishop et al.	Applicant
US2006/0248330(A1)	2006-11-01	Randle	Examiner
US2006/0277594(A1)	2006-12-01	Chiavegatto et al.	Applicant
US2006/0280297(A1)	2006-12-01	Fukaya	Applicant
US2006/0282681(A1)	2006-12-01	Scheidt et al.	Applicant
US2007/0052517(A1)	2007-03-01	Bishop et al.	Applicant
US2007/0081666(A1)	2007-04-01	Shima	Applicant
US2007/0195959(A1)	2007-08-01	Clarke	Applicant
US2007/0204350(A1)	2007-08-01	Juszkiewicz	Applicant
US2007/0220062(A1)	2007-09-01	Carberry et al.	Applicant
US2007/0226809(A1)	2007-09-01	Ellard	Applicant
US2007/0250930(A1)	2007-10-01	Aziz et al.	Applicant
US2007/0271578(A1)	2007-11-01	Thenthiruperai et al.	Applicant
US2007/0299684(A1)	2007-12-01	Goodwin	Applicant
US2007/0299771(A1)	2007-12-01	Brody et al.	Applicant
US2008/0109369(A1)	2008-05-01	Su et al.	Applicant
US2008/0109868(A1)	2008-05-01	Waris	Applicant
US2008/0109876(A1)	2008-05-01	Hitomi et al.	Applicant
US2008/0155652(A1)	2008-06-01	DeBie	Applicant
US2008/0184336(A1)	2008-07-01	Sarukkai et al.	Applicant
US2008/0215897(A1)	2008-09-01	Doyle et al.	Applicant
US2008/0301078(A1)	2008-12-01	Proctor et al.	Applicant
US2009/0063382(A1)	2009-03-01	Proctor et al.	Applicant
US2009/0070533(A1)	2009-03-01	Elazary et al.	Applicant
US2009/0077618(A1)	2009-03-01	Pearce et al.	Applicant
US2009/0132819(A1)	2009-05-01	Lu et al.	Applicant
US2009/0210697(A1)	2009-08-01	Chen et al.	Applicant
US2009/0249462(A1)	2009-10-01	Chhabra	Examiner
US2009/0265610(A1)	2009-10-01	Leonard et al.	Applicant
US2009/0287837(A1)	2009-11-01	Felsher	Applicant
US2010/0042542(A1)	2010-02-01	Rose et al.	Applicant
US2010/0067686(A1)	2010-03-01	Minematsu	Applicant
US2010/0082991(A1)	2010-04-01	Baldwin et al.	Applicant
US2010/0088237(A1)	2010-04-01	Wankmueller	Applicant
US2010/0100972(A1)	2010-04-01	Lemieux et al.	Applicant
US2010/0107220(A1)	2010-04-01	Nguyen	Applicant
US2010/0138910(A1)	2010-06-01	Aldor et al.	Applicant
US2010/0174652(A1)	2010-07-01	Shear et al.	Applicant
US2010/0205431(A1)	2010-08-01	Griffin	Applicant
US2010/0223186(A1)	2010-09-01	Hogan et al.	Applicant
US2010/0228668(A1)	2010-09-01	Hogan et al.	Applicant
US2010/0242083(A1)	2010-09-01	Begum et al.	Applicant
US2010/0280954(A1)	2010-11-01	Khandelwal et al.	Applicant
US2010/0299362(A1)	2010-11-01	Osmond	Applicant
US2010/0306610(A1)	2010-12-01	Komatsu	Applicant
US2010/0306842(A1)	2010-12-01	Asano	Examiner
US2011/0040967(A1)	2011-02-01	Waller et al.	Applicant
US2011/0055920(A1)	2011-03-01	Hariri	Examiner
US2011/0087526(A1)	2011-04-01	Morgenstern et al.	Applicant
US2011/0107418(A1)	2011-05-01	Bhagwan et al.	Applicant
US2011/0162040(A1)	2011-06-01	Stephens	Applicant
US2011/0252480(A1)	2011-10-01	Patawaran et al.	Applicant
US2011/0293096(A1)	2011-12-01	Reilly et al.	Applicant
US2011/0314271(A1)	2011-12-01	Boccon-Gibod et al.	Applicant
US2012/0030421(A1)	2012-02-01	Chang et al.	Applicant
US2012/0142403(A1)	2012-06-01	Prather et al.	Applicant
US2012/0151553(A1)	2012-06-01	Burgess	Examiner
US2012/0173431(A1)	2012-07-01	Ritchie et al.	Applicant
US2012/0197806(A1)	2012-08-01	Hill	Applicant
US2012/0324094(A1)	2012-12-01	Wyatt	Examiner
US2013/0103584(A1)	2013-04-01	Eichner et al.	Applicant
US2013/0142328(A1)	2013-06-01	Shibata et al.	Applicant
US2013/0152160(A1)	2013-06-01	Smith et al.	Applicant
US2014/0026191(A1)	2014-01-01	Jain et al.	Applicant
US2014/0090011(A1)	2014-03-01	Howe	Applicant
US2014/0150060(A1)	2014-05-01	Riley	Examiner
US2014/0157041(A1)	2014-06-01	Danielsson	Examiner
US2014/0201057(A1)	2014-07-01	Shuster	Applicant
US2014/0245372(A1)	2014-08-01	Elias	Examiner
US2014/0258109(A1)	2014-09-01	Jiang et al.	Applicant
US2015/0006392(A1)	2015-01-01	Brand et al.	Applicant
US2015/0040180(A1)	2015-02-01	Jacobson	Examiner
US2015/0081567(A1)	2015-03-01	Boyle et al.	Applicant
US2015/0089620(A1)	2015-03-01	Manza	Examiner
US2015/0121506(A1)	2015-04-01	Cavanaugh	Examiner
US2015/0242825(A1)	2015-08-01	Mills	Applicant
US2015/0288517(A1)	2015-10-01	Evans	Examiner
US2015/0294109(A1)	2015-10-01	Kanzaki	Examiner
US2015/0379259(A1)	2015-12-01	Mohammed	Examiner
US2016/0012240(A1)	2016-01-01	Smith	Examiner
US2016/0021224(A1)	2016-01-01	Howe	Applicant
US2016/0173510(A1)	2016-06-01	Harris	Examiner
US2016/0267477(A1)	2016-09-01	McDonald	Applicant
US2017/0063816(A1)	2017-03-01	Ackerly	Examiner
US2017/0103459(A1)	2017-04-01	Kim	Applicant
US2017/0132630(A1)	2017-05-01	Castinado et al.	Applicant
US2017/0134765(A1)	2017-05-01	Uhr et al.	Applicant
US2017/0149745(A1)	2017-05-01	Geng	Applicant
US2017/0195330(A1)	2017-07-01	Ren et al.	Applicant
US2018/0012000(A1)	2018-01-01	Ogawa	Examiner
US2018/0097789(A1)	2018-04-01	Murthy	Examiner
US2018/0139219(A1)	2018-05-01	Sabata et al.	Applicant
US2018/0145957(A1)	2018-05-01	Kasibhatla	Examiner
US2018/0351733(A1)	2018-12-01	Rohel et al.	Applicant
US2018/0373887(A1)	2018-12-01	Smith	Applicant
US2019/0058693(A1)	2019-02-01	Alkhabbaz	Examiner
US2019/0230090(A1)	2019-07-01	Kathiara	Examiner
US2020/0134158(A1)	2020-04-01	Mullins	Examiner
US2020/0162252(A1)	2020-05-01	Davis	Examiner
US2020/0177589(A1)	2020-06-01	Mangalvedkar et al.	Applicant
US2020/0210568(A1)	2020-07-01	Strogov	Examiner
US2020/0294293(A1)	2020-09-01	Boenig, II	Examiner
US2021/0126774(A1)	2021-04-01	Galligan	Examiner
US2021/0194853(A1)	2021-06-01	Xiao	Examiner
US2021/0234700(A1)	2021-07-01	Ali	Examiner
US2022/0100825(A1)	2022-03-01	Groth et al.	Applicant
US2022/0329631(A1)	2022-10-01	Chin et al.	Applicant
CA2167543(A1)	1997-07-01		Applicant
CA2217825(A1)	1998-04-01		Applicant
EP765068(A2)	1997-03-01		Applicant
EP779587(A2)	1997-06-01		Applicant
EP818907(A2)	1998-01-01		Applicant
EP883076(A2)	1998-12-01		Applicant
EP902381(A2)	1999-03-01		Applicant
EP921487(A2)	1999-06-01		Applicant
JP9-91132	1997-04-01		Applicant
JP9-114787	1997-05-01		Applicant
JP9-114904	1997-05-01		Applicant
JP9-153964	1997-06-01		Applicant
JP9-179912	1997-07-01		Applicant
JP9-218903	1997-08-01		Applicant
JP9-259189	1997-10-01		Applicant
JP9-297789	1997-11-01		Applicant
JP9-305682	1997-11-01		Applicant
JP9-326002	1997-12-01		Applicant
JP10-3501	1998-01-01		Applicant
JP10-509543	1998-09-01		Applicant
JP10-327145	1998-12-01		Applicant
JP11-3387	1999-01-01		Applicant
JP11003387	1999-01-01		Applicant
JP11-53444	1999-02-01		Applicant
JP11-503541	1999-03-01		Applicant
JP11-239128	1999-08-01		Applicant
JP11-353280	1999-12-01		Applicant
JP2001-350664(A)	2001-12-01		Applicant
JP2002-353953(A)	2002-12-01		Applicant
JP2005-056418(A)	2005-03-01		Applicant
JP2009-252120(A)	2009-10-01		Applicant
KR1020000012391	2000-03-01		Applicant
KR10-2008-0064687(A)	2008-07-01		Applicant
KR10-2008-0064787	2008-07-01		Applicant
WO-95/16971(A1)	1995-06-01		Applicant
WO-96/21192(A1)	1996-07-01		Applicant
WO-96/31965(A1)	1996-10-01		Applicant
WO-96/37848(A1)	1996-11-01		Applicant
WO-97/01920(A1)	1997-01-01		Applicant
WO-9809260	1997-04-01		Applicant
WO-97/22074(A1)	1997-06-01		Applicant
WO-97/29584(A1)	1997-08-01		Applicant
WO-97/49054(A2)	1997-12-01		Applicant
WO-98/40809(A2)	1998-09-01		Applicant
WO-98/57460(A1)	1998-12-01		Applicant
WO-99/21321(A1)	1999-04-01		Applicant
WO-99/57835(A1)	1999-11-01		Applicant

Non-Patent Literature (42)

Ajluni, C., “Security Techniques Ensure Privacy,” Electronic Design, Apr. 1995, pp. 83-84 (abstract).Applicant
Alsop, S., “Bookmarks Mark the Next Chapter in the Continuing Story of the War of the Web,” Info World 17(37):102, Sep. 11, 1995.Applicant
Benji Rogers: “How the Blockchain and VR Can Change the Music Industry—Cuepoint—Medium”, Nov. 23, 2015 (Nov. 23, 2015), XP055374610, Retrieved from the Internet <URL:https://medium.com/cuepoint/bc-a-fair-trade-music-format-virtual-reality-the-blockchain-76fc47699733>.Applicant
Briefly Noted, Internet Business News, © 1994-8 M2 Communications Ltd., Coventry, United Kingdom, Jan. 1, 1998, p. 1.Applicant
Davenport, G, “New eCharge Internet Billing System Charges Purchases to Telephone Bill with AT&T MultiQuest”, Business Wire, Dec. 3, 1997, 2 pages.Applicant
Decision of Rejection mailed Dec. 6, 2011, issued in Japanese Patent Application No. 2001-587188, filed May 25, 2001, 8 pages.Applicant
DigiBox: A Self-Protecting Container for Information Commerce, Olin Sibert, et al. 1995.Applicant
Electronic Commerce News, vol. 3, No. 42, Oct. 19, 1998, “Plastic or Cybercash? Cutting Banks out of the Payment Circuit,” three pages.Applicant
Encryption Devices, Government Executive, Jul. 1996, p. 2A.Applicant
http://www.echarge.att.com/, “AT&T eCharge: Simple,” available at least as early as Oct. 29, 1997.Applicant
http://www.echarge.att.com/cgi-bin/Activate.cgi, “AT&T eCharge: Activate Your Account,” available at least as early at Oct. 29, 1997.Applicant
http://www.echarge.att.com/cgi-bin/Register.cgi, “AT&T eCharge: Apply for an Account,” available at least as early at Oct. 29, 1997.Applicant
http://www.echarge.att.com/cgi-bin/Transactions.cgi, “AT&T eCharge: Account Activity,” available at least as early as Oct. 29, 1997.Applicant
http://www.echarge.att.com/faq.html, “AT&T eCharge: Frequently Asked Questions/Customer Support,” available at least as early as Oct. 29, 1997.Applicant
http://www.echarge.att.com/how_wk .. html, “AT&T eCharge: How Does It Work?” available at least as early as Oct. 29, 1997.Applicant
http://www.echarge.att.com/index.html, “AT&T eCharge: Welcome to AT&T eCharge,” available at least as early as Oct. 29, 1997.Applicant
http://www.echarge.att.com/index.html, “AT&T eCharge,” available at least as early as Oct. 29, 1997.Applicant
http://www.echarge.att.com/terms_conditions.html, “AT&T eCharge: Frequently Asked Questions/Customer Support,” available at least as early as Oct. 29, 1997.Applicant
Information Intelligence, Inc., “User Authentication and Authorization Challenges in a Networked Library Environment,” Online Libraries & Microcomputers 15(10), Oct. 1, 1997.Applicant
International Preliminary Report on Patentability for International Application No. PCT/US2001/017106 dated Nov. 13, 2002.Applicant
International Preliminary Report on Patentability for International Application No. PCT/US2017/020640 dated Sep. 4, 2018.Applicant
International Search Report and Written Opinion for International Application No. PCT/US2017/020640 dated Sep. 8, 2017.Applicant
International Search Report and Written Opinion mailed Jan. 4, 2016, issued in corresponding International Application No. PCT/US2015/026405, filed Apr. 17, 2015, 6 pages.Applicant
International Search Report and Written Opinion mailed Mar. 22, 2013, issued in corresponding International Application No. PCT/US2012/068826, filed Dec. 10, 2012, 11 pages.Applicant
Internet 900 Billing Fills Void, Audiotex News, Dec. 1997, p. 5 (abstract).Applicant
Internet Service Considers 900, Audiotex News, Jan. 1997, p. 8 (abstract).Applicant
Itoh, M., et al., “Outline of SET Protocol,” NEC Journal 51 (9):90-99, 1998 (with partial English translation provided by foreign associate).Applicant
Lang, P., “Product Review: eCharge Billing System” © 1997-2009 Optimum Interactive LLC, Apr. 1998, <http:/fsellitontheweb.com/ezine/echarge.shtml> [retrieved Dec. 10, 2008], 3 pages.Applicant
Lau, H., “Open House: E-business and you: Buying on the Net . . . Safely,” Businessworld (Philippines), Nov. 3, 1998.Applicant
Logicom, Inc., “New Web900 Service Offers Secure Billing Over the Internet,” News Release, Jul. 1, 1996.Applicant
Marion, L., “Who's Guarding the Till at the Cybermall?” Datamation 41 (3):38-39, Feb. 15, 1995.Applicant
Minkoff, J., “Ensuring Online Security,” Discount Merchandiser, Jan. 1996, p. 49.Applicant
Pappalardo, D., “Tools Lets ISPs Charge for Fax, Voice,” Network World, Apr. 1997, p. 116.Applicant
PR Newsire Association, Inc., “Verisign Offers Unique Seal to Show Internet Users ‘Proof of Authentication’,” PR Newswire, Dec. 10, 1996.Applicant
Schneier, B., “Applied Cryptography: Protocols, Algorithms, and Source Code in C,” 2nd Edition, John Wiley & Sons, Inc., New York, 1996 (rather than sending the entire text, applicants refer Examiner to the remarks regarding this reference that are contained in the European Examination Report identified in No. 3 above).Applicant
Sirbu, M.A., “Creating an Open Market for Information,” Journal of Academic Librarianship, Nov. 1995, p. 467 (abstract).Applicant
Sweetland. P., “Integrated Billing and the Internet, ”Telecommunications 31(6):127-130, Jun. 1997.Applicant
Victims Seeking Cheap Online Erotica Aroused by Not-So-Cheap Phone Bills, San Jose Mercury News, Feb. 20, 1997, p. 1C.Applicant
Wasserman, T., “Retailers, OSPs Race to Secure Qnline Sales,” Computer Retail Week 7(160):6-7, Jan. 6, 1997.Applicant
Wingfield, N., “Netscape Joins Fray with Web Browser for Windows 95,” Info World 17(27):37, Jul. 3, 1995.Applicant
Yamamoto, H., “Development of Cyber Business by Integrating Internet Protocol Service with Telephone Service”, The Telecommunications Association, NTT Technical Review 10(1):86-88, Jan. 1998.Applicant
Yamasaki, S., and K. Araki, “A Certificate Infrastructure Model for Integrated Cross-Authentification With Warranty and Use Policy Control,” Trans. Information Processing Society of Japan 40(1 ):296-309, Jan. 1999 (English Abstract).Applicant

Abstract