A network controller configured to provide network access to client devices, receives a network access request from a client device. The network access request includes a media access control (MAC) address of the client device and information about a first private key. The network controller sends to a server an authentication request, which includes the MAC address of the client device. The network controller receives an authentication response from the server, which includes a second private key. The network controller determines whether the first private key is the same as the second private key. In response to determining that the first private key is different from the second private key, network access is denied to the client device, and in response to determining that the first private key is the same as the second private key, network access is granted to the client device.

A system and a method are disclosed for enabling cross-chain transactions between a first blockchain and a second blockchain. A certificate for a cross-chain transaction processed by a sidechain is received. Additionally, a verification key associated with the sidechain is received. Moreover, information related to the cross-chain transaction processed by the sidechain is received. Based on the verification key associated with the sidechain, the validity of the certificate is verified using a zero-knowledge proof. In response to determining the validity of the certificate, the cross-chain transaction is processed based on the received information related to the cross-chain transaction processed by the sidechain.

A method for searching an encrypted file comprises: receiving a query from a first device of a set of devices; tokenizing the query; searching the encrypted file, without decrypting the file, for the tokenized query; aggregating results of the search; and outputting the aggregated results. The searching includes checking a bloom filter of an index of the encrypted file. The index includes a file public secret (R), a proof of work for the file secret (Rproof), a multipart threshold public encryption key (LKe-pub), a multipart threshold public search key (LKs-pub), and the bloom filter. The bloom filter including index values that are elliptic curve paired between a curve-hashed token of the encrypted file and the product of the encrypted file's ephemeral secret value (r) and the multipart threshold public search key (LKs-pub).

A communication method for the secure management of keys and identities of an Object manufactured by a Manufacturer having a Manufacturer key pair (Ks.sub.man, Kp.sub.man) and a client having a Client key pair (Ks.sub.client, Kp.sub.client), that is carried out at least partially on a decentralized blockchain database by generating by the Manufacturer two diversified symmetric keys from its key pair and from diversifiers, sharing keys with the object, publishing and recording the decentralized identifier (DID) in the database, wherein when a Client purchases the object from the Manufacturer, providing the identifier of the object DID by the Manufacturer, updating the blockchain, when the object is initially switched on, auto-enrolling by generating new symmetric keys, sending two new encrypted diversifiers to the client with the public client key, publishing and recording new encrypted diversifiers with the public client key in the blockchain.

A method for electing a leader in a blockchain network using a role-based consensus protocol includes generating a new block by a node in the blockchain network and computing an effective resources metric for the node based on a role of the node, resources of the node and a role-based weight profile for the resources of the node. Eligibility proof of the node is generated based on eligibility information that includes a blockheader of the new block, an identity of the node, a difficulty target, T, of the blockchain network, and the effective resources metric. The new block and the eligibility proof is broadcast to the blockchain network, to enable one or more other nodes in the blockchain network to verify eligibility of the node as a leader.

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.

In one set of embodiments, each server executing a secure multi-party computation (MPC) protocol can receive shares of inputs to the MPC protocol from a plurality of clients, where each input is private to each client and where each share is generated from its corresponding input using a threshold secret sharing scheme. Each server can then verify whether the shares of the plurality of inputs are valid/invalid and, for each invalid share, determine whether a client that submitted the invalid share or a server that holds the invalid share is corrupted. If the client that submitted the invalid share is corrupted, each server can ignore the input of that corrupted client during a computation phase of the MPC protocol. Alternatively, if the server that holds the invalid share is corrupted, each server can prevent that corrupted server from participating in the computation phase.

A method of cryptographically secured decentralized testing includes receiving, by a computing device and from a secure test apparatus, an output of a cryptographic function of a secret test result identifier, authenticating the output, and recording, in a data repository, an indication of a test result as a function of the output.

In some embodiments, a method includes storing data associated with fungible assets in a distributed ledger database. The method includes dividing fungible tokens into a first set of groups of fungible tokens based on the data and sending, via the distributed ledger-based network and based on an asymmetric cryptography key pair, each group of fungible tokens from the first set of groups of fungible tokens to a communication device from the first set of communication devices to cause the second plurality of communication devices to send, to a designated recipient communication device, non-fungible tokens for each group of fungible tokens from the second set of groups of fungible tokens. The first set of groups of fungible tokens is divided into a second set of groups of fungible tokens and received at a second set of communication devices.

Described is an approach for an improved method, system, and computer program product that performs zero-knowledge proof of knowledge of user identification and/or authentication for a decentralized, trustless storage and management of user identification and/or authentication using one or more distributed ledger systems.