Zero Knowledge, Zkp, Fiat Shamir, Zero Knowledge Proofs.
• n! graphs isomorphic to G₀ or to G₁, which however collapse to n! many graphs in case G₀ and G₁ are isomorphic. So a random graph would have a higher chance of being isomorphic to one of the two in case they are not isomorphic. This gap in the probabilities can be exploited. The verifier can