406 |
\parbox{\sw}{BiBa $(h,b,q,n,t,w)$} |
\parbox{\sw}{BiBa $(h,b,q,n,t,w)$} |
407 |
& $q$ & $b$ & $th$ & $wh$ & $h$ & $t$ & $?+wh$ & $w$ \\ |
& $q$ & $b$ & $th$ & $wh$ & $h$ & $t$ & $?+wh$ & $w$ \\ |
408 |
\parbox{\sw}{Reyzin 2nd $(h,b,t,k)$ } |
\parbox{\sw}{Reyzin 2nd $(h,b,t,k)$ } |
409 |
& $1$ & $b$ & $kh$ & $th$ & $h$ & $t$ & $1$ (XXX) & $1+k$ (XXX) \\ |
& $1$ & $b$ & $kh$ & $th$ & $h$ & $t$ & $1$ & $1+k$ \\ |
410 |
|
|
411 |
\parbox{\sw}{Bleichenbacher-Maurer\cite{XXX(ASIACRYPT)} |
\parbox{\sw}{Bleichenbacher-Maurer\cite{XXX(ASIACRYPT)} |
412 |
(h, n) |
(h, n) |
562 |
In long-term digital publishing, the time limits on normal digital signatures |
In long-term digital publishing, the time limits on normal digital signatures |
563 |
are |
are |
564 |
|
|
565 |
|
- we expect our methods to be improved on considerably; we have shown it is *feasible*, |
566 |
|
now someone needs to show it's *practical* |
567 |
|
|
568 |
- hashes *do* get broken, REF |
- hashes *do* get broken, REF |
569 |
|
|
570 |
foo |
foo |