Non-interactive ZKPs

The protocol we are going to analyze in this section is a non-interactive ZKP. This means that the prover has to demonstrate the statement, assuming that the verifier does not know the solution (the content of the statement) and that the verification is made without any exchange of information from the verifier.

The scheme could be summed up as follows:

Let’s take this problem into consideration: Peggy states to know [m], encrypted with RSA, as follows:

Keep in mind that Peggy doesn’t want to reveal the content [m] to Victor.

Here, (N, c, e) are public parameters, and [m] is secret.

Important Note

Remember, I always denote the secret elements of the functions with the [...] symbols.

In order to demonstrate the statement to Victor, the following protocol is executed:

1. Peggy chooses a random integer, [r₁] (which she keeps secret), and calculates the inverse of r₁ (represented as INV[r₁]...