[Gzz-commits] manuscripts/Sigs article.rst

[Tuomas J. Lukka]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Tuomas J. Lukka <address@hidden>        03/05/17 15:07:39

Modified files:
        Sigs           : article.rst 

Log message:
        publishing

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

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.49 manuscripts/Sigs/article.rst:1.50
--- manuscripts/Sigs/article.rst:1.49   Sat May 17 15:04:02 2003
+++ manuscripts/Sigs/article.rst        Sat May 17 15:07:39 2003
@@ -27,13 +27,11 @@
 
 On a theoretical level, our scheme allows the construction
 of a feasible algorithm with the full digital signature feature
-set without using a trapdoor function.
+set without using a trapdoor function, i.e. without
+relying on
+number-theoretic assumptions such as the hardness
+of factoring or discrete logs.
 
-Our scheme has applications in long-term digital publishing.
-Unlike signature schemes like RSA and DSA, it does not
-rely on number-theoretic assumptions like the hardness
-of factoring or discrete logs, areas in which substantial
-cryptoanalytical improvements continue to be made.
 As long as the random oracle, used to generate the new private keys
 and to implement the one-time signatures, 
 isn't broken, an exhaustive
@@ -315,18 +313,13 @@
   it *is* possible to 
   revoke only that leaf, not the whole key.
 
-Applicability to Digital Publishing
-===================================
-
-In long-term digital publishing, the time limits on normal digital signatures
-are 
-
-foo
-
 Conclusion
 ==========
 
 - key idea: using the deterministic bit string for each privkey
+
+In long-term digital publishing, the time limits on normal digital signatures
+are 
 
 foo