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

Add solution for 5c

Browse Source
This commit is contained in:
Tobias Eidelpes 2022-06-21 19:37:09 +02:00
parent 63bf201d2c
commit 8f1bcd7bbe
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

@ -289,7 +289,16 @@
isomorphic to $\mathcal{G}$. If it is, the verifier accepts, otherwise it isomorphic to $\mathcal{G}$. If it is, the verifier accepts, otherwise it
rejects. rejects.
\item \TODO \item The domain of the commitment scheme is the set of graphs isomorphic to
$\mathcal{G}$ and the range is the number ($2^{130}$) of isomorphic
graphs. The scheme consists of three phases: setup, commitment and
opening. The setup phase consists of choosing an appropriate random
permutation $\psi$ from the set of isomorphisms on $\mathcal{G}$. The
commitment phase takes the isomorphism $\psi$ and the graph $\mathcal{G}$
as input and produces a commitment $\mathcal{G}'$. The opening phase takes
an isomorphism $\mathsf{resp}$ and another graph
$\mathcal{G}_{\mathsf{ch}}$ isomorphic to $\mathcal{G}$ as input and
outputs $\top$ if the result matches $\mathcal{G}'$ and $\bot$ otherwise.
\item \TODO \item \TODO