zenon/applied-cryptography
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Add solution for 5b

Browse Source
This commit is contained in:
Tobias Eidelpes 2022-06-21 19:21:16 +02:00
parent a340ef443e
commit 63bf201d2c
1 changed files with 10 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
exam/ex.tex
View File

@ -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