Zero Knowledge, Zkp, Fiat Shamir, Zero Knowledge Proofs.
wanted to convince the verifier that two given graphs G₀ and G₁are isomorphic. For this he choses a permutation of one of the graphs and the verifier flipps a coin and asking the prover to exhibit an isomorphism to G₀ or G₁ accordingly. For GNI, the verifier randomly chooses one of G₀ or G₁ and