一种新颖的可再生多Hash链的构造  

A Novel Construction of Re-initializable Multi-Hash Chains

作　　者：赵源超[1] 李道本[1] 

机构地区：[1]北京邮电大学信息工程学院,北京100876

出　　处：《电子与信息学报》2006年第2期299-302,共4页Journal of Electronics & Information Technology

基　　金：国家自然科学基金重大项目(69931050)资助课题

摘　　要：作为一种能够提供不可否认性的密码学算法,由于计算效率较高,Hash链被广泛应用于电子微支付方案中。为了进一步提高系统的效率,可以同时采用多个Hash链表示不同的面值进行微支付。由于Hash链存在有限长度的限制,系统的设计需要尽量降低再生Hash链时导致的额外开销。该文提出一种高效的基于一次性签名的可同时再生多个Hash链的构造方法,分析了这种构造内在的不可否认性和再生配置的灵活性,讨论了在多面值微支付中的应用。这种构造方法能够提高同时使用多个Hash链的系统的效率。As a cryptography algorithm that can provide non-repudiability, hash chains are widely used in electronic micropayment schemes because of its efficiency. In order to further improve efficiency, multiple hash chains can be simultaneously used to represent different denominations in micropayment. Because of the limitation that hash chain has a limited length, system design has to reduce the overhead when hash chains are re-initialized. A efficient one-time-signature-based construction is proposed which can simultaneously re-initialize multiple hash chains and its intrinsic non-repudiability and flexibility of configuration in re-initialization are analyzed. The application of the construction in multi-denomination micropayment is illustrated. The proposed construction can improve the efficiency of systems with multiple hash chains.

关 键 词：HASH链 不可否认性 一次性签名 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]