基于Offline-TTP的电子支付协议公平性分析

基于Offline-TTP的电子支付协议通常具有复杂结构,由多个子协议组合而成,与传统认证协议具有显著不同,主要表现在协议目标和攻击者模型两个方面。电子支付协议最主要目的是实现买卖双方的公平交换,同时假定交换双方都可能是不诚实的,需要考虑来自协议合法实体的内部攻击。在重新定义协议公平性和攻击者模型的基础上,提出扩展的串空间模型,以一个真实的电子支付协议为对象,演示了基于串空间理论的电子支付协议公平性形式化模型和分析方法,并指出该协议存在安全缺陷,提出改进意见。     

轻量级移动支付协议公平性分析

为保证移动支付安全、顺利进行,必须采用安全的移动支付协议。针对计算和存储能力有限的移动设备和不可靠的移动环境,选择采用对称加密的轻量级移动支付协议PCMS,使用串空间理论对其建模,进行形式化分析。通过图的方式直观描述协议的执行过程,分析协议安全目标,基于串空间理论的认证测试方法,对该协议的公平性形式化分析。针对PCMS协议不满足公平性,提出增加时间戳来解决,同时增加一个退款子协议完成后续退款操作。结合模型检测工具验证分析,结果表明,改进后的协议满足公平性。     

一种交换协议的理性模型及其公平机制设计

理性交换协议是解决小额支付的有效方法,但是由于参与者的自利性,理性交换协议的公平性较难满足。论文首先对理性交换过程中的集体利益进行形式化定义,并基于占优策略构建理性参与者模型,以及基于占优策略和集体利益建立理性交换协议的公平性模型;其次基于激励相容理论设计理性交换协议的公平机制,基于理性交换协议的公平机制和扩展式博弈构建理性交换协议的理性博弈模型,并基于理性交换协议的博弈模型设计了一个理性交换协议;最后基于相关博弈方法证明所设计协议满足正确性和理性公平性,并用一个案例说明方案的可行性。     

一种基于动态博弈的理性交换协议模型

小额交易的微支付协议中,采用TTP以保证公平性的代价比微支付金额本身还要高,所以理性交换协议是一种合适的选择.虽然理性交换协议不能完全保证公平性,但可保证理性参与方没有理由不遵守协议.基于动态博弈对理性交换协议进行建模,根据协议博弈中纳什均衡的概念形式化定义了理性交换,并以Syverson提出的理性交换协议进行了实例研究.     

离线公平交换协议的子协议分析

离线公平交换协议的子协议对其公平性至关重要。使用串空间方法分析2个重要的离线公平交换协议的子协议对协议公平性的影响,发现保持子协议运行的互斥和结果的同步是离线公平交换协议公平性的重要保证。根据该发现,针对协议中存在的问题,给出协议的改进方案,提出设计两方和多方离线公平交换协议的建议。     

电子商务协议的串空间分析

电子商务协议常常具有复杂结构,协议可能由多个子协议组合而成.因此,电子商务协议的安全分析较认证协议更为复杂.传统的信念逻辑不适宜分析电子商务协议.Kailar逻辑适宜分析电子商务协议的可追究性,但不适宜分析协议的公平性.本文介绍并扩展了串空间逻辑,分析了ISI支付协议的串,并证明其不满足公平性.还提出一种新的串节点路径法,用以分析了ASW协议,该协议系由多个子协议组成的分支结构协议,通过串空间分析证明了该协议的公平性.通过对两个协议的分析,分别提供了对电子商务在线交易协议和离线交易协议的形式化分析方法.     

一个新的电子支付协议及其形式化分析

在安全电子支付协议中,付款方和收款方的可追究性及公平性非常重要.通常可以采用电子支付中的双方可追究协议来达到这个目的.在克服ISI支付协议缺陷的基础上,提出了一种新的公平可追究电子支付协议.经过使用改进的Kailar逻辑分析验证,新的协议满足可追究性和公平性原则.     

基于串空间的可信计算协议分析

