Zero Knowledge, Zkp, Fiat Shamir, Zero Knowledge Proofs.
interaction altogether (so only the prover communicates a message), we can put restrictions on what is communicated during the interaction by the verifier. Remember the two instances of interactive proofs mentioned earlier of graph isomorphism (GI) and graph non-isomorphism (GNI). For GI the prover