Abstract: Virtual machines in a network may be isolated by encrypting transmissions between the virtual machines with keys possessed only by an intended recipient. Within a network, the virtual machines may be logically organized into a number of community-of-interest (COI) groups. Each COI may use an encryption key to secure communications within the COI, such that only other virtual machines in the COI may decrypt the message. Remote devices may gain access to virtual machines in a network through a virtual device relay. The virtual device relay receives data from the remote device, such as a tablet or cellular phone, and forwards the data to one of the virtual machines, when the virtual device relay shares a COI with the destination virtual machine.

Abstract: A system and method for the dynamic, run-time configuration of logic core register files, and the provision of an associated execution context. The dynamic register files as well as the associated execution context information are software-defined so as to be virtually configured in random-access memory. This virtualization of both the processor execution context and register files enables the size, structure and performance to be specified at run-time and tailored to the specific processing, instructions and data associated with a given processor state or thread, thereby minimizing both the aggregate memory required and the context switching time. In addition, the disclosed system and method provides for processor virtualization which further enhances the flexibility and efficiency.

Abstract: A system and method for the storage, within one or more virtual execution context registers, tracing information indicative of process/code flow within a processor system. This stored information can include a time stamp, information indicative of where the instruction pointer of the system was pointing prior to any process discontinuity, information indicative of where the instruction pointer of the system was pointing after any process discontinuity, and the number of times a specific instruction or sub-process is executed during a particular process. The data collected and stored can be utilized within such a system for the identification and analysis of processing hot-spots.

Abstract: A host computing device for use in a network architecture having at least one client computing device or network, at least one server computing device or network and a gateway coupled between the at least one client computing device or network and the at least one server computing device or network. The host computing device includes at least one application container and at least one sidecar container coupled to the application container. The sidecar container provides supporting features to the application container. The sidecar container is a virtual private network (VPN) sidecar that performs at least one sidecar function on behalf of the application container.

Abstract: A system and method for virtual processor customization based upon the particular workload placed upon the virtual processor by one or more execution contexts within a given program or process. The customization serves to optimize the virtual processor architecture based upon a determination as to the size and/or type or virtual execution registers optimally suited for supporting a given execution context. This results in a time-variant processor architecture comprised of a virtual processor base and a virtual execution context.

Abstract: An apparatus configured for database access control. The apparatus includes a memory and a processor coupled to the memory, wherein the processor is configured to execute instructions, The instructions include receiving a statement requesting access for a user to data files stored in a non-transitory memory medium; parsing the statement into one or more arguments, wherein each argument ends with a logical operator; computing a skip count for each of the arguments; evaluating the statement using the skip counts to determine whether the access should be granted to the user; retrieving the data files from the non-transitory memory medium; and sending the data files to the user, if the access is granted.

Abstract: A processor-based method of building and appending data structures in a multi-host environment includes creating and storing data into a first data structure having a first root node, a first right leaf node and a plurality of other leaf nodes and non-leaf nodes defining multiple hierarchical levels; allowing a search of the first data structure to proceed while creating a second data structure that includes a second root node, a second left leaf node and a plurality of leaf nodes and non-leaf nodes defining multiple hierarchical levels; receiving a command to append the second data structure to the first data structure during searching the first data structure; creating a global lock for all hosts in the multi-host environment to the first root node and the first right leaf node of the first data structure while allowing access to the plurality of other leaf nodes and non-leaf nodes of the first data structure; updating the first root node and the first right leaf node with information about the second data

Abstract: The present invention provides for employing SQL to introduce blockchain technologies into a relational database, and thereby leverage the inherent tamper-resistant properties of blockchain, without the need to completely rewrite existing or legacy relational database software. The invention creates a relational database inside of a blockchain and uses a conventional SQL interface for standard database operations. This reduces the burden of introducing blockchain technologies, while providing the benefits of the intrinsic security and verification features of blockchain technology. The invention provides a rich historical record of every transaction thereby greatly reducing, if not eliminating, the relational database's susceptibility to tampering. This allows for temporal queries on arbitrary records within the database and the generation of reports and audits for any point in the history of the database.

Abstract: A processor-based method for securing directories through a persistent signature, comprising: selecting a directory; selecting a private key, a certificate identifier and a hash algorithm identifier for each selected directory; creating an encrypted hash of the directory using the hash algorithm and private key; and creating a persistent, independent signature for the directory that identifies the directory, certificate identifier, hash algorithm identifier, and the encrypted hash value for that directory.

Abstract: A processor-based method for verifying a secured file, directory, or meta-data, comprising: extracting a persistent, independent signature for a secured file, directory, or meta-data from a directory signature file, the signature identifying a certificate identifier, a hash algorithm identifier, and an encrypted hash value for that secured file, directory, or meta-data; retrieving a public key corresponding to the certificate identifier; decrypting the encrypted hash using the public key and a decryption tool, resulting in a clear text hash value; creating a new hash value for the secured file, directory, or meta-data, the hash creation corresponding to the hash algorithm identifier; and verifying the signature when the new hash value for the secured file, directory, or meta-data matches the unencrypted hash value from the persistent, independent signature for the secured file, directory, or meta-data,

