157 |
BiBa |
BiBa |
158 |
---- |
---- |
159 |
|
|
160 |
? |
The signer generates `$t$` random numbers (balls) and publishes |
161 |
|
their hashes as the public key. A hash function maps each ball |
162 |
|
to one of `$n$` *bins*, depending on the signed message |
163 |
|
and a counter, initially zero. |
164 |
|
If `$w$` balls fall into the same bin, they are published |
165 |
|
as the signature. If no bin contains at least `$w$` balls, |
166 |
|
the counter is increased and the procedure is repeated |
167 |
|
until a '`$w$`-time collision' is found. |
168 |
|
|
169 |
|
- private key: the `$t$` random numbers |
170 |
|
|
171 |
|
- public key: the hashes of the random numbers |
172 |
|
|
173 |
|
- sign: apply the hash function to all balls |
174 |
|
until a `$w$`-time collision is found |
175 |
|
|
176 |
|
- verify: verify that the hash function maps the published balls |
177 |
|
into the same bin; verify that the balls match the public key |
178 |
|
(i.e., that the public key contains their hashes). |
179 |
|
|
180 |
|
|
181 |
Reyzin |
Reyzin |
182 |
------ |
------ |