Abstract: Various systems for providing secure signatures based on post-quantum computing are provided. The systems allow may one-time signatures (“OTS”) to be based on the same public key. The systems provide for efficient use of OTS signatures with blockchains. The systems provide for rapid verification of signatures. The systems provide for caching for Winternitz-based OTS schemes and for use of short checksum.

Abstract: Various aspects of the subject technology relate to systems, methods, and machine-readable media for providing encryption of data with data separation. Various aspects may include performing determining a request payload for a communication from a client device. Aspects may also include creating a first reference data object for a first subset of data fields of the request payload. Aspects may also include creating a second reference data object for a second subset of data fields. Aspects may also include replacing a first value of the first subset with a first reference value. Aspects may include replacing a second value of the second subset with a second reference value. Aspects may include encrypting a response payload with the first reference data object and the second reference data object in an encrypted text-based structured data file format with a cryptographic key.

Abstract: Methods, systems, and storage media for minting a digital collectible are disclosed. Exemplary implementations may: receive a request from a user to generate a digital collectible comprising user-created content; validate the user-created content was created by the user; receive a designation of a number of copies of the digital collectible that are to be generated; generate the digital collectible based on the user-created content; and record the digital collectible to a blockchain.

Abstract: A system for generating a hash tree with components grouped by component type is provided. Each non-leaf node of the hash tree has a hash of the hashes of its child nodes, and a leaf node has a hash of a component of the hash tree. The system generates, for each component type, a component subtree for that component type based on the leaf nodes that have hashes of the components of that component type. The system then generates a root subtree of the hash tree based on leaf nodes that are the root nodes of the component subtrees. The combination of the root subtree and the component subtrees form the hash tree.

Abstract: A system for confirming an authorization to consume an output of a transaction based on multiple signatures with different authority weights is provided. The system confirms the authorization to consume the output when the combined authority weights of one or more authorities that provide their authorizations satisfy a threshold weight. The authority weight for each authority and the threshold weight are identified in an authorization specification that specifies the criterion for the authorization of a matter. The authorization specification also specifies authorization verification information for each authority. When the sum of the authority weights of the authorities whose authorizations have been verified is greater than or equal to the threshold weight, the system confirms the authorization to consume the output.

Abstract: A system for generating a hash tree with components grouped by component type is provided. Each non-leaf node of the hash tree has a hash of the hashes of its child nodes, and a leaf node has a hash of a component of the hash tree. The system generates, for each component type, a component subtree for that component type based on the leaf nodes that have hashes of the components of that component type. The system then generates a root subtree of the hash tree based on leaf nodes that are the root nodes of the component subtrees. The combination of the root subtree and the component subtrees form the hash tree.

Abstract: A system for confirming an authorization to consume an output of a transaction based on multiple signatures with different authority weights is provided. The system confirms the authorization to consume the output when the combined authority weights of one or more authorities that provide their authorizations satisfy a threshold weight. The authority weight for each authority and the threshold weight are identified in an authorization specification that specifies the criterion for the authorization of a matter. The authorization specification also specifies authorization verification information for each authority. When the sum of the authority weights of the authorities whose authorizations have been verified is greater than or equal to the threshold weight, the system confirms the authorization to consume the output.

Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods for generating decentralized, privacy-preserving cryptographic proofs of liabilities in connection with immutable databases. In particular, in one or more embodiments, the disclosed systems enable an entity to transparently and accurately report its total amount of liabilities, obligations or other data related to fungible negative reports without exposing any user data or sensitive system data (e.g., the liabilities structure). Furthermore, the disclosed systems can generate a cryptographic proof of liability that allows individual users to independently verify that their committed liability is included in a reported total liability.

Abstract: Various systems for providing secure signatures based on post-quantum computing are provided. The systems allow may one-time signatures (“OTS”) to be based on the same public key. The systems provide for efficient use of OTS signatures with blockchains. The systems provide for rapid verification of signatures. The systems provide for caching for Winternitz-based OTS schemes and for use of short checksum.

Abstract: Various systems for providing secure signatures based on post-quantum computing are provided. The systems allow may one-time signatures (“OTS”) to be based on the same public key. The systems provide for efficient use of OTS signatures with blockchains. The systems provide for rapid verification of signatures. The systems provide for caching for Winternitz-based OTS schemes and for use of short checksum.

Abstract: Various systems for providing secure signatures based on post-quantum computing are provided. The systems allow may one-time signatures (“OTS”) to be based on the same public key. The systems provide for efficient use of OTS signatures with blockchains. The systems provide for rapid verification of signatures. The systems provide for caching for Winternitz-based OTS schemes and for use of short checksum.

Abstract: A system for confirming an authorization to consume an output of a transaction based on multiple signatures with different authority weights is provided. The system confirms the authorization to consume the output when the combined authority weights of one or more authorities that provide their authorizations satisfy a threshold weight. The authority weight for each authority and the threshold weight are identified in an authorization specification that specifies the criterion for the authorization of a matter. The authorization specification also specifies authorization verification information for each authority. When the sum of the authority weights of the authorities whose authorizations have been verified is greater than or equal to the threshold weight, the system confirms the authorization to consume the output.

Abstract: A system for generating a hash tree with components grouped by component type is provided. Each non-leaf node of the hash tree has a hash of the hashes of its child nodes, and a leaf node has a hash of a component of the hash tree. The system generates, for each component type, a component subtree for that component type based on the leaf nodes that have hashes of the components of that component type. The system then generates a root subtree of the hash tree based on leaf nodes that are the root nodes of the component subtrees. The combination of the root subtree and the component subtrees form the hash tree.

Abstract: A method for organizing a secure multi-participant online contest is disclosed. The method includes creating encrypted contest data parts with a set of encryption keys that have a corresponding set of decryption keys. The contest starting time is announced and the encrypted contest data parts are made available to a group of contest participants. The decryption keys are transmitted to the contest participants in accordance to a contest time flow. In some examples, the encrypted contest data parts allows for contests that include multi-step and multi-part questions.