13 |
|
|
14 |
Abstract: |
Abstract: |
15 |
|
|
16 |
- Full DS feature set |
- recursive application of one-time signature to sign |
17 |
|
nodes along a single branch of a tree of deterministically |
18 |
- unlimited time |
generated pubkeys |
|
|
|
|
- hash function strength, no unproven complexity results |
|
19 |
|
|
20 |
- In conjunction with Merkle hash trees, used to generate |
- In conjunction with Merkle hash trees, used to generate |
21 |
a family of trade-offed schemes whose time and space characteristics |
a family of trade-offed schemes whose time and space characteristics |
22 |
depend linearly on the underlying schemes'. |
depend linearly on the underlying one-time sig schemes'. |
23 |
|
|
24 |
|
- good |
25 |
|
|
26 |
|
- unlimited time |
27 |
|
|
28 |
|
- hash function strength, no unproven complexity results |
29 |
|
|
30 |
|
- existentially unforgeable in adaptive chosen message attack, |
31 |
|
even if underlying one-time-signature algorithm isn't |
32 |
|
|
33 |
|
- instance: |
34 |
|
|
35 |
|
- Full DS feature set |
36 |
|
|
37 |
|
|
38 |
|
- XXX KB |
39 |
|
|
40 |
|
- XXX hashes to create, XXX hashes to verify |
41 |
|
|
42 |
|
- probabilistic instance |
43 |
|
|
44 |
|
- with p XXX safe to sign up to XXX docs |
45 |
|
|
|
- recursive application of |
|
46 |
|
|
47 |
|
|
48 |
|
|