可再生散列鏈的精巧構(gòu)造
An Elegant Construction of Re-initializable Hash Chains
-
摘要: 散列(hash)鏈被廣泛應(yīng)用于電子微支付、一次性口令等多種密碼學(xué)系統(tǒng)中。然而，因為散列鏈存在有限長度的限制，當(dāng)鏈上的散列值被用盡的時候，系統(tǒng)需要再生新的散列鏈，所以系統(tǒng)的設(shè)計需要盡量降低再生散列鏈時導(dǎo)致的額外開銷。該文提出一種高效的完全基于單向散列函數(shù)的可再生散列鏈的構(gòu)造方法。而且，這種構(gòu)造方法能夠以不可否認(rèn)的方式安全地再生散列鏈。它的高效、安全和精巧的結(jié)構(gòu)將為散列鏈的實際應(yīng)用提供廣闊的前景。
-
關(guān)鍵詞:
- 散列鏈; 單向散列函數(shù); 不可否認(rèn)性
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. 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. -
計量
- 文章訪問數(shù): 2243
- HTML全文瀏覽量: 117
- PDF下載量: 752
- 被引次數(shù): 0
下載:
