210 |
Scheme & Params & $q$ & $b$ & $s$ & $r$ & $h$ & $c_0$ & $c_s$ & $c_v$ \\ |
Scheme & Params & $q$ & $b$ & $s$ & $r$ & $h$ & $c_0$ & $c_s$ & $c_v$ \\ |
211 |
\hline |
\hline |
212 |
Lamport\cite{XXX} & |
Lamport\cite{XXX} & |
213 |
$h$, $b$ & $1$ & $b$ & $bh$ & $2bh$ & $h$ & $2bh$ & $0$ & $bh$ \\ |
$h,b$ & $1$ & $b$ & $bh$ & $2bh$ & $h$ & $2bh$ & $0$ & $bh$ \\ |
214 |
\hline |
\hline |
215 |
Merkle-Winternitz\cite{XXX} & |
Merkle-Winternitz\cite{XXX} & |
216 |
$h$, $b$, $n$ & $1$ & $b$ & $\frac{bh}{n}+h$ & $h$ & $h$ & |
$h,b,n$ & $1$ & $b$ & $\frac{bh}{n}+h$ & $h$ & $h$ & |
217 |
$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$ & |
218 |
$\frac{b}{n}(2^n-1)+1$ \\ |
$\frac{b}{n}(2^n-1)+1$ \\ |
219 |
\hline |
\hline |
220 |
Merkle hash tree & % XXX check this again |
Merkle hash tree & % XXX check this again |
221 |
$(q',b,s',r',h,c_0',c_s',c_v')$, $n$ & |
$S',n$ & ${2^n}q'$ & $b$ & $s'+r'+hn$ & $h$ & $h$ & |
222 |
${2^n}q'$ & $b$ & $s'+r'+hn$ & $h$ & $h$ & ${2^n}c_0'+2^{n+1}-1$ & |
${2^n}c_0'+2^{n+1}-1$ & $c_s'+n$ & $c_v'+n$ \\ |
223 |
$c_s'+n$ & $c_v'+n$ \\ |
\hline |
224 |
|
Key boosting & |
225 |
|
$S',N$ & ${q'}^N$ & $b$ & $N(r'+s')$ & $r'$ & $h$ & |
226 |
|
$c_0'$ & $N(c_0'+c_s')$ & $Nc_v$ \\ |
227 |
\hline |
\hline |
228 |
\end{tabular} |
\end{tabular} |
229 |
\caption{ |
\caption{ |
230 |
Characterizations of the existing one-time signature schemes. |
Characterizations of the existing one-time signature schemes. |
231 |
The symbols are explained in the text. ($n$ is a positive integer.) |
The symbols are explained in the text. $n$ is a freely chosen |
232 |
|
positive integer. $S'$ is a signature scheme of the form |
233 |
|
$(q',b,s',r',h,c_0',c_s',c_v')$. |
234 |
} |
} |
235 |
\end{table*} |
\end{table*} |
236 |
|
|