An Efficient Multi-Round Anonymous Auction Protocol

ASIA unversity > 資訊學院 > 光電與通訊學系 > 期刊論文 > Item 310904400/9548

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/9548

题名:	An Efficient Multi-Round Anonymous Auction Protocol
作者:	Cheng-Chi Lee;Min-Shiang Hwang;Chih-Wei Lin
关键词:	Anonymity;auction;knapsack problem;multiparty computation;security
日期:	2007-08
上传时间:	2010-05-12 01:12:10 (UTC+0)
出版者:	Asia University
摘要:	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.
關聯:	Journal of Discrete Mathematical Sciences & Cryptography 10(4):547–557
显示于类别:	[光電與通訊學系] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
	0Kb	Unknown	496	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.