Sensoriant, Inc.

Safelishare, Inc.

Goutham Puppala

Shamim A Naqvi

Robert Frank Raucci

In accordance a method for storing a dataset, the dataset may be split into fragments that are distributed among different nodes of a network for storage. The fragments may then be retrieved as and when needed and re-assembled. The method allows multiple different fragments to be stored and re-assembled on demand. The dataset is initially stored in a user computing device in communication with a data storage system and a custodial entity. The fragments are stored so that no single computing entity in the storage system or the custodian ever contains or gains knowledge of all the fragments. Additionally, the user computing device that was initially in possession of the dataset and which caused the fragments to be stored in the storage system may be replaced with different user computing devices without losing the capability of storing and re-assembling the user data on demand by the replacement user computing device.

Storing and retrieving user data using joint, non-correlative, irreversible and private indexical expressions

A method for communicating information relating to test results of a user includes obtaining test results of a user. An assertion is derived from the test results of the user. The test results are input to a pre-provisioned first algorithm. The assertion is encapsulated in a first data object by a PGE that controls an environment in which the first algorithm is executed. A first proof is generated which is configured to be usable to verify that the first algorithm used the test results to produce the assertion when provided to a PVE along with the first data object. The test results itself are excluded from the first proof and the first data object such that privacy of the test results is maintained. The first proof and the first data object are communicated to a receiving communication device from an enterprise communication device associated with the user and an enterprise.

Testing and other data communicated using trust models in decentralized and distributed systems

A method for sharing information has an assertion associated therewith such that the receiving communication device is able to verify the assertion without the sender revealing underlying data demonstrating the validity of the assertion. The assertion is derived from underlying data input to a pre-provisioned first algorithm. The assertion is encapsulated in a first data object by a PGE that controls an environment in which the first algorithm is executed. A first proof is generated that is configured to verify that the first algorithm used the underlying data to produce the assertion when provided to a PVE along with the first data object. The underlying data is excluded from the first proof and the first data object such that privacy of the underlying data is maintained. The information, the first proof and the first data object are sent to the receiving communication device from the sending communication device.

User identity and trust models in decentralized and distributed systems

A method for achieving consensus amongst a distributed and decentralized set of computers, devices or components in a network interacting via messaging is presented. The method does not rely on the availability of an overall ledger that is consulted for every interaction. Rather, the interacting components communicate directly with each other via messages that contain proofs of consistency that may be used to achieve local consistency amongst the interacting components. Local consistency guarantees global consistency. For regulatory and record keeping purposes, use of an overall ledger may be contemplated for regulatory and record keeping purposes. The latter may be updated by the interacting devices via an asynchronous updating mechanism.

Growing community of inventors

Basking Ridge, NJ, United States of America

Goutham Puppala