可信计算技术能为终端、网络以及云计算平台等环境提供安全支撑,其本身的安全机制或者协议应该得到严格的形式化证明.该文基于串空间模型对其远程证明协议进行了分析.首先,扩展了串空间的消息代数和攻击者串,使其能表达可信计算相关的密码学操作,并对衍生的定理进行了证明;并且提出了4个新的认证测试准则,能对协议中的加密、签名、身份生成和哈希等组件进行推理.其次,基于扩展的串空间模型对远程证明协议的安全属性(隐私性、机密性和认证性)进行了抽象和分析.最后,给出了对发现攻击的消息流程,并基于ARM开发板对其中的布谷鸟攻击进行了实现,验证了串空间的分析结果.     

RSA-CEMD协议的分析及基于串空间模型的形式化证明

电子商务协议的最基本任务是保证交易方进行公平交换,而分析交换协议是否保证了公平性就成了分析电子商务协议的关键。本文分析了文献[1]中的挂号电子邮件协议RSA-CEMD协议,指出了其存在的缺陷,对其进行了修改,并对修改后协议的公平性用经过扩展的串空间模型进行了形式化分析。     

IEEE 802.11i 协议的形式化分析

Furqan提出运用串空间理论对IEEE 802.11i协议进行形式化验证的基础上,对IEEE 802.11i 协议的串空间模型进行了改进,并证明了Furqan没有证明的保密性以及服务器的认证性。分析结果证明,在目前的攻击者模型中,IEEE 802.11i 协议是安全的。     

电子结算系统的设计方案

网上购物是指买卖双方利用简单、快捷和低成本的电子通讯方式进行各种商贸活动的一种交易模式。电子结算作为其中的组成部分,决定了交易进行的最终步骤能否成功,其重要性不言而喻。系统主要以ASP.NET作为开发基础,使用了Microsoft公司的Visual Studio 2008作为开发环境。基本实现了网上购物中的电子结算应具备的主要功能,包括:在线支付,支付网关管理,买家购物管理和卖家销售及库存管理等功能。该系统界面简洁,操作容易,维护方便。     

COMBINING TRUST MODELING AND MECHANISM DESIGN FOR PROMOTING HONESTY IN E‐MARKETPLACES

In this paper, we propose a novel incentive mechanism for promoting honesty in electronic marketplaces that is based on trust modeling. In our mechanism, buyers model other buyers and select the most trustworthy ones as their neighbors to form a social network which can be used to ask advice about sellers. In addition, however, sellers model the reputation of buyers based on the social network. Reputable buyers provide truthful ratings for sellers, and are likely to be neighbors of many other buyers. Sellers will provide more attractive products to reputable buyer to build their own reputation. We theoretically prove that a marketplace operating with our mechanism leads to greater profit both for honest buyers and honest sellers. We emphasize the value of our approach through a series of illustrative examples and in direct contrast to other frameworks for addressing agent trustworthiness. In all, we offer an effective approach for the design of e‐marketplaces that is attractive to users, through its promotion of honesty.     

Evaluating the trustworthiness of advice about seller agents in e-marketplaces: A personalized approach

In this paper, we present a model for evaluating the trustworthiness of advice about seller agents in electronic marketplaces. In particular, we propose a novel personalized approach for effectively handling unfair ratings of sellers provided to buyer agents from other buyers (called advisors). Our approach offers flexibility for buyers to weight their value for private and public knowledge about advisors. A personalized approach is proposed as well for buyers to model the trustworthiness of sellers, based on the advice provided. Experimental results demonstrate that our approach can effectively model trustworthiness for both advisors and sellers, even when there are large numbers of unfair ratings.     

具有隐私保护的安全电子交易协议

电子交易的普及在给用户带来便利的同时,其在交易支付中所暴露出的隐私保护和安全性问题也受到不同程度的挑战。针对此问题,提出一个安全的电子交易协议。协议中,优化后的签密算法可保证交易的安全性;同时支付服务商具有去匿名性功能,可以在保护用户隐私的基础上进行追责。经性能分析,本协议在提高通信性能的基础上,满足消息的机密性和不可否认性、购买者的匿名性和可追踪性以及电子交易的公平性。     

Trust-oriented buyer strategies for seller reporting and selection in competitive electronic marketplaces

