27 |
|
|
28 |
On a theoretical level, our scheme allows the construction |
On a theoretical level, our scheme allows the construction |
29 |
of a feasible algorithm with the full digital signature feature |
of a feasible algorithm with the full digital signature feature |
30 |
set without using a trapdoor function. |
set without using a trapdoor function, i.e. without |
31 |
|
relying on |
32 |
|
number-theoretic assumptions such as the hardness |
33 |
|
of factoring or discrete logs. |
34 |
|
|
|
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. |
|
35 |
As long as the random oracle, used to generate the new private keys |
As long as the random oracle, used to generate the new private keys |
36 |
and to implement the one-time signatures, |
and to implement the one-time signatures, |
37 |
isn't broken, an exhaustive |
isn't broken, an exhaustive |
313 |
it *is* possible to |
it *is* possible to |
314 |
revoke only that leaf, not the whole key. |
revoke only that leaf, not the whole key. |
315 |
|
|
|
Applicability to Digital Publishing |
|
|
=================================== |
|
|
|
|
|
In long-term digital publishing, the time limits on normal digital signatures |
|
|
are |
|
|
|
|
|
foo |
|
|
|
|
316 |
Conclusion |
Conclusion |
317 |
========== |
========== |
318 |
|
|
319 |
- key idea: using the deterministic bit string for each privkey |
- key idea: using the deterministic bit string for each privkey |
320 |
|
|
321 |
|
In long-term digital publishing, the time limits on normal digital signatures |
322 |
|
are |
323 |
|
|
324 |
foo |
foo |
325 |
|
|
326 |
.. bibliography:: gzigzag |
.. bibliography:: gzigzag |