114 |
that can be used any number of times without keeping track |
that can be used any number of times without keeping track |
115 |
of private keys that have already been used. |
of private keys that have already been used. |
116 |
Our scheme assumes a one-time signature scheme |
Our scheme assumes a one-time signature scheme |
117 |
and a random oracle. We then examine how this scheme can be used |
and a random oracle. |
118 |
in a digital publishing context. |
In the following Sections, we first |
119 |
|
describe our algorithm. |
120 |
|
Then, we analyze the tradeoffs in it and other one-time signature |
121 |
|
schemes. |
122 |
|
After this, we discuss the different variants of our |
123 |
|
algorithm based on how the path through the key tree |
124 |
|
is selected, and finally conclude. |
125 |
|
|
126 |
|
|
127 |
|
|
128 |
|
|
129 |
One-time Signature Key Boosting |
One-time Signature Key Boosting |