检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学信息安全与国家计算网格实验室四川成都610031 [2]四川师范大学计算机科学学院,四川成都610068 [3]华东交通大学基础科学学院,江西南昌330013
出 处:《铁道学报》2013年第11期51-59,共9页Journal of the China Railway Society
基 金:国家自然科学基金(61240025);四川省教育厅基金(13ZB0152)
摘 要:针对移动环境中网络及计算条件受限的情况,在考虑有效性和支付效率的基础上,设计了一个适应于移动环境的公平移动支付协议。该协议由认证、支付、恢复、结算四个子协议构成。在认证协议中通过基于Hash函数的动态ID机制满足了双向认证、有限的匿名性和不可追踪性,并获取不可伪造性的、可重用的支付证书。在支付过程中基于变色龙Hash函数和双Hash链,实现了交易的匿名性、可追究性和公平性。最后利用Kailar逻辑对协议的可追究性和公平性进行形式化分析,结果表明:协议在保持较高执行效率的同时,能满足可追究性和公平性,适用于在移动环境以及类似的通信、计算条件受限的环境中使用。Considering the conditions that the network and calculation capability of mobile terminals are limited in the mobile environment, the novel fair mobile payment protocol was proposed. The protocol was composed of four sub-protocols of authentication, payment, recovery and withdraw. In the authentication sub-protocol, the dynamic ID mechanism based on the hash function was adopted to satisfy mutual authentication, limited an- onymity and intractability. Simultaneously, the unforgeable and reusable payment certificate was obtained. In the process of payment, the attributes of anonymity, non-repudiation and fairness were achieved on the basis of the Chameleon Hash functions and double Hash chains. Finally, through formally analyzing the security attrib- utes by the Kailar logic, the result declares that the protocol can fulfill non-repudiation and fairness while main- taining high efficiency in implementation. The protoeol can be applied in mobile environments and similar com- munication and calculation constrained environments.
关 键 词:移动支付 HASH链 变色龙Hash函数 公平性 KAILAR逻辑
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.198