Abstract: Implementations of the present disclosure are directed to a universal distributed key generation (DKG) between computing devices for private key sharing in cryptographic networks. The universal DKG of the present disclosure overcomes deficiencies of traditional approaches to DKG in generating key pairs. The universal DKG provides time- and resource-efficient generation of cryptographic keys for multiple elliptic curves to enable entities to transact in multiple cryptographic networks. More particularly, the universal DKG simplifies management of cryptographic keys, while accelerating the key generation process without compromising security.

Abstract: Certain aspects of the present disclosure provide techniques for converting a bridged token on a blockchain to a native token on the blockchain. An example method generally includes pausing a token bridge between a first blockchain and a second blockchain. Minting privileges on the second blockchain are adjusted such that a designated user is granted privileges to control token minting on the second blockchain and no other users are allowed to control token minting on the second blockchain. It is validated that a quantity of a bridged token has remained unchanged since a freeze time at which the token bridge was paused. Based on validating that the quantity of the bridged token has remained unchanged since the freeze time, the bridged token is converted to a native token existing on the second blockchain.

Abstract: Certain aspects of the disclosure provide a method for verifiable key rotation of an encryption key. The method includes generating a ciphertext by encrypting a plaintext with a homomorphic probabilistic encryption scheme based on a first key. The method further includes generating an updating token based on a difference between the homomorphic probabilistic encryption scheme based on a second key and generating a second ciphertext by encrypting the first ciphertext with the updating token. The method further includes validating the key rotation by selecting a set of second ciphertext blocks from the second ciphertext; reverting the set of second ciphertext blocks with the updating token to a set of third ciphertext blocks; and computing a Hamming distance between blocks of the set of second ciphertext blocks and the corresponding set of third ciphertext blocks.

Abstract: Implementations of the present disclosure are directed to star distributed key generation (SDKG) between computing devices for private key sharing in cryptographic networks, where a computing device is the center of a star graph of multiple computing devices and functions as a 2-out-of-3 DKG protocol that can is robust against multiple types of corruptions.

Abstract: Certain aspects of the disclosure provide a method for performing a blockchain-based transaction, comprising: broadcasting a burn operation on a first blockchain in a first message including a first recipient address and an amount of cryptocurrency to be burned; receiving an attestation of the first message from an attestation service; rebroadcasting the burn operation on the first blockchain in a second message including the attestation of the first message and a second recipient address; receiving an attestation of the second message from the attestation service; and causing the amount of cryptocurrency to be minted on a second blockchain.

Abstract: The present disclosure relates to systems, methods, and non-transitory computer readable storage media for implementing a scalable, secure, efficient, and adaptable distributed digital ledger transaction network. Indeed, the disclosed systems can reduce storage and processing requirements, improve security of implementing computing devices and underlying digital assets, accommodate a wide variety of different digital programs (or “smart contracts”), and scale to accommodate billions of users and associated digital transactions. For example, the disclosed systems can utilize a host of features that improve storage, account/address management, digital transaction execution, consensus, and synchronization processes. The disclosed systems can also utilize a new programming language that improves efficiency and security of the distributed digital ledger transaction network.

Abstract: According to examples, a system for enabling user authentication may include a processor and a memory storing instructions. The processor, when executing the instructions, may cause the system to receive user login credentials and initiate a user authentication process by receiving a challenge configured using an attribute of a system including the processor. The processor executes further instructions to determine the attribute value and to derive a zero-knowledge proof in response to the challenge. The zero-knowledge proof is provided to the challenge issuer to access services of one or more applications.

Abstract: Methods, systems, and apparatus for verifying quantum randomness. In one aspect a computing device receives data from a quantum computer. The data includes a timestamp, a binary-valued vector, and a predicted response to a challenge string. The predicted response to the challenge string is generated using a regression model that has been trained to fit LPN instances as a linear function, where the LPN instances are constructed using a physically unclonable function. The computing device determines a parity of a random number output by a public source of randomness at a time specified by the timestamp and performs either a generation round or a test round based on the parity to verify the randomness of a bit generated by the quantum computer. The generation round uses the data to verify a preimage of the binary-valued vector and the test round uses the data to verify an equation.

Abstract: Methods, systems, and apparatus for generating an encryption key. In one aspect, a method includes the generating and sending, by a first device, a stream of random challenges to other devices. Each other device processes, by a physically unclonable function (PUF) included in the device, the stream of random challenges twice to obtain pairs of responses and computes a first Bernoulli matrix vector. Each other device generates a first LPN instance using a pre-stored public matrix, a partial encryption key, and the first Bernoulli error matrix, and sends the first LPN instance to the first device. The first device computes a threshold number of the first LPN instances and an estimated combined error of PUFs included in the other devices. The first device generates an encryption key by recovering a summation of each partial encryption key encoded in the threshold number of first LPN instances.