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

Add computational hiding for 5d

Browse Source
This commit is contained in:
Tobias Eidelpes 2022-06-28 11:43:46 +02:00
parent bf2d150d54
commit 4da544ae01
1 changed files with 5 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
exam/ex.tex
View File

@ -330,6 +330,11 @@
two different graphs to the same output which corresponds to solving the two different graphs to the same output which corresponds to solving the
CGI problem. CGI problem.
Computational hiding: Two commitments are computationally
indistinguishable from each other as long as the adversary is PPT.
Otherwise, the adversary could distinguish between the two distribution
ensembles.
\item If $G_{ch}=\phi_{ch}(G)$ and $G'=\psi(G)$, it follows that \item If $G_{ch}=\phi_{ch}(G)$ and $G'=\psi(G)$, it follows that
$G=\phi_{ch}^{-1}(G_{ch})$ and therefore $G'=\psi(\phi_{ch}^{-1}(G_{ch}))$ $G=\phi_{ch}^{-1}(G_{ch})$ and therefore $G'=\psi(\phi_{ch}^{-1}(G_{ch}))$
so the verifier will always accept. so the verifier will always accept.