%0 Journal Article
%T An Elegant Construction of Re-initializable Hash Chains<br>可再生散列链的精巧构造
%A Zhao Yuan-chao
%A Li Dao-ben
%A <br>赵源超
%A 李道本
%J 电子与信息学报
%D 2006
%I 
%X 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. An efficient construction which can re-initialize hash chains is proposed, and it is entirely based on one-way hash function. In the proposed construction hash chains can be securely re-initialized in a non-repudiable manner. The method will find much pragmatic application because of its efficient, secure and elegant structure.
%K Hash chain
%K One-way hash function
%K Non-repudiability<br>散列链
%K 单向散列函数
%K 不可否认性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=65382FBF9179A7FB&yid=37904DC365DD7266&vid=D3E34374A0D77D7F&iid=9CF7A0430CBB2DFD&sid=959B2AB984B945BD&eid=4E17F6A5D7499FF3&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=16