Are there any crypography schemes which rely on Graph Isomorphism not being in P? Are there any cryptography schemes having correctness relying on Graph Isomorphism not being in P?  If I should ask this question in the CS Theory area, I will migrate it.

Thanks.
There is an elegant example of zero knowledge proof for graph isomorphism. The prover sends a randomly relabled graph and the verifier requests mapping to one of the originals. It is a very simple to understand and prove zero knowledge proof. However I don't believe anyone ever used this for authentication or such.
Obviously we now know graph isomorphism isn't hard after all making all these not very useful.