A method may include splitting an original token into a first sub-token and a second sub-token, generating a first hash value of the first sub-token and a first randomness value, and generating a second hash value of the second sub-token and a second randomness value. The method may also include evaluating an NIZKP regarding the split, and sampling first and second signature keys and verification keys associated with the first and second sub-tokens, respectively. The method may additionally include generating first and second signed values of concatenations of the first and second hash values and the first and second verification keys, respectively, and signed using an initial signature key of a current owner of the original token. The method may additionally include sending the NIZKP, the first and second hash values, the first and second signed values, and the first and second verification keys to the blockchain.

A system includes a ledger on which a task giver may register a task. The task may include executable code. A task solver may accept the task and execute the code to produce a solver output that is recorded on the ledger. Verifiers may provide competing verifier outputs which may also be recorded on the ledger. The solver and verifiers may compare their outputs to determine if there is agreement. Agreement may signify consistent and accurate execution of the code. Disagreement may indicate the presence of errors. In some cases, the solver and verifiers may compete in a contention-based protocol where a solver may assert control of tokens where the solver identifies an error in verifier execution. Additionally or alternatively, a verifier may assert control of tokens where the verifier identifies an error in solver execution.

Systems, computer program products, and methods are described herein for enhanced authentication framework using multi-dimensional hashing. The present invention is configured to electronically receive, from a computing device of a user, a resource transfer request; retrieve, from an authentication database, a multi-dimensional hash for a first set of data files for the user and a user identification artifact; retrieve, from the computing device of the user, a second set of data files matching the user identification artifact; initiate an asynchronous hash processing engine on the second set of data files; generate, using the asynchronous hash processing engine, a multi-dimensional hash for the second set of data files; compare the multi-dimensional hash for the first set of data files with the multi-dimensional hash for the second set of data files to determine a match; and authorize the resource transfer request based on at least determining the match.

A computer-implemented method of operating an electronic draw system, the method comprising: obtaining a bit sequence in one or more blocks of one or more different blockchains; generating a seed value based on the bit sequence in the one or more blocks of the one or more different blockchains; applying a random number generator algorithm to calculate a sequence of random numbers using the seed value as input; and converting the sequence of random numbers to an electronic drawing output of the electronic draw system.

The disclosed exemplary embodiments include computer-implemented systems, devices, and processes that securely manage transfers of digital assets between computing devices using permissioned distributed ledgers. By way of example, an apparatus may receive, from a first device, a request to transfer a digital asset to a second device and a first digital signature applied to the request. Based on a validation of the first digital signature, the apparatus may approve the request and apply a second digital signature to the request and the first digital signature indicative of the approval of the request by the apparatus. The apparatus may also transmit the request, the first digital signature, and the second digital signature to a computing system, which may validate the first and second digital signatures and perform operations that record the first public key and asset data identifying the digital asset within at least one element of a distributed ledger.

The instant disclosure illustrates how the privacy and security of activities occurring on distributed ledger-based networks (DLNs) can be enhanced with the use of zero-knowledge proofs (ZKPs) that can be used to verify the validity of at least some aspects of the activities without private information related to the activities necessarily being revealed publicly. Methods and systems that are directed at facilitating the tracking and recovery of assets stolen on ZKP-enabled DLNs while preserving the confidentiality of the tokens are presented herein.

Generating a verifiable pairwise claim. Receiving a request for issuing a verifiable claim that is associated with a subject entity and is verifiable by one or more verifying entities. The request includes at least an encrypted portion using a particular type of encryptography. Verifying that the subject entity is associated with a subject of the verifiable claim based on decrypting the encrypted portion using the particular type of cryptography. In response to verifying that the subject entity is associated with the subject of the verifiable claim, issuing the verifiable claim that is structured to be verifiable only by the one or more verifying entities.

Examples are described for dynamically applying a digital watermark to a file, such as a dataset of genomic sequencing data. In one example, a method of dynamically applying a watermark to at least a portion of a file includes generating, using a secret key, a first random seed, generating, using the first random seed, an ordered pseudorandom set of integers, generating, using entity information and timing information, a second random seed, selecting, using the second random seed, a subset of the ordered pseudorandom set of integers, and modifying data at data locations in the file corresponding to at least a portion of the identifiers included in the subset to generate a watermarked file. The method may further include performing a check to determine whether the watermark is present in a file using a sequence of watermark elements that are generated based on the secret key.

Methods of data encryption using a mutating encryption key are disclosed. The methods generate an encryption key and utilize a codex to mutate or vary the encryption key value. The encryption key may be generated using a random number generator. The encryption key value in pre-mutation state, together with the codex, is used to generate the next valid value for the encryption key. Unencrypted message data may be used together with the codex to mutate the encryption key. A valid encryption key and the unencrypted or successfully deciphered message are thus required to mutate the encryption key to the next key post-mutation state at each end.

A method for creating a link between hyperledger blocks by a block link server. The method comprises receiving by a block link server executing on a computer system a first link creation message from a first network element, the first link creation message comprising first block information comprising a first hyperledger identifier and a first block identifier, both associated with a first hyperledger, receiving by the block link server a second link creation message, comprising second block information comprising a second hyperledger identifier and a second block identifier, both associated with a second hyperledger, storing by the block link server a link data structure comprising the first block information and the second block information, and sending by the block link server a link identifier of the link data structure to the first network element.