From 4da544ae010b265f33bc870aef91ec47bb8c63d4 Mon Sep 17 00:00:00 2001
From: Tobias Eidelpes <tobias@eidelpes.info>
Date: Tue, 28 Jun 2022 11:43:46 +0200
Subject: [PATCH] Add computational hiding for 5d

---
 exam/ex.tex | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/exam/ex.tex b/exam/ex.tex
index f2a0a24..0b59747 100644
--- a/exam/ex.tex
+++ b/exam/ex.tex
@@ -330,6 +330,11 @@
       two different graphs to the same output which corresponds to solving the
       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
       $G=\phi_{ch}^{-1}(G_{ch})$ and therefore $G'=\psi(\phi_{ch}^{-1}(G_{ch}))$
       so the verifier will always accept.