A decentralized property system and method allow ownership rights to be transferred directly from one party to another without requiring a central authority to operate or secure the system. Digital signatures provide a method to issue and transfer titles (“bitmarks”) within the system. Using a blockchain algorithm, distributed consensus on asset ownership can be achieved.

To provide a terminal device that can share a session key for use in encryption communication with multiple terminal devices at a certain timing without relying on an existing server device. The terminal device includes: a list/request sending unit that, when the terminal device operates as an owner device, generates a key distribution request, signs the key distribution request, and transmits the key distribution request to a key distribution management device; a participation request sending unit that, when the terminal device operates as a general device, generates a participation request, signs the participation request, and transmits the participation request to the key distribution management device; a session key generating unit that executes an authentication-based multipoint key distribution algorithm of server-client type in cooperation with another terminal device participating in the session and with the key distribution management device to generate a session key; and a post-confirmation unit that, when the session key has been normally generated, transmits a success notice to the key distribution management device and receives a collective notice from the key distribution management device.

A method for execution by a dispersed storage and task (DST) client module includes issuing a read threshold number of read slice requests are issued to storage units of the set of storage units. One or more encoded slices of a selected read threshold number of encoded slices are received. When a next encoded data slice of a decode threshold number of encoded data slices is received within a response timeframe, outputting of the next encoded data slice is initiated. When the next encoded data slice is not received within the response timeframe, receiving of another decode threshold number of encoded slices of the set of encoded slices is facilitated. The other decode threshold number of encoded slices are decoded to produce recovered encoded data slices, where the recovered encoded data slices includes at least a recovered next encoded data. Outputting of the recovered next encoded data slice is initiated.

Methods and systems are disclosed for managing registrations of computers. The methods and systems provide a registration tool that may be used to automatically register the computers. For each computer to be registered, information uniquely identifying the computer is collected and sent to a remote registration server. The information is then used by the remote registration server to perform the registration on behalf of the computer. The registration may be with a software vendor, a third-party database, or with the remote registration server itself in some cases. The registration server thereafter returns a registration code or other information to the computer to complete the registration. Such an arrangement allows the registration process to be controlled from a central location.

The present teaching relates to method, system, medium, and implementation for secure data management by a service provider. A request is first received for carrying out a transaction with a user and one or more data items associated with the user are then determined that need to be validated prior to the transaction. A request is then sent to the user seeking to validate the one or more data items. When a cloaked identifier is received from the user with information related to a trusted party, the cloaked identifier is then sent to the trusted party with a request for a validation response. When the validation response is received with an indication that the one or more data items are validated, the transaction with the user is carried out.

An example operation may include one or more of receiving a location of an output stored on a data structure of a blockchain, where the location comprises a path of hashes generated by a reduced-step hash instead of a full-step hash of the blockchain, performing an approximate hash verification on the path of hashes based on the reduced-step hash values to verify whether the output is unused, and in response to a determination that the output is unused as a result of the approximate hash verification, approving a use of the output by a client associated with the output.

A trust broker is disclosed for a data confidence fabric. The trust broker evaluates the trustworthiness of data flowing through a network that includes a data confidence fabric. The trust broker evaluates a baseline confidence score and generates a workorder to improve the baseline confidence score in a measurable way. The trust broker may implement the workorder and ensure that the trust improves in the data confidence fabric.

An improved blockchain implementation that reduces application transaction processing bottlenecks for applications that operate on a decentralized network. For example, if an application operating on a decentralized network becomes sufficiently popular, an existing blockchain can be split into the original blockchain and an application-specific chain (or app chain) that includes blocks that only store transactions for the sufficiently popular application. A peer that is not interested in tracking transactions for the sufficiently popular application, however, does not need to track the application-specific chain. Thus, the peer can reduce the number of computational operations that are performed by simply storing block data for blocks in the original blockchain and not for blocks in the application-specific chain.

According to an embodiment of a first aspect of the invention, there is provided a distributed network comprising a plurality of subnets. Each of the plurality of subnets comprises a plurality of nodes. The network is configured to run a set of computational units and to assign each of the computational units to one of the plurality of subnets according to a subnet-assignment, thereby creating an assigned subset of the set of computational units for each of the subnets. The network is further configured to run on each node of the plurality of subnets the assigned subset of the computational units and to replicate the assigned subsets of the computational units across the respective subnets. The network is further configured to exchange unit-to-unit messages between the computational units via a messaging protocol based on the subnet-assignment.

Further aspects of the invention relate to a corresponding computer-implemented method, a node, a computer program product and a software architecture.

According to an embodiment of a first aspect of the invention, there is provided a distributed network comprising a plurality of nodes. Each of the plurality of nodes is configured to run one or more computational units comprising its own unit state. The network is configured to individually execute, by an execution subset of the plurality of nodes, s set of execution messages in a deterministic manner, thereby mutating the unit states of one or more of the computational units of the execution subset. The network is further configured to regularly make, by the nodes of the execution subset, a read snapshot of the unit states of the one or more computational units of the execution subset and to provide, by one or more nodes of the execution subset, user access to the read snapshot.

Further aspects of the invention relate to a corresponding computer-implemented method, a node, a computer program product and a software architecture.