2 Merlin Presents Arthur Graph G V E Claims G Contains Independent Set Size K Merlin Knows Q37118265

2. Merlin presents Arthur with a graph G-(V, E) and claims that G contains an independent set I of size k that only Merlin knows. Arthur wishes to verify this fact, however Merlin does not want to reveal the independent set to Arthur, so they agree to the following Proof Protocol: i) Merlin chooses a random permutation of vertices π ← perm(1, VB. and then com- putes G, r(G), such that if

OR

 

OR