移动微支付系统研究

本文给出了移动微支付系统的基本模型和主要特点,并深入探讨了几种主要的移动微支付系统的功能和优缺点。同时,基于对移动微支付系统发展现状和未决问题的分析和评述,指出了今后该领域的研究方向。     

一个安全高效的移动微支付协议

提出了一个基于Payword的移动微支付协议,新协议对Payword的协议的不足之处进行了改进。为了使协议更好地应用到移动商务中,协议采用了对称加密算法,并且将多值hash链应用到与不同商家的交易中,降低了用户端的存储和计算开销。协议在保证安全性的前提下降低了微支付的交易成本。     

移动计算环境下的通用安全支付系统框架

移动代理在未来的移动商务中具有举足轻重的地位,它能提供更好的灵活性和性能。但也面临着许多新的安全问题。以移动代理和SEMOPS模型为基础,结合现有的移动支付协议,抽象出移动支付系统通用的业务模块,提出了一种新的移动计算环境下通用安全移动支付系统框架。     

移动商务中几种微支付协议研究

移动微支付是移动支付的一个重要部分,随着微支付安全性的增强,移动微支付将被应用到各行各业,本文分析了几种现有典型微支付协议实例的细节及相关特性,并对微支付协议中存在的安全问题进行深入讨论.     

一个基于移动代理的优化支付协议

移动代理是能在异构网络中漫游的一种软件实体,它极大地改善了分布式系统的性能,被认为在未来的电子商务中必将起到很重要的作用．然而,许多新的安全问题也随之而来．这些安全问题已被看做是移动代理技术得到更广泛应用的主要障碍之一．利用可验证秘密共享和正交验证理论,提出了一个基于移动代理的优化支付协议．协议提供了很好的安全性．同时,在不泄露所购买商品的情况下,能够使移动代理对所购买商品进行验证．另外,最小限度地使用了可信任第3方,除非出现欺诈行为或者协议提前终止．否则可信任的第3方为脱线运行．     

一种新的移动代理路由解决方案

移动代理是一种软件程序,它漫游在计算机网络中,经过不同的主机代替用户执行一定的任务,但是它也带来了许多新的有关面临恶意代理与主机的安全问题.对已有的移动代理路由协议进行了分析讨论,在此基础上,利用一种满足结合律但不满足交换律的单向函数,构造了一种新的移动代理路由解决方案,并对其安全性和计算复杂度进行了详细分析.结果表明,该协议满足路由协议的所有安全性质,而且具有更低的计算复杂度.     

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

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

移动代理系统的体系结构及实现

在分析现有移动代理系统体系结构的基础上，给出了一个作者设计的应用系统。     

移动微支付协议Payword的改进与形式化分析

针对移动微支付协议Payword不满足不可否认性的问题,提出了改进的移动微支付协议Payword。相比Payowrd,改进的Payword具有更好的安全性和公平性。为验证改进的移动微支付协议Payword能否满足不可否认性,对SVO逻辑进行扩展,并运用扩展后的SVO逻辑对改进的Payword微支付协议进行形式化分析。分析结果表明,改进后的微支付协议满足不可否认性。     

一种无线网络环境中的微支付协议

基于R.Rivest和A．Shamir提出的微支付协议PayWord的一个改进方案NMP，为无线网络环境中的小额交易设计了一种新的无线微支付协议WMP(Wireless Micropayment Protocol)。WMP协议在充分考虑安全性、公平性、不可否认性以及匿名性的基础上，针对目前无线微支付环境中带宽和客户端计算能力较低的问题，尽可能地优化了协议执行过程中的通信代价和客户端的计算量，具有较好的性能和较高的运行效率。     

一种适用于移动电子商务的微支付方案

文章用对称密码技术给出一套较完整的移动电子商务中安全微支付方案。该方案利用AES算法给出用户的一次性签名,用户可以无差别地和任何一个商家交易且计算量和存储量都很小。此外,还解决了微支付中的税收问题。同时方案具有不可否认性、公平性和较好的匿名性,并能有效防止用户和商家的欺诈。该方案使小额支付和微支付更加高效、灵活,适用于移动电子商务。     

基于PayWord的自更新Hash链微支付协议

针对基于Hash链的小额支付协议PayWord在支付效率和安全性方面的不足,以及传统Hash链的应用存在长度限制的问题,提出一种新的适用于移动电子商务认证与微支付的协议,包括“多面额”Hash链思想、可自更新的Hash链机制和基于令牌的快速认证方法。分析结果证明新协议可实现安全性、公平性和效率的统一,适用于移动用户与同一网络信息服务提供商进行频繁小额交易的移动商务环境。     

一种数字商品交易微支付方案

姬东耀等改进了微支付(NMP)方案PayWord,提出了具有较好安全性和公平性的NMP方案。该文在此基础上,给出一种基于自更新哈希链机制的微支付方案。新方案不仅有效解决了恶意透支、时限性等问题,还提高了公平性、安全性和效率。在支付阶段,虽然新方案的存储和通信载荷较NMP增加了80 B,但在10 000份额交易下,前者的节点平均计算效率是后者的125倍。     

一组移动代理的行为设计模式

模式是开发应用程序时所用方法和指导原则的总称，它表达了人们的进行软件开发过程中常用的一些设计思想，通过分析移动代理的运行过程，提出了一组行为设计模式，其核心思想就是将系统易变的部分与不变的部分进行分离，将系统不同层次的功能进行分离，具全来说，就是按照从上到下的顺序，将移动代理的行为分成任务流、协作交流和基础功能三层，并针对不同的层提出了相应的设计思想，利用这些模式，人们可以解决移动代理系统设计过程中遇到的许多问题，因此具有很高的实用价值和理论价值。     

A New Micro-Payment System Using General Payword Chain

In recent years electronic commerce has grown rapidly as Internet and web technologies have progressed. Therefore, a secure and efficient payment system for general-purpose applications is undoubtedly becoming an important issue. Rivest and Shamir have proposed a micro-payment scheme which is user-specific and vendor-specific. However, in their scheme, it is required that the user generates a new payword chain for each vendor from which the user makes a purchase. In this paper, we propose a new micro-payment system that enables users to make purchases from multiple vendors. Only one payword chain has to be generated which makes this system very efficient. A sequence of payword chains which represents a set of small payments can be authenticated and payment can be made by an efficient method. A lower computation cost and improved system performance is also achieved. Therefore, the new micro-payment system has multiple practical applications.     

e-coupons: An Efficient, Secure and Delegable Micro-Payment System

In this paper, we propose a new efficient and secure micro-payment scheme, named e-coupons, which can provide the users the facility of delegating their spending capability to other users or their own devices like Laptop, PDA, Mobile Phone, and such service access points. The scheme has the promise of becoming an enabler for various Internet-based services involving unit-wise payment. It gives flexibility to the users to manage their spending capability across various access points for a particular service without obtaining an authorization for each and every access point from a facilitating bank. This flexibility which is not present in the existing micro-payment schemes is essential for accessing ubiquitous e-services and other Internet-based applications. The facility of delegation introduces a slight overhead in respect of the proof or verification of the delegated authorization and security provided to the payments. The payoff from the facility of delegation takes away the burden of the overhead. The paper discusses the design of the protocol and provides a basic analysis of the performance of the system. e-coupons is based on PayWord, a single-seed one-way hash chain for unit-wise payment, TESLA for payment security and SPKI/SDSI as underlying PKI framework for its unique delegation feature. The results obtained from the implementation of e-coupons are quite acceptable and show near real-time response. Our scheme uses multi-seed one-way hash chains for unit-wise payment. Furthermore, it allows an ordered transfer of the portions of payment chains to others. Because of this user's spending capability can be used from different service access points to access the subscribed service, concurrently. This work is supported by grants from Ministry of Information and Technology, Government of India. Vishwas Patil is a PhD student at Dipartimento di Informatica, Università degli Studi di Roma “La Sapienza”, with a fellowship from the Italian MIUR under FIRB program. He was associated with School of Technology and Computer Science at TIFR-Tata Institute of Fundamental Research, Mumbai (India), as a Scientific Officer from 2000–2004. He received his Bachlor of Engineering in Computer Science from NIT-National Institute of Technology, Surat (India), in year 2000. His current research interests include access control and enforcement, trust management, facilitating incomplete contracts, e-commerce technologies, PKIs, information and system security, privacy. RK Shyamasundar is Professor and Dean, Faculty of Technology and Computer Science at Tata Institute of Fundamental Research, Mumbai, India. He has been on the faculty/staff of IBM TJ Watson Research Center, Pennsylvania state University, Utrecht University, Eindhoven University of Technology, University of Illinois at Urbana Champaigne, Max-Planck Institute of Informatiks etc. He is Fellow of IEEE, Fellow of Indian Academy of Sciences, Fellow Indian National Science Academy, Fellow Indian National Academy of Engineering. He received his PhD in Computer Science from IISc Bangalore and his research interests include modeling and verification of safety-critical reactive and real-time systems, synchronous languages, compiler verification, deductive techniques, logics of programs, formal methods for industrial applications, computer and network security, e-commerce, grid computing, wireless technologies etc.     

Reliable Communication for Highly Mobile Agents

The provision of a reliable communication infrastructure for mobile agents is still an open research issue. The challenge to reliability we address in this work does not come from the possibility of faults, but rather from the mere presence of mobility, which complicates the problem of ensuring the delivery of information even in a fault-free network. For instance, the asynchronous nature of message passing and agent migration may cause situations where messages forever chase a mobile agent that moves frequently from one host to another. Current solutions rely on conventional technologies that either do not provide a solution for the aforementioned problem, because they were not designed with mobility in mind, or enforce continuous connectivity with the message source, which in many cases defeats the very purpose of using mobile agents.In this paper, we propose an algorithm that guarantees delivery to highly mobile agents using a technique similar to a distributed snapshot. A number of enhancements to this basic idea are discussed, which limit the scope of message delivery by allowing dynamic creation of the connectivity graph. Notably, the very structure of our algorithm makes it amenable not only to guarantee message delivery to a specific mobile agent, but also to provide multicast communication to a group of agents, which constitutes another open problem in research on mobile agents. After presenting our algorithm and its properties, we discuss its implementability by analyzing the requirements on the underlying mobile agent platform, and argue about its applicability.     

基于双哈希链的公平移动支付协议的设计和分析

设计并分析了一个全新的基于双哈希链的公平移动支付协议;简要介绍了移动支付的业务流程并分析了该模型存在对用户不公平的不足之处;把用于一次性数字签名的双哈希链方案引入移动支付协议,借鉴分次支付的思想提出了一个新的公平移动支付协议;该协议包括4个部分:注册协议、定单下载协议、支付协议、清算协议;它具有很高的效率和可靠性,最大优点在于能够保证支付过程中对用户的公平,使移动用户在参加移动增值业务过程中不再处于绝对劣势,适于移动网络中的公平支付.     

基于移动代理的信息收集方法研究

传统的用软盘收集信息的方法存在一些不足之处，本文介绍了移动代理技术，给出了用移动代理技术来实现信息收集的方法，对该方法进行了安全性分析，并说明了该方法的优点。