From a0c5f7b4dcacba8f066e5feeaf9186e512a41df6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=C3=96zg=C3=BCr=20Kesim?= <oec@kesim.org>
Date: Sat, 1 Jun 2024 15:53:26 +0200
Subject: [PATCH] added penalty for cheating

---
 eipsi2024/eipsi2024.tex | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/eipsi2024/eipsi2024.tex b/eipsi2024/eipsi2024.tex
index 2d92c6e..05d7ab3 100644
--- a/eipsi2024/eipsi2024.tex
+++ b/eipsi2024/eipsi2024.tex
@@ -527,10 +527,11 @@ Searching for functions \uncover<2->{with the following signatures}
 		\item trusts outcome with $\frac{\kappa-1}{\kappa}$ certainty,
 		\item i.e. $\Child$ has $\frac{1}{\kappa}$ chance to cheat.
 		\item<2->[$\implies$] \textbf{Gives us unlinkability at the price of (adjustable) uncertainty!}
+		\item<3-> (Cheating will be discouraged by penalizing it economically)
 	\end{itemize}
 
 	\vfill
-	\uncover<3->{Notes:
+	\uncover<4->{Notes:
 		\begin{itemize}
 			\item similar to the cut\&choose {\it refresh} protocol in GNU Taler
 			\item still need to define $\Derive()$ and $\Compare()$.