Hewlett Packard Enterprise Development LP

Hewlett-packard Development Company, L.p.

Brian Quentin Monahan

Patrick Goldsack

Keith Alexander Harrison

Adrian John Baldwin

Marco Casassa Mont

Richard Brown

Philipp Reinecke

Granville Barnett

Liqun Chen

Geoffrey Ndu

Antonio Lain

Adrian Shaw

Luis Miguel Vaquero Gonzalez

Simon Kai-Ying Shiu

Chris Tofts

Marco Aurelio Barbosa Fagnani Gomes Lotz

A method of validating software including maintaining, in a trusted computing system, a copy of at least portions of data of the software, the software comprising data in an untrusted computing system. The method includes, with the trusted computing system, specifying selected data from data included in the copy as hash data, generating an executable file for generating a hash based on the specified hash data, executing the executable file to generate a check hash using the specified selected data from the copy as the hash data, and determining whether the software is valid based, at least in part, on a comparison of the check hash to an access hash generated by execution of the executable file by the untrusted computing system using the specified selected data from the untrusted computing system as the hash data.

Software validation for untrusted computing systems

Example embodiments relate to combining hashes of data blocks. The examples disclosed herein calculate a hash value for each data block in a sequence of data blocks. The hash values are combined into a combined value, where the combined value has the same sequence as the sequence of data blocks. A master hash value is then calculated for the combined value.

Combining hashes of data blocks

Example embodiments relates to method and systems to infer graph topologies. A computing device for inferring a graph topology, comprises a physical processor that executes machine readable instructions that cause the computing device to process a set of unclassified tables. For each table the computing device determines a primary key comprising a set of columns of a table being analyzed, determines a set of foreign keys, each foreign key comprising a column of the analyzed table, and identifies a parameter based on the analyzed table, the primary key and the set of foreign keys. The parameter may comprise a node identification, a set of node attributes, a set of edges without attributes, a set of edges with attributes or a set of edge attributes. The computing device can cause the display of the graph topology based on the processed set of unclassified tables.

Inferring graph topologies

An apparatus comprises a memory to store data and a processor coupled to the memory. The processor may modify a plurality of data elements using a semantic relationship between the plurality of data elements and a pre-selected data security policy and to store data representing the modified plurality of data elements in the memory.

Modification of data elements using a semantic relationship

An example computing device comprises a first processing unit having first capabilities, a second processing unit having second capabilities, and a shared memory accessible by the first processing unit and the second processing unit. The shared memory stores data objects in association with type information indicating the data type of the data objects. The example computing device further comprises an instruction set to, when executed by a processing unit of the computing device, select one of the first processing unit and the second processing unit to perform a computation of a particular type, using data of a particular type stored in the shared memory, wherein the selection is performed based on a predefined affinity of the first processing unit for the particular computation type and/or the particular data type and a predefined affinity of the second processing unit for the particular computation type and/or the particular data type.

Scheduling heterogenous processors

Examples analyze source code of a task prior to compiling the source code to determine a static property of the task. Examples determine a category for the task based at least in part on the static property. Examples compile the source code to generate a binary of the task. Examples determine execution parameters for the task based at least in part on the category. Examples schedule the binary for execution based at least in part on the execution parameters.

Category based execution scheduling

In one example in accordance with the present disclosure, a system comprises a first memory module and a first memory integrity monitoring processor, embedded to the first memory module, to receive a second hash corresponding to a second memory module. The second hash includes a second sequence number for reconstruction of a final hash value and the second hash is not sequentially a first number in a sequence for reconstruction of the final hash value. The first processor may receive a third hash corresponding to a third memory module. The third hash includes a third sequence number for reconstruction of the final hash value and the third hash is received after the second hash. The first processor may determine if the second hash can be combined with the third hash, combine the second hash and third hash into a partial hash reconstruct the final hash value using the partial hash.

Memory integrity monitoring

In one implementation, computer executable instructions are provided to identify a group of instructions corresponding to a code block for an executable module. The instructions increment a counter associated with the code block to indicate the code block has been tested.

System and method to indicate code block execution

A method of assessing a network uses a model () having nodes () to represent parts of the network infrastructure and the application services, and having links to represent how the nodes influence each other. Dependencies or effects of the application services are found by determining paths through the nodes and links of the model (). Such assessment can be useful for design, test, operations, and diagnosis, and for assessment of which parts of the infrastructure are critical to given services, or which services are dependent on, or could have an effect on a given part of the infrastructure. The dependencies or effects can encompass reachability information. The use of a model having links and nodes can enable more efficient processing, to enable larger or richer models. What changes in the dependencies or effects result from a given change in the network can be determined ().

Modelling network to assess security properties

A method of authorizing a computing entity comprises obtaining at the authorizing entity a delegation chain of intermediate elements through which an authorisable entity asserts authorization eligibility in the form of a sequence of locally assigned labels for the elements. The method further comparing the label sequence against a label sequence template.

Method of authorising a computing entity

A method of communication is such that a first party () communicates a composite credential () across a distributed electronic network () to a second Party (). The composite credential () includes a plurality of credentials (-).

Communication and authentication of a composite credential utilizing obfuscation

The present invention provides a digital certificate () comprising a plurality of credential attribute properties (), and a trust function () embedded within the certificate as an executable file, which trust function can determine as a function of data () available to it a trust value () attributable to at least a part of the certificate at least partly by execution of the executable file. A corresponding method of communication is also disclosed.

Digital certificates

A distributed storage system for storing at least one credential (), provided by an issuing authority and relating to an identity (), is described. The system comprises: a plurality of unique identities () each having a local store (). Each local store () securely stores credentials () relating to the owner of the identity (). The system also comprises one or more security certificates () provided at each identity () for ensuring the authenticity of the credentials (). The security certificates () provide secure references to the issuers of the credentials () and this can be used in verifying the origin of each credential (). The identity can be provided a website or a mobile phone for example.

Growing community of inventors

Bristol, United Kingdom

Brian Quentin Monahan