An Anonymous Sealed-bid Auction with a Feature of Entertainment

概要

論文の詳細を見る
Some works about an electronic sealed-bid auction protocol^<1), 3), 5)～10), 15), 16), 18)> have been proposed. An electronic auction scheme should satisfy the following seven properties: (a)Fair of bidders; (b)Bid security; (c)Anonymity; (d)Validity of winning bids; (e)Nonrepudiation; (f)Robustness; and(g)Efficient bidding points. Many previous schemes do not realize anonymity for an auction manager. In this paper, we propose a new electronic sealed-bid auction that realizes anonymity for an auction manager, maintaining both computational and round complexity low. We represent a bid efficiently by using binary trees : for 2^k bidding points, the size of the representation of bids is just k. Furthermore, we introduce a new idea of entertainment to the opening phase by deoreasing winner candidates little by little. Our notion is very attractive and new since all previous works on a sealed-bid auction aim at "efficiency" but not "entertainment" seen in English auction. The main features of our scheme are: anonymity for a single AM, efficient bidding points and entertainment.
一般社団法人情報処理学会の論文
2001-08-15