Paper 2005/011 Original: eprint.iacr.org/2005/011 ↗
An Improved Elegant Method to Re-initialize Hash Chains
Abstract
Hash chains are widely used in various cryptographic systems such as electronic micropayments and one-time passwords etc. However, hash chains suffer from the limitation that they have a finite number of links which when used up requires the system to re-initialize new hash chains. So system design has to reduce the overhead when hash chains are re-initialized. Recently, Vipul Goyal proposed an elegant one-time-signature-based method to re-initialize hash chains, in this efficient method an infinite number of finite length hash chains can be tied together so that hash chains can be securely re-initialized in a non-repudiable manner. Vipul Goyal¡¯s method is improved in this paper to reach a little more efficient method, which, more importantly, is a natural extension of the concept of conventional hash chains.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2005-01-20: last updated
- 2005-01-20: published
- Short URL
- https://ia.cr/2005/011
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2005/011,
author = {Yuanchao Zhao and Daoben Li},
title = {An Improved Elegant Method to Re-initialize Hash Chains},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/011},
year = {2005},
url = {https://eprint.iacr.org/2005/011}
}