Michael Everett Mcfall

US Patent:

20180198826, Jul 12, 2018

Filed:

Mar 6, 2018

Appl. No.:

15/912667

Inventors:

- Las Vegas NV, US
Michael McFall - Henderson NV, US

International Classification:

H04L 29/06

Abstract:

Disclosed is a method, a device, and/or a system of control over data resource utilization through a security node control policy evaluated in the context of an authorization request. In one embodiment, a method includes receiving an authorization request from a device to utilize a protected resource within a datastore. A control policy extracted from a security node defines an authorized context for the device to utilize the protected resource. The control policy includes a control algorithm comprising one or more conditionals comparing context values to control ranges. Context values are retrieved to form a context dataset. Utilization of the protected resource is authorized when it is determined by the control algorithm that the context dataset conforms to the authorized context. The security node may organize data into a domain structure that includes a unique identifier, an identity element, a content element, and a context element.

US Patent:

20170048253, Feb 16, 2017

Filed:

Aug 7, 2016

Appl. No.:

15/230421

Inventors:

- Henderson NV, US
Michael McFall - Henderson NV, US

International Classification:

H04L 29/06
G06F 17/30

Abstract:

Disclosed is a method, a device, and/or a system of a data resource control data structure. In one embodiment, a computer-implemented method includes receiving an authorization request from a device to utilize a protected resource within a datastore. A control policy that defines an authorized context in which the device is authorized to utilize the protected resource is extracted from a security node of a non-hierarchical data structure. The control policy includes a control algorithm and optionally a control dataset. Context values specified in the control algorithm are retrieved to form a context dataset. Utilization of the protected resource is authorized when it is determined by the control algorithm that the context dataset conforms to the authorized context. The security node may organize data into a domain structure that includes a unique identifier, an identity element, a content element, and a context element.

US Patent:

20170034217, Feb 2, 2017

Filed:

Aug 7, 2016

Appl. No.:

15/230424

Inventors:

- Henderson NV, US
Michael McFall - Henderson NV, US

International Classification:

H04L 29/06

Abstract:

Disclosed is a method, a device, and/or a system of authorization of access to a data resource in addition to specific actions to be performed on the data resource based on an authorized context enforced by a use policy. A computer-implemented method includes receiving a use request from a device to use a protected resource. The method extracts from a security node a use policy comprising defining an authorized context for use the protected resource. First, access to the protected resource is authorized when the use request conforms to the authorized context. Use keys are generated and returned to the device for redemption. Second, after the protected resource is streamed to the device, a process of the device monitors use of and enforce ephemerality of the protected resource by maintaining an active use ledger. A use policy update may generate new use terms that are pushed to the device, terminating use.

US Patent:

20160344550, Nov 24, 2016

Filed:

Aug 7, 2016

Appl. No.:

15/230423

Inventors:

- Henderson NV, US
Michael McFall - Henderson NV, US

International Classification:

H04L 9/32
H04L 29/06

Abstract:

Disclosed is a method, a device, and/or a system of authentication of a user and/or a device through parallel synchronous update of immutable hash histories. In one embodiment, a computer-implemented method for authentication includes receiving an identity claim from a device that includes a device root hash of a hashed history of the device, referred to as a device hastory. Data of a user profile associated with the device that includes a profile root hash of a profile hastory is retrieved. The device root hash and the profile root hash are compared and determined to be identical to verify an identity of a user and/or a device. A transaction record is generated and deposited as a new block in both in the profile hastory and device hastory. A new profile root hash is computed to evolve the identity of the user profile for a prospective authentication request.

US Patent:

20160344737, Nov 24, 2016

Filed:

Aug 7, 2016

Appl. No.:

15/230422

Inventors:

- Henderson NV, US
Michael McFall - Henderson NV, US

International Classification:

H04L 29/06
G06F 17/30
G06F 21/62

Abstract:

Disclosed is a method, a device, and/or a system of uniqueness and auditing of a data resource through an immutable record of transactions in a hash history. In one embodiment, a method includes maintaining uniqueness of a “data organism” that has a hash history, referred to as a hastory, forming a unique identity based on previous transactions in which the data organism participated. The method may be usable to verify an original of the data organism, control copies, transfer ownership and/or audit the datastore. The hastory includes a set of blocks in a sequential chain, each block including a transaction record. A root hash is unique within the datastore for a given data within each block and a given block order of the sequential chain. A transaction record is deposited as a new block in the sequential and the root hash is re-calculated to evolve identity of the data organism.

US Patent:

20160063100, Mar 3, 2016

Filed:

Jun 29, 2015

Appl. No.:

14/754514

Inventors:

- Henderson NV, US
Michael McFall - Henderson NV, US

International Classification:

G06F 17/30
G06F 21/62

Abstract:

Disclosed is a method, a device, a system and/or a manufacture of a semantic data structure. In one embodiment, a physical memory usable to store information within a datastore comprises a number of domains. Each domain includes a unique identifier and organizes data into a domain structure that includes and an identity element, a content element, and a context element, each of which may be implemented as an EAV triplet. A fundamental instantiation of the domain structure contains a primitive data and a relational instantiation of the domain structure contains references to other domains. The references of the content element may be constrained, for example to a directed acyclic graph architecture, while references of the context element may reference any domain. Additional instantiations may build orders of referential structure, provide security and control of data resources within the datastore, and model users and application programs.