From 63bf201d2c615f1b1492d51c2549958d9d25fc84 Mon Sep 17 00:00:00 2001 From: Tobias Eidelpes Date: Tue, 21 Jun 2022 19:21:16 +0200 Subject: [PATCH] Add solution for 5b --- exam/ex.tex | 11 ++++++++++- 1 file changed, 10 insertions(+), 1 deletion(-) diff --git a/exam/ex.tex b/exam/ex.tex index 91a422f..f7ff722 100644 --- a/exam/ex.tex +++ b/exam/ex.tex @@ -278,7 +278,16 @@ \phi(\mathcal{G}_b)$. $\mathcal{B}$ can then take this isomorphism and apply it to its own problem to obtain the solution. - \item \TODO + \item First, the prover takes a random isomorphism and generates a + permutation of the given graph $\mathcal{G}$. The resulting graph is the + commitment which is sent to the verifier. The verifier then picks a random + graph from the set of graphs isomorphic to $\mathcal{G}$ and sends it to + the prover. The prover takes this graph and calculates the permutation + needed to arrive at the original graph $\mathcal{G}$. This is the response + which is sent to the verifier. The verifier can then use the response to + check if the graph it picked earlier (in the challenge) is actually + isomorphic to $\mathcal{G}$. If it is, the verifier accepts, otherwise it + rejects. \item \TODO