From 8f1bcd7bbe063da550caceb542c840b16caec1fe Mon Sep 17 00:00:00 2001 From: Tobias Eidelpes Date: Tue, 21 Jun 2022 19:37:09 +0200 Subject: [PATCH] Add solution for 5c --- exam/ex.tex | 11 ++++++++++- 1 file changed, 10 insertions(+), 1 deletion(-) diff --git a/exam/ex.tex b/exam/ex.tex index f7ff722..3b2a9be 100644 --- a/exam/ex.tex +++ b/exam/ex.tex @@ -289,7 +289,16 @@ isomorphic to $\mathcal{G}$. If it is, the verifier accepts, otherwise it 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