Name
Abstract | ||
|---|---|---|
A hash chain H for a hash function hash(.) is a sequence of hash values < x(n), x(n-1), ..., x(0)>, where x(0) is a secret value, x(i) is generated by x(i) = hash(x(i-1)) for 1 <= i <= n, and x(n) is a public value. Hash values of H are disclosed gradually from x(n-1) to x(0). The correctness of a disclosed hash value x(i) can be verified by checking the equation x(n) =(?) hash(n-i)(x(i)). To speed up the verification, Fischlin introduced a check-bit scheme at CT-RSA 2004. The basic idea of the check-bit scheme is to output some extra information cb, called a check-bit vector, in addition to the public value x(n), which allows each verifier to perform only a fraction of the original work according to his or her own security level. We revisit the Fischlin's check-bit scheme and show that the length of the check-bit vector cb can be reduced nearly by half. The reduced length of cb is close to the theoretic lower bound. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1587/transfun.E94.A.383 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
hash chain, progressive verification, check-bit scheme | Journal | E94A |
Issue | ISSN | Citations |
1 | 0916-8508 | 1 |
PageRank | References | Authors |
0.37 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dae Hyun Yum | 1 | 315 | 24.95 |
| Jin Seok Kim | 2 | 56 | 6.25 |
| Pil Joong Lee | 3 | 1039 | 103.09 |
| Sung Je Hong | 4 | 267 | 28.92 |