232 |
& $1$ & $b$ & $\frac{bh}{n}+h$ & $h$ & $h$ & |
& $1$ & $b$ & $\frac{bh}{n}+h$ & $h$ & $h$ & |
233 |
$2\frac{b}{n}(2^n-1)+1$ & $\frac{b}{n}(2^n-1)+1$ & |
$2\frac{b}{n}(2^n-1)+1$ & $\frac{b}{n}(2^n-1)+1$ & |
234 |
$\frac{b}{n}(2^n-1)+1$ \\ |
$\frac{b}{n}(2^n-1)+1$ \\ |
235 |
|
\parbox{\sw}{BiBa $(h,b,q,n,t,w)$} |
236 |
|
& $q$ & $b$ & $th$ & $wh$ & $h$ & $t$ & $?+wh$ & $w$ \\ |
237 |
\parbox{\sw}{Reyzin one-way\cite{XXX} $(h,b,t,k)$ } |
\parbox{\sw}{Reyzin one-way\cite{XXX} $(h,b,t,k)$ } |
238 |
& $1$ & $b$ & $kh$ & $h$ & $h$ & $t$ & $?$ & $?+k$ \\ |
& $1$ & $b$ & $kh$ & $h$ & $h$ & $t$ & $?$ & $?+k$ \\ |
239 |
\hline |
\hline |
252 |
\caption{ |
\caption{ |
253 |
Characterizations of existing one-time signature schemes. |
Characterizations of existing one-time signature schemes. |
254 |
The symbols are explained in the text. $n$ is a freely chosen |
The symbols are explained in the text. $n$ is a freely chosen |
255 |
positive integer. In Reyzin and Reyzin's scheme, $t$ and $k$ |
positive integer. |
256 |
must be chosen so that $({t \over k}) \ge 2^b$. |
In BiBa, $t$ is the number of balls, $n$ the number of bins, |
257 |
|
and $w$ the number of balls needed in a single bin |
258 |
|
in order to form a signature. |
259 |
|
In Reyzin and Reyzin's scheme, $t$ and $k$ |
260 |
|
must be chosen so that ${t \choose k} \ge 2^b$. |
261 |
The derived schemes use |
The derived schemes use |
262 |
as their basis another one-time signature scheme |
as their basis another one-time signature scheme |
263 |
$S'$ with the parameter octuplet |
$S'$ with the parameter octuplet |