A new reverse auction agent system for m-commerce using mobile agents

Authors:
Dong-Her Shih;Shin-Yi Huang;David C. Yen
Affiliations:
Department of Information Management, National Yunlin University of Science and Technology, 123, Section 3, University Road, Touliu, Yunlin, Taiwan, R.O.C.;Department of Information Management, National Yunlin University of Science and Technology, 123, Section 3, University Road, Touliu, Yunlin, Taiwan, R.O.C.;Department of DSC and MIS, Miami University, Oxford, Ohio 45056, United States
Venue:
Computer Standards & Interfaces
Year:
2005

Citing 11
Cited 8

The Design and Implementation of a Secure Auction Service

IEEE Transactions on Software Engineering
Reducing the round complexity of a sealed-bid auction protocol with an off-line TTP

Proceedings of the 7th ACM conference on Computer and communications security
Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence

Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence
Nomad: Mobile Agent System for an Internet-Based Auction House

IEEE Internet Computing
Efficient Sealed-Bid Auction Using Hash Chain

ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
A Designated Bid Reverse Auction for Agent-Based Electronic Commerce

IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison

ISC '01 Proceedings of the 4th International Conference on Information Security
An Auction Protocol Which Hides Bids of Losers

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
M+1-st Price Auction Using Homomorphic Encryption

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Electronic auctions with private bids

WOEC'98 Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

Efficient migration for mobile computing in distributed networks

Computer Standards & Interfaces
JAID: An algorithm for data fusion and jamming avoidance on distributed sensor networks

Pervasive and Mobile Computing
Lattice Based Privacy Negotiation Rule Generation for Context-Aware Service

UIC '09 Proceedings of the 6th International Conference on Ubiquitous Intelligence and Computing
An approach for near-optimal distributed data fusion in wireless sensor networks

Wireless Networks
A Galois lattice approach to a context-aware privacy negotiation service

Expert Systems with Applications: An International Journal
Developing a fuzzy multi-attribute matching and negotiation mechanism for sealed-bid online reverse auctions

Journal of Theoretical and Applied Electronic Commerce Research
Retail in the Digital City

International Journal of E-Business Research
Artificial immune system based mobile agent platform protection

Computer Standards & Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to get the goods, a buyer must search for the items through several auction sites in Internet. When the auction starts, the buyer needs to connect to these auction sites frequently so that he can monitor the bid states and re-bid. In this paper, we propose an automated negotiation model between two participants, for m-commerce, using collaborative mobile agents called mobile reverse auction agent system (MoRAAS), which mediates between the buyer and the sellers and executes bidding asynchronously and autonomously. This reduces the network load and offers more intelligent bidding. A new double encryption key chain technique and a new RVAP protocol are proposed to achieve unconditional bid privacy. Every losing bidder can control the privacy of their own bids while no trust is needed. Computational cost of our RVAP protocol is reduced by avoiding the costly verifiable encryption technique.