Module hyrax

Source
Expand description

A polynomial commitment scheme based on the hardness of the discrete logarithm problem in prime-order groups. This is a Fiat-Shamired version of the PCS described in the Hyrax paper [WTsTW17], with the difference that, unlike in the cited reference, the evaluation of the polynomial at the point of interest is indeed revealed to the verifier at the end.

Structs§

HyraxCommitment
Hyrax commitment to a polynomial consisting of one multi-commit per row of the coefficient matrix
HyraxCommitmentState
Hyrax Commitment state: matrix of polynomial coefficients and list of random scalars used in each of the row-wise Pedersen commitments
HyraxPC
Hyrax polynomial committment scheme: A polynomial commitment scheme based on the hardness of the discrete logarithm problem in prime-order groups. This is a Fiat-Shamired version of the PCS described in the Hyrax paper [WTsTW17].
HyraxProof
Proof of a Hyrax opening, containing various commitments and auxiliary values generated randomly during the opening
HyraxUniversalParams
UniversalParams amounts to a Pederson commitment key of sufficient length

Constants§

PROTOCOL_NAME
String of bytes used to seed the randomness during the setup function. Note that the latter should never be used in production environments.

Type Aliases§

HyraxCommitterKey
The committer key, which coincides with the universal parameters
HyraxVerifierKey
The verifier key, which coincides with the committer key