The search functionality is under construction.
The search functionality is under construction.

Fast Verification of Hash Chains with Reduced Storage

Dae Hyun YUM, Jin Seok KIM, Pil Joong LEE, Sung Je HONG

  • Full Text Views

    0

  • Cite this

Summary :

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 ≤ in, 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 xn =? hashn-i(xi). 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.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.1 pp.383-391
Publication Date
2011/01/01
Publicized
Online ISSN
1745-1337
DOI
10.1587/transfun.E94.A.383
Type of Manuscript
PAPER
Category
Cryptography and Information Security

Authors

Keyword