--- a/handouts/ho06.tex	Tue Dec 30 21:59:47 2014 +0000
+++ b/handouts/ho06.tex	Wed Dec 31 01:49:20 2014 +0000
@@ -2,6 +2,7 @@
 \usepackage{../style}
 
 \begin{document}
+\fnote{\copyright{} Christian Urban, 2014}
 
 \section*{Handout 6 (Zero-Knowledge Proofs)}
 
@@ -379,9 +380,13 @@
 
 \subsubsection*{Using Modular Arithmetic for ZKP Protocols}
 
-Another NP-problem is to calculate discrete logarithms. It can
-be used by choosing public numbers $A$, $B$, $p$, and private
-$x$ such that
+While information can be encoded into graph isomorphisms, it
+is not the most convenient carrier of information. Clearly it
+is much easier to encode information into numbers. Let us look
+at zero-knowledge proofs that use numbers as secrets. For this
+the underlying NP-problem is to calculate discrete logarithms.
+It can be used by choosing public numbers $A$, $B$, $p$, and
+private $x$ such that
 
 \begin{center}
 $A^x \equiv B\; mod\; p$
@@ -406,6 +411,11 @@
 http://zk-ssh.cms.ac/docs/Zero_Knowledge_Prinzipien.pdf
 http://www.wisdom.weizmann.ac.il/~oded/PS/zk-tut02v4.ps
 
+socialist millionares problem
+http://en.wikipedia.org/wiki/Socialist_millionaire
+http://twistedoakstudios.com/blog/Post3724_explain-it-like-im-five-the-socialist-millionaire-problem-and-secure-multi-party-computation
+
+
 %%% Local Variables: 
 %%% mode: latex
 %%% TeX-master: t