摘要
为提高微支付系统的交易效率,借鉴二叉树可分的思想,提出一种基于可自更新二维Hash链的微支付系统,对二维Hash链的结点面额进行特定赋值,使用户只需进行lbN次(N是用户需要花费的电子现金总额)Hash计算就能完成交易,利用多维Hash链可自更新的方法避免用户对Hash链再次初始化,从而减少系统的额外开销。理论分析结果证明,该系统具有实用性及不可伪造性。
To promote the transaction efficiency of micropayment system.The thought of the binary tree is used to present a new micropayment system based on self-updatable two-dimensional Hash chain.It values specific evaluation to the node,thus the user can complete the transaction by lbN times(is electronic cash total amount which user can spend).It uses the regeneration method of the multi-Hash chain,and avoids initiation once more by user.Analysis results show its practicability and unforgeability.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第18期272-274,共3页
Computer Engineering
基金
山西大同大学校级科研基金资助项目(2010Q13)