239 |
} |
} |
240 |
\end{table*} |
\end{table*} |
241 |
|
|
242 |
Effect of boosting |
Table XXX |
|
------------------ |
|
243 |
|
|
244 |
There are three parameters to the one-time signature key boosting algorithm: |
There are three parameters to the one-time signature key boosting algorithm: |
245 |
`$N$`, the number of levels in the private key tree, |
`$N$`, the number of levels in the private key tree, |
249 |
- given `$N$` and `$k$`, there are `$k^N$` |
- given `$N$` and `$k$`, there are `$k^N$` |
250 |
possible private keys for signing messages. |
possible private keys for signing messages. |
251 |
|
|
252 |
|
- We map |
253 |
|
|
254 |
- alternatives at tree nodes: |
- alternatives at tree nodes: |
255 |
|
|
256 |
- sign each public key separately, requires `$b \\ge r$` and `$q\\ge k$` |
- sign each public key separately, requires `$b \\ge r$` and `$q\\ge k$` |
277 |
- the first levels of signatures may be given in the public key, |
- the first levels of signatures may be given in the public key, |
278 |
giving a tradeoff between public key size and signature size. |
giving a tradeoff between public key size and signature size. |
279 |
|
|
280 |
|
Variants: Choosing the Tree Branch |
281 |
|
================================== |
282 |
|
|
283 |
Choice of `$x$` |
Choice of `$x$` |
284 |
--------------- |
|
285 |
|
Deterministic: a Full Digital Signature Algorithm Feature Set |
286 |
|
------------------------------------------------------------- |
287 |
|
|
288 |
- Arbitrary (pseudo-infinite, i.e. infinite wouldn't help any more) |
- Arbitrary (pseudo-infinite, i.e. infinite wouldn't help any more) |
289 |
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! |
294 |
|
|
295 |
- realistic? How much does this need? |
- realistic? How much does this need? |
296 |
|
|
297 |
|
Random or deterministic, but probabilistic |
298 |
|
------------------------------------------ |
299 |
|
|
300 |
|
Shorter signatures |
301 |
|
|
302 |
- If less, cannot use information from hash directly, otherwise can attack |
- If less, cannot use information from hash directly, otherwise can attack |
303 |
by giving close relatives |
by giving close relatives |
304 |
|
|