261 |
|
|
262 |
- tree of hashes, publish one public key and hashes of tree branches: |
- tree of hashes, publish one public key and hashes of tree branches: |
263 |
contributes `$s + r + h \\log k$` bits to sig and |
contributes `$s + r + h \\log k$` bits to sig and |
264 |
`$2k-1$` extra hashes to `$c_s$` and `$k-1$` to `$c_v$`. |
`$2k-1$` extra hashes to `$c_s$` and `$\\log k$` to `$c_v$`. |
265 |
|
|
266 |
|
|
267 |
- Our scheme, in the third alternative, maps a scheme |
- Our scheme, in the third alternative, maps a scheme |
276 |
|
|
277 |
- Arbitrary (pseudo-infinite, i.e. infinite wouldn't help any more) |
- Arbitrary (pseudo-infinite, i.e. infinite wouldn't help any more) |
278 |
number of keys, if for each *hash* its own private key for signing it! |
number of keys, if for each *hash* its own private key for signing it! |
279 |
This means that `$N \\log k \ge h$` |
This means that `$N \\log k \\ge h$` |
280 |
|
|
281 |
- this is a nice theoretical result: it *is* possible to sign anything |
- this is a nice theoretical result: it *is* possible to sign anything |
282 |
without trapdoors |
without trapdoors |