An Efficient Multi-Round Anonymous Auction Protocol

ASIAIR > College of Computer Science > Department of Photonics and Communication Engineering > Journal Article > Item 310904400/9548

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/9548

Title:	An Efficient Multi-Round Anonymous Auction Protocol
Authors:	Cheng-Chi Lee;Min-Shiang Hwang;Chih-Wei Lin
Keywords:	Anonymity;auction;knapsack problem;multiparty computation;security
Date:	2007-08
Issue Date:	2010-05-12 01:12:10 (UTC+0)
Publisher:	Asia University
Abstract:	In this paper, we shall propose an efficient multi-round anonymous auction protocol. In the many literatures concerned, when more than one party bidding the same highest price for merchandise, all the bidders must re-participate in the auction again. It is inefficient. In this paper, the proposed protocol can make the auction easier. In our system, we first pick out the bidders offering the same highest price as the winners of the first round. Then, all the bidders need not re-participate in the auction again; only the winners of the first round have to come back for the second round.
Relation:	Journal of Discrete Mathematical Sciences & Cryptography 10(4):547–557
Appears in Collections:	[Department of Photonics and Communication Engineering] Journal Article

Files in This Item:

File	Size	Format
	0Kb	Unknown	497	View/Open