Abstract: A processor-based method for securing meta-data through a persistent signature, comprising: identifying meta-data for a file; selecting a private key, a certificate identifier and a hash algorithm identifier for the meta-data; creating an encrypted hash of the meta-data using the hash algorithm and private key; and creating a persistent, independent signature for the meta-data that identifies the meta-data, certificate identifier, hash algorithm identifier, and the encrypted hash value for the meta-data.

Abstract: A processor-based method for creating a persistent directory signature file, comprising: selecting a private key, a certificate identifier and a hash algorithm identifier for the directory signature file; concatenating one or more persistent, independent signatures wherein a persistent independent signature includes a file name, sub-directory indicator, or meta-data indicator, and a certificate identifier, and a hash identifier, and an encrypted hash; creating an encrypted hash of the one or more concatenated signatures using the hash algorithm and private key chosen for the directory signature file; and concatenating the encrypted hash of the one or more concatenated signatures with the concatenated signatures and the certificate identifier, and hash algorithm identifier chosen for the directory signature file to create a persistent, independent signature for the directory signature file.

Abstract: A processor-based method for securing files through a persistent signature includes: selecting a file of any file type; selecting a private key, a certificate identifier and a hash algorithm identifier for the file; creating an encrypted hash of the file using the hash algorithm and private key for the file; and creating a persistent, independent signature for each selected file that identifies the file, certificate identifier, hash algorithm identifier, and the encrypted hash value for the file.

Abstract: Methods and systems for implementing an object identification system equipped to reduce the number of service calls for remote object identification lookups are disclosed. The object identification management server works to reduce the number of object identification requests, which overall improves the process of quickly and accurately providing object identifications when needed and without unnecessarily wasting computing resources. The object identification server can subsequently manage the number of identification requests by setting a tunable threshold, which allows a system to operate more efficiently and allocate computing resources accordingly.

Abstract: A processor-based method of creating a secondary index includes creating an empty secondary index; capturing the current system time; cloning the database to create a cloned database; writing to a file a secondary index column value and a primary key column value from rows in the cloned database that meet search criteria; populate the secondary index using sorted data; writing, periodically, a row number being processed from the file to control information for the B-tree; and clearing the row number.

Abstract: A processor-based method of creating a secondary index for a B-tree in a database includes creating an empty secondary index; traversing the B-tree to find the left most data page to begin processing; capturing the current system time; placing a read-lock on the data page; retrieving a first primary key value for the data page; writing the first primary key value to a control information for the B-tree; creating a secondary index entry and writing it into the secondary index; and releasing the read-lock.

Abstract: A processor-based method of updating a secondary index for a B-tree in a database in a DBMS to include subsequent changes that occurred during creation of the secondary index includes opening an audit trail and moving back in the audit trail to a captured system time; making the secondary index visible to the DBMS for INSERT, UPDATE and DELETE processing; reading a next committed set of database updates from the audit trail; creating a secondary index modification for each row on each audit trail update and applying it to the secondary index; clearing the captured system time from control information for the B-tree to indicate completion; and making the secondary index visible to the DBMS for all processing.

Abstract: A processor-based method of making a file containing a secondary index recoverable during processing of the secondary index includes: capturing a current system time as a captured system time and writing the captured system time to control information; finding writes to the file containing the secondary index; also writing the writes to an audit trail; using the captured system time in control information for the secondary index as a start time for recovery; determining if there is a primary key value in the control information; using a primary key value in the control information to traverse to a data page continuing the primary key value; placing a read-lock on the data page; creating a corresponding secondary index entry; and releasing the read-lock.

Abstract: Methods and systems for remote dynamic isolation of IoT devices are provided. One system includes a first IoT device and a second IoT device configured with an active communication channel with the first IoT device and a role certificate. An operator device is configured to interact with a distributed ledger to issue and revoke role certificates for a plurality of devices including the first IoT device and the second IoT device. The first IoT device periodically validates a role certificate proof received from the second IoT device with an entry of the role certificate proof recorded on the distributed ledger.

Abstract: A processor-based method of building and appending data structures in a multi-host environment includes creating and storing data into a first data structure having a first root node, a first right leaf node and a plurality of other leaf nodes and non-leaf nodes defining multiple hierarchical levels; allowing a search of the first data structure to proceed while creating a second data structure that includes a second root node, a second left leaf node and a plurality of leaf nodes and non-leaf nodes defining multiple hierarchical levels; receiving a command to append the second data structure to the first data structure during searching the first data structure; creating a global lock for all hosts in the multi-host environment to the first root node and the first right leaf node of the first data structure while allowing access to the plurality of other leaf nodes and non-leaf nodes of the first data structure; updating the first root node and the first right leaf node with information about the second data