gzz-commits
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Gzz-commits] manuscripts/Sigs article.rst


From: Benja Fallenstein
Subject: [Gzz-commits] manuscripts/Sigs article.rst
Date: Mon, 19 May 2003 16:40:43 -0400

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Benja Fallenstein <address@hidden>      03/05/19 16:40:43

Modified files:
        Sigs           : article.rst 

Log message:
        some security

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

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.133 manuscripts/Sigs/article.rst:1.134
--- manuscripts/Sigs/article.rst:1.133  Mon May 19 16:38:50 2003
+++ manuscripts/Sigs/article.rst        Mon May 19 16:40:43 2003
@@ -179,6 +179,19 @@
 The time to verify is also equal to the time of verifying `$N$` 
 signatures in the underlying scheme.
 
+*Security.* Assume that the underlying signature scheme
+is resistant against a `$q$`-time chosen message attack.
+Within the tree, each private key is only used to sign
+`$q$` messages: the public keys corresponding to the
+new private keys the random oracle determines from
+the old private key. This part of the system is thus
+secure against any kind of chosen message attack.
+
+At the leaves, the scheme is secure if the same
+leaf key is not used to sign more than `$q$` messages;
+security thus depends on the algorithm for choosing `$x$`.
+
+
 Full Digital Signature Feature Set without Trapdoor Functions
 =============================================================
 
@@ -207,7 +220,6 @@
 linear with `$N$` and the time to sign grows exponentially with `$n$`.
 Table [ref-tabtradeoff]_ shows the tradeoff in the characteristics
 of the derived schemes.
-
 
 ..  raw:: latex
 




reply via email to

[Prev in Thread] Current Thread [Next in Thread]