Self-updating hash chains based on erasure coding

Hash chains have been proposed as a tool for improving the efficiency of a variety of practical and valuable cryptographic applications such as one-time password, one-time signature, electronic micropayment, entity authentication, etc. In this paper, we propose a new type of self-updating hash chain (SUHC) that is based on erasure coding algorithms. At each authentication, one part of the next seed is send to the server. After k times of authentication, current hash chain is exhausted, and at the same time, the next seed can be reconstructed. Compared with existing SHC schemes, this scheme is secure and efficient. The scheme can be used in service-oriented applications for user authentication.