In competitive electronic marketplaces where some selling agents may be dishonest and quality products offered by good sellers are limited, selecting the most profitable sellers as transaction partners is challenging, especially when buying agents lack personal experience with sellers. Reputation systems help buyers to select sellers by aggregating seller information reported by other buyers (called advisers). However, in such competitive marketplaces, buyers may also be concerned about the possibility of losing business opportunities with good sellers if they report truthful seller information. In this paper, we propose a trust-oriented mechanism built on a game theoretic basis for buyers to: (1) determine an optimal seller reporting strategy, by modeling the trustworthiness (competency and willingness) of advisers in reporting seller information; (2) discover sellers who maximize their profit by modeling the trustworthiness of sellers and considering the buyers’ preferences on product quality. Experimental results confirm that competitive marketplaces operating with our mechanism lead to better profit for buyers and create incentives for seller honesty.     

一种乐观电子商务协议的公平性分析

乐观电子商务协议通常具有复杂结构,由多个子协议组合而成,与传统认证协议具有显著不同。电子商务协议最主要目的是实现买卖双方的公平交换,同时假定交换双方都可能是不诚实的,需要考虑来自协议合法实体的内部攻击。文章在深入分析公平交换协议各项属性的基础上,定义了电子项的认证属性,对SVO逻辑进行了扩展,使用SVO逻辑语法定义了电子商务协议应满足的公平性。文章以一种真实的电子商务协议为对象,演示了基于SVO逻辑的电子商务协议公平性分析方法,并指出该协议存在安全缺陷,提出改进意见。     

一种基于移动代理的电子支付系统框架

在电子商务支付系统研究中,引入移动代理技术可以为商家和用户提供从网络资源智能发现,到在线虚拟市场交易等一系列定制服务,从而能够提高在线支付系统处理交易的智能化和自动化水平.为此,文章在抽象出若干电子支付系统业务模块的基础上提出了一种基于移动代理的智能型协作的电子支付系统框架模型,并分析了设计思想及主要部分工作流程和开发中一些关键技术的实现方案（包括移动代理的对象模型等）,以便于在Internet网络上实现安全快捷的支付.     

Analyzing strategies of mobile agents on malicious cloud platform with Agent-Based Computational Economic Approach

Cloud computing is a service model that enables resource-limited mobile devices to remotely execute tasks from a server. The mobile agent is a software program installed in the mobile device to negotiate a diversity of commerce transactions with other mobile agents in the cloud. However, the negotiation plans carried by mobile agents are easily be eavesdropped on by the malicious cloud platforms, since the codes of mobile agents are read and executed by the cloud platform. Thus, sellers can tailor the negotiation plans to cheat buyers for seizing buyers’ profits in negotiations after eavesdropping on buyers’ negotiation plans. In this paper, we consider the buyers can take actions to resist the sellers’ cheatings, which is that the buyers can tailor their plans with extremely low demand to decrease sellers’ profits before migrate to the hosts. In this paper, we consider actions that buyers can take to resist sellers’ cheatings, that is the buyers can tailor their plans with extremely low demands before migrate to the cloud platform. Above situations between buyers and sellers are modeled as a mathematical model called Eavesdropping and Resistance of Negotiation (ERN) Game. The strategies of the buyers and sellers playing the ERN Game are analyzed by the Agent-Based Computational Economic approach. The simulation results show the cooperative strategies will be emerged between buyers and sellers in the ERN Game.     

多智能体协同选择的智能导购模型

基于多智能体协同选择提出了一种导购选择模型,该模型可识别其他可信买方智能体("值得信赖的朋友"),并将它们关于卖方的信息结合自身关于卖方的信息综合起来协同选择质高价低的卖方,从而实现高质量的导购性能。构建了一个存在多种类型的买方和卖方的购物模拟环境,并进行了多组实验。实验结果表明,该模型可以准确地识别可信买方智能体,并可在复杂的购物环境中高效地选择出优质卖方。此外,实验结果还表明,有了该模型,单个买方智能体选择优质卖方的能力要明显高于无多智能体协同选择情况下单个买方智能体的选择能力。