Module chain_crypto::algorithms::zkps::dleq

source ·
Expand description

Non-interactive Zero Knowledge proof of Discrete Logarithm EQuality (DLEQ).

The proof is the following:

NIZK{(base_1, base_2, point_1, point_2), (dlog): point_1 = base_1^dlog AND point_2 = base_2^dlog}

which makes the statement, the two bases base_1 and base_2, and the two points point_1 and point_2. The witness, on the other hand is the discrete logarithm, dlog.

Structs

  • Zkp
    Proof of correct decryption. Note: if the goal is to reduce the size of a proof, it is better to store the challenge and the response. If on the other hand we want to allow for batch verification of proofs, we should store the announcements and the response.