[Gzz-commits] manuscripts/Sigs article.rst

[Tuomas J. Lukka]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Tuomas J. Lukka <address@hidden>        03/05/18 08:28:33

Modified files:
        Sigs           : article.rst 

Log message:
        reyzin

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/Sigs/article.rst.diff?tr1=1.75&tr2=1.76&r1=text&r2=text

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.75 manuscripts/Sigs/article.rst:1.76
--- manuscripts/Sigs/article.rst:1.75   Sun May 18 08:27:38 2003
+++ manuscripts/Sigs/article.rst        Sun May 18 08:28:33 2003
@@ -181,6 +181,27 @@
 Reyzin
 ------
 
+We discuss only the second algorithm, based on subset-intractable
+functions.
+
+To sign `$b$` bits, choose `$t$` and `$k$` such that
+`$ {t \choose k} \ge b $`
+
+Parameters `$t$` and `$k$`.
+
+- private key: `$t$` random numbers
+
+- public key: hashes of the random numbers. Calculate `$t$` hashes
+
+- sign: Hash the message, split hash to `$k$` strings of `$\\log t$` bits.
+  use these as indices to say which numbers to reveal in the signature.
+  Calculate one hash.
+
+- verify: same deterministic part, check that revealed numbers hash right.
+
+Probability for successful forgery after `$r$` signatures:
+`$(rk/t)^k$` 
+
 ?
 
 Bleichenbacher-Maurer
@@ -334,7 +355,9 @@
        \parbox{\sw}{BiBa $(h,b,q,n,t,w)$}
            & $q$ & $b$ & $th$ & $wh$ & $h$ & $t$ & $?+wh$ & $w$ \\
        \parbox{\sw}{Reyzin one-way\cite{XXX} $(h,b,t,k)$ }
-           & $1$ & $b$ & $kh$ & $h$ & $h$ & $t$ & $?$ & $?+k$ \\
+           & $1$ & $b$ & $kh$ & $th$ & $h$ & $t$ & $1$ (XXX) & $1+k$ (XXX) \\
+           olean mouseClickHit(MouseEvent e, VobScene oldVobScene, float[] 
zout);
+
        \parbox{\sw}{Bleichenbacher-Maurer\cite{XXX (ASIACRYPT)}
                (h, n) 
                         }