Verifier generated common reference string for zero-knowledge proofs

A method for performing a cryptographic operation, comprising:

• receiving, from a verifier node and at a prover node, a message comprising a common reference string;
• executing a zero-knowledge proof using the common reference string;
• transmitting, to the verifier node, one or more commitments of respective outputs of the zero-knowledge proof, the one or more commitments of the respective outputs configured to hide the respective outputs from the verifier node until the respective outputs are revealed to the verifier node;
• receiving, after transmitting the one or more commitments and from the verifier node, a random value associated with the common reference string;
• determining whether the common reference string is generated using the random value received from the verifier node;
• and
• aborting the cryptographic operation or revealing the one or more commitments based at least in part on a result of the determining.

An apparatus for management of a cryptographic operation, comprising:

• one or more memories storing processor-executable code;
• and
• one or more processors coupled with the one or more memories and individually or collectively operable to execute the code to cause the apparatus to:
• generate, at a verifier node, a common reference string using a random value;
• transmit, to a prover node, a message comprising the common reference string;
• receive, from the prover node, one or more commitments of respective outputs of a zero-knowledge proof executed by the prover node, the one or more commitments of the respective outputs configured to hide the respective outputs from the verifier node until the respective outputs are revealed to the verifier node;
• transmit, after receiving the one or more commitments, the random value that is used for generating the common reference string;
• receive, from the prover node, an indication that the one or more commitments of the respective outputs are revealed;
• regenerate the zero-knowledge proof using the common reference string;
• and
• verify, after receiving the indication that the one or more commitments are revealed and regenerating the zero-knowledge proof, execution of the zero-knowledge proof by the prover node.