Name
Abstract | ||
|---|---|---|
A hash chain H for a hash function hash(·) is a sequence of hash values 〈xn, xn−1,..., x0 〉, where x0 is a secret value, xi is generated by xi=hash(xi−1) for 1≤i≤n, and xn is a public value. Hash values of H are disclosed gradually from xn−1 to x0. The correctness of a disclosed hash value xi can be verified by checking the equation $x_n \stackrel{?}{=} {\mathsf{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 xn, 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 |
|---|---|---|
2010 | 10.1007/978-3-642-11925-5_26 | CT-RSA |
Keywords | Field | DocType |
check-bit scheme,fast verification,check-bit vector,public value xn,check-bit vector cb,hash function hash,hash value,secret value,public value,hash chain h,hash value xi,hash chain,hash function,lower bound | Hash filter,Discrete mathematics,Fowler–Noll–Vo hash function,Collision resistance,Rolling hash,SWIFFT,Hash function,Quadratic probing,Hash chain,Mathematics | Conference |
Volume | ISSN | ISBN |
5985 | 0302-9743 | 3-642-11924-7 |
Citations | PageRank | References |
2 | 0.39 | 15 |
Authors | ||
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 |