97 |
on one-way functions, i.e., functions `$y=f(x)$` such |
on one-way functions, i.e., functions `$y=f(x)$` such |
98 |
as block ciphers or cryptographic hashes so that |
as block ciphers or cryptographic hashes so that |
99 |
that given `$y$` it is infeasible to find `$x$`. |
that given `$y$` it is infeasible to find `$x$`. |
100 |
Given a one-way function f, the signer generates a set |
Generally, given a one-way function f, the signer generates a set |
101 |
of (pseudo)random numbers and and publishes `$f(x)$` for each |
of (pseudo)random numbers and and publishes `$f(x)$` for each |
102 |
`$x$` in the set. This is the public key. To sign a message, |
`$x$` in the set. This is the public key. To sign a message, |
103 |
the signer employs a deterministic algorithm to select |
the signer employs a deterministic algorithm to select |
135 |
still needs to keep track of which private keys |
still needs to keep track of which private keys |
136 |
have already been used in order not to compromise security. |
have already been used in order not to compromise security. |
137 |
|
|
138 |
XXX Following descriptions not into article, maybe into tech report? |
In section XXX, we give a description of existing |
139 |
We need these to make sure our numbers are right |
one-time signature algorithms with their different |
140 |
|
tradeoffs. |
141 |
|
|
142 |
One-time Signature Key Boosting |
One-time Signature Key Boosting |
143 |
=============================== |
=============================== |
559 |
- verify: verify signature with new public key, verify hash chain. |
- verify: verify signature with new public key, verify hash chain. |
560 |
|
|
561 |
|
|
562 |
|
Efficiency of key boosting |
563 |
|
========================== |
564 |
|
|
565 |
|
- general analysis as appears in table |
566 |
|
|
567 |
|
- given different choices for the underlying scheme, |
568 |
|
and for choosing x |
569 |
|
|
570 |
|
- maybe recommendations |
571 |
|
|
572 |
|
|
573 |
Conclusion |
Conclusion |
574 |
========== |
========== |