Non-interactive zero-knowledge proof
common random string shared between the prover and the verifier is enough to achieve computational zero-knowledge without requiring interaction
common random string shared between the prover and the verifier is enough to achieve computational zero-knowledge without requiring